ACM Transactions on Programming Languages and Systems (TOPLAS)
Sorting on a mesh-connected parallel computer
Communications of the ACM
Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
A logarithmic time sort for linear size networks
Journal of the ACM (JACM)
Continuous routing and batch routing on the hypercube
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Optimal Graph Algorithms on a Fixed-Size Linear Array
IEEE Transactions on Computers
Randomized parallel communications on an extension of the omega network
Journal of the ACM (JACM)
Randomized algorithms and pseudorandom numbers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Hypercube message routing in the presence of faults
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Optimal communication algorithms for regular decompositions on the hypercube
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Cost-bandwidth tradeoffs for communication networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fault tolerance in hypercube-derivative networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Multi-packet-routing on mesh connected arrays
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Robust algorithms for packet routing in a mesh
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Fast, Deterministic Routing, on Hypercubes, Using Small Buffers
IEEE Transactions on Computers
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The chaos router: a practical application of randomization in network routing
SPAA '90 Proceedings of the second 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
Fast algorithms for bit-serial routing on a hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast-fault-tolerant parallel communication and on-line maintenance using information dispersal
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Greedy packet scheduling on shortest paths (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
The efficiency of greedy routing in hypercubes and butterflies
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Balanced routing: towards the distance bound on grids
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Optimal VLSI Sorting with Reduced Number of Processors
IEEE Transactions on Computers
Chaos router: architecture and performance
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Fault tolerance in hypercube-derivative networks (preliminary version)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Message-passing algorithms for a SIMD torus with coteries
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
The chaos router: a practical application of randomization in network routing
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Parallel Algorithms for Image Processing on OMC
IEEE Transactions on Computers
Fully-adaptive routing: packet switching performance and wormhole algorithms
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Optimal bounded-degree VLSI networks for sorting in a constant number of rounds
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Simple algorithms for routing on butterfly networks with bounded queues
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Factors in the performance of the AN1 computer network
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Matching the bisection bound for routing and sorting on the mesh
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal routing of parentheses on the hypercube
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Dense edge-disjoint embedding of binary trees in the mesh
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Randomized routing with shorter paths
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
How much can hardware help routing?
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized algorithms and pseudorandom numbers
Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
Improved bounds for routing and sorting on multi-dimensional meshes
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Performance of hypercube routing schemes with or without buffering
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Computers
Two Packet Routing Algorithms on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
Deterministic on-line routing on area-universal networks
Journal of the ACM (JACM)
ROMM routing on mesh and torus networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Bounding delays in packet-routing networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized Routing with Shorter Paths
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
A Theory of Wormhole Routing in Parallel Computers
IEEE Transactions on Computers
The performance of simple routing algorithms that drop packets
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
How much can hardware help routing?
Journal of the ACM (JACM)
IEEE Transactions on Computers
The Case for Chaotic Adaptive Routing
IEEE Transactions on Computers
Scheduling nonuniform traffic in a packet-switching system with small propagation delay
IEEE/ACM Transactions on Networking (TON)
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
Efficient Routing and Sorting Schemes for de Bruijn Networks
IEEE Transactions on Parallel and Distributed Systems
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A new method to make communication latency uniform: distributed routing balancing
ICS '99 Proceedings of the 13th international conference on Supercomputing
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random regular graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Queueing analysis of oblivious packet-routing networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimal construction of edge-disjoint paths in random graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Derandomizing algorithms for routing and sorting on meshes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Complexity Results for Permuting Data and Other Computations on Parallel Processors
Journal of the ACM (JACM)
Performing Permutations on Interconnection Networks by Regularly Changing Switch States
IEEE Transactions on Parallel and Distributed Systems
Solving Fundamental Problems on Sparse-Meshes
IEEE Transactions on Parallel and Distributed Systems
Almost optimal permutation routing on hypercubes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Analysis of Distributed Routing Balancing behavior
Proceedings of the 2002 ACM symposium on Applied computing
Some permutation routing algorithms for low-dimensional hypercubes
Theoretical Computer Science
Scattering and Gathering Messages in Networks of Processors
IEEE Transactions on Computers
Efficient Routing Schemes for Multiple Broadcasts in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Partitioning Message Patterns for Bundled Omega Networks
IEEE Transactions on Parallel and Distributed Systems
Routing in Modular Fault-Tolerant Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Online Packet Routing on Linear Arrays and Rings
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
New Bounds for Oblivious Mesh Routing
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
How Helpers Hasten h-Relations
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
List-ranking on interconnection networks
Information and Computation
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Throughput-centric routing algorithm design
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Performing BMMC Permutations in Two Passes through the Expanded Delta Network and MasPar MP-2
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient schemes for parallel communication
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Randomized parallel communication (Preliminary Version)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
N-processors graphs distributively achieve perfect matchings in O(log2N) beats
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A logarithmic time sort for linear size networks
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Scaling internet routers using optics
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs
Combinatorics, Probability and Computing
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Approximately uniform random sampling in sensor networks
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Oblivious routing in directed graphs with random demands
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Proceedings of the 32nd annual international symposium on Computer Architecture
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
How (and why) to introduce Monte Carlo randomized algorithms into a basic algorithms course?
Journal of Computing Sciences in Colleges
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New lower bounds for oblivious routing in undirected graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Teaching the power of randomization using a simple game
Proceedings of the 37th SIGCSE technical symposium on Computer science education
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms (TALG)
Optimality of a Two-Phase Strategy for Routing in Interconnection Networks
IEEE Transactions on Computers
Congestion management for non-blocking clos networks
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Minimizing average latency in oblivious routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow
Research on next-generation scalable routers implemented with H-Torus topology
Journal of Computer Science and Technology
Exploring pattern-aware routing in generalized fat tree networks
Proceedings of the 23rd international conference on Supercomputing
Application-aware deadlock-free oblivious routing
Proceedings of the 36th annual international symposium on Computer architecture
Dynamic and Distributed Multipath Routing Policy for High-Speed Cluster Networks
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Static virtual channel allocation in oblivious routing
NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
A Multipath Fault-Tolerant Routing Method for High-Speed Interconnection Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
RouteBricks: exploiting parallelism to scale software routers
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Path-based, randomized, oblivious, minimal routing
Proceedings of the 2nd International Workshop on Network on Chip Architectures
Allocator implementations for network-on-chip routers
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Oblivious routing in fat-tree based system area networks with uncertain traffic demands
IEEE/ACM Transactions on Networking (TON)
A performance analysis framework for routing lookup in scalable routers
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Valiant load balancing, capacity provisioning and resilient backbone design
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
PacketShader: a GPU-accelerated software router
Proceedings of the ACM SIGCOMM 2010 conference
Hedera: dynamic flow scheduling for data center networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Destination-based adaptive routing on 2D mesh networks
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Weighted random oblivious routing on torus networks
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
A novel 3D layer-multiplexed on-chip network
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Throughput-Effective On-Chip Networks for Manycore Accelerators
MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
RouteBricks: enabling general purpose network infrastructure
ACM SIGOPS Operating Systems Review
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
The round complexity of distributed sorting: extended abstract
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Adaptive load-balancing in WDM mesh networks with performance guarantees
Photonic Network Communications
Deadlock-free fine-grained thread migration
NOCS '11 Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-Chip
DevoFlow: scaling flow management for high-performance networks
Proceedings of the ACM SIGCOMM 2011 conference
Energy characteristic of a processor allocator and a network-on-chip
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
Universal sequencing on a single machine
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Reliability-aware platform optimization for 3D chip multi-processors
The Journal of Supercomputing
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
Oblivious low-congestion multicast routing in wireless networks
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Enriching introductory programming courses with non-intuitive probability experiments component
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
Caesar: a content router for high speed forwarding
Proceedings of the second edition of the ICN workshop on Information-centric networking
CamCubeOS: a key-based network stack for 3D torus cluster topologies
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
Journal of the ACM (JACM)
Randomized partially-minimal routing: near-optimal oblivious routing for 3-D mesh networks
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Optimal throughput and delay in delay-tolerant networks with ballistic mobility
Proceedings of the 19th annual international conference on Mobile computing & networking
Destination-based congestion awareness for adaptive routing in 2D mesh networks
ACM Transactions on Design Automation of Electronic Systems (TODAES) - Special Section on Networks on Chip: Architecture, Tools, and Methodologies
Designing on-chip networks for throughput accelerators
ACM Transactions on Architecture and Code Optimization (TACO)
Scalable, optimal flow routing in datacenters via local link balancing
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
All routes to efficient datacenter fabrics
Proceedings of the 8th International Workshop on Interconnection Network Architecture: On-Chip, Multi-Chip
| Hi-index | 0.04 |
In this paper we isolate a combinatorial problem that, we believe, lies at the heart of this question and provide some encouragingly positive solutions to it. We show that there exists an N-processor realistic computer that can simulate arbitrary idealistic N-processor parallel computations with only a factor of O(log N) loss of runtime efficiency. The main innovation is an O(log N) time randomized routing algorithm. Previous approaches were based on sorting or permutation networks, and implied loss factors of order at least (log N)2.