Abstract is missing.
- Time-Constrained Scheduling of Weighted Packets on Trees and MeshesMicah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén. 1-12 [doi]
- Scheduling Optimization for Resource-Intensive Web Requests on Server ClustersHuican Zhu, Ben Smith, Tao Yang. 13-22 [doi]
- Efficient Approximation Algorithms for Scheduling Malleable TasksGrégory Mounié, Christophe Rapine, Denis Trystram. 23-32 [doi]
- Simple Competitive Request Scheduling StrategiesPetra Berenbrink, Marco Riedel, Christian Scheideler. 33-42 [doi]
- Post-Mortem Black-Box Correctness Tests for Basic Parallel Data StructuresPhillip B. Gibbons, John L. Bruno, Steven Phillips. 44-53 [doi]
- Some Compact Layouts of the ButterflyYefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky. 54-63 [doi]
- Sorting and Counting Networks of Small Depth and Arbitrary WidthCostas Busch, Maurice Herlihy. 64-73 [doi]
- Communication-Processor Tradeoffs in Limited Resources PRAMAdnan Agbaria, Yosi Ben-Asher, Ilan Newman. 74-82 [doi]
- Scheduling Threads for Low Space Requirement and Good LocalityGirija J. Narlikar. 83-95 [doi]
- A Closer Look at Coscheduling Approaches for a Network of WorkstationsShailabh Nagar, Ajit Banerjee, Anand Sivasubramaniam, Chita R. Das. 96-105 [doi]
- Experience with an Adaptive Globally-Synchronizing Clock AlgorithmCheng Liao, Margaret Martonosi, Douglas W. Clark. 106-114 [doi]
- BOS is Boss: A Case for Bulk-Synchronous Object SystemsMark W. Goudreau, Kevin Lang, Girija J. Narlikar, Satish Rao. 115-125 [doi]
- A Comparison of Scalable Superscalar ProcessorsBradley C. Kuszmaul, Dana S. Henry, Gabriel H. Loh. 126-137 [doi]
- A System-Level Specification Framework for I/O ArchitecturesMark D. Hill, Anne Condon, Manoj Plakal, Daniel J. Sorin. 138-147 [doi]
- Optimal Replacements in Caches with Two Miss CostsJaeheon Jeong, Michel Dubois. 155-164 [doi]
- Data Management in Networks: Experimental Evaluation of a Provably Good StrategyChristof Krick, Friedhelm Meyer auf der Heide, Harald Räcke, Berthold Vöcking, Matthias Westermann. 165-174 [doi]
- Randomized and Adversarial Load BalancingPetra Berenbrink, Tom Friedetzky, Angelika Steger. 175-184 [doi]
- Tradeoffs Between Parallelism and Fill in Nested DissectionClaudson F. Bornstein, Bruce M. Maggs, Gary L. Miller. 191-200 [doi]
- Selecting Tile Shape for Minimal Execution TimeKarin Högstedt, Larry Carter, Jeanne Ferrante. 201-211 [doi]
- Recursive Array Layouts and Fast Parallel Matrix MultiplicationSiddhartha Chatterjee, Alvin R. Lebeck, Praveen K. Patnala, Mithuna Thottethodi. 222-231 [doi]
- A Simple and Efficient Parallel Disk MergesortRakesh D. Barve, Jeffrey Scott Vitter. 232-241 [doi]
- Multidimensional, Multiprocessor, Out-of-Core FFTsLauren M. Baptist, Thomas H. Cormen. 242-250 [doi]
- Fundamental Control Algorithms in Mobile NetworksKostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas, Richard B. Tan. 251-260 [doi]