SPAA B

28 papers

YearTitle / Authors
1999A Closer Look at Coscheduling Approaches for a Network of Workstations.
Shailabh Nagar, Ajit Banerjee, Anand Sivasubramaniam, Chita R. Das
1999A Comparison of Scalable Superscalar Processors.
Bradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh
1999A Simple and Efficient Parallel Disk Mergesort.
Rakesh D. Barve, Jeffrey Scott Vitter
1999A System-Level Specification Framework for I/O Architectures.
Mark D. Hill, Anne Condon, Manoj Plakal, Daniel J. Sorin
1999All-to-All Routing and Coloring in Weighted Trees of Rings.
Bruno Beauquier, Stephane Perennes, David Tóth
1999BOS is Boss: A Case for Bulk-Synchronous Object Systems.
Mark W. Goudreau, Kevin J. Lang, Girija J. Narlikar, Satish Rao
1999Communication-Processor Tradeoffs in Limited Resources PRAM.
Adnan Agbaria, Yosi Ben-Asher, Ilan Newman
1999Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.
Christof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann
1999Efficient Approximation Algorithms for Scheduling Malleable Tasks.
Grégory Mounié, Christophe Rapine, Denis Trystram
1999Efficient Parallel Solutions of Linear Algebraic Circuits.
Yosi Ben-Asher, Gadi Haber
1999Experience with an Adaptive Globally-Synchronizing Clock Algorithm.
Cheng Liao, Margaret Martonosi, Douglas W. Clark
1999Fundamental Control Algorithms in Mobile Networks.
Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan
1999Making Sparse Matrix Computations Scalable (Invited Talk Abstract).
James Demmel
1999Multidimensional, Multiprocessor, Out-of-Core FFTs.
Lauren M. Baptist, Thomas H. Cormen
1999On the Scheduling of Variable Latency Functional Units.
Silvia M. Müller
1999Optimal Replacements in Caches with Two Miss Costs.
Jaeheon Jeong, Michel Dubois
1999Post-Mortem Black-Box Correctness Tests for Basic Parallel Data Structures.
Phillip B. Gibbons, John L. Bruno, Steven Phillips
1999Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999
Gary L. Miller, Vijaya Ramachandran
1999Randomized and Adversarial Load Balancing.
Petra Berenbrink, Tom Friedetzky, Angelika Steger
1999Recursive Array Layouts and Fast Parallel Matrix Multiplication.
Siddhartha Chatterjee, Alvin R. Lebeck, Praveen K. Patnala, Mithuna Thottethodi
1999Scheduling Optimization for Resource-Intensive Web Requests on Server Clusters.
Huican Zhu, Ben Smith, Tao Yang
1999Scheduling Threads for Low Space Requirement and Good Locality.
Girija J. Narlikar
1999Selecting Tile Shape for Minimal Execution Time.
Karin Högstedt, Larry Carter, Jeanne Ferrante
1999Simple Competitive Request Scheduling Strategies.
Petra Berenbrink, Marco Riedel, Christian Scheideler
1999Some Compact Layouts of the Butterfly.
Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky
1999Sorting and Counting Networks of Small Depth and Arbitrary Width.
Costas Busch, Maurice Herlihy
1999Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén
1999Tradeoffs Between Parallelism and Fill in Nested Dissection.
Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller