A library of static and dynamic communication algorithms for parallel computation Emmanouel A. Varvarigos OriginalPaper Pages: 3 - 20
The Shuffled Mesh: a flexible and efficient model for parallel computing G. BongiovanniG.A. De BiaseA. Monti OriginalPaper Pages: 21 - 27
A fault tolerant routing scheme for hypercubes Khaled DaySaad HarousAbdel‐Elah Al‐Ayyoub OriginalPaper Pages: 29 - 44
Partitionable multistage interconnection networks. Part 2: Task migration schemes Muhammad Naeem AyyazDikran S. MeliksetianC.Y. Roger Chen OriginalPaper Pages: 45 - 67
Methods for designing efficient parallel‐recursive filter structures for computing discrete transforms Richard J. KozickMaurice F. Aburdene OriginalPaper Pages: 69 - 80
A general scheme for constructing optimal bus based architectures for hypercubes Priyalal D. Kulasinghe OriginalPaper Pages: 81 - 97
Embedding complete binary trees in product graphs Kemal EfeAdrienne L. BroadwaterAntonio Fernandez OriginalPaper Pages: 99 - 109
Modelling fully‐adaptive routing in hypercubes S. LoucifM. Ould‐KhaouaL.M. Mackenzie OriginalPaper Pages: 111 - 118
Communication capabilities of product networks Abdelghani BellaachiaAbdou Youssef OriginalPaper Pages: 119 - 133
Removing edges from hypercubes to obtain vertex‐symmetric networks with small diameter Douglas W. BassI. Hal Sudborough OriginalPaper Pages: 135 - 146