Find a copy in the library
Finding libraries that hold this item...
|Genre/Form:||Conference papers and proceedings
|Material Type:||Conference publication|
|All Authors / Contributors:||
D Frank Hsu; Arnold L Rosenberg; Dominique Sotteau; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.; DIMACS (Group)
|Notes:||"Refereed versions of papers from a workshop held at Rutgers University, from February 7-9, 1994"--Title page verso.
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT & T Bell Labs, Bellcore."
|Description:||x, 342 pages : illustrations ; 27 cm.|
|Contents:||Ranking algorithms for Hamiltonian paths in hypercubic networks by F. S. Annexstein Dense bus networks of diameter $2$ by J.-C. Bermond, J. Bond, and S. Djelloul On broadcasting schemes in restricted optical passive star systems by P. Berthome and A. Ferreira Restricted routing and wide diameter of the cycle prefix network by W. Y. C. Chen, V. Faber, and E. Knill Permutation routing via Cayley graphs with an example for bus interconnection networks by G. Cooperman and L. Finkelstein Using helpful sets to improve graph bisections by R. Diekmann, B. Monien, and R. Preis Modification of consecutive-$d$ digraphs by D.-Z. Du, D. F. Hsu, and D. J. Kleitman Highly adaptive wormhole routing algorithms for $N$-dimensional torus by J. Duato and P. Lopez Conflict-free access to constant-perimeter rectangular subarrays by D. G. Erickson and C. J. Colboum Makespan minimization of task graphs with random task running times by L. Finta and Z. Liu Scheduling of structured and unstructured computation by A. Gerasoulis, J. Jiao, and T. Yang Routing in optical networks: The problem of contention by L. A. Goldberg Communications in optically interconnected parallel computer systems by M. Hamdi Fault-tolerant Kautz networks by R. Harbane Asynchronous packet routers by C. Jesshope and I. Nedelchev Cayley digraphs of finite cyclic groups with minimal average distance by X. Jia Shuffled tree based fault-tolerant hierarchical interconnection networks by O. H. Karam and D. P. Agrawal Restricted connectivity and restricted fault diameter of some interconnection networks by L. Qiao and Z. Yi Sorting and selection on interconnection networks by S. Rajasekaran Towards a simple construction method for Hamiltonian decomposition of the hypercube by S. W. Song Generalized reduced hypercube interconnection networks for massively parallel computers by S. G. Ziavras.|
|Series Title:||DIMACS series in discrete mathematics and theoretical computer science, v. 21.|
|Responsibility:||D. Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau, editors.|
- Parallel processing (Electronic computers) -- Congresses.
- Computer networks -- Congresses.
- Computer networks.
- Parallel processing (Electronic computers)
- Arquitetura de sistemas de computacao.
- Parallélisme (informatique) -- Congrès.
- Réseaux d'ordinateurs -- Congrès.
- Verteiltes System.
- Computer networks -- Congresses
- Parallel processing (Electronic computers) -- Congresses