Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
A recursively scalable network VLSI implementation
Future Generation Computer Systems
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Parallel processing for super-computers and artificial intelligence
Parallel processing for super-computers and artificial intelligence
Performance of multicomputer networks under Pin-out constraints
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel computational geometry
Parallel computational geometry
Interconnection networks for high-performance parallel computers
Interconnection networks for high-performance parallel computers
Order preserving communication on a star network
Parallel Computing
IEEE Transactions on Parallel and Distributed Systems
A Well-Behaved Enumeration of Star Graphs
IEEE Transactions on Parallel and Distributed Systems
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Enabling technologies for petaflops computing
Enabling technologies for petaflops computing
Optimal communication algorithms on star graphs using spanning tree constructions
Journal of Parallel and Distributed Computing
Two Ranking Schemes for Efficient Computation on the Star Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Designing Clustered Multiprocessor Systems under Packaging and Technological Advancements
IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Transposition Networks as a Class of Fault-Tolerant Robust Networks
IEEE Transactions on Computers
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets
IEEE Transactions on Parallel and Distributed Systems
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Communication Aspects of the Star Graph Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Embedding Complete Binary Trees into Star Networks
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Cayley graph connected cycles: A new class of fixed-degree interconnection networks
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Efficient low-degree interconnection networks for parallel processing: topologies, algorithms, vlsi layouts, and fault tolerance
Optimal Total Exchange in Cayley Graphs
IEEE Transactions on Parallel and Distributed Systems
Routing and Embeddings in Super Cayley Graphs
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Multilayer VLSI Layout for Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors
Proceedings of the 2005 ACM symposium on Applied computing
An oblivious shortest-path routing algorithm for fully connected cubic networks
Journal of Parallel and Distributed Computing
The Container Problem in Bubble-Sort Graphs
IEICE - Transactions on Information and Systems
Embedding algorithms for bubble-sort, macro-star, and transposition graphs
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
Enhanced-Star: a new topology based on the star graph
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Matrix-Star graphs: a new interconnection network based on matrix operations
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Hi-index | 0.00 |
We propose a new class of interconnection networks, called macro-star networks, which belong to the class of Cayley graphs and use the star graph as a basic building module. A macro-star network can have node degree that is considerably smaller than that of a star graph of the same size, and diameter that is sublogarithmic and asymptotically within a factor of 1.25 from a universal lower bound (given its node degree). We show that algorithms developed for star graphs can be emulated on suitably constructed macro-stars with asymptotically optimal slowdown. This enables us to obtain through emulation a variety of efficient algorithms for the macro-star network, thus proving its versatility. Basic communication tasks, such as the multinode broadcast and the total exchange, can be executed in macro-star networks in asymptotically optimal time under both the single-port and the all-port communication models. Moreover, no interconnection network with similar node degree can perform these communication tasks in time that is better by more than a constant factor than that required in a macro-star network. We show that macro-star networks can embed trees, meshes, hypercubes, as well as star, bubble-sort, and complete transposition graphs with constant dilation. We introduce several variants of the macro-star network that provide more flexibility in scaling up the number of nodes. We also discuss implementation issues and compare the new topology with the star graph and other popular topologies.