Filters








62 Hits in 3.6 sec

Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals

M. Kunde, R. Niedermeier, K. Reinhardt, P. Rossmanith
1999 Algorithmica  
We present deterministic sorting and routing algorithms for grids and tori with additional diagonal connections.  ...  If packets may be copied, 1{1 sorting can be done in only in 2 3 n + o(n) on a torus with diagonals.  ...  Particularly, we get in the average optimal h{h sorting and routing algorithms for tori and grids with diagonals for all h.  ... 
doi:10.1007/pl00009288 fatcat:4zyvzef7kje4dlghim5qpny5tu

Page 4340 of Mathematical Reviews Vol. , Issue 2000f [page]

2000 Mathematical Reviews  
(D-MUTUI; Munich) Optimal deterministic sorting and routing on grids and tori with diagonals. (English summary) Algorithmica 25 (1999), no. 4, 438-458.  ...  Summary: “We present deterministic sorting and routing algo- rithms for grids and tori with additional diagonal connections.  ... 

Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound [chapter]

Manfred Kunde
1993 Lecture Notes in Computer Science  
The remaining problem is now to nd a way to route those elements that have to travel a distance between 3n=16 and n=4.  ...  It can be shown that all remaining row elements can be routed in this way, and that they reach their destination row in time.  ...  Acknowledgements: I would like to thank Christos Kaklamanis, Greg Plaxton, and Rajmohan Rajaraman for helpful discussions.  ... 
doi:10.1007/3-540-57273-2_62 fatcat:i6er5xsf6vc4fhtynlc6eeuomi

Page 1812 of Mathematical Reviews Vol. 32, Issue Index [page]

Mathematical Reviews  
(with Niedermeier, Rolf; Reinhardt, Klaus; Rossmanith, Peter) Optimal deterministic sorting and routing on grids and tori with diagonals.  ...  , 2000d:68002 and Gargano, Luisa, 2000¢:68016 Roberts, Alan (with Symvonis, Antonios) On-line matching routing on trees.  ... 

Kernel techniques: From machine learning to meshless methods

Robert Schaback, Holger Wendland
2006 Acta Numerica  
It addresses non-expert readers and focuses on practical guidelines for using kernels in applications.  ...  This contribution explains why and how kernels are applied in these disciplines. It uncovers the links between them, as far as they are related to kernel techniques.  ...  For instance, on spheres one can take spherical harmonics, and on tori one can take sin and cos functions as the ϕ i .  ... 
doi:10.1017/s0962492906270016 fatcat:hmwsgedodbfujlh6qusweugsyu

Extreme Scale FMM-Accelerated Boundary Integral Equation Solver for Wave Scattering [article]

Mustafa Abduljabbar, Mohammed Al Farhan, Noha Al-Harthi, Rui Chen, Rio Yokota, Hakan Bagci, David Keyes
2018 arXiv   pre-print
With distributed memory optimizations, on the other hand, we report near-optimal efficiency in the weak scalability study with respect to both the logarithmic communication complexity as well as the theoretical  ...  With shared memory optimizations, we achieve roughly 77% of peak single precision floating point performance of a 56-core Skylake processor, and on average 60% of peak single precision floating point performance  ...  In addition, AoS enhances the locality of references for interacting particles after they are sorted and indexed based on their Morton order.  ... 
arXiv:1803.09948v1 fatcat:2segh75rf5f2dmbt5cdr6qq7xe

Verantwortlich für das Programm ist das Wissenschaftliche Direktorium: Träger: Die Bundesländer Saarland und Rheinland-Pfalz Schloß Dagstuhl Parallel and Distributed Algorithms Reported by Rolf Wanka Participants

Beth Thomas, Jose Encarnagao, Hans Hagen, Michael Laska, Thomas Lengauer, Wolfgang Thomas, Reinhard Wilhelm, Universität Karlsruhe, Bezugsadresse Geschäftsstelle, Schloss Dagstuhl, Greg Barnes, Mpi Saarbrücken (+18 others)
unpublished
OVERVIEW The second Dagstuhl Seminar on Parallel and Distributed Algorithms was organized by Richard Cole (Courant Institute, New York), Ernst W.  ...  An interesting guided excursion to the ancient Roman city, and therefore oldest German city, of Trier took place on Thursday. _ The outstanding environment and organization of Schloß Da.gstuhl greatly  ...  The All-to-all Mapping and its Impact on Sorting and Routing  ... 
fatcat:ipxzlvrg5bcgdjt654ohf6pehm

The Birth of Quantum Computing [chapter]

2021 Law and Policy for the Quantum Age  
This chapter is based on both bibliographic research and interviews conducted with many quantum computing pioneers.  ...  This is the first of three chapters on quantum computing.  ...  The game could be played on a hexagonal grid, or a threedimensional grid, or even a five-dimensional grid.  ... 
doi:10.1017/9781108883719.008 fatcat:qeesind6ofbtflvrr2dftgl334

Page 1607 of Mathematical Reviews Vol. 32, Issue Index [page]

Mathematical Reviews  
(Summary) 2000):68079 68Q25 — (with Kunde, M.; Niedermeier, Rolf; Reinhardt, Klaus) Optimal deterministic sorting and routing on grids and tori with diagonals.  ...  (with King, Davis) Optimal bit allocation in compressed 3D models. (English summary) Multi-resolution modeling and 3D geometry compression. Comput. Geom. 14 (1999), no. 1-3, 91-118.  ... 

2020 Index IEEE Transactions on Circuits and Systems I: Regular Papers Vol. 67

2020 IEEE Transactions on Circuits and Systems Part 1: Regular Papers  
., +, TCSI Oct. 2020 3389-3399 A Distributed Power Delivery Grid Based on Analog-Assisted Digital LDOs With Cooperative Regulation and IR-Drop Reduction.  ...  ., +, TCSI April 2020 1136-1148 A Mismatch Calibration Technique for SAR ADCs Based on Deterministic Self-Calibration and Stochastic Quantization.  ...  An N-Path Filter Design Methodology With Harmonic Rejection, Power Reduction, Foldback Elimination, and Spectrum Shaping.  ... 
doi:10.1109/tcsi.2021.3055003 fatcat:kbmst5td2bbvtl7vpbj3knnkri

A methodology for studying persistency aspects of internet flows

Jörg Wallerich, Holger Dreger, Anja Feldmann, Balachander Krishnamurthy, Walter Willinger
2005 Computer communication review  
Pouzin who constructively commented on the fragmentation and accounting issues; and S. Crocker who commented on the creation and destruction of associations. Acknowledgments  ...  Acknowledgments Orion Hodson assisted with our TBIT measurements. Thanks also to Gorry Fairhurst, Sourabh Ladha, and the anonymous reviewers for their helpful feedback.  ...  For one, most of the points in both plots scatter around the diagonal, some are right on the diagonal (indicating a perfect match between NetFlows and FragFlows), some occupy the line x = 0 (vertical line  ... 
doi:10.1145/1064413.1064417 fatcat:b5leqpkvmnd5paw2vws4mqhlme

Genetic Programming III - Darwinian Invention and Problem Solving

Peter Nordin
1999 Evolutionary Computation  
Special thanks goes to our reviewers, who stuck with us through a major reorganization of the book and provided insightful and useful comments.  ...  Acknowledgments We would like to acknowledge the help of our editor, Denise Penrose, and that of Edward Wade and Emilia Thiuri, at Morgan Kaufmann Publishers.  ...  all sorts.  ... 
doi:10.1162/evco.1999.7.4.451 fatcat:27732t6mfvgt7mzpbvkrv6wcqm

Synchronization in complex networks

Alex Arenas, Albert Díaz-Guilera, Jurgen Kurths, Yamir Moreno, Changsong Zhou
2008 Physics reports  
Finally, we review several applications of synchronization in complex networks to different disciplines: biological systems and neuroscience, engineering and computer science, and economy and social sciences  ...  We also overview the new emergent features coming out from the interplay between the structure and the function of the underlying pattern of connections.  ...  Thiel, for having carefully read the manuscript and for their very enlightening comments.  ... 
doi:10.1016/j.physrep.2008.09.002 fatcat:hib32qi56fgpborlps7wpghyyq

Data science applications to string theory

Fabian Ruehle
2019 Physics reports  
of readers with a physics background.  ...  While there is a strong focus on neural network applications in unsupervised, supervised and reinforcement learning, other machine learning techniques are discussed as well.  ...  If one of the flux quanta is chosen for mutation, a random number drawn from a normal distribution with zero mean and variance σ = 0.01 is added to the flux.  ... 
doi:10.1016/j.physrep.2019.09.005 fatcat:i5jtac7qpfgyrmsmvsylyinaba

Mapping Techniques And Performance Analysis For An Interconnection Cached Multiprocessor Network

Vipul Gupta
1994
Many parallel applications exhibit a behavior in which each computation entity communicates with a small set of other entities and the communication pattern changes slowly with respect to time.  ...  For general graphs, we develop a heuristic algorithm based on simulated annealing to solve this partitioning problem.  ...  and Tori In this section, we study communication graphs which are 2-D grids and tori.  ... 
doi:10.7282/t36w9fpp fatcat:76l35jo7zjasvojcmmo26jbaue
« Previous Showing results 1 — 15 out of 62 results