Accepted papers to SPAA 98  (3/19/98)



7
Efficient Disk Allocation for Fast Similarity Searching
Sunil Prabhakar, Divyakant Agrawal and Amr El Abbadi
sunilp@cs.ucsb.edu
13
Explicit Multi-Threading (XMT) Bridging Models for Instruction Parallelism
Uzi Vishkin, Shlomit Dascal, Efraim Berkovich and Joseph Nuzman
vishkin@umiacs.umd.edu
17
Analyses of Load Stealing Models Based on Differential Equations
Michael Mitzenmacher
michaelm@pa.dec.com
19
Lamport Clocks: Verifying A Directory Cache-Coherence Protocol
Manoj Plakal, Daniel J. Sorin, Anne E. Condon and Mark D. Hill
markhill@cs.wisc.edu
23
Communication-Optimal Parallel Minimum Spanning Tree Algorithms
Micah Adler, Wolfgang Dittrich, Ben Juurlink, Miroslaw Kutylowski and Ingo Rieping
inri@uni-paderborn.de
26
"Dynamic-Fault-Prone BSP": A paradigm for robust computations in changing environments
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis and Moti Yung
kontog@cti.gr
30
Recovery Time of Dynamic Allocation Processes
Artur Czumaj
artur@uni-paderborn.de
32
Automatic Parallel I/O Performance Optimization in Panda
Y. Chen, M. Winslett, Y. Cho and S. Kuo
s-kuo@cs.uiuc.edu
39
Fast Set Operations Using Treaps
Guy E. Blelloch and Margaret Reid-Miller
mrmiller@cs.cmu.edu
44
Broadcasting, Multicasting and Gossiping in Trees under the All-Port Line Model
Johanne Cohen
cohen@lri.fr
48
Computation-Centric Memory Models
Matteo Frigo and Victor Luchangco
athena@theory.lcs.mit.edu
49
Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method
Ambrose K. Laing and Robert Cypher
laing@cs.jhu.edu
50
Detecting Data Races in Cilk Programs that Use Locks
Guang-Ien Cheng, Mingdong Feng, Charles E. Leiserson, Keith H. Randall and Andrew F. Stark
astark@mit.edu
53
Linear Programming Models for Scheduling Systems of Affine Recurrence Equations  -- a Comparative Study --
Stephen Balev, Patrice Quinton, Sanjay Rajopadhye and Tanguy Risset
risset@irisa.fr
55
A Simple Parallel Sorting Algorithm
Sanguthevar Rajasekaran
raj@cise.ufl.edu
56
Dynamic Scheduling with Incomplete Information: A New Theory
Hannah Bast
hannah@mpi-sb.mpg.de
58
Asynchronous Parallel Algorithm for Mining Association Rules on a Shared-memory Multi-processors
David W. Cheung, Kan Hu and Shaowei Xia
dcheung@cs.hku.hk
59
Trace-Driven Studies of VLIW Video Signal Processors
Zhao Wu and Wayne Wolf
zhaowu@ee.princeton.edu
60
Scheduling Time-Constrained Communication in Linear Networks
Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman and Walter Unger
ramesh@cs.umass.edu
63
In-Memory Directories: Eliminating the Directory Overhead in CC-NUMAs
Christopher Ho, Heidi Ziegler and Michel Dubois
chris@usc.edu
66
How "hard" is thread partitioning and how "bad" is a list scheduling based partitioning algorithm?
Xinan Tang and Guang R. Gao
tang@eecis.udel.edu
67
Efficient Communication Strategies for Ad-Hoc Wireless Networks
Micah Adler and Christian Scheideler
chrsch@uni-paderborn.de
70
Computational Bounds for Fundamental Problems on General-Purpose Parallel Models
Philip D. MacKenzie and Vijaya Ramachandran
philmac@cs.idbsu.edu
72
Parallel Continuous Randomized Load Balancing
Petra Berenbrink, Tom Friedetzky and Ernst W. Mayr
friedetz@informatik.tu-muenchen.de
73
Layout Area of the Bitonic Sorting Network
Shimon Even, S. Muthukrishnan, Michael S. Paterson and Suleyman Cenk Sahinalp
cenk@dcs.warwick.ac.uk
76
An Adversarial Model for Distributed Dynamic Load Balancing
S. Muthukrishnan and Rajmohan Rajaraman
rraj@dimacs.rutgers.edu
78
Verification of Runway-PA8000 memory model using "Test model-checking" technique
Rajnish Ghughal, Abdel Mokkedem, Ratan Nalumasu and Ganesh Gopalakrishnan
ghughal@cs.utah.edu
79
Thread Scheduling for Multiprogrammed Multiprocessors
Nimar S. Arora, Robert D. Blumofe and C. Greg Plaxton
plaxton@cs.utexas.edu
80
Blocking in Parallel Multisearch Problems
Wolfgang Dittrich, David Hutchinson and Anil Maheshwari
hutchins@scs.carleton.ca
82
Elimination Forest Guided 2D Sparse LU Factorization
Kai Shen, Xiangmin Jiao and Tao Yang
tyang@cs.ucsb.edu