SPAA B

33 papers

YearTitle / Authors
1997A Localized Algorithm for Parallel Association Mining.
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Wei Li
1997Accessing Nearby Copies of Replicated Objects in a Distributed Environment.
C. Greg Plaxton, Rajmohan Rajaraman, Andréa W. Richa
1997Allocating Weighted Jobs in Parallel.
Petra Berenbrink, Friedhelm Meyer auf der Heide, Klaus Schröder
1997Approximation Algorithms for Structured Communication Problems.
Dominique Barth, Pierre Fraigniaud
1997Better Trade-Offs for Parallel List Ranking.
Jop F. Sibeyn
1997Bounds to the Throughput of an Interconnection Network.
Ludek Kucera
1997Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation?
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1997Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies.
Loren Schwiebert
1997Efficient Computations on Fault-Prone BSP Machines.
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis
1997Efficient Detection of Determinacy Races in Cilk Programs.
Mingdong Feng, Charles E. Leiserson
1997Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms.
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson
1997Efficient Load Balancing and Data Remapping for Adaptive Grid Calculations.
Leonid Oliker, Rupak Biswas
1997Fine-Grain Multithreading with the EM-X Multiprocessor.
Andrew Sohn, Yuetsu Kodama, Jui Ku, Mitsuhisa Sato, Hirofumi Sakane, Hayato Yamana, Shuichi Sakai, Yoshinori Yamaguchi
1997From Algorithm Parallelism to Instruction-Level Parallelism: An Encode-Decode Chain Using Prefix-Sum.
Uzi Vishkin
1997HARP: A Fast Spectral Partitioner.
Horst D. Simon, Andrew Sohn, Rupak Biswas
1997Implementation and Evaluation of an Efficient Parallel Delaunay Triangulation Algorithm.
Jonathan C. Hardwick
1997Modeling Parallel Bandwidth: Local vs. Global Restrictions.
Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias
1997On the Analysis of Randomized Load Balancing Schemes.
Michael Mitzenmacher
1997On the Parallel Complexity of Matrix Factorization Algorithms.
Mauro Leoncini, Giovanni Manzini, Luciano Margara
1997Optimal Weighted Loop Fusion for Parallel Programs.
Nimrod Megiddo, Vivek Sarkar
1997Pipelining with Futures.
Guy E. Blelloch, Margaret Reid-Miller
1997Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '97, Newport, RI, USA, June 23-25, 1997
Charles E. Leiserson, David E. Culler
1997Reactive Diffracting Trees.
Giovanni Della-Libera, Nir Shavit
1997Simple, Efficient Routing Schemes for All-Optical Networks.
Michele Flammini, Christian Scheideler
1997Space-Efficient Scheduling of Parallelism with Synchronization Variables.
Guy E. Blelloch, Phillip B. Gibbons, Girija J. Narlikar, Yossi Matias
1997System Area Network Mapping.
Brent N. Chun, Alan M. Mainwaring, Saul Schleimer, Daniel Shawcross Wilkerson
1997Temporal Notions of Synchronization and Consistency in Beehive.
Aman Singla, Umakishore Ramachandran, Jessica K. Hodgins
1997The Performance of Simple Routing Algorithms That Drop Packets.
Suprakash Datta, Ramesh K. Sitaraman
1997Thread Partitioning and Scheduling Based on Cost Model.
Xinan Tang, Jing Wang, Kevin B. Theobald, Guang R. Gao
1997Three-Dimensional Pattern Matching.
Zvi Galil, Jong Geun Park, Kunsoo Park
1997Triplex: A Multi-Class Routing Algorithm.
Melanie L. Fulgham, Lawrence Snyder
1997Using Speculative Retirement and Larger Instruction Windows to Narrow the Performance Gap Between Memory Consistency Models.
Parthasarathy Ranganathan, Vijay S. Pai, Sarita V. Adve
1997Using Tadpoles to Reduce Memory and Communication Requirements for Exhaustive, Breadth-First Search Using Distributed Computers.
Gene Cooperman, Michael Tselman