Volume 11,
Number 1,
1991
- Charles C. Weems, Edward M. Riseman, Allen R. Hanson, Azriel Rosenfeld:
The DARPA Image Understanding Benchmark for Parallel Computers.
1-24 BibTeX
- Christoph Scheurich, Michel Dubois:
Lockup-free Caches in High-Performance Multiprocessors.
25-36 BibTeX
- Ali R. Hurson, Simin H. Pakzad, D. B. Shin, Les L. Miller:
A Reconfigurable MIMD Back-end Database Machine.
37-50 BibTeX
- Robert R. Seban:
FTN Topology and Protocols.
51-62 BibTeX
- Mee Yee Chan, Shiang-Jen Lee:
Distributed Fault-Tolerant Embeddings of Rings in Hypercubes.
63-71 BibTeX
- Philip J. Bernhard, Daniel J. Rosenkrantz:
An Efficient Method for Representing and Transmitting Message Patterns on Multiprocessor Interconnection Networks.
72-85 BibTeX
- Isaac D. Scherson, Peter F. Corbett:
Communications Overhead and the Expected Speedup of Multidimensional Mesh-Connected Parallel Processors.
86-96 BibTeX
Volume 11,
Number 2,
1991
Volume 11,
Number 3,
1991
- Ben Lee, Ali R. Hurson, Tse-Yun Feng:
A Vertically Layered Allocation Scheme for Data Flow Systems.
175-187 BibTeX
- Yi-Hsiu Wei, Alexander D. Stoyenko, Germán S. Goldszmidt:
The Design of a Stub Generator for Heterogeneous RPC Systems.
188-197 BibTeX
- Wei Shu, Laxmikant V. Kalé:
Chare Kernel - a Runtime Support System for Parallel Computations.
198-211 BibTeX
- Milos D. Ercegovac, Tomás Lang:
Module to Perform Multiplication, Division, and Square Root in Systolic Arrays for Matrix Computations.
212-221 BibTeX
- Kemal Efe:
Embedding Mesh of Trees in the Hypercube.
222-230 BibTeX
- Graham M. Megson:
Systolic Algorithms for B-Spline Patch Generation.
231-238 BibTeX
- Samuel A. Fineberg, Thomas L. Casavant, Howard Jay Siegel:
Experimental Analysis of a Mixed-Mode Parallel Architecture Using Bitonic Sequence Sorting.
239-251 BibTeX
- Ravi Varadarajan:
Embedding Shuffle Networks in Hypercubes.
252-256 BibTeX
- Biing-Feng Wang, Gen-Huey Chen:
Cost-Optimal Parallel Algorithms for Constructing 2-3 Trees.
257-262 BibTeX
Volume 11,
Number 4,
1991
Copyright © Sun May 17 00:10:47 2009
by Michael Ley (ley@uni-trier.de)