Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
Parallel hashing—an efficient implementation of shared memory
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A Unified theory of interconnection network structure
Theoretical Computer Science
Relations between concurrent-write models of parallel computation
SIAM Journal on Computing
Routing and sorting on mesh-connected arrays (extended abstract)
VLSI Algorithms and Architectures
Sorting in c log n parallel steps
Combinatorica
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
A framework for adaptive routing in multicomputer networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
On communication latency in PRAM computations
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Communication complexity of PRAMs
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A bridging model for parallel computation
Communications of the ACM
Network and processor architecture for message-driven computers
VLSI and parallel computation
Proceedings of the fifth MIT conference on Advanced research in VLSI
Vector models for data-parallel computing
Vector models for data-parallel computing
Average case analysis of greedy routing algorithms on arrays
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
Asynchronous shared memory parallel computation
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The expected advantage of asynchrony
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM
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
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The efficiency of greedy routing in hypercubes and butterflies
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Handbook of theoretical computer science (vol. A)
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Better expansion for Ramanujan graphs
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Express Cubes: Improving the Performance of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Simple algorithms for routing on butterfly networks with bounded queues
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Highly parallel computing
Randomized routing and sorting on fixed-connection networks
Journal of Algorithms
The network architecture of the connection machine CM-5
Journal of Parallel and Distributed Computing
Journal of the ACM (JACM)
IEEE Transactions on Parallel and Distributed Systems
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth 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
Fluent parallel computation
The asynchronous pram: a semisynchronous model for shared-memory mimd machines
The asynchronous pram: a semisynchronous model for shared-memory mimd machines
An information dispersal approach to issues in parallel processing
An information dispersal approach to issues in parallel processing
Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Routing permutations on graphs via matchings
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Trade-offs between communication throughput and parallel time
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
On the benefit of supporting virtual channels in wormhole routers
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Distributed packet switching in arbitrary networks
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Time-constrained scheduling of weighted packets on trees and meshes
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Optimal bounds for matching routing on trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Work-optimal simulation of PRAM models on meshes
Nordic Journal of Computing
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An optimal schedule for Gaussian elimination on an MIMD architecture
Journal of Computational and Applied Mathematics
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An optimal schedule for Gaussian elimination on an MIMD architecture
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |