## Interconnection Networks and Mapping and Scheduling Parallel Computations: DIMACS Workshop, February 7-9, 1994Derbiau Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau This book contains the refereed proceedings of a DIMACS Workshop on Massively Parallel Computation. |

### What people are saying - Write a review

User Review - Flag as inappropriate

Boring, useless,WORST grammar, POOR English, BAD read, BAD writing, HORRIBLE writing skills, comes off as white supremacist attitude to me

### Contents

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 Adimensional 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 |

### Other editions - View all

### Common terms and phrases

2-D APW adaptive routing architecture array binary bisection bits block bus cycle Cayley graphs cluster communication conflict-free connected construction conventional hypercubes deadlock-free defined denoted Department of Computer destination deterministic diameter diff-value digraph distance E-mail edges elements emulation exists fault-tolerant Figure follows given Gray code Hamiltonian cycles Hamiltonian path heuristic hypercube hypergraph IEEE Trans implementation input integer interconnection networks Kautz graph labeled latin square Lemma loop lower bound mapping Mathematics memory modules Mesh node number of nodes number of processors Optical Passive Star optimal out-forest paper Parallel Algorithms parallel computers partitioning PE's performance permutation route PRAM problem Proc Proof PYRROS randomized randomized algorithm rectangular subarrays RH's routing algorithm routing function scheduling sequence skewing scheme sorting sparse matrix speedup steps subset task graph templates Theorem total number upper bound upper subfield vertex vertices virtual channels wavelength wormhole routing