Results 1 
5 of
5
Packet Routing In FixedConnection Networks: A Survey
, 1998
"... We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
We survey routing problems on fixedconnection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, krelation routing, routing to random destinations, dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems and numerous references.
Overview of Mesh Results
 MAXPLANCK INSTITUT FUR INFORMATIK, SAARBRUCKEN
, 1995
"... This paper provides an overview of lower and upper bounds for algorithms for meshconnected processor networks. Most of our attention goes to routing and sorting problems, but other problems are mentioned as well. Results from 1977 to 1995 are covered. We provide numerous results, references and ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper provides an overview of lower and upper bounds for algorithms for meshconnected processor networks. Most of our attention goes to routing and sorting problems, but other problems are mentioned as well. Results from 1977 to 1995 are covered. We provide numerous results, references and open problems. The text is completed with an index. This is a workedout version of the author's contribution to a joint paper with Miltos D. Grammatikakis, D. Frank Hsu and Miro Kraetzl on multicomputer routing, submitted to the Journal of Parallel and Distributed Computing.
Efficient TwoLevel Mesh based Simulation of PRAMs
 Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks
, 1995
"... We consider timeprocessor optimal simulations of PRAM models on coated block meshes. A coated block mesh consists of processor blocks and \Theta or p \Theta p \Theta p router blocks. The router blocks form a 2dimensional or a 3dimensional regular mesh, and the processor&memory blocks a ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We consider timeprocessor optimal simulations of PRAM models on coated block meshes. A coated block mesh consists of processor blocks and \Theta or p \Theta p \Theta p router blocks. The router blocks form a 2dimensional or a 3dimensional regular mesh, and the processor&memory blocks are located on the surface of the block mesh. As a generalization of the coated mesh, the 2dimensional and 3dimensional coated block meshes simulate EREW, CREW, and CRCW PRAM models timeprocessor optimally with moderate simulation cost. Using proper amount of parallel slackness, the cost can be decreased clearly below 2 routing steps per simulated PRAM processor. The coated block mesh is actually an instance of a more general twolevel construction technique, which uses a seemingly inefficient but scalable solution on top of a nonscalable but efficient solution. Within blocks (chips) brute force techniques are applied, whereas the mesh structure on top makes the whole construction modul...
Improved Virtual Leveled Routing Strategy for Meshes
, 1994
"... We present an improved version of the virtual leveled network routing strategy for mesh connected computers. This improvement achieves a speedup of approximately 2, and requires practically no additional hardware. We confirm this by providing experimental results concerning time to accomplish CRCW P ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We present an improved version of the virtual leveled network routing strategy for mesh connected computers. This improvement achieves a speedup of approximately 2, and requires practically no additional hardware. We confirm this by providing experimental results concerning time to accomplish CRCW PRAM simulation influenced routing situations. 1 Introduction Combining messages during a routing process is the method to avoid performance degradation in the presence of hotspots. Especially, combining on the route provides a practical method to accomplish the memory reference primitives of strong CRCW PRAM (as well as CREW) models. Several methods have been proposed to accomplish combining [1, 3, 6, 8, 10], which all can be applied to mesh connected computers. These methods can be applied to other interconnection structures as well, but here we deal only with the 2dimensional and the 3dimensional mesh structure, since it is simple, regular, modularly extendible, well scalable, and in g...
Performance of WorkOptimal PRAM Simulation Algorithms on Coated Meshes
, 1996
"... We study the effect of varying the multithreading level of processors in workoptimal PRAM simulation algorithms on coated meshes. A coated mesh consists of a mesh connected routing machinery and P processor &memory pairs that form a coat on the routing machinery. The algorithms studied are based on ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the effect of varying the multithreading level of processors in workoptimal PRAM simulation algorithms on coated meshes. A coated mesh consists of a mesh connected routing machinery and P processor &memory pairs that form a coat on the routing machinery. The algorithms studied are based on greedy routing, sorting, improved virtual leveled network technique, combining queues method, and synchronization wave. Our results show that increasing the multithreading level considerably improves the simulation cost. The cost can be decreased below 5 routing steps per P simulated PRAM processors. In case of one algorithm, even costs 1:1 : : : 2 are achieved. 1 Introduction Workoptimal simulation of PRAM models means that a constant fraction of the aggregate power of processors can be given to (arbitrary) PRAM computations. We study the efficiency of five PRAM simulation algorithms on a structure called coated mesh. This is interesting, since (a) the coated mesh (rigid definition is g...