Newsgroups: comp.parallel
From: "Eugene N. Miya" <eugene@pioneer.arc.nasa.gov>
Subject: Yep, global search and replace on SPAA/PPOPP considered harmful
Organization: NASA Ames Res. Ctr. Mtn Vw CA 94035
Date: Tue, 1 Aug 1995 11:27:23 GMT
Message-ID: <3vc28l$isf@onramp.arc.nasa.gov>

Yep, caught the problem.  This is the second editorial copy.
Some keywords and annotations added.

Send me editorial corrections, comments, etc. for final addition.

%A Guy E. Blelloch
%A Phillip B. Gibbons
%A Yossi Matias
%T Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 1-12
%K DAGs, MXM, sort/sum,

%A Charles E. Leiserson
%A Keith H. Randall
%Z MIT
%T Parallel Algorithms for the Circuit Value Update Problem
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 13-20

%A Martin Dyer
%A Jonathan Nash
%A Peter Dew
%Z U. of Leeds, UK
%T An optimal randomized planar convex hull algorithm with
good empirical performance
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 21-26
%K WPRAM, BSP, KSR, discrete event sim, quicksort,

%A Frank Dehne
%A Xiaotie Deng
%A Patrick Dymond
%A Andreas Fabri
%A Ashfaq A. Khokhar
%T A Randomized Parallel 3D Convex Hull Algorithm For
Coarse Grained Multicomputers
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 27-33
%K PRAM,

%A Seungjoon Park
%A David L. Dill
%Z Stanford
%T An Executable Specification, Analyzer and Verifier for RMO
(Relaxed Memory Order)
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 34-41
%K mur$phi$, murphy, SPARC, code,
%X Available: ftp:snooze.stanford.edu:pub/murphi.

%A Eric A. Brewer
%A Frederic T. Chong
%A Lok T. Liu
%A Shamik D. Sharma
%A John Kubiatowicz
%T Remote Queues: Exposing Message Queues for Optimization and Atomicity
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 42-53
%K RQ, MIT Alewife, CM-5, Intel Paragon, Cray T3D,

%A Nir Shavit
%A Dan Touitou
%T Elimination Trees and the Construction of Pools and Stacks
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 54-63
%K elimination balancers, producer-consumer,
%X Preliminary version.

%A Jehoshua Bruck
%A Danny Dolev
%A Ching-Tien Ho
%A Marcel-Catalin Rosu
%A Ray Strong
%T Efficient Message Passing Interface (MPI) for Parallel Computing on
Clusters of Workstations
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 64-73
%K LANs, TCP, UDP, URTP,

%A Soumen Chakrabarti
%A James Demmel
%A Katherine Yelick
%Z UC Berkeley
%T Modeling the Benefits of Mixed Data and Task Parallelism
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 74-83
%K AMR, adaptive mesh refinement, batch, graphs, DAGs,

%A Guy E. Blelloch
%A Phillip B. Gibbons
%A Yossi Matias
%A Marco Zagha
%T Accounting for Memory Bank Contention and Delay in
High-Bandwidth Multiprocessors
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 84-94
%K BSP, EREW PRAM, QRQW PRAM, Cray C90,

%A Albert Alexandrov
%A Mihai Ionescu
%A Klaus E. Schauser
%A Chris Scheiman
%Z UC Santa Barbara
%T LogGP: Incorporating Long Messages into the LogP model -
One step closer towards a realistic model for parallel computation
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 95-105
%K Log GP, Log P, Meiko CS-2, FFT, split-C, sort,

%A Tom Leighton
%A Yuan Ma
%A Torsten Suel
%T On Probabilistic Networks for Selection, Merging, and Sorting
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 106-118

%A Friedhelm Meyer auf\ der\ Heide
%A Martin Storch
%A Rolf Wanka
%Z Heinz Nixdorf Inst., Paderborn, Germany
%T Optimal Trade-offs Between Size and Slowdown for Universal Parallel Networks
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 119-128

%A Micah Adler
%A John W. Byers
%A Richard M. Karp
%Z UC Berkeley
%T Parallel Sorting With Limited Bandwidth
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 129-136
%K PRAM(m), Oracle, BSP,

%A Friedhelm Meyer auf\ der\ Heide
%A Christian Scheideler
%Z Heinz Nixdorf Inst., Paderborn, Germany
%T Space-Efficient Routing in Vertex-Symmetric Networks
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 137-146
%X Extended abstract.

