default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations 1994
- D. Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau:
Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, February 7-9, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 21, DIMACS/AMS 1995, ISBN 978-0-8218-0238-0 - Foreword. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: vii-
- Preface. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: ix-
- Fred S. Annexstein:
Ranking algorithms for Hamiltonian paths in hypercubic networks. 1-7 - Jean-Claude Bermond, Johny Bond, Selma Djelloul:
Dense bus networks of diameter 2. 9-18 - Pascal Berthomé, Afonso Ferreira:
On broadcasting schemes in restricted optical passive star systems. 19-29 - William Y. C. Chen, Vance Faber, Emanuel Knill:
Restricted routing and wide diameter of the cycle prefix network. 31-46 - Gene Cooperman, Larry Finkelstein:
Permutation routing via Cayley graphs with an example for bus interconnection networks. 47-56 - Ralf Diekmann, Burkhard Monien, Robert Preis:
Using helpful sets to improve graph bisections. 57-73 - Ding-Zhu Du, D. Frank Hsu, Daniel J. Kleitman:
Modification of consecutive-d digraphs. 75-85 - José Duato
, Pedro López:
Highly adaptive wormhole routing algorithms for N-dimensional torus. 87-104 - Doreen L. Erickson, Charles J. Colbourn:
Conflict-free access to constant-perimeter, rectangular, subarrays. 105-124 - Lucian Finta, Zhen Liu:
Makespan Minimization of task graphs with random task running times. 125-138 - Apostolos Gerasoulis, Jia Jiao, Tao Yang:
Scheduling Of Structured and Unstructured computation. 139-172 - Leslie Ann Goldberg:
Routing in Optical networks: The problem of contention. 173-180 - Mounir Hamdi:
Communications in optically interconnected parallel computer systems. 181-200 - Rabah Harbane:
Fault-tolerant Kautz networks. 201-210 - Chris R. Jesshope, Ivailo M. Nedelchev:
Asynchronous packet routers. 211-227 - Xingde Jia:
Cayley digraphs of finite cyclic groups with minimal average distance. 229-250 - Omar H. Karam, Dharma P. Agrawal:
Shuffled tree based fault-tolerant hierarchical interconnection networks. 251-265 - Li Qiao, Zhang Yi:
Restricted connectivity and restricted fault diameter of some interconnection networks. 267-273 - Sanguthevar Rajasekaran:
Sorting and selection on interconnection networks. 275-296 - Siang Wun Song:
Towards a simple construction method for Hamiltonian decomposition of the hypercube. 297-306 - Sotirios G. Ziavras:
Generalized reduced hypercube interconnection networks for massively parallel computers. 307-325 - List of Participants. 327-342
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-14 23:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
