SPAA'99: Announcements from the Program Chair

Preliminary Conference Program

The following papers were accepted to SPAA'99 from 90 submissions.

Lauren M. Baptist and Thomas H. Cormen ``Multidimensional, Multiprocessor, Out-of-Core FFTs with Distributed Memory and Parallel Disks''

Mark D. Hill, Anne E. Condon, Manoj Plakal, Daniel J. Sorin ``A System-Level Specification Framework for I/O Architectures''

Adnan Agbariai and Yosi Ben-Asher and Ilan Newman. ``Communication-Processor Tradeoffs in Limited Resources PRAM''

Costas Busch and Maurice Herlihy ``Small-Depth Sorting and Counting Networks of Arbitrary Width''

Gregory Mounie and Christophe Rapine and Denis Trystram ``Efficient Approximation Algorithms for Scheduling Malleable Tasks''

Girija Narlikar. ``Scheduling Threads for Low Space Requirement and Good Locality''

Karin Hogstedt, Larry Carter and Jeanne Ferrante. ``Selecting Tile Shape for Minimal Execution Time''

John L. Bruno and Phillip B. Gibbons and Steven Phillips. ``Post-mortem Black-box Correctness Tests for Basic Parallel Data Structures''

Bradley C. Kuszmaul and Dana S. Henry and Gabriel Loh ``A Comparison of Scalable Superscalar Processors''

Petra Berenbrink, Tom Friedetzky and Angelika Steger. ``Randomized and Adversarial Load Balancing''

Kostas Hatzis and George Pentaris and Paul Spirakis and Vasilis Tampakas and Richard Tan ``Fundamental Control Algorithms in Mobile Networks''

Christof Krick, Friedhelm Meyer auf der Heide, Harald Racke, Berthold Vocking and Matthias Westermann ``Data Management in Networks: Experimental Evaluation of a Provably Good Strategy''

Cheng Liao, Margaret Martonsi and Douglas W. Clark ``An Adaptive Globally-Synchronizing Clock Algorithm and its Implementation on a Myrinet-based PC Cluster''

Rakesh D. Barve and Jeffrey S. Vitter ``A Simple and Efficient Parallel Disk Mergesort''

Petra Berenbrink and Marco Riedel and Christian Scheideler ``Simple Competitive Request Scheduling Strategies''

Siddhartha Chatterjee and Alvin R. Lebeck and Praveen K. Patnala and Mithuna Thottethodi ``Recursive Array Layouts and Fast Parallel Matrix Multiplication''

Silvia M. Mueller ``On the Scheduling of Variable Latency Functional Units''

Huican Zhu and Ben Smith and Tao Yang ``Scheduling Optimization for Resource-Intensive Web Requests on Server Clusters''

Jaeheon Jeong and Michel Dubois ``Optimal Replacements in Caches with Two Miss Costs''

Shailabh Nagar, Ajit Banerjee, Anand Sivasubramaniam, Chita R. Das ``A Closer Look At Coscheduling Approaches for a Network of Workstations''

Bruno Beauquier and Stephane Perennes and David Toth ``All-To-All Routing and Coloring in Weighted Trees of Rings''

Micah Adler and Sanjeev Khanna and Rajmohan Rajaraman and Adi Rosen ``Time-Constrained Scheduling of Weighted Packets on Trees and Meshes''

Yefim Dinitz and Shimon Even and Roni Kupershtok and Maria Zapolotsky ``Layouts for the Butterfly and the Transpose Bijection''

Claudson F. Bornstein and Bruce M. Maggs and Gary L. Miller ``Tradeoffs between Parallelism and Fill in Nested Dissection''

Yosi Ben-Asher and Gady Haber ``Efficient Parallel Solutions of Linear Algebraic Circuits''

Mark W. Goudreau, Kevin Lang, Girija Narlikar and Satish B. Rao ``BOS is Boss: A Case for Bulk-Synchronous Object Systems''

The list of papers to appear in the SPAA Revue will be posted later.