%A Robert Cypher
%Z Johns Hopkins
%T The Communication Requirements of Mutual Exclusion
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 147-156
%K critical sections, entry sections, strong, weak ME,

%A Vara Ramakrishnan
%A Isaac D. Scherson
%A Raghu Subramanian
%Z UC Irvine
%T Efficient Techniques for Fast Nested Barrier Synchronization
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 157-164
%K MIMD, CM-5,

%A Jerry Stamatopoulos
%A Jon A. Solworth
%Z UI Chicago
%T Universal Congestion Control in Meshes
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 165-174
%K Intel touchstone DELTA, paragon, barriers,

%A Loren Schwiebert
%A D. N. Jayasimha
%Z Ohio State
%T A Universal Proof Technique for Deadlock-Free Routing in
Interconnection Networks
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 175-184

%A Gianfranco Bilardi
%A Franco P. Preparata
%T Upper Bounds on Processor-Time Tradeoffs under
Bounded-Speed Message Propagation
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 185-194
%K topological separator, H-RAM,

%A Ronald I. Greenberg
%Z U. Maryland
%T Finding Connected Components on a Scan Line Array Processor
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 195-202
%K SLAP, SIMD,
%X Preliminary version.

%A C.R.M. Sundaram
%A Derek L. Eager
%Z U. of Saskatchewan, Canada
%T Future Applicability of Bus-Based Shared Memory Multiprocessors
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 203-212
%X Type I, II, and III applications.  Oriented to bus.

%A John H. Reif
%Z Duke
%T Parallel Molecular Computation
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 213-223
%K searching, pattern matching, recombinant DNA/RNA technology, PAM,
%X An interesting paper.

%A Ka Wong Chong
%A Tak Wah Lam
%Z U. of Hong Kong
%T Approximating Biconnectivity in Parallel
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 225-233
%K NP-hard,

%A F.S. Annexstein
%A R.P. Swaminathan
%Z U. of Cincinnati
%T On Testing Consecutive-Ones Property in Parallel
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 234-243
%K Whitney switch, Tutte decomposition,

%A Martin Farach
%A S. Muthukrishnan
%T Optimal Parallel Dictionary Matching and Compression
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 244-253
%K human genome,
%X Extended abstract.

%A Philip D. MacKenzie
%Z Sandia National Labs
%T Lower Bounds for Randomized Exclusive Write PRAMs
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 254-263
%K CREW PRAM, EREW PRAM, random adversary technique,

%A Dannie Durand
%A Ravi Jain
%A David Tseytlin
%Z Bellcore
%T Applying Randomized Edge Coloring Algorithms to Distributed Communication:
An Experimental Study
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 264-274

%A Ted Nesson
%A S. Lennart Johnsson
%Z Harvard
%T ROMM Routing on Mesh and Torus Networks
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 275-287
%K randomized, oblivious, multi-phase, minimal,

%A Thomas H. Cormen
%A Kristin Bruhl
%T Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 286-297
%X Extended abstract.

%A Sunil Kim
%A Alexander Veidenbaum
%Z UI Urbana-Champaign
%T On Shortest Path Routing in Single Stage Shuffle-Exchange Networks
%J Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures
SPAA'95
%C Santa Barbara, California
%D July 1995
%P 298-307
%K direct connected, HSP2,

%A Rajesh Bordawekar
%A Alok Choudhary
%A Ken Kennedy
%A Charles Koelbel
%A Mike Paleczny
%T A Model and Compilation Strategy for Out-of-Core Data Parallel Programs
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 1-10
%K I/O,

%A Jacob Gotwals
%A Suresh Srinivas
%A Dennis Gannon
%Z Indiana U.
%T pC++/streams: a Library for I/O on Complex Distributed Data Structures
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 11-18
%K I/O,
%X Web pages in the references.

%A John Darlington
%A Yi-ke Guo
%A Hing Wing To
%A Jin Yang
%Z Imperial College
%T Parallel Skeletons for Structured Composition
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 19-28
%K SCL, structured coordination language, BL, base language,
comptational skeletons, PCN, AP1000,

%A Martin C. Carlisle
%A Anne Rogers
%Z Princeton
%T Software Caching and Computation Migration in Olden
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 29-38
%K C, CM-5, DAG, SPMD, path affinity,

%A William W. Carlson
%A Jesse M. Draper
%Z IDA Supercomputing Research Center
%T Distributed Data Access in AC
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 39-47
%K Cray T3D, MIMD,

