Processor-Time Tradeoffs for Cayley Graph Interconnection Networks

We show that every processor array whose interconnection network is based on a Cayley graph of nonso that the graph's underlying group has a nontrivia size \ subgroup) can be emulated in a workpreserving manner, on general computations, by a (smaller) quotient array. If the underlying group has nontrivial snbgroups of several orders, one thus can choose among several matchups of time and hardware requirements. Our emulations gain efficiency when additional structural uniformity is present.

[1]  Jan van Leeuwen,et al.  Simulation of Large Networks on Smaller Networks , 1986, Inf. Control..

[2]  Arnold L. Rosenberg,et al.  Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies , 1992, Discret. Appl. Math..

[3]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[4]  Jan van Leeuwen,et al.  Simulation of Large Networks on Smaller Networks , 1985, Inf. Control..

[5]  Sheldon B. Akers,et al.  On Group Graphs and Their Fault Tolerance , 1987, IEEE Transactions on Computers.

[6]  Arnold L. Rosenberg,et al.  Work-preserving emulations of fixed-connection networks , 1989, STOC '89.

[7]  Hans L. Bodlaender,et al.  The Complexity of Finding Uniform Emulations on Fixed Graphs , 1988, Inf. Process. Lett..

[8]  D. Robinson.  A Course in the Theory of Groups , 1982 .

[9]  Arnold L. Rosenberg,et al.  Group Action Graphs and Parallel Architectures , 1990, SIAM J. Comput..

[10]  John P. Fishburn,et al.  Quotient Networks , 1982, IEEE Transactions on Computers.

[11]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.