SPAA B

34 papers

YearTitle / Authors
1991A Comparison of Sorting Algorithms for the Connection Machine CM-2.
Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha
1991A One-Way Array Algorithm for Matroid Scheduling.
Matthias F. M. Stallmann
1991A Simple Load Balancing Scheme for Task Allocation in Parallel Machines.
Larry Rudolph, Miriam Slivkin-Allalouf, Eli Upfal
1991An Approach to Emulating Separable Graphs (preliminary Version).
Bojana Obrenic
1991An Overview of Supertoroidal Networks.
Richard N. Draper
1991Architectural Mechanisms to Support Three-Dimensional Lattice Gas Simulations.
Fung F. Lee, Michael J. Flynn
1991Architectural Primitives for a Scalable Shared Memory Multiprocessor.
Joonwon Lee, Umakishore Ramachandran
1991Balanced Routing: Towards the Distance Bound on Grids.
Manfred Kunde
1991Coding Theory, Hypercube Embeddings, and Fault Tolerance.
William Aiello, Frank Thomson Leighton
1991Constructing Arrangements Optimally in Parallel (Preliminary Version).
Michael T. Goodrich
1991Detecting Violations of Sequential Consistency.
Kourosh Gharachorloo, Phillip B. Gibbons
1991Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages (Preliminary Version).
Bojana Obrenic
1991Fast and Reliable Parallel Hashing.
Hannah Bast, Torben Hagerup
1991Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks.
Gustavo D. Pifarré, Luis Gravano, Sergio A. Felperin, Jorge L. C. Sanz
1991Generalised Multiprocessor Scheduling Using Optimal Control.
G. N. Srinivasa Prasanna, Bruce R. Musicus
1991Impossibility Results for Asynchronous PRAM (Extended Abstract).
Maurice Herlihy
1991In-Place Techniques for Parallel Convex Hull Algorithms (Preliminary Version).
Mujtaba R. Ghouse, Michael T. Goodrich
1991Large-Scale Sorting in Parallel Memories (Extended Abstract).
Mark H. Nodine, Jeffrey Scott Vitter
1991Lock-Free garbage Collection for Multiprocessors.
Maurice Herlihy, J. Eliot B. Moss
1991More Time-Work Tradeoffs for Parallel Graph Algorithms.
Thomas H. Spencer
1991Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version).
Mikhail J. Atallah, Frank K. H. A. Dehne, Russ Miller, Andrew Rau-Chaplin, Jyh-Jong Tsay
1991On the Capabilities of Systolic Systems (Extended Abstract).
Shimon Even, Ami Litman
1991Optimal Speedup for Backtrack Search on a butterfly Network.
Abhiram G. Ranade
1991Parallel Algorithms for Routing in Non-Blocking Networks.
Geng Lin, Nicholas Pippenger
1991Parallel Construction of Trees with Optimal Weighted Path Length.
Lawrence L. Larmore, Teresa M. Przytycka
1991Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '91, Hilton Head, South Carolina, USA, July 21-24, 1991
Tom Leighton
1991Processor Efficient Parallel Solution of Linear Systems over an Abstract Field.
Erich L. Kaltofen, Victor Y. Pan
1991Proving Sequential Consistency of High-Performance Shared Memories (Extended Abstract).
Phillip B. Gibbons, Michael Merritt, Kourosh Gharachorloo
1991Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version).
Christos Kaklamanis, Danny Krizanc, Lata Narayanan, Thanasis Tsantilas
1991Sequential Consistency Versus Linearizability (Extended Abstract).
Hagit Attiya, Jennifer L. Welch
1991Simulating Binary Trees on X-Trees (Extended Abstract).
Burkhard Monien
1991The Efficiency of Greedy Routing in Hypercubes and Butterflies.
George D. Stamoulis, John N. Tsitsiklis
1991Tight Bounds for the Chaining Problem.
Shiva Chaudhuri
1991Understanding Retiming Through Maximum Average-Weight Cycles.
Marios C. Papaefthymiou