%A Niclas Andersson
%A Peter Fritzson
%Z Linkoping U.
%T Generating Parallel Code from Object Oriented Mathematical Models
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 48-57
%K Object-Math (object oriented mathematical language for scientific
computing), ODE, SCC,

%A Anwar M. Ghuloum
%A Allan L. Fisher
%Z CMU
%T Flattening and Parallelizing Irregular, Recurrent Loop Nests
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 58-67
%K Cray C90,

%A Shubhendu S. Mukherjee
%A Shamik D. Sharma
%A Mark D. Hill
%A James R. Larus
%A Anne Rogers
%A Joel Saltz
%T Efficient Support for Irregular Applications on Distributed-Memory Machines
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 68-79
%K CM-5, CHAOS, XSM, TSM, Tempest, DSMC,

%A Eric A. Brewer
%Z UC Berkeley
%T High-Level Optimization via Automated Statistical Modeling
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 80-91
%K PDE, CM-5, ATM,

%A Jean-Francois Collard
%A Denis Barthou
%A Paul Feautrier
%T Fuzzy Array Dataflow Analysis
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 92-101
%K if, while loops, FADA,

%A Ken Kennedy
%A Nenad Nedeljkovic
%A Ajay Sethi
%Z Rice U.
%T A Linear-Time Algorithm for Computing the Memory Access Sequence in
Data-Parallel Programs
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 102-111
%K HPF,

%A Gwan-Hwan Hwang
%A Jenq Kuen Lee
%A Dz-Ching Ju
%T An Array Operation Synthesis Scheme to Optimize Fortran 90 Programs
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 112-122
%K HPF,

%A David A. Bader
%A Joseph JaJa
%Z U. Maryland
%T Parallel Algorithms for Image Histogramming and Connected Components with
an Experimental Study
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 123-133
%K histrogramming, connected components, image processing, image understanding,
scalable parallel processing, parallel algorithms,
BDM, block distributed memory, split-C, merge,
%O http://www.uiacs.umd.edu/~dbader
%X Extended abstract.

%A Jaspal Subhlok
%A Gary Vondran
%Z CMU
%T Optimal Mapping of Sequences of Data Parallel Tasks
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 134-143
%K dynamic programming, FFT, greedy algorithm,

%A Chau-Wen Tseng
%Z Stanford
%T Compiler Optimizations for Eliminating Barrier Synchronization
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 144-155
%K SPMD, SUIF, tomcatv, LU decomposition, shallow water, erle64,

%A Michael Philippsen
%Z Intl. Computer Science Inst.
%T Automatic Alignment of Array Data and Processes to
Reduce Communication Time on DMPPs
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 156-165
%K MasPar MP-1,

%A Jennifer M. Anderson
%A Saman P. Amarasinghe
%A Monica S. Lam
%Z Stanford
%T Data and Computation Transformations for Multiprocessors
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 166-178
%K DASH, SUIF,

%A Tor E. Jeremiassen
%A Susan J. Eggers
%T Reducing False Sharing on Shared Memory Multiprocessors through
Compile Time Data Transformations
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 179-188

%A Ellen Spertus
%A William J. Dally
%Z MIT
%T Evaluating the Locality Benefits of Active Messages
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 189-198
%K J-machine, TAM,

%A Robert W. Wisniewski
%A Leonidas I. Kontothanassis
%A Michael L. Scott
%Z U.  Rochester
%T High Performance Synchronization Algorithms for
Multiprogrammed Multiprocessors
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 199-206
%K KSR,

%A Robert D. Blumofe
%A Christopher F. Joerg
%A Bradley C. Kuszmaul
%A Charles E. Leiserson
%A Keith H. Randall
%A Yuli Zhou
%Z MIT
%T Cilk: An Efficient Multithreaded Runtime System
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 207-216
%K computer chess example,

%A Deborah A. Wallach
%A Wilson C. Hsieh
%A Kirk L. Johnson
%A M. Frans Kaashoek
%A William E. Weihl
%Z MIT
%T Optimistic Active Messages:
A Mechanism for Scheduling Communication with Computation
%J Proc. 5th ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming, PPoPP'95
%C Santa Barbara, California
%D July 1995
%P 217-226
%K ORPC, TPRC, OAM, CM-5,
%X After reading the abstract and conclusions (which I use as a guide to
decide if a paper is worth reading), it is clear that the authors are
proud to have invented these nifty things called "optimistic active
messages".   However, since they fail to mention what "optimistic active
messages" are, I failed to be interested in the rest of the paper.
[I != ENM]



