6. SPAA 1994:
Cape May,
New Jersey,
USA
SPAA '94:
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures,
June 27-29,
1994,
Cape May,
New Jersey,
USA. ACM Press,
1994
- Shay Halperin, Uri Zwick:
An Optimal Randomized Logarithmic Time Connectivity algorithm for the EREW PRAM (Extended Abstract).
1-10
Electronic Edition (ACM DL) BibTeX
- John Greiner:
A Comparison of Parallel Algorithms for Connected Components.
16-25
Electronic Edition (ACM DL) BibTeX
- Torsten Suel:
Improved Bounds for Routing and Sorting on Multi-Dimensional Meshes.
26-35
Electronic Edition (ACM DL) BibTeX
- Doug Ierardi:
2d-Bubblesorting in Average time O(N lg N).
36-45
Electronic Edition (ACM DL) BibTeX
- Hui Li, Kenneth C. Sevcik:
Parallel Sorting by Over Partitioning.
46-56
Electronic Edition (ACM DL) BibTeX
- Dan Suciu, Val Tannen:
Efficient Compilation of High-Level Data Parallel Algorithms.
57-66
Electronic Edition (ACM DL) BibTeX
- Todd E. Rockoff:
SIMD Instruction Cache.
67-75
Electronic Edition (ACM DL) BibTeX
- Eric J. Schwabe, Ian M. Sutherland:
Improved Parity-Declustered Layouts for Disk Arrays.
76-84
Electronic Edition (ACM DL) BibTeX
- Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.
85-93
Electronic Edition (ACM DL) BibTeX
- Rainer Feldmann, Peter Mysliwietz, Burkhard Monien:
Studying Overheads in Massively Parallel MIN/MAX-Tree Evaluation.
94-103
Electronic Edition (ACM DL) BibTeX
- Margaret Reid-Miller:
List Ranking and List Scan on the Cray C-90.
104-113
Electronic Edition (ACM DL) BibTeX
- John H. Reif, Stephen R. Tate:
Dynamic Parallel Tree Contraction (Extended Abstract).
114-121
Electronic Edition (ACM DL) BibTeX
- Pangfeng Liu, Sandeep N. Bhatt:
Experiences with Parallel N-Body Simulation.
122-131
Electronic Edition (ACM DL) BibTeX
- Clyde P. Kruskal, Kevin J. Rappoport:
Bandwidth-Based Lower Bounds on Slowdown for Efficient Emulations of Fixed-Connection Networks.
132-139
Electronic Edition (ACM DL) BibTeX
- Micah Adler, John W. Byers:
AT2 Bounds for a Class of VLSI Problems and String Matching.
140-146
Electronic Edition (ACM DL) BibTeX
- Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie:
An W(log log n) Lower Bound for Routing in Optical Networks.
147-156
Electronic Edition (ACM DL) BibTeX
- Hagit Attiya, Roy Friedman:
Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract).
157-166
Electronic Edition (ACM DL) BibTeX
- Nir Shavit, Asaph Zemach:
Diffracting Trees (Preliminary Version).
167-176
Electronic Edition (ACM DL) BibTeX
- Phillip B. Gibbons, Ephraim Korach:
On Testing Cache-Coherent Shared Memories.
177-188
Electronic Edition (ACM DL) BibTeX
- Jaswinder Pal Singh, Edward Rothberg, Anoop Gupta:
Modeling Communication in Parallel Algorithms: A Fruitful Interaction Between Theory and Systems?
189-199
Electronic Edition (ACM DL) BibTeX
- John Turek, Walter Ludwig, Joel L. Wolf, Lisa Fleischer, Prasoon Tiwari, Jason Glasgow, Uwe Schwiegelshohn, Philip S. Yu:
Scheduling Parallelizable Tasks to Minimize Average Response Time.
200-209
Electronic Edition (ACM DL) BibTeX
- Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein:
Job Scheduling in Rings.
210-219
Electronic Edition (ACM DL) BibTeX
- Raghu Subramanian, Isaac D. Scherson:
An Analysis of Diffusive Load-Balancing.
220-225
Electronic Edition (ACM DL) BibTeX
- Bhaskar Ghosh, S. Muthukrishnan:
Dynamic Load Balancing in Parallel and Distributed Networks by Random Matchings (Extended Abstract).
226-235
Electronic Edition (ACM DL) BibTeX
- Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Efficient Low-Contention Parallel Algorithms.
236-247
Electronic Edition (ACM DL) BibTeX
- Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn:
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer.
248-256
Electronic Edition (ACM DL) BibTeX
- Leslie Ann Goldberg, Yossi Matias, Satish Rao:
An Optical Simulation of Shared Memory.
257-267
Electronic Edition (ACM DL) BibTeX
- Hisao Tamaki:
Construction of the Mesh and the Torus Tolerating a Large Number of Faults.
268-277
Electronic Edition (ACM DL) BibTeX
- John H. Reif:
O(log² n) Time Efficient Parallel Factorization of Dense, Sparse Separable, and Banded Matrices.
278-289
Electronic Edition (ACM DL) BibTeX
- Mauro Leoncini:
How Much Can We Speedup Gaussian Elimination with Pivoting?
290-297
Electronic Edition (ACM DL) BibTeX
- Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Derrick Weathersby:
Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems.
298-309
Electronic Edition (ACM DL) BibTeX
- Susan Hinrichs, Corey Kosak, David R. O'Hallaron, Thomas Stricker, Riichiro Take:
An Architecture for Optimal All-to-All Personalized Communication.
310-319
Electronic Edition (ACM DL) BibTeX
- Himanshu Gupta, P. Sadayappan:
Communication Efficient Matrix Multiplication on Hypercubes.
320-329
Electronic Edition (ACM DL) BibTeX
- John E. Savage:
A Model for Multi-Grained Parallelism (Extended Abstract).
330-335
Electronic Edition (ACM DL) BibTeX
- Jerry Stamatopoulos, Jon A. Solworth:
Increasing Network Bandwidth on Meshes.
336-345
Electronic Edition (ACM DL) BibTeX
- Michael Mitzenmacher:
Bounds on the Greedy Routing Algorithm for Array Networks.
346-353
Electronic Edition (ACM DL) BibTeX
- Donald D. Chinn, Frank Thomson Leighton, Martin Tompa:
Minimal Adaptive Routing on the Mesh with Bounded Queue Size.
354-363
Electronic Edition (ACM DL) BibTeX
- Smaragda Konstantinidou:
Segment Router: A Novel Router Design for Parallel Computers.
364-373
Electronic Edition (ACM DL) BibTeX
Copyright © Sat May 16 23:42:07 2009
by Michael Ley (ley@uni-trier.de)
