DocumentCode
2032805
Title
Substructure Allocation in Recursive Interconnection Networks
Author
Fernandes, Ronald ; Kanevsky, Arkady
Author_Institution
Texas A&M University
Volume
1
fYear
1993
fDate
16-20 Aug. 1993
Firstpage
319
Lastpage
322
Abstract
In a multiuser message passing MIMD sys tem, substructure allocation is an important aspect of sys tem design. In this paper, we present four substructure al location algorithms for a multiuser WK-Recursive network. Two algorithms are bit-map based and two are tree based. The algorithms are compared using simulation.
Keywords
Algorithm design and analysis; Clocks; Computer science; Indexing; Message passing; Multiprocessor interconnection networks; Network topology; Parallel algorithms; Parallel processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location
Syracuse, NY, USA
ISSN
0190-3918
Print_ISBN
0-8493-8983-6
Type
conf
DOI
10.1109/ICPP.1993.169
Filename
4134162
Link To Document