12. SPAA 1999: Saint-Malo, France

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

Last update Sat May 18 19:49:31 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page