12. SPAA 2000: Bar Harbor, Maine, USA

• Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe:
  The data locality of work stealing. 1-12
  Electronic Edition (ACM DL) BibTeX
• Michael A. Bender, Michael O. Rabin:
  Scheduling Cilk multithreaded parallel programs on processors of different speeds. 13-21
  Electronic Edition (ACM DL) BibTeX
• Arnold L. Rosenberg:
  Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract). 22-29
  Electronic Edition (ACM DL) BibTeX
• Robert Elsässer, Burkhard Monien, Robert Preis:
  Diffusive load balancing schemes on heterogeneous networks. 30-38
  Electronic Edition (ACM DL) BibTeX
• Ali Pinar, Bruce Hendrickson:
  Interprocessor communication with memory constraints. 39-45
  Electronic Edition (ACM DL) BibTeX
• Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou:
  Efficient on-line communication in cellular networks. 46-53
  Electronic Edition (ACM DL) BibTeX
• Edith Cohen, Haim Kaplan, Uri Zwick:
  Connection caching under vaious models of communication. 54-63
  Electronic Edition (ACM DL) BibTeX
• Li Zhang:
  Fault tolerant networks with small degree. 64-69
  Electronic Edition (ACM DL) BibTeX
• Susanne Albers:
  Generalized connection caching. 70-78
  Electronic Edition (ACM DL) BibTeX
• An-Chow Lai, Babak Falsafi:
  Comparing the effectiveness of fine-grain memory caching against page migration/replication in reducing traffic in DSM clusters. 79-88
  Electronic Edition (ACM DL) BibTeX
• Peter Sanders:
  Asynchronous scheduling of redundant disk arrays. 89-98
  Electronic Edition (ACM DL) BibTeX
• Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya:
  Infinite parallel job allocation (extended abstract). 99-108
  Electronic Edition (ACM DL) BibTeX
• Friedhelm Meyer auf der Heide, Harald Räcke, Matthias Westermann:
  Data management in hierarchical bus networks. 109-118
  Electronic Edition (ACM DL) BibTeX
• André Brinkmann, Kay Salzwedel, Christian Scheideler:
  Efficient, distributed data placement strategies for storage area networks (extended abstract). 119-128
  Electronic Edition (ACM DL) BibTeX
• Pangfeng Liu, Tzu-Hao Sheng:
  Broadcast scheduling optimization for heterogeneous cluster systems. 129-136
  Electronic Edition (ACM DL) BibTeX
• Ole Agesen, David Detlefs, Christine H. Flood, Alex Garthwaite, Paul A. Martin, Nir Shavit, Guy L. Steele Jr.:
  DCAS-based concurrent deques. 137-146
  Electronic Edition (ACM DL) BibTeX
• Uzi Vishkin:
  A no-busy-wait balanced tree parallel algorithmic paradigm. 147-155
  Electronic Edition (ACM DL) BibTeX
• Binu K. Mathew, Sally A. McKee, John B. Carter, Al Davis:
  Algorithmic foundations for a parallel vector access memory system. 156-165
  Electronic Edition (ACM DL) BibTeX
• Madhav V. Marathe, Alessandro Panconesi, Larry D. Risinger Jr.:
  An experimental study of a simple, distributed edge coloring algorithm. 166-175
  Electronic Edition (ACM DL) BibTeX
• Parimala Thulasiraman, Kevin B. Theobald, Ashfaq A. Khokhar, Guang R. Gao:
  Multithreaded algorithms for the fast Fourier transform. 176-185
  Electronic Edition (ACM DL) BibTeX
• Kazuo Iwama, Eiji Miyano:
  A (2.954 epsilon)n oblivious routing algorithm on 2D meshes. 186-195
  Electronic Edition (ACM DL) BibTeX
• Chi-Hsiang Yeh, Behrooz Parhami, Emmanouel A. Varvarigos, Hua Lee:
  VLSI layout and packaging of butterfly networks. 196-205
  Electronic Edition (ACM DL) BibTeX
• André DeHon:
  Compact, multilayer layout for butterfly fat-tree. 206-215
  Electronic Edition (ACM DL) BibTeX
• Susumu Matsumae, Nobuki Tokura:
  An efficient self-simulation algorithm for reconfigurable meshes. 216-223
  Electronic Edition (ACM DL) BibTeX