Interconnection Networks and Mapping and Scheduling Parallel Computations: DIMACS Workshop, February 7-9, 1994Derbiau Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau American Mathematical Soc., 1995. gada 1. janv. - 342 lappuses This book contains the refereed proceedings of a DIMACS Workshop on Massively Parallel Computation. |
Saturs
Dense bus networks of diameter | 9 |
On broadcasting schemes in restricted optical passive star systems | 19 |
Restricted routing and wide diameter of the cycle prefix network | 31 |
Permutation routing via Cayley graphs with an example for bus intercon | 47 |
Using helpful sets to improve graph bisections | 57 |
Modification of consecutived digraphs | 75 |
Highly adaptive wormhole routing algorithms for Ndimensional torus | 87 |
Conflictfree access to constantperimeter rectangular subarrays | 105 |
Communications in optically interconnected parallel computer systems | 181 |
Faulttolerant Kautz networks | 201 |
Asynchronous packet routers | 211 |
Cayley digraphs of finite cyclic groups with minimal average distance | 229 |
Shuffled tree based faulttolerant hierarchical interconnection networks | 251 |
Restricted connectivity and restricted fault diameter of some interconnec | 267 |
Sorting and selection on interconnection networks | 275 |
Towards a simple construction method for Hamiltonian decomposition | 297 |
Makespan minimization of task graphs with random task running times | 125 |
Scheduling of structured and unstructured computation | 139 |
The problem of contention | 173 |
Generalized reduced hypercube interconnection networks for massively par | 307 |
List of Participants | 327 |
Citi izdevumi - Skatīt visu
Interconnection Networks and Mapping and Scheduling Parallel Computations ... Derbiau Frank Hsu,Arnold L. Rosenberg,Dominique Sotteau Ierobežota priekšskatīšana - 1995 |
Bieži izmantoti vārdi un frāzes
2-D APW adaptive routing architecture binary bisection bits Bruijn graphs bus cycle Cayley graphs cluster communication conflict-free connected construction deadlock-free defined denoted Department of Computer destination deterministic diameter diff-value digraph distance Distributed Computing E-mail edges elements emulation fault-tolerant Figure follows Hamiltonian cycles Hamiltonian path heuristic hypercube hypergraph IEEE Trans implementation input integer interconnection networks Kautz Kautz graphs labeled labelled multigraph latin square Lemma loop lower bound mapping Mathematics Mathematics Subject Classification maximum memory modules Mesh node number of nodes number of processors optimal out-forest Parallel Algorithms parallel computers partitioning PE's performance permutation route PRAM problem Proc Proof PYRROS R₁ randomized randomized algorithm rectangular subarrays RH's routing algorithm routing function scheduling sequence skewing schemes sorting sparse matrix speedup steps subset task graph templates Theorem total number upper bound upper subfield vertex vertices virtual channels wavelength