Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
The connection machine
A framework for adaptive routing in multicomputer networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Adaptive, minimal routing in hypercubes
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On the design of interconnection networks for parallel and multiprocessor systems
On the design of interconnection networks for parallel and multiprocessor systems
Multiprocessor systems: interconnection networks, memory hierarchy, modeling and simulations
Multiprocessor systems: interconnection networks, memory hierarchy, modeling and simulations
Circuit-switched multicomputers and heuristic load placement
Circuit-switched multicomputers and heuristic load placement
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Chaos router: architecture and performance
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Requirements for deadlock-free, adaptive packet routing
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network
IEEE Transactions on Parallel and Distributed Systems
Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks
IEEE Transactions on Parallel and Distributed Systems
Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
The Case for Chaotic Adaptive Routing
IEEE Transactions on Computers
Deadlock-free routing in arbitrary networks via the flattest common supersequence method
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Applying segment routing to k-ary n-cube networks
ICS '98 Proceedings of the 12th international conference on Supercomputing
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
On the Design of a High-Performance Adaptive Router for CC-NUMA Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Throughput fairness in k-ary n-cube networks
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Adaptive Flow Control for Robust Performance and Energy
MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
| Hi-index | 0.01 |