Last update:
Fri Oct 24 15:50:15 MDT 2008
Arvind and
Dean J. Brock Resource Managers in Functional
Programming . . . . . . . . . . . . . . 5--21
Steven S. Chen and
Jack J. Dongarra and
Christopher C. Hsiung Multiprocessing Linear Algebra
Algorithms on the Cray X-MP-2:
Experiences with Small Granularity . . . 22--31
H. T. Kung and
Monica S. Lam Wafer-Scale Integration and Two-Level
Pipelined Implementations of Systolic
Arrays. . . . . . . . . . . . . . . . . 32--63
Anthony P. Reeves Parallel Pascal: an Extended Pascal for
Parallel Computers . . . . . . . . . . . 64--80
Manoj Kumar and
J. R. Jump Performance Enhancement in Buffered
Delta Networks Using Crossbar Switches
and Multiple Links. . . . . . . . . . . 81--103
Steven L. Tanimoto Hierarchical Cellular Logic for Pyramid
Computers . . . . . . . . . . . . . . . 105--132
Jeffrey D. Ullman Flux, sorting, and supercomputer
organization for AI applications . . . . 133--151
Stanley Y. W. Su and
Chaitanya K. Baru Dynamically Partitionable Multicomputers
with Switchable Memory . . . . . . . . . 152--184
Eliezer Dekel and
Sartaj Sahni Parallel Matching Algorithm for Convex
Bipartite Graphs and Applications to
Scheduling. . . . . . . . . . . . . . . 185--205
Eli Opper and
Miroslaw Malek On Resource Allocation in Multistage
Interconnection Network-Based Systems. 206--220
Graham R. Nudd and
R. David Etchells and
Jan Grinberg Three-Dimensional VLSI Architecture for
Image Understanding . . . . . . . . . . 1--29
A. Yavuz Oruc and
M. Yaman Oruc Equivalence Relations Among
Interconnection Networks . . . . . . . . 30--49
Ernest W. Kent and
Michael O. Shneier and
Ronald Lumia Pipe. (Pipelined Image-Processing
Engine) . . . . . . . . . . . . . . . . 50--78
Robert J. McMillen and
Howard Jay Siegel Evaluation of Cube and Data Manipulator
Networks . . . . . . . . . . . . . . . . 79--107
Dan I. Moldovan and
Yu-Wen Tung Snap: a VLSI Architecture for Artificial
Intelligence Processing . . . . . . . . 109--131
Kuo-Cheng Li and
Herb Schwetman Vector C: a Vector Processing Language 132--169
Omar Wing Content-Addressable Systolic Array for
Sparse Matrix Computation . . . . . . . 170--181
Oscar H. Ibarra and
Michael A. Palis and
Sam M. Kim Some Results Concerning Linear Iterative
(Systolic) Arrays . . . . . . . . . . . 182--218
Alvin M. Despain and
Allen M. Peterson and
Oscar S. Rothaus and
Erling H. Wold Fast Fourier transform processors using
Gaussian residue arithmetic . . . . . . 219--237
Angela Y. Wu Embedding of tree networks into
hypercubes . . . . . . . . . . . . . . . 238--249
Franklin T. Luk A parallel method for computing the
generalized singular value decomposition 250--260
A. Bojanczyk and
R. P. Brent Tridiagonalization of a symmetric matrix
on a square array of mesh-connected
processors . . . . . . . . . . . . . . . 261--276
J. A. B. Fortes and
D. I. Moldovan Parallelism detection and transformation
techniques useful for VLSI algorithms 277--301
James J. Clark and
Peter D. Lawrence A systolic parallel processor for the
rapid computation of multiresolution
edge images using the $\nabla^2 G$
operator . . . . . . . . . . . . . . . . 302--319
J. L. Gaudiot and
M. D. Ercegovac Performance evaluation of a simulated
data-flow computer with low-resolution
actors . . . . . . . . . . . . . . . . . 321--351
P. Bertolazzi and
G. Bongiovanni A VLSI structure for the deadlock
avoidance problem . . . . . . . . . . . 352--361
Thomas Gross Software implementation of
floating-point arithmetic on a
reduced-instruction-set processor . . . 362--375
S. P. Smith and
H. C. Torng A fast inner product processor based on
equal alignments . . . . . . . . . . . . 376--390
Hiroshi Umeo A class of SIMD machines simulated by
systolic arrays . . . . . . . . . . . . 391--403
Azriel Rosenfeld The prism machine: an alternative to the
pyramid . . . . . . . . . . . . . . . . 404--411
Lubomir Bic and
Robert L. Hartmann Simulated performance of a data-driven
database machine . . . . . . . . . . . . 1--22
Tse-Yun Feng and
Wei Young Fault diagnosis for a class of
rearrangeable networks . . . . . . . . . 23--47
Leah H. Jamieson and
Philip T. Mueller, Jr. and
Howard Jay Siegel FFT algorithms for SIMD parallel
processing systems . . . . . . . . . . . 48--71
A. Varma and
C. S. Raghavendra On permutations passable by the Gamma
network . . . . . . . . . . . . . . . . 72--91
Tin-Fook Ngai and
Mary Jane Irwin and
Shishpal Rawat Regular, Area-Time Efficient
Carry-Lookahead Adders . . . . . . . . . 92--105
Dennis Gannon and
John Van Rosendale On the structure of parallelism in a
highly concurrent PDE solver . . . . . . 106--135
Chin-Wan Chung and
Keki B. Irani An optimization of queries in
distributed database systems . . . . . . 137--157
Kenji Onaga and
Takahiro Takechi A wavefront algorithm for LU
decomposition of a partitioned matrix on
VLSI processor arrays . . . . . . . . . 158--182
S. Ceri and
G. Gottlob Optimizing joins between two partitioned
relations in distributed databases . . . 183--205
Concettina Guerra A VLSI algorithm for the optimal
detection of curve . . . . . . . . . . . 206--214
Guang R. Gao A maximally pipelined tridiagonal linear
equation solver . . . . . . . . . . . . 215--235
Bruce K. Hillyer and
David Elliot Shaw Execution of OPS5 production systems on
a massively parallel machine . . . . . . 236--268
Salvatore J. Stolfo and
Daniel P. Miranker The DADO production system machine . . . 269--296
John L. Gustafson and
Stuart Hawkinson and
Ken Scott The architecture of a homogeneous vector
supercomputer . . . . . . . . . . . . . 297--304
P. M. C. C. Barahona and
J. R. Gurd Processor allocation in a Multi-ring
Dataflow Machine . . . . . . . . . . . . 305--327
T. N. Mudge and
J. P. Hayes and
G. D. Buzzard and
D. C. Winsor Analysis of multiple-bus interconnection
networks . . . . . . . . . . . . . . . . 328--343
Zvi Drezner and
Amnon Barak An asynchronous algorithm for scattering
information between the active nodes of
a multicomputer system . . . . . . . . . 344--351
Mark A. Franklin and
Sanjay Dhar Interconnection networks: physical
design and performance analysis . . . . 352--372
H. F. Li and
R. Jayakumar Systolic structures: a notion and
characterization . . . . . . . . . . . . 373--397
Kazuhiro Sado and
Yoshihide Igarashi Some parallel sorts on a mesh-connected
processor array and their time
efficiency . . . . . . . . . . . . . . . 398--410
Nicholas V. Findler and
Ron Lo An examination of distributed planning
in the world of air traffic control . . 411--431
J.-C. Bermond and
C. Delorme and
J.-j. Quisquater Strategies for interconnection networks:
some methods from graph theory . . . . . 433--449
S. P. Kumar and
J. S. Kowalik Triangularization of a positive definite
matrix on a parallel computer . . . . . 450--460
M. C. Chen A design methodology for synthesizing
parallel algorithms and architectures 461--491
M. J. Atallah and
M. T. Goodrich Efficient parallel solutions to some
geometric problems . . . . . . . . . . . 492--507
Y. Jegou and
A. Seznec Data synchronized pipeline architecture:
pipelining in multiprocessing
environments . . . . . . . . . . . . . . 508--526
R. Mirchandaney and
J. A. Stankovic Using stochastic learning automata for
job scheduling in distributed processing
systems . . . . . . . . . . . . . . . . 527--552
D. Dolev and
E. Upfal and
M. K. Warmuth The parallel complexity of scheduling
with precedence constraints . . . . . . 553--576
Ten-Hwang Lai Termination detection for dynamically
distributed systems with
non-first-in-first-out communication . . 577--599
Gerhard X. Ritter and
P. D. Gader Image algebra techniques for parallel
image processing . . . . . . . . . . . . 7--44
Eric B. Hinkle and
Jorge L. C. Sanz and
Anil K. Jain and
Dragutin Petkovic $P^3E$: New Life for Projection-Based
Image Processing . . . . . . . . . . . . 45--78
T. N. Mudge and
T. S. Abdel-Rahman Vision algorithms for hypercube machines 79--94
Quentin F. Stout Supporting divide-and-conquer algorithms
for image processing . . . . . . . . . . 95--115
Gerard G. L. Meyer and
Louis J. Podrazik A parallel first-order linear recurrence
solver . . . . . . . . . . . . . . . . . 117--132
S. Lennart Johnsson Communication efficient basic linear
algebra computations on hypercube
architectures . . . . . . . . . . . . . 133--172
V. K. Prasanna Kumar and
C. S. Raghavendra Array processor with multiple
broadcasting . . . . . . . . . . . . . . 173--190
Fred J. Taylor A residue arithmetic implementation of
the FFT . . . . . . . . . . . . . . . . 191--208
A. Kovaleski and
S. Ratheal and
F. Lombardi An architecture and an interconnection
scheme for time-sliced buses . . . . . . 209--229
Shang-Hua Teng and
Bin Wang Parallel algorithms for message
decomposition . . . . . . . . . . . . . 231--249
Stephen Taylor and
Lisa Hellerstein and
Shmuel Safra and
Ehud Shapiro Notes on the complexity of systolic
programs . . . . . . . . . . . . . . . . 250--265
R. H. Perrott and
R. W. Lyttle and
P. S. Dhillon The design and implementation of a
Pascal-based language for array
processor architectures . . . . . . . . 266--287
Peter R. Cappello Gaussian elimination on a hypercube
automaton . . . . . . . . . . . . . . . 288--308
Louis D. Duval and
Robert A. Wagner and
Yijie Han and
Donald W. Loveland Finding test-and-treatment procedures
using parallel computation . . . . . . . 309--318
Uzi Vishkin Randomized parallel speedups for list
ranking . . . . . . . . . . . . . . . . 319--333
Uwe Schwiegelshohn and
Lothar Thiele A systolic array for cyclic-by-rows
Jacobi algorithms . . . . . . . . . . . 334--340
J. B. Sinclair Efficient Computation of Optimal
Assignments for Distributed Tasks . . . 342--362
Vijay Balasubramanian and
Prithviraj Banerjee A fault tolerant massively parallel
processing architecture . . . . . . . . 363--383
Laxmi N. Bhuyan Analysis of interconnection networks
with different arbiter designs . . . . . 384--403
A. Yavuz Oruc Designing Cellular Permutation Networks
Through Coset Decompositions of
Symmetric Groups. . . . . . . . . . . . 404--422
Jason Gait A distributed process manager for an
engineering network computer . . . . . . 423--437
Francine Berman and
Lawrence Snyder On mapping parallel algorithms into
parallel architectures . . . . . . . . . 439--458
Hartmut Schwandt Interval arithmetic block cyclic
reduction on vector computers . . . . . 459--487
Zen Chen and
Chih-Chi Chang Iteration-level parallel execution of DO
loops with a reduced set of dependence
relations . . . . . . . . . . . . . . . 488--504
Duane A. Bailey and
Janice E. Cuny and
Bruce B. MacLeod Reducing communication overhead: a
parallel code optimization . . . . . . . 505--520
Eli Shamir and
Eli Upfal A probabilistic approach to the
load-sharing problem in distributed
systems . . . . . . . . . . . . . . . . 521--530
F. Baiardi and
A. Fantechi and
A. Tomasi and
M. Vanneschi Distributed implementation of nested
communicating sequential processes:
communication and termination . . . . . 531--545
Hussein A. H. Ibrahim and
John R. Kender and
David Elliot Shaw Low-level image analysis tasks on
fine-grained tree-structured SIMD
machines . . . . . . . . . . . . . . . . 546--574
D. Rotem and
E. Korach and
N. Santoro Analysis of a distributed algorithm for
extrema finding in a ring . . . . . . . 575--591
S. Y. Kung and
P. S. Lewis and
S. C. Lo Performance analysis and optimization of
VLSI dataflow arrays . . . . . . . . . . 592--618
Darrell Makarenko and
Jonathan Schaeffer A VLSI multiprecision matrix multiplier
and polynomial evaluator . . . . . . . . 619--628
Benjamin W. Wah and
Mokhtar Aboelaze and
Weijia Shang Systematic designs of buffers in
macropipelines of systolic arrays . . . 1--25
Tony R. Martinez and
Jacques J. Vidal Adaptive parallel logic networks . . . . 26--58
Krishna P. Mikkilineni and
Stanley Y. W. Su An evaluation of sorting algorithms for
common-bus local networks . . . . . . . 59--81
Ole Eriksen A termination detection protocol and its
formal verification . . . . . . . . . . 82--91
Martin David Katz and
Dennis J. Volper Geometric retrieval in parallel . . . . 92--102
H. X. Lin and
H. J. Sips Parallel vector reduction algorithms and
architectures . . . . . . . . . . . . . 103--130
Charles V. Stewart and
Charles R. Dyer Scheduling algorithms for PIPE
(Pipelined Image-Processing Engine) . . 131--153
Mi Lu and
Peter Varman Optimal algorithms for rectangle
problems on a mesh-connected computer 154--171
Franklin T. Luk and
Haesun Park An analysis of algorithm-based fault
tolerance techniques . . . . . . . . . . 172--184
S. C. Kothari and
G. M. Prabhu and
Robert Roberts A multipath network with cross links . . 185--193
Nicola Santoro and
Michael Scheutzow and
Jeffrey B. Sidney On the expected complexity of
distributed selection . . . . . . . . . 194--203
M. J. Irwin Special issue on parallelism in computer
arithmetic . . . . . . . . . . . . . . . 205--208
Milos D. Ercegovac and
Tomas Lang On-line scheme for computing rotation
factors . . . . . . . . . . . . . . . . 209--227
S. G. Smith and
P. B. Denyer Advanced serial-data computation . . . . 228--249
R. Kirchner and
U. Kulisch Accurate arithmetic for vector
processors . . . . . . . . . . . . . . . 250--270
Joseph R. Cavallaro and
Franklin T. Luk CORDIC arithmetic for an SVD processor 271--290
Jean Duprat and
Jean-Michel Muller Hardwired polynomial evaluation . . . . 291--309
Peter Kornerup and
David W. Matula An on-line arithmetic unit for
bit-pipelined rational arithmetic . . . 310--330
D. Callahan and
J. Cocke and
K. Kennedy Estimating interlock and improving
balance for pipelined architectures . . 334--358
W. W. Carlson and
J. A. B. Fortes On the performance of combined data flow
and control flow systems: experiments
using two iterative algorithms . . . . . 359--382
M. A. Sridhar and
C. S. Raghavendra Uniform minimal full-access networks . . 383--403
D. M. Nicol and
F. H. Willard Problem size, parallel architecture, and
optimal speedup . . . . . . . . . . . . 404--420
J. M. Purtilo and
D. A. Reed and
D. C. Grunwald Environments for prototyping parallel
algorithms . . . . . . . . . . . . . . . 421--437
J. Lee and
E. Shragowitz and
S. Sahni A hypercube algorithm for the 0/1
knapsack problem . . . . . . . . . . . . 438--456
Arvind and
K. Ekanadham Future scientific programming on
parallel machines . . . . . . . . . . . 460--493
D. DeGroot A technique for compiling execution
graph expressions for restricted
AND-parallelism in logic programs . . . 494--516
D. Callahan and
K. Kennedy Analysis of interprocedural side effects
in a parallel programming environment 517--550
M. Wolfe Vector optimization vs vectorization . . 551--567
A. Nicolau Loop quantization: a generalized loop
unwinding technique . . . . . . . . . . 568--586
D. Gannon and
W. Jalby and
K. Gallivan Strategies for cache and local memory
management by global program
transformation . . . . . . . . . . . . . 587--616
F. Allen and
M. Burke and
P. Charles and
R. Cytron and
J. Ferrante An overview of the PTRAN analysis system
for multiprocessing . . . . . . . . . . 617--640
H. Muhlenbein and
T. Schneider and
S. Streitz Network programming with MUPPET . . . . 641--653
Isaac D. Scherson and
Smil Ruhman Multi-operand arithmetic in a
partitioned associative architecture . . 655--668
S. Purushothaman and
P. A. Subrahmanyam Reasoning about systolic algorithms . . 669--699
Charles U. Martel A parallel algorithm for preemptive
scheduling of uniform machines . . . . . 700--715
Vojin G. Oklobdzija and
Earl R. Barnes On implementing addition in VLSI
technology . . . . . . . . . . . . . . . 716--728
P. C. Mathias and
L. M. Patnaik A systolic evaluator for linear,
quadratic, and cubic expressions . . . . 729--740
Bijendra N. Jain and
Satish K. Tripathi An analysis of cube-connected cycles and
circular shuffle networks for parallel
computation . . . . . . . . . . . . . . 741--754
C. Guerra and
S. Hambrusch Parallel algorithms for line detection
on a mesh . . . . . . . . . . . . . . . 1--19
B. Schieber and
S. Moran Parallel algorithms for maximum
bipartite matchings and maximum $0$--$1$
flows . . . . . . . . . . . . . . . . . 20--38
G. R. Gao Algorithmic aspects of balancing
techniques for pipelined data flow code
generation . . . . . . . . . . . . . . . 39--61
M. Veldhorst Gaussian elimination with partial
pivoting on an MIMD computer . . . . . . 62--68
I. D. Scherson and
S. Ilgen A reconfigurable fully parallel
associative processor . . . . . . . . . 69--89
J. Schaeffer Distributed game-tree searching . . . . 90--114
Y. Saad and
M. H. Schultz Data communication in hypercubes . . . . 115--135
A. D. McAulay Conjugate gradients on optical crossbar
interconnected multiprocessor . . . . . 136--150
I. D. Scherson and
S. Sen and
Y. Ma Two nearly optimal sorting algorithms
for mesh-connected processor arrays
using Shear-sort . . . . . . . . . . . . 151--165
H. L. Bodlaender The classification of coverings of
processor networks . . . . . . . . . . . 166--182
Michael A. Arbib Schemas and neural networks for sixth
generation computing . . . . . . . . . . 185--216
Carme Torras I. Genis Relaxation and neural learning: Points
of convergence and divergence . . . . . 217--244
Kiumi Akingbehin and
Michael Conrad A hybrid architecture for programmable
computing and evolutionary learning . . 245--263
M. M. Van Hulle and
G. A. Orban Entropy driven artificial neuronal
networks and sensorial representation: a
proposal . . . . . . . . . . . . . . . . 264--290
Joydeep Ghosh and
Kai Hwang Mapping neural networks onto
message-passing multicomputers . . . . . 291--330
Jan H. M. Korst and
Emile H. L. Aarts Combinatorial optimization on a
Boltzmann machine . . . . . . . . . . . 331--357
S. Y. Kung and
J. N. Hwang A unified systolic architecture for
artificial neural networks . . . . . . . 358--387
G. C. Fox and
J. G. Koller Code generation by a generalized neural
network: general principles and
elementary examples . . . . . . . . . . 388--410
Valmir C. Barbosa and
Eli Gafni A distributed implementation of
simulated annealing . . . . . . . . . . 411--434
James L. Johnson A neural network approach to the
$3$-satisfiability problem . . . . . . . 435--449
Jean-Loup Baer and
Wen-Hann Wang Multilevel cache hierarchies:
organizations, protocols, and
performance . . . . . . . . . . . . . . 451--476
Ora E. Percus and
Malvin H. Kalos Random number generators for MIMD
parallel processors . . . . . . . . . . 477--497
K. V. S. Ramarao Detection of mutual inconsistency in
distributed databases . . . . . . . . . 498--514
Charles E. McDowell A practical algorithm for static
analysis of parallel programs . . . . . 515--536
Yijie Han Parallel algorithms for computing linked
list prefix . . . . . . . . . . . . . . 537--557
David Peleg and
Allen Van Gelder Packet distribution on a ring . . . . . 558--567
Alex Kapelnikov and
Richard R. Muntz and
Milos D. Ercegovac A modelling methodology for the analysis
of concurrent systems and computations 568--597
C. Henry Chu and
Edward J. Delp and
Leah H. Jamieson and
Howard Jay Siegel and
Francis J. Weil and
Andrew B. Whinston A model for an intelligent operating
system for executing image understanding
tasks on a reconfigurable parallel
architecture . . . . . . . . . . . . . . 598--622
Eliezer Dekel and
Istvan Ozsvath Parallel external merging . . . . . . . 623--635
S. K. Ghoshal and
M. Gupta and
V. Rajaraman A parallel multistep predictor-corrector
algorithm for solving ordinary
differential equations . . . . . . . . . 636--648
Bruce Abramson and
Moti Yung Divide and conquer under global
constraints: a solution to the
$N$-queens problem . . . . . . . . . . . 649--662
D. J. Evans and
G. M. Megson Fast triangularization of a symmetric
tridiagonal matrix . . . . . . . . . . . 663--678
Thomas Bier and
Kia-Fock Loe Embedding of binary trees into
hypercubes . . . . . . . . . . . . . . . 679--691
H. Schroder Top-down designs of instruction systolic
arrays for polynomial interpolation and
evaluation . . . . . . . . . . . . . . . 692--703
Malle A. Tagamets and
James A. Reggia A data flow implementation of a
competition-based connectionist model 704--714
Yubin Hung and
Azriel Rosenfeld Parallel processing of linear quadtrees
on a mesh-connected computer . . . . . . 1--27
Uwe Schwiegelshohn and
Lothar Thiele Linear systolic arrays for matrix
computations . . . . . . . . . . . . . . 28--39
Bharat Jayaraman and
Robert M. Keller Semantics and implementation of resource
expressions . . . . . . . . . . . . . . 40--63
Anoop Gupta and
Charles L. Forgy Static and run-time characteristics of
OPS5 production systems . . . . . . . . 64--95
Jean-Luc Gaudiot and
Liang-Teh Lee Occamflow: a methodology for programming
multiprocessor systems . . . . . . . . . 96--124
W. Richard Stark and
Leon Kotin The social metaphor for distributed
processing . . . . . . . . . . . . . . . 125--147
S. Pakzad Fault tolerance analysis of the class of
rearrangeable interconnection networks 148--164
D. B. Skillicorn and
B. Kocay A global measure of network connectivity 165--177
David Smitley and
Insup Lee Synthesizing minimum total expansion
topologies for reconfigurable
interconnection networks . . . . . . . . 178--199
Bradley R. Engstrom and
Peter R. Cappello The SDEF programming system . . . . . . 201--231
Isaac D. Scherson and
Yiming Ma Analysis and applications of the
orthogonal access multiprocessor . . . . 232--255
Jeff D. Parker A concurrent search structure . . . . . 256--278
George Cybenko Dynamic load balancing for distributed
memory multiprocessors . . . . . . . . . 279--301
Massimo Maresca and
Hungwen Li Connection autonomy in SIMD computers: a
VLSI implementation . . . . . . . . . . 302--320
Yu-Cheng Liu and
Chungching Wang Analysis of prioritized crossbar
multiprocessor systems . . . . . . . . . 321--334
Azriel Rosenfeld Arc colorings, partial path groups, and
parallel graph contractions . . . . . . 335--354
Gerard Tel and
Harry A. G. Wijshoff Hierarchical parallel memory systems and
multiperiodic skewing schemes . . . . . 355--367
Nam Ling and
Magdy A. Bayoumi Systematic algorithm mapping for
multidimensional systolic arrays . . . . 368--382
G. Bongiovanni and
R. Petreschi Parallel-depth search for acyclic
digraphs . . . . . . . . . . . . . . . . 383--390
Jie-Yong Juang and
Benjamin W. Wah Load balancing and ordered selections in
a computer system with multiple
contention buses . . . . . . . . . . . . 391--415
Ken Wong and
Mark A. Franklin Performance analysis of a parallel logic
simulation machine . . . . . . . . . . . 416--440
V. K. Prasanna Kumar and
Yu-Chen Tsai Designing linear systolic arrays . . . . 441--463
To-Yat Cheung An algorithm with decentralized control
for sorting files in a network . . . . . 464--481
Chuan-Qi Zhu and
Zhixi Fang and
Xiaobo Li A new parallel sorting approach with
sorting memory module . . . . . . . . . 482--502
Alan Wagner Embedding arbitrary binary trees in a
hypercube . . . . . . . . . . . . . . . 503--520
Chung-Ta King and
Thomas B. Gendreau and
Lionel M. Ni Reliable election in broadcast networks 521--540
T. H. Szymanski and
V. C. Hamacher On the universality of multipath
multistage interconnection networks . . 541--569
Hyunsoo Yoon and
Kyungsook Y. Lee $B$-banyan and $B$-delta networks for
multiprocessor systems . . . . . . . . . 570--582
Tse-Yun Feng Search algorithms for bis-sequential
machines . . . . . . . . . . . . . . . . 1--9
Pradeep K. Dubey and
Michael J. Flynn Optimal pipelining . . . . . . . . . . . 10--19
V. V. Dixit and
D. I. Moldovan The allocation problem in parallel
production systems . . . . . . . . . . . 20--29
Youran Lan and
Abdol-Hossein Esfahanian and
Lionel M. Ni Multicast in hypercube multiprocessors 30--41
Lubomir Bic A process-oriented model for efficient
execution of dataflow programs . . . . . 42--51
B. Codenotti and
G. Lotti and
F. Romani Area-time trade-offs for matrix-vector
multiplication . . . . . . . . . . . . . 52--59
Phillip C-Y. Sheu and
R. L. Kashyap Query optimization in distributed
logic-oriented object bases . . . . . . 60--71
Hyunsoo Yoon and
Kyungsook Y. Lee and
Amos Bahiri On the modulo ${M}$ translators for the
prime memory system . . . . . . . . . . 72--76
W. Daniel Hillis and
Washington Taylor, IV Exploiting symmetry in high-dimensional
finite difference calculations . . . . . 77--79
Sukil Kim and
Dharma P. Agrawal and
Robert J. Plemmons Least-squares multiple updating
algorithms on a hypercube . . . . . . . 80--88
David A. Carlson Solving linear recurrence systems on
mesh-connected computers with multiple
global buses . . . . . . . . . . . . . . 89--95
David Peleg Time-optimal leader election in general
networks . . . . . . . . . . . . . . . . 96--99
David H. Schaefer Special Issue on Massively Parallel
Computation: Guest Editor's Introduction 101--101
K. Knobe and
J. D. Lukas and
G. L. Steele, Jr. Data Optimization: Allocation of Arrays
to Reduce Communication on SIMD Machines 102--118
G. E. Blelloch and
G. W. Sabot Compiling Collection-Oriented Languages
onto Massively Parallel Computers . . . 119--134
M. Willebeek-LeMair and
A. P. Reeves Solving Nonuniform Problems on SIMD
Computers: Case Study on Region Growing 135--149
D. W. Blevins and
E. W. Davis and
R. A. Heaton and
J. H. Feif BLITZEN: A Highly Integrated Massively
Parallel Machine . . . . . . . . . . . . 150--160
J. P. Darling and
I. D. Mayergoyz Parallel Algorithm for the Solution of
Nonlinear Poisson Equation of
Semiconductor Device Theory and Its
Implementation on the MPP . . . . . . . 161--168
B. C. Kuszmaul and
J. Fried NAP (No ALU Processor): The Great
Communicator . . . . . . . . . . . . . . 169--179
N. M. Sammur and
M. T. Hagan Mapping Signal Processing Algorithms on
Parallel Architectures . . . . . . . . . 180--185
H. Berryman and
J. Saltz and
W. Gropp and
R. Mirchandaney Krylov Methods Preconditioned with
Incompletely Factored Matrices on the
CM-2 . . . . . . . . . . . . . . . . . . 186--190
M. D. Rice and
S. B. Seidman and
P. Y. Wang The Specification of Data Parallel
Algorithms . . . . . . . . . . . . . . . 191--195
C. S. Lin and
A. L. Thring and
J. Koga and
E. J. Seiler A parallel particle-in-cell model for
the Massively Parallel Processor . . . . 196--199
Vernon Rego and
Aditya P. Mathur Concurrency enhancement through program
unification: a performance analysis . . 201--217
Henk J. Sips and
Hai Xiang Lin A new model for on-line arithmetic with
an application to the reciprocal
calculation . . . . . . . . . . . . . . 218--230
Joseph J. Pfeiffer, Jr. HCL: a language for low-level image
analysis . . . . . . . . . . . . . . . . 231--244
S. Chandrasekaran and
S. Venkatesan A message-optimal algorithm for
distributed termination detection . . . 245--252
Ray Ford and
Michael J. Jipping and
Roger Shultz and
Brion Wenhardt On the performance of concurrent tree
algorithms . . . . . . . . . . . . . . . 253--266
Qing Yang and
Laxmi N. Bhuyan Performance of multiple-bus
interconnections for multiprocessors . . 267--273
Jason Gait Scheduling and process migration in
partitioned multiprocessors . . . . . . 274--279
Richard Cole and
Ofer Zajicek An optimal parallel algorithm for
building a data structure for planar
point location . . . . . . . . . . . . . 280--285
Jong-Chuang Tsay and
Sy Yuan Systolic flow . . . . . . . . . . . . . 286--291
F. F. Rivera and
M. A. Ismail and
E. L. Zapata Parallel squared error clustering on
hypercube arrays . . . . . . . . . . . . 292--299
Quentin F. Stout Special Issue on Algorithms for
Hypercube Computers: Guest Editor's
Introduction . . . . . . . . . . . . . . 301--302
Joel Saltz and
Kathleen Crowley and
Ravi Mirchandaney and
Harry Berryman Run-Time Scheduling and Execution of
Loops on Message Passing Machines . . . 303--312
O. A. Olukotun and
T. N. Mudge Hierarchical Gate-Array Routing on a
Hypercube Multiprocessor . . . . . . . . 313--324
Ching-Tien Ho and
S. Lennart Johnsson Embedding Meshes in Boolean Cubes by
Graph Decomposition . . . . . . . . . . 325--339
Chaitanya K. Baru and
Piyush Goel Squashed embedding of E-R schemas in
hypercubes . . . . . . . . . . . . . . . 340--348
Nathaniel J. Davis, IV and
David L. Mannix and
Wade H. Shaw and
Thomas C. Hartrum Distributed Discrete-Event Simulation
Using Null Message Algorithms on
Hypercube Architectures . . . . . . . . 349--357
P. J. Eberlein and
Haesun Park Efficient Implementation of Jacobi
Algorithms and Jacobi Sets on
Distributed Memory Architectures . . . . 358--366
Frank Dehne and
Andrew Rau-Chaplin Implementing Data Structures on a
Hypercube Multiprocessor, and
Applications in Parallel Computational
Geometry . . . . . . . . . . . . . . . . 367--375
R. D. McLeod and
J. J. Schellenberg and
P. D. Hortensius Percolation and Anomalous Transport as
Tools in Analyzing Parallel Processing
Interconnection Networks . . . . . . . . 376--387
Adam W. Bojanczyk and
Franklin T. Luk A Unified Systolic Array for Adaptive
Beamforming . . . . . . . . . . . . . . 388--392
Zen Chen and
Chih-Chi Chang and
Tsorng-Lin Chia On the Design of VLSI Architectures for
Parallel Execution of DO Loops . . . . . 393--399
Shang-Hua Teng Adaptive Parallel Algorithms for
Integral Knapsack Problems . . . . . . . 400--406
Sy-Yen Kuo and
W. Kent Fuchs Reconfigurable cube-connected cycles
architectures . . . . . . . . . . . . . 1--10
Paola Bertolazzi and
Silvio Salza and
Concettina Guerra A parallel algorithm for the visibility
problem from a point . . . . . . . . . . 11--14
H. F. Li and
K. Venkatesh and
T. Radhakrishnan Time advancement in distributed event
simulation . . . . . . . . . . . . . . . 15--25
Karl-Heinz Zimmermann The theory of acyclic systolic systems 26--41
Ten-Hwang Lai and
William White Mapping pyramid algorithms into
hypercubes . . . . . . . . . . . . . . . 42--54
Shing-tsaan Huang A fully pipelined minimum-spanning-tree
constructor . . . . . . . . . . . . . . 55--62
Frank Dehne Computing the largest empty rectangle on
one- and two-dimensional processor
arrays . . . . . . . . . . . . . . . . . 63--68
Michael T. Goodrich and
Mikhail J. Atallah On performing robust order statistics in
tree-structured dictionary machines . . 69--76
A. Goscinski Two algorithms for mutual exclusion in
real-time distributed computer systems 77--82
Kam Hoi Cheng A simultaneous access queue . . . . . . 83--86
F. D. Anger and
Jing-jang Hwang and
Yuan-chieh Chow Scheduling with sufficient loosely
coupled processors . . . . . . . . . . . 87--92
S. Chowdhury The Greedy load sharing algorithm . . . 93--99
L. M. Ni and
K. C. Tai Special Issue on Software Tools for
Parallel Programming and Visualization:
Guest Editors' Introduction . . . . . . 101--102
P. A. Suhler and
J. Biswas and
K. M. Korner and
J. C. Browne TDFL: A Task-Level Dataflow Language . . 103--115
Ping-Sheng Tseng A Systolic Array Parallelizing Compiler 116--127
V. Y. Shen and
C. Richter and
M. L. Graf and
J. A. Brumfield VERDI: A Visual Environment for
Designing Distributed Systems . . . . . 128--137
H. El-Rewini and
T. G. Lewis Scheduling Parallel Program Tasks onto
Arbitrary Target Machines . . . . . . . 138--153
V. Balasundaram A Mechanism for Keeping Useful Internal
Information in Parallel Programming
Tools: The Data Access Descriptor . . . 154--170
D. C. Marinescu and
J. E. Lumpp, Jr. and
T. L. Casavant and
Siegel and
H. J. Models for Monitoring and Debugging
Tools for Parallel and Distributed
Software . . . . . . . . . . . . . . . . 171--184
J. Dongarra and
O. Brewer and
J. A. Kohl and
S. Fineberg A Tool to Aid in the Design,
Implementation, and Understanding of
Matrix Algorithms for Parallel
Processors . . . . . . . . . . . . . . . 185--202
Thomas J. LeBlanc and
John M. Mellor-Crummey and
Robert J. Fowler Analyzing Parallel Program Executions
Using Multiple Views . . . . . . . . . . 203--217
Xiaobo Li and
Yian-Leng Chang Simulating Parallel Architectures in a
Distributed Environment . . . . . . . . 218--223
P. David Stotts and
Richard Furuta Browsing Parallel Process Networks . . . 224--235
Tse-Yun Feng and
Qirui Zhang On fault diagnosis of multistage
networks with four valid states . . . . 237--251
Michel Cosnard and
Jean Duprat and
Yves Robert Systolic triangularization over finite
fields . . . . . . . . . . . . . . . . . 252--260
A. W. Bojanczyk and
R. P. Brent and
F. R. de Hoog Linearly connected arrays for Toeplitz
least-squares problems . . . . . . . . . 261--270
Bernard P. Zeigler and
Guoqing Zhang Mapping hierarchical discrete event
models to multiprocessor systems:
concepts, algorithm, and simulation . . 271--281
David S. Wise and
John Franco Costs of quadtree representation of
nondense matrices . . . . . . . . . . . 282--296
J. R. Parker and
T. R. Ingoldsby Design and analysis of a multiprocessor
for image processing . . . . . . . . . . 297--303
D. T. Harper, III and
J. R. Jump Evaluation of reduced bandwidth
multistage networks . . . . . . . . . . 304--311
Fung F. Lee Partitioning of regular computation on
multiprocessor systems . . . . . . . . . 312--317
Arvin Park and
K. Balasubramanian Reducing communication costs for sorting
on mesh-connected and linearly connected
parallel computers . . . . . . . . . . . 318--322
Richard D. Ferrante Parameters for distributed system design 323--329
R. Mirchandaney and
D. Towsley and
J. A. Stankovic Adaptive load sharing in heterogeneous
distributed systems . . . . . . . . . . 331--346
M. A. Sridhar and
C. S. Raghavendra Minimal full-access networks:
enumeration and characterization . . . . 347--356
P. Triantafillou and
M. Bauer Distributed name management in Internet
systems: a study of design and
performance issues . . . . . . . . . . . 357--368
L. E. Moser and
P. M. Melliar-Smith The world banker's algorithm . . . . . . 369--373
W. Hohberg How to find biconnected components in
distributed networks . . . . . . . . . . 374--386
Z. Fan and
K. H. Cheng Design and analysis of simultaneous
access priority queues . . . . . . . . . 387--397
M. Gupta and
K. Y. Lee The $n$-omega: an omega-like topology
for distributed-memory multiprocessors 398--410
S. Ranka and
S. Sahni String editing on an SIMD hypercube
multicomputer . . . . . . . . . . . . . 411--418
W. G. Nation and
H. J. Siegel Disjoint path properties of the data
manipulator network family . . . . . . . 419--423
B. W. Wah and
Guo-Jie Li Optimal parallel evaluation of AND trees 1--17
Yubin Hung and
A. Rosenfeld Processing border codes on a
mesh-connected computer . . . . . . . . 18--28
E. R. Cohn Implementing the multiprefix operation
efficiently . . . . . . . . . . . . . . 29--34
F. Ercal and
J. Ramanujam and
P. Sadayappan Task allocation onto a hypercube by
recursive mincut bipartitioning . . . . 35--44
D. M. Chiarulli and
S. P. Levitan and
R. G. Melhem Optical bus control for distributed
multiprocessors . . . . . . . . . . . . 45--54
T. Lang and
L. Kurisaki Nonuniform traffic spots (NUTS) in
multistage interconnection networks . . 55--67
Dik Lun Lee and
Chun-Wu Leng Design and performance evaluation of an
associative memory with distributed
control . . . . . . . . . . . . . . . . 68--78
S. Ranka and
S. Sahni Image template matching on MIMD
hypercube multicomputers . . . . . . . . 79--84
A. Hac and
T. J. Johnson Sensitivity study of the load balancing
algorithm in a distributed system . . . 85--89
A. El-Amawy and
S. Latifi Bridged hypercube networks . . . . . . . 90--95
B. Wilkinson Cascaded rhombic crossbar
interconnection networks . . . . . . . . 96--101
Leonard M. Napolitano, Jr. The design of a high performance
packet-switched network . . . . . . . . 103--114
Myung Hoon Sunwoo and
J. K. Aggarwal Flexibly coupled multiprocessors for
image processing . . . . . . . . . . . . 115--129
Peiyi Tang and
Pen-Chung Yew Software combining algorithms for
distributing hot-spot addressing . . . . 130--139
David M. Koppelman and
A. Yavuz Oruc A self-routing permutation network . . . 140--151
Keqin Li and
Kam Hoi Cheng Static job scheduling in partitionable
mesh connected systems . . . . . . . . . 152--159
S. H. Hosseini and
B. Litow and
M. Malkawi and
J. McPherson and
K. Vairavan Analysis of a graph coloring based
distributed load balancing algorithm . . 160--166
Quentin F. Stout and
Bruce Wagar Intensive hypercube communication
prearranged communication in link-bound
machines . . . . . . . . . . . . . . . . 167--181
Bjorn Lisper Synthesis of time-optimal systolic
arrays with cells with inner structure 182--187
Hamid R. Arabnia A parallel algorithm for the arbitrary
rotation of digitized images using
process-and-data-decomposition approach 188--192
Thomas H. Cormen and
Charles E. Leiserson A hyperconcentrator switch for routing
bit-serial messages . . . . . . . . . . 193--204
Anne Dinning and
B. Mishra A fully parallel algorithm for
implementing path expressions . . . . . 205--221
Behrooz Shirazi and
Mingfang Wang and
Girishi Pathak Analysis and evaluation of heuristic
methods for static task scheduling . . . 222--232
Mohan Ahuja Concurrency control for a mix of
universioned and multiversioned entities
in distributed databases . . . . . . . . 233--252
P. David Stotts and
T. W. Pratt Coverability graphs for a class of
synchronously executed unbounded Petri
net . . . . . . . . . . . . . . . . . . 253--260
Lars Lundberg A protocol to reduce global
communication in distributed Ada tasking 261--264
Robert D. Silverman Parallel polynomial arithmetic over
finite rings . . . . . . . . . . . . . . 265--270
Joseph Y.-T. Leung and
Tommy W. Tam and
C. S. Wong and
G. H. Young and
F. Y. L. Chin Packing squares into a square . . . . . 271--275
Lubomir Bic and
Jean-Luc Gaudiot Special Issue on Data-Flow Computing:
Guest Editors' Introduction . . . . . . 277--278
M. Beck and
K. K. Pingali and
A. Nicolau Static Scheduling for Dynamic Dataflow
Machines . . . . . . . . . . . . . . . . 279--288
D. E. Culler and
G. M. Papadopoulos The Explicit Token Store . . . . . . . . 289--308
V. G. Grafe and
J. E. Hoch The EPSILON-2 Multiprocessor System . . 309--318
A. H. Veen and
R. Van Den Born The RC Compiler for the DTN Dataflow
Computer . . . . . . . . . . . . . . . . 319--332
E. A. Lee and
J. C. Bier Architectures for Statically Scheduled
Dataflow . . . . . . . . . . . . . . . . 333--348
J. T. Feo and
D. C. Cann and
R. R. Oldehoeft A Report on the Sisal Language Project 349--366
H. M. Vin and
F. Berman and
J. S. Mattson, Jr. Efficient Data-Driven Evaluation: Theory
and Implementation . . . . . . . . . . . 367--385
Charles Weems and
Edward Riseman and
Allen Hanson and
Azriel Rosenfeld The DARPA image understanding benchmark
for parallel computers . . . . . . . . . 1--24
C. Scheurich and
M. Dubois Lockup-free caches in high-performance
multiprocessors . . . . . . . . . . . . 25--36
A. R. Hurson and
S. H. Pakzad and
D. B. Shin and
L. L. Miller A reconfigurable MIMD back-end database
machine . . . . . . . . . . . . . . . . 37--50
Robert R. Seban FTN topology and protocols . . . . . . . 51--62
Mee Yee Chan and
Shiang-Jen Lee Distributed fault-tolerant embeddings of
rings in hypercubes . . . . . . . . . . 63--71
P. J. Bernhard and
D. J. Rosenkrantz An efficient method for representing and
transmitting message patterns on
multiprocessor interconnection networks 72--85
Isaac D. Scherson and
Peter F. Corbett Communications overhead and the expected
speedup of multidimensional
mesh-connected parallel processors . . . 86--96
Rajendra V. Boppana and
C. S. Raghavendra Generalized schemes for access and
alignment of data in parallel processors
with self-routing interconnection
networks . . . . . . . . . . . . . . . . 97--111
Richard P. Larowe, Jr. and
Carla Schlatter Ellis Page placement policies for NUMA
multiprocessors . . . . . . . . . . . . 112--129
Uwe Schwiegelshohn and
Franco Gasperoni and
Kemal Ebcioglu On optimal parallelization of arbitrary
loops . . . . . . . . . . . . . . . . . 130--134
David Smitley and
Kent Iobst Bit-serial SIMD on the CM-2 and the
Cray-2 . . . . . . . . . . . . . . . . . 135--145
Manfred Kunde and
Thomas Tensi $(\kappa-\kappa)$ routing on
multidimensional mesh-connected arrays 146--155
Poras T. Balsara and
Robert M. Owens and
Mary Jane Irwin Digit serial multipliers . . . . . . . . 156--162
De-Lei Lee Design of an array processor for image
processing . . . . . . . . . . . . . . . 163--169
William E. Wright Parallel algorithms for generating the
raster representation of straight lines
and circles . . . . . . . . . . . . . . 170--173
B. Lee and
A. R. Hurson and
T. Y. Feng A vertically layered allocation scheme
for data flow systems . . . . . . . . . 175--187
Yi-Hsiu Wei and
Alexander D. Stoyenko and
German S. Goldszmidt The design of a stub generator for
heterogeneous RPC systems . . . . . . . 188--197
Wei Shu and
L. V. Kale Chare kernel --- a runtime support
system for parallel computations . . . . 198--211
Milos D. Ercegovac and
Tomas Lang Module to perform multiplication,
division, and square root in systolic
arrays for matrix computations . . . . . 212--221
Kemal Efe Embedding mesh of trees in the hypercube 222--230
G. M. Megson Systolic algorithms for B-spline patch
generation . . . . . . . . . . . . . . . 231--238
Samuel A. Fineberg and
Thomas L. Casavant and
Howard Jay Siegel Experimental analysis of a mixed-mode
parallel architecture using bitonic
sequence sorting . . . . . . . . . . . . 239--251
Ravi Varadarajan Embedding shuffle networks in hypercubes 252--256
Biing-Feng Wang and
Gen-Huey Chen Cost-optimal parallel algorithms for
constructing $2$--$3$ trees . . . . . . 257--261
D. P. Bertsekas and
C. Ozveren and
G. D. Stamoulis and
P. Tseng and
J. N. Tsitsiklis Optimal communication algorithms for
hypercubes . . . . . . . . . . . . . . . 263--275
J. Gotze and
U. Schwiegelshohn VLSI-suited orthogonal solution of
systems of linear equations . . . . . . 276--283
Avi Lin Parallel algorithms for boundary value
problems . . . . . . . . . . . . . . . . 284--290
Isaac A. Dimitrovsky The group lock and its applications . . 291--302
Tony R. Martinez and
Douglas M. Campbell A self-adjusting dynamic logic module 303--313
Krishnan Padmanabhan Efficient architectures for data access
in a shared memory hierarchy . . . . . . 314--327
Alan Edelman Optimal matrix transposition and bit
reversal on hypercubes: all-to-all
personalized communication . . . . . . . 328--331
Bogdan S. Chlebus and
Imrich Vrto Parallel quicksort . . . . . . . . . . . 332--337
Dipak Sitaram and
Israel Koren and
C. M. Krishna A random, distributed algorithm to embed
trees in partially faulty processor
arrays . . . . . . . . . . . . . . . . . 1--11
Frank Dehne and
Susanne E. Hambrusch Parallel algorithms for determining
$k$-width connectivity in binary images 12--23
E. de Souza e Silva and
M. Gerla Queueing network models for load
balancing in distributed systems . . . . 24--38
P. J. Bernhard and
H. B. Hunt, III and
D. J. Rosenkrantz Compaction of message patterns into
succinct representations for
multiprocessor interconnection networks 39--49
Charles Tong and
Paul N. Swarztrauber Ordered fast Fourier transforms on a
massively parallel hypercube
multiprocessor . . . . . . . . . . . . . 50--59
E. L. Zapata and
J. A. Lamas and
F. F. Rivera and
O. G. Plata Modified Gram-Schmidt $QR$ factorization
on hypercube SIMD computers . . . . . . 60--69
P. Navaneethan and
Lawrence Jenkins Design of nonequivalent self-routing
networks based on a matrix model . . . . 70--73
Guan-Ing Chen and
Ten-Hwang Lai Scheduling independent jobs on
partitionable hypercubes . . . . . . . . 74--78
Keqin Li and
Kam-Hoi Cheng A two-dimensional buddy system for
dynamic resource allocation in a
partitionable mesh connected system . . 79--83
Pen-Chung Yew and
Benjamin W. Wah Special Issue on Shared-Memory
Multiprocessors . . . . . . . . . . . . 85--86
Todd Mowry and
Anoop Gupta Tolerating Latency Through
Software-Controlled Prefetching in
Shared-Memory Multiprocessors . . . . . 87--106
Nian-Feng Tzeng Alleviating the Impact of Tree
Saturation on Multistage Interconnection
Network Performance . . . . . . . . . . 107--117
Micah Beck and
Richard Johnson and
Keshav Pingali From Control Flow to Dataflow . . . . . 118--129
Dhabaleswar K. Panda and
Kai Hwang Fast Data Manipulation in
Multiprocessors Using Parallel Pipelined
Memories . . . . . . . . . . . . . . . . 130--145
Yonatan Aumann and
Assaf Schuster Improved Memory Utilization in
Deterministic PRAM Simulation . . . . . 146--151
Kleanthis Psarris and
David Klappholz and
Xiangyun Kong On the Accuracy of the Banerjee Test . . 152--157
Susumu Horiguchi and
Takeo Nakada Performance Evaluation of Parallel Fast
Fourier Transform on a Multiprocessor
Workstation . . . . . . . . . . . . . . 158--163
Michael W. Strevell and
Harvey G. Cragon Data Type Transformation in
Heterogeneous Shared Memory
Multiprocessors . . . . . . . . . . . . 164--170
Peter J. Varman and
Scott D. Scheufler and
Balakrishna R. Iyer and
Gary R. Ricard Merging Multiple Lists on
Hierarchical-Memory Multiprocessors . . 171--177
Alok N. Choudhary and
Ravi Ponnusamy Implementation and Evaluation of Hough
Transform Algorithms on a Shared-Memory
Multiprocessor . . . . . . . . . . . . . 178--188
Hong Jiang and
Laxmi N. Bhuyan and
Jogesh K. Muppala MVAMIN: mean value analysis algorithms
for multistage interconnection networks 189--201
Stephen S. Yau and
Xiaoping Jia and
Doo-Hwan Bae PROOF: a parallel object-oriented
functional computation model . . . . . . 202--212
John K. Antonio and
Wei K. Tsai and
G. M. Huang A highly parallel algorithm for
multistage optimization problems and
shortest path problems . . . . . . . . . 213--222
Raymond R. Glenn and
Daniel V. Pryor Instrumentation for a massively parallel
MIMD application . . . . . . . . . . . . 223--236
Seth Abraham and
Krishnan Padmanabhan Performance of multicomputer networks
under pin-out constraints . . . . . . . 237--248
Shantanu Dutt and
John P. Hayes Designing fault-tolerant systems using
automorphisms . . . . . . . . . . . . . 249--268
Zicheng Guo and
Rami G. Melhem and
Richard W. Hall and
Donald M. Chiarulli and
Steven P. Levitan Pipelined communications in optically
interconnected arrays . . . . . . . . . 269--282
Sivarama P. Dandamudi and
Derek L. Eager On hypercube-based hierarchical
interconnection network design . . . . . 283--289
Klaus Zeppenfeld Parallel search in bivalued game trees 290--296
S. Lennart Johnsson Performance modeling of distributed
memory architectures . . . . . . . . . . 300--312
Arun K. Nanda and
Honda Shing and
Ten-Hwan Tzen and
Lionel M. Ni Resource contention in shared-memory
multiprocessors: a parameterized
performance degradation model . . . . . 313--328
Shin-Dug Kim and
Mark A. Nichols and
Howard Jay Siegel Modeling overlapped operation between
the control unit and processing elements
in an SIMD machine . . . . . . . . . . . 329--342
John B. Andrews and
Constantine D. Polychronopoulos An analytical approach to
performance/cost modeling of parallel
computers . . . . . . . . . . . . . . . 343--356
Peter G. Harrison Analytic models for multistage
interconnection networks . . . . . . . . 357--369
Brigitte Plateau and
Jean-Michel Fourneau A methodology for solving Markov models
of parallel systems . . . . . . . . . . 370--387
John Gustafson and
Diane Rover and
Stephen Elbert and
Michael Carter The design of a scalable, fixed-time
computer benchmark . . . . . . . . . . . 388--401
R. T. Dimpsey and
R. K. Iyer Modeling and measuring multiprogramming
and system overheads on a shared-memory
multiprocessor: case study . . . . . . . 402--414
Seema Hiranandani and
Joel Saltz and
Piyush Mehrotra and
Harry Berryman Performance of hashed cache data
migration schemes on multicomputers . . 415--422
David A. Poplawski Synthetic models of distributed-memory
parallel programs . . . . . . . . . . . 423--426
Robert E. Strout, II and
James R. McGraw and
Alan C. Hindmarsh An examination of the conversion of
software to multiprocessors . . . . . . 1--16
Catherine E. Houstis and
Mokhtar Aboelaze A comparative performance analysis of
mapping applications to parallel
multiprocessor systems: a case study . . 17--29
Matthew Rosing and
Robert B. Schnabel and
Robert P. Weaver The DINO parallel programming language 30--42
Kai Hwang and
Chien-Ming Cheng Simulated performance of a RISC-based
multiprocessor using orthogonal-access
memory . . . . . . . . . . . . . . . . . 43--57
John R. Gilbert and
Robert Schreiber Optimal expression evaluation for data
parallel architectures . . . . . . . . . 58--64
Patrick Zwietering and
Emile Aarts Parallel Boltzmann machines: a
mathematical model . . . . . . . . . . . 65--75
R. Lin and
S. Olariu An NC recognition algorithm for cographs 76--90
Avraham Leff and
Philip S. Yu An adaptive strategy for load sharing in
distributed database environments with
information lags . . . . . . . . . . . . 91--103
Seth Abraham and
Krishnan Padmanabhan The twisted cube topology for
multiprocessors: a study in network
asymmetry . . . . . . . . . . . . . . . 104--110
Marc Moonen and
Paul Van Dooren and
Joos Vandewalle Jacobi-type algorithms for LDU and
Cholesky factorization . . . . . . . . . 111--117
Cetin K. Koc and
Sarath N. Arachchige A fast algorithm for Gaussian
elimination over GF(2) and its
implementation on the GAPP . . . . . . . 118--122
Vipin Kumar and
Vineet Singh Scalability of parallel algorithms for
the all-pairs shortest-path problem . . 124--138
Y. Ben-Asher and
D. Peleg and
R. Ramaswami and
A. Schuster The power of reconfiguration . . . . . . 139--153
Thomas B. Berg and
Shin-Dug Kim and
Howard Jay Siegel Limitations imposed on mixed-mode
performance of optimized phases due to
temporal juxtaposition . . . . . . . . . 154--169
Anargyros Krikelis Computer vision applications with the
associative string processor . . . . . . 170--184
Eugene Albert and
Joan D. Lukas and
Guy L. Steele, Jr. Data parallel computers and the FORALL
statement . . . . . . . . . . . . . . . 185--192
Peter Kochevar A simple light simulation algorithm for
massively parallel machines . . . . . . 193--201
Joel Saltz and
Serge Petiton and
Harry Berryman and
Adam Rifkin Performance effects of irregular
communication patterns on massively
parallel multiprocessors . . . . . . . . 202--212
Jingke Li and
Marina Chen The data alignment phase in compiling
programs for distributed-memory machines 213--221
James A. Storer and
John H. Reif A parallel architecture for high-speed
data compression . . . . . . . . . . . . 222--227
Joel M. Wein and
Stavros A. Zenios On the massively parallel solution of
the assignment problem . . . . . . . . . 228--236
Diane Rover and
Vicki Tsai and
Yin-Shan Chow and
John Gustafson Signal-processing algorithms on parallel
architectures: a performance update . . 237--245
Ching-Tien Ho Optimal broadcasting on SIMD hypercubes
without indirect addressing capability 246--255
John E. Savage and
Markus G. Wloka Parallelism in graph-partitioning . . . 257--272
Frank Weil and
Leah H. Jamifson and
Edward J. Delp Dynamic intelligent scheduling and
control of reconfigurable parallel
architectures for computer vision/image
processing . . . . . . . . . . . . . . . 273--285
Edward A. Carmona and
Michael D. Rice Modeling the serial and parallel
fractions of a parallel algorithm . . . 286--298
Shyan-ming Yuan and
Ashok K. Agrawala Fault-tolerant decentralized commit
protocols . . . . . . . . . . . . . . . 299--311
Reinhard v. Hanxleden and
L. Ridgeway Scott Load balancing on message passing
architectures . . . . . . . . . . . . . 312--324
Christopher L. Cox and
James A. Knisely A tridiagonal system solver for
distributed memory parallel processors
with vector nodes . . . . . . . . . . . 325--331
Jianhua Lin and
James A. Storer Processor-efficient hypercube algorithms
for the knapsack problem . . . . . . . . 332--337
Arunabha Sen and
Abhutt Sengupta and
Subir Bandyopadhyay Generalized supercube: an incrementally
expandable interconnection network . . . 338--344
Daniel P. Miranker Special Issue on the Parallel Execution
of Rule Systems . . . . . . . . . . . . 345--347
James G. Schmolze Guaranteeing Serializable Results in
Synchronous Parallel Production Systems 348--365
Salvatore J. Stolfo and
Ouri Wolfson and
Philip K. Chan and
Hasanat M. Dewan and
Leland Woodbury and
Jason S. Glazier and
David A. Ohsie PARULEL: Parallel Rule Processing Using
Meta-rules for Redaction . . . . . . . . 366--382
Steve Kuo and
Dan Moldovan Implementation of Multiple Rule Firing
Production Systems on Hypercube . . . . 383--394
Wilson Harvey and
Dirk Kalp and
Milind Tambe and
David McKeown and
Allen Newell The Effectiveness of Task-Level
Parallelism for Production Systems . . . 395--411
T. Castagnetti and
P. Ciancarini Static Analysis of a Parallel Logic
Language Based on the Blackboard Model 412--423
Chin-Ming Kuo and
Daniel P. Miranker and
James C. Browne On the Performance of the CREL System 424--441
Jian Xu and
Kai Hwang Mapping Rule-Based Systems onto
Multicomputers Using Simulated Annealing 442--455
E. Bahr and
F. Barachini and
J. Doppelbauer and
H. Gräbner and
F. Kasparec and
T. Mandl and
H. Mistelberger A Parallel Production System
Architecture . . . . . . . . . . . . . . 456--462
Daniel A. Menasce and
Luiz Andre Barroso A Methodology for Performance Evaluation
of Parallel Applications on
Multiprocessors . . . . . . . . . . . . 1--14
Bilha Mendelson and
Israel Koren Estimating the Potential Parallelism and
Pipelining of Algorithms for Data Flow
Machines . . . . . . . . . . . . . . . . 15--28
Nicholas T. Karonis Timing Parallel Programs That Use
Message Passing . . . . . . . . . . . . 29--36
C. T. Davarakis and
D. G. Maritsas A Probabilistic Parallel Associative
Search and Query Set of Algorithms . . . 37--49
Alok N. Choudhary and
Ravi Ponnusamy Parallel Implementation and Evaluation
of a Motion Estimation System Algorithm
Using Several Data Decomposition
Strategies . . . . . . . . . . . . . . . 50--65
Vernon J. Rego and
V. S. Sunderam Experiments in Concurrent Stochastic
Simulation: The EcliPSe Paradigm . . . . 66--84
Foster J. Provost and
Rami Melhem A Distributed Algorithm for Embedding
Trees in Hypercubes with Modifications
for Run-Time Fault Tolerance . . . . . . 85--89
Haesun Park On Multiple Error Detection in Matrix
Triangularizations Using Checksum
Methods . . . . . . . . . . . . . . . . 90--97
Abdou Youssef and
Bhagirath Narahari Topological Properties of Generalized
Banyan-Hypercube Networks . . . . . . . 98--103
A. Kapelnikov and
R. R. Muntz and
M. D. Ercegovac A Methodology for Performance Analysis
of Parallel Computations with Looping
Constructs . . . . . . . . . . . . . . . 105--120
Yiwan Wong and
Jean-Marc Delosme Transformation of Broadcasts into
Propagations in Systolic Algorithms . . 121--145
Louiqa Raschid and
Stanley Y. W. Su A Parallel Pipelined Strategy for
Evaluating Linear Recursive Predicates
in a Multiprocessor Environment . . . . 146--162
Nian-Feng Tzeng and
Hsing-Lung Chen An Effective Approach to the Enhancement
of Incomplete Hypercube Computers . . . 163--174
Henry Clark and
Bruce McMillin DAWGS --- A Distributed Compute Server
Utilizing Idle Workstations . . . . . . 175--186
A. Sengupta and
K. Zemoudeh and
S. Bandyopadhyay Self-Routing Algorithms for Strongly
Regular Multistage Interconnection
Networks . . . . . . . . . . . . . . . . 187--192
Charles J. Colbourn and
Katherine Heinrich Conflict-Free Access to Parallel
Memories . . . . . . . . . . . . . . . . 193--200
Anargyros (Argy) Krikelis Neural Computing on Massively Parallel
Processing. Guest Editor's Introduction 201--202
Max H. Garzon and
Stanley P. Franklin and
William Baggett and
William S. Boyd, Jr. and
Dinah Dickerson Design and Testing of a General-Purpose
Neurocomputer . . . . . . . . . . . . . 203--220
Mark James and
Doan Hoang Design of Low-Cost, Real-Time Simulation
Systems for Large Neural Networks . . . 221--235
Li-Xin Wang and
Jerry M. Mendel Parallel Structured Networks for Solving
a Wide Variety of Matrix Algebra
Problems . . . . . . . . . . . . . . . . 236--247
Nelson Morgan and
James Beck and
Phil Kohn and
Jeff Bilmes and
Eric Allman and
Joachim Beer The Ring Array Processor: A
Multiprocessing Peripheral for
Connectionist Applications . . . . . . . 248--259
Tomas Nordström and
Bertil Svensson Using and Designing Massively Parallel
Computers for Artificial Neural Networks 260--285
Tom Tollenaere and
Marc M. Van Hulle and
Guy A. Orban Parallel Implementation and Capabilities
of Entropy-Driven Artificial Neural
Networks . . . . . . . . . . . . . . . . 286--305
Ulrich Ramacher Synapse --- A Neurocomputer That
Synthesizes Neural Algorithms on a
Parallel Systolic Engine . . . . . . . . 306--318
Lon-Chan Chu and
Benjamin W. Wah Optimal Mapping of Neural-Network
Learning on Message-Passing
Multicomputers . . . . . . . . . . . . . 319--339
Nubuo Funabiki and
Yoshiyasu Takefuji and
Kuo-Chun Lee A Neural Network Model for Finding a
Near-Maximum Clique . . . . . . . . . . 340--344
Chwan-Hwa (John) Wu and
Jyun-Hwei Tsai Concurrent Asynchronous Learning
Algorithms for Massively Parallel
Recurrent Neural Networks . . . . . . . 345--353
Xianing Zhu and
Shengwei Zhang and
A. G. Constantinides Lagrange Neural Networks for Linear
Programming . . . . . . . . . . . . . . 354--360
Hanmao Shi and
Jonathan Schaeffer Parallel Sorting by Regular Sampling . . 361--372
Yao-ming Yeh and
Tse-yun Feng Algorithm-Based Fault Tolerance for
Matrix Inversion with Maximum Pivoting 373--389
Tze Chiang Lee and
John P. Hayes Design of Gracefully Degradable
Hypercube-Connected Systems . . . . . . 390--401
Yuval Tamir and
Gregory L. Frazier Hardware Support for High-Priority
Traffic in VLSI Communication Switches 402--416
Valerie A. Miller and
George J. Davis Adaptive Quadrature on a Message-Passing
Multiprocessor . . . . . . . . . . . . . 417--425
Barry S. Fagin Large Integer Multiplication on
Hypercubes . . . . . . . . . . . . . . . 426--430
Joseph JáJá and
Kwan Woo Ryu Load Balancing and Routing on the
Hypercube and Related Networks . . . . . 431--435
Xiaojun Guan and
Michael A. Langston Parallel Methods for Solving Fundamental
File Rearrangement Problems . . . . . . 436--439
Hwang Kai Editorial Announcement . . . . . . . . . v--vi
Steve Kuo and
Dan Moldovan The State of the Art in Parallel
Production Systems . . . . . . . . . . . 1--26
Jaswinder Pal Singh and
John L. Hennessy Finding and Exploiting Parallelism in an
Ocean Simulation Program: Experience,
Results, and Implications . . . . . . . 27--48
Barry Wilkinson Overlapping Connectivity Interconnection
Networks for Shared Memory
Multi-processor Systems . . . . . . . . 49--61
Yoshifumi Manabe and
Makoto Imase Global Conditions in Debugging
Distributed Programs . . . . . . . . . . 62--69
Radhakrishnan Sridhar and
Sitharama S. Iyengar and
Subbiah Rajanarayanan Range Search in Parallel Using
Distributed Data Structures . . . . . . 70--74
Mohammad Ashraf Iqbal Efficient Algorithms for Dilated
Mappings of Binary Trees . . . . . . . . 75--78
Yen-Cheng Chen and
Wen-Tsuen Chen and
Gen-Huey Chen Efficient Median Finding and Its
Application to Two-Variable Linear
Programming on Mesh-Connected Computers
with Multiple Broadcasting . . . . . . . 79--84
Anonymous Erratum: Volume 14, Number 3 (1992), pp.
221--235: Mark James and Doan Hoang,
``Design of Low-Cost, Real-Time
Simulation Systems for Large Neural
Networks'' . . . . . . . . . . . . . . . 85--85
Jayantha Herath Guest Editor's Introduction . . . . . . 87--89
Gabor Karsai and
Janos Sztipanovits and
Samir Padalkar and
Csaba Biegl and
Nobuji Miyasaka and
Koji Okuda Model-Based Intelligent Process Control
for Cogenerator Plants . . . . . . . . . 90--102
B. Marsh and
C. Brown and
T. LeBlanc and
M. Scott and
T. Becker and
P. Das and
J. Karlsson and
C. Quiroz Operating System Support for Animate
Vision . . . . . . . . . . . . . . . . . 103--117
Arthur Ieumwananonthachai and
Akiko N. Aizawa and
Steven R. Schwartz and
Benjamin W. Wah and
Jerry C. Yan Intelligent Process Mapping through
Systematic Improvement of Heuristics . . 118--142
Toshio Shimada and
Kenji Toda and
Kenji Nishida Real-Time Parallel Architecture for
Sensor Fusion . . . . . . . . . . . . . 143--152
Qiang Li Minimum Deadlock-Free Message Routing
Restrictions in Binary Hypercubes . . . 153--159
Sanguthevar Rajasekaran and
Richard Overholt Constant Queue Routing on a Mesh . . . . 160--166
Anonymous Addendum: Volume 14, Number 2 (1992),
pp. 105--120: A. Kapelnikov, R. R.
Muntz, and M. D. Ercegovac, ``A
Methodology for Performance Analysis of
Parallel Computations with Looping
Constructs'' . . . . . . . . . . . . . . 167--167
Giovanni Chiola Special Issue on Petri Net Modeling of
Parallel Computers . . . . . . . . . . . 169--170
Gianfranco Balbo and
Susanna Donatelli and
Giuliana Franceschinis Understanding Parallel Program Behavior
through Petri Net Models . . . . . . . . 171--187
A. Ferscha A Petri Net Approach for Performance
Oriented Parallel Program Design . . . . 188--206
Peter Buchholz A Hierarchical View of GCSPNs and Its
Impact on Qualitative and Quantitative
Analysis . . . . . . . . . . . . . . . . 207--224
S. Balaji and
L. M. Patnaik and
Lawrence Jenkins and
P. S. Goel S-Nets: A Petri Net Based Model for
Performance Evaluation of Real-Time
Scheduling Algorithms . . . . . . . . . 225--237
William H. Sanders and
Luai M. Malhis Dependability Evaluation Using Composed
SAN-Based Reward Models . . . . . . . . 238--254
Gianfranco Ciardo and
Jogesh K. Muppala and
Kishor S. Trivedi Analyzing concurrent and fault-tolerant
software using stochastic reward nets 255--269
Stefano Caselli and
Gianni Conte and
Ugo Malavolta Topology and Process Interaction in
Concurrent Architectures: A GSPN
Modeling Approach . . . . . . . . . . . 270--281
Hauke Jungnitz and
Beatriz Sanchez and
Manuel Silva Approximate Throughput Computation of
Stochastic Marked Graphs . . . . . . . . 282--295
C. Simone and
M. Ajmone Marsan The Application of EB-Equivalence Rules
to the Structural Reduction of GSPN
Models . . . . . . . . . . . . . . . . . 296--302
Michel Dubois and
Shreekant Thakkar Special Issue on Memory System
Architectures for Scalable
Multiprocessors . . . . . . . . . . . . 303--304
Philip Bitar The Weakest Memory-Access Order . . . . 305--331
John B. Andrews and
Carl J. Beckmann and
David K. Poulsen Notification and Multicast Networks for
Synchronization and Coherence . . . . . 332--350
Andrew W. Wilson, Jr. and
Richard P. LaRowe, Jr. Hiding shared memory reference latency
on the Galactica Net distributed shared
memory architecture . . . . . . . . . . 351--367
David E. Hudak and
Santosh G. Abraham Compile-Time Optimization of
Near-Neighbor Communication for Scalable
Shared-Memory Multiprocessors . . . . . 368--381
William J. Bolosky and
Michael L. Scott Evaluation of multiprocessor memory
systems using off-line optimal behavior 382--398
Kourosh Gharachorloo and
Sarita V. Adve and
Anoop Gupta and
John L. Hennessey and
Mark D. Hill Programming for Different Memory
Consistency Models . . . . . . . . . . . 399--407
Yuval Tamir and
G. Janakiraman Hierarchical Coherency Management for
Shared Virtual Memory Multicomputers . . 408--419
S. Lennart Johnsson and
Ching-Tien Ho Generalized Shuffle Permutations on
Boolean Cubes . . . . . . . . . . . . . 1--14
Pierre Fraigniaud Complexity Analysis of Broadcasting in
Hypercubes with Restricted Communication
Capabilities . . . . . . . . . . . . . . 15--26
Ora E. Percus and
Susan R. Dickey Performance Analysis of Clock-Regulated
Queues with Output Multiplexing in Three
Different $2 \times 2$ Crossbar Switch
Architectures . . . . . . . . . . . . . 27--40
Sotirios G. Ziavras On the Problem of Expanding
Hypercube-Based Systems . . . . . . . . 41--53
L. Cheng and
A. A. Sawchuk A one-copy algorithm for $2$D shuffles
for optical Omega networks . . . . . . . 54--66
W. Edwin Clark and
Gregory L. McColm and
W. Richard Stark On the Complexity of Deadlock-Free
Programs on a Ring of Processors . . . . 67--71
Hans W. Guesgen and
Kinson Ho and
Paul N. Hilfinger A Tagging Method for Parallel Constraint
Satisfaction . . . . . . . . . . . . . . 72--75
Wen-Tsuen Chen Guest Editor's Introduction . . . . . . 77--78
Craig M. Chase and
Alex L. Cheung and
Anthony P. Reeves and
Mark R. Smith Paragon: A Parallel Programming
Environment for Scientific Applications
Using Communication Structures . . . . . 79--91
Rajiv Gupta SPMD Execution of Programs with
Pointer-Based Data Structures on
Distributed-Memory Machines . . . . . . 92--107
J. Ramanujam and
P. Sadayappan Tiling Multidimensional Iteration Spaces
for Multicomputers . . . . . . . . . . . 108--120
Yen-Chun Lin and
Yu-Ho Cheng Automatic generation of parallel Occam
programs for transputer rings . . . . . 121--133
K. Ravindran and
S. Samdarshi A Flexible Causal Broadcast
Communication Interface for Distributed
Applications . . . . . . . . . . . . . . 134--157
Mi Lu and
Jesse Zhixi Fang A Solution of the Cache Ping-Pong
Problem in Multiprocessor Systems . . . 158--171
Hong Xu and
Philip K. McKinley and
Lionel M. Ni Efficient Implementation of Barrier
Synchronization in Wormhole-Routed
Hypercube Multicomputers . . . . . . . . 172--184
Jang-Ping Sheu and
Yuh-Shyan Chen and
Chih-Yung Chang Fault-Tolerant Sorting Algorithm on
Hypercube Multicomputers . . . . . . . . 185--197
Howard Jay Siegel and
Seth Abraham and
William L. Bain and
Kenneth E. Batcher and
Thomas L. Casavant and
Doug DeGroot and
Jack B. Dennis and
David C. Douglas and
Tse-Yun Feng and
James R. Goodman and
Alan Huang and
Harry F. Jordan and
J. Robert Jump and
Yale N. Patt and
Alan J. Smith and
James E. Smith and
Lawrence Snyder and
Harold S. Stone and
Russ Tuck and
Benjamin W. Wah Report of the Purdue workshop on grand
challenges in computer architecture for
the support of high performance
computing . . . . . . . . . . . . . . . 199--211
Todd Heywood and
Sanjay Ranka A Practical Hierarchical Model of
Parallel Computation. I. The Model . . . 212--232
T. Heywood and
S. Ranka A Practical Hierarchical Model of
Parallel Computation. II. Binary Tree
and FFT Algorithms . . . . . . . . . . . 233--249
Yosi Ben-Asher and
David Egozi and
Assaf Schuster $2$-D SIMD Algorithms for Perfect
Shuffle Networks . . . . . . . . . . . . 250--257
E. D. Kyriakis-Bitzaros and
C. E. Goutis An Efficient Decomposition Technique for
Mapping Nested Loops with Constant
Dependencies into Regular Processor
Arrays . . . . . . . . . . . . . . . . . 258--264
Tadao Takaoka and
Kiyomi Umehara An Efficient VLSI Algorithm for the All
Pairs Shortest Path Problem . . . . . . 265--270
Behrooz Shirazi and
A. R. Hurson Special Issue on Scheduling and Load
Balancing: Guest Editors' Introduction 271--275
Apostolos Gerasoulis and
Tao Yang A Comparison of Clustering Heuristics
for Scheduling Directed Acyclic Graphs
on Multiprocessors . . . . . . . . . . . 276--291
Tevfik Bultan and
Cevdet Aykanat A New Mapping Heuristic Based on Mean
Field Annealing . . . . . . . . . . . . 292--305
Dror G. Feitelson and
Larry Rudolph Gang Scheduling Performance Benefits for
Fine-Grain Synchronization . . . . . . . 306--318
Mikhail J. Atallah and
Christina Lock Black and
Dan C. Marinescu and
Howard Jay Siegel and
Thomas L. Casavant Models and Algorithms for Coscheduling
Compute-Intensive Tasks on a Network of
Workstations . . . . . . . . . . . . . . 319--327
Yahui Zhu Efficient Processor Allocation
Strategies for Mesh-Connected Parallel
Computers . . . . . . . . . . . . . . . 328--337
Shiv Prakash and
Alice C. Parker SOS: Synthesis of Application-Specific
Heterogeneous Multiprocessor Systems . . 338--351
Ravi Jain and
Kiran Somalwar and
John Werth and
J. C. Browne Scheduling parallel I/O operations in
multiple bus systems . . . . . . . . . . 352--362
Arun Swami and
Honesty C. Young and
Ashish Gupta Algorithms for Handling Skew in Parallel
Task Scheduling . . . . . . . . . . . . 363--377
Virginia M. Lo Temporal communication graphs: Lamport's
process-time graphs augmented for the
purpose of mapping and scheduling . . . 378--384
C. Z. Xu and
F. C. M. Lau Analysis of the Generalized Dimension
Exchange Method for Dynamic Load
Balancing . . . . . . . . . . . . . . . 385--393
Sulaiman Al-Bassam and
Hesham El-Rewini and
Bella Bose and
T. G. Lewis Processor Allocation for Hypercubes . . 394--401
Anonymous Author Index for Volume 16 . . . . . . . 402--402
Alok Choudhary Parallel I/O Systems: Guest Editor's
Introduction . . . . . . . . . . . . . . 1--3
Garth A. Gibson and
David A. Patterson Designing Disk Arrays for High Data
Reliability . . . . . . . . . . . . . . 4--27
A. L. Narasimha Reddy and
John Chandy and
P. Banerjee Design and Evaluation of Gracefully
Degradable Disk Arrays . . . . . . . . . 28--40
Thomas H. Cormen Fast Permuting on Disk Arrays . . . . . 41--57
Shenze Z. Chen and
Don Towsley The Design and Evaluation of RAID 5 and
Parity Striping Disk Array Architectures 58--74
Antoine N. Mourad and
Kent W. Fuchs and
Daniel G. Saab Recovery Issues in Databases Using
Redundant Disk Arrays . . . . . . . . . 75--89
Joydeep Ghosh and
Kelvin D. Goveas and
Jeffrey T. Draper Performance Evaluation of a Parallel I/O
Subsystem for Hypercube Multicomputers 90--106
Jeffrey Scott Vitter and
Mark H. Nodine Large-Scale Sorting in Uniform Memory
Hierarchies . . . . . . . . . . . . . . 107--114
James C. French and
Terrence W. Pratt and
Mriganka Das Performance Measurement of the
Concurrent File System of the Intel
iPSC/2 Hypercube . . . . . . . . . . . . 115--121
Erik P. DeBenedictis and
Juan Miguel Del Rosario Modular Scalable I/O . . . . . . . . . . 122--128
Jai Menon and
James Roche and
Jim Kasson Floating Parity and Data Disk Arrays . . 129--139
David Kotz and
Carla Schlatter Ellis Caching and Writeback Policies in
Parallel File Systems . . . . . . . . . 140--145
Manish Malhotra and
Kishor S. Trivedi Reliability Analysis of Redundant Arrays
of Inexpensive Disks . . . . . . . . . . 146--151
Sang-Hwa H. Chung and
Dan I. Moldovan Modeling semantic networks on the
Connection Machine . . . . . . . . . . . 152--163
Jeannette M. Wing and
Chun Gong Testing and Verifying Concurrent Objects 164--182
Anonymous Erratum: Volume 16, Number 1 (1992): L.
Cheng and A. A. Sawchuk, ``A One-Copy
Algorithm for $2$-D Shuffles for Optical
Omega Networks,'' pp. 54--66 . . . . . . 183--183
L. Cheng and
A. A. Sawchuk Volume 16, Number 1 (1992), in the
article ``A One-Copy Algorithm for $2$-D
Shuffles for Optical Omega Networks,''
by L. Cheng and A. A. Sawchuk, pages
54--66 . . . . . . . . . . . . . . . . . 183--183
Anonymous Announcement: IEEE Technical Committee
on Parallel Processing . . . . . . . . . 184--184
Rami Melhem and
Donald Chiarulli Optical Computing and Interconnection
Systems: Guest Editors' Introduction . . 185--187
S. K. Tewksbury and
L. A. Hornak and
H. E. Nariman and
S. M. Langsjoen and
N. J. Hall and
J. J. Hall and
S. P. McGinnis Toward Cointegration of Optical
Interconnections within Silicon
Microelectronic Systems . . . . . . . . 188--199
Miles Murdocca and
Vipul Gupta Architectural Implications of
Reconfigurable Optical Interconnects . . 200--211
Aloke Guha and
Julian Bristow Designing Optical Networks from Simple
Switching Elements . . . . . . . . . . . 212--221
Q. Wang Song and
Salim Hariri and
Alok Choudhary Design and Analysis of an Optical
Communications Processor . . . . . . . . 222--229
Pericles A. Mitkas and
P. Bruce Berra PHOEBUS: An Optoelectronic Database
Machine Based on Parallel Optical Disks 230--244
Farid Ahmed and
Abdul Ahad S. Awwal An Adaptive Opto-electronic Neural
Network for Associative Pattern
Retrieval . . . . . . . . . . . . . . . 245--250
M. S. Alam and
M. A. Karim Real-Time Optical Arithmetic/Logical
Processing . . . . . . . . . . . . . . . 251--258
Yoram Ofek and
Moshe Sidi Design and Analysis of a Hybrid Access
Control to an Optical Star Using WDM . . 259--265
Haesun Park and
L. Magnus Ewerbring An Algorithm for the Generalized
Singular Value Decomposition on
Massively Parallel Computers . . . . . . 267--276
Mee Yee Chan and
Shiang-Jen Lee Fault-Tolerant Permutation Routing in
Hypercubes . . . . . . . . . . . . . . . 277--281
Naim Abdullah and
Jie-yong Juang Concurrent Query Processing for Logic
Inference Using the Connection Graph . . 282--297
C. Lee and
H. Lam and
S. Y. W. Su An Object Flow Computer for Database
Applications: Design and Performance
Evaluation . . . . . . . . . . . . . . . 298--314
Adam Kapralski New Methods for the Generation of
Permutations, Combinations, and Other
Combinatorial Objects in Parallel . . . 315--326
Ajay Gupta and
Steven C. Bruell and
Sukumar Ghosh Mutual Exclusion on a Hypercube . . . . 327--336
D. B. Skillicorn and
D. T. Barnard Compiling in Parallel . . . . . . . . . 337--352
Kyungsook Y. Lee and
Hyunsoo Yoon and
Ming T. Liu Performance Evaluation of a Class of
Multipath Packet Switching
Interconnection Networks . . . . . . . . 353--359
X. Hu and
S. C. Bass and
R. G. Harber An Efficient Implementation of Singular
Value Decomposition Rotation
Transformations with CORDIC Processors 360--362
Amnon Barak and
Ron Ben-Natan Bounded Contractions of Full Trees . . . 363--369
Kam Hoi Cheng and
Qingzhou Wang A Simultaneous Access Design for Idle
Processor Reactivation and the Detection
of the Termination of a Parallel
Activity . . . . . . . . . . . . . . . . 370--373
Ernst W. Mayr and
C. Greg Plaxton Pipelined Parallel Prefix Computations,
and Sorting on a Pipelined Hypercube . . 374--380
Anonymous Author Index for Volume 17 . . . . . . . 381--381
Jian Xu and
Kai Hwang Heuristic Methods for Dynamic Load
Balancing in a Message-Passing
Multicomputer . . . . . . . . . . . . . 1--13
Krishnan Padmanabhan A Shuffle-Based Alternative to the ADM
Interconnection Architecture . . . . . . 14--24
Peter B. Worland Parallel Methods for ODEs with Improved
Absolute Stability Boundaries . . . . . 25--32
A. S. Wagner Embedding All Binary Trees in the
Hypercube . . . . . . . . . . . . . . . 33--43
Eva Ma and
Lixin X. Tao Embeddings among Meshes and Tori . . . . 44--55
Dechang C. Gu and
D. J. Rosenkrantz and
S. S. Ravi Determining Performance Measures of
Algorithm-Based Fault Tolerant Systems 56--70
Oscar H. Ibarra and
Myung Hee Kim Quadtree Building Algorithms on an SIMD
Hypercube . . . . . . . . . . . . . . . 71--76
Bernard P. Zeigler and
Ahmed Louri A Simulation Environment for Intelligent
Machine Architectures . . . . . . . . . 77--88
James Edward Steck and
Bruce McMillin and
K. Krishnamurthy and
Gary G. Leininger Parallel implementation of a recursive
least-squares neural network training
method on the Intel iPSC/2 . . . . . . . 89--93
Mukesh Singhal A Taxonomy of Distributed Mutual
Exclusion . . . . . . . . . . . . . . . 94--101
Thomas L. Casavant Tools and Methods for Visualization of
Parallel Systems and Computations: Guest
Editor's Introduction . . . . . . . . . 103--104
Eileen Kraemer and
John T. Stasko The Visualization of Parallel Systems:
An Overview . . . . . . . . . . . . . . 105--117
Thomas Bemmerl and
Peter Braum Visualization of Message Passing
Parallel Programs with the TOPSYS
Parallel Programming Environment . . . . 118--128
Diane T. Rover and
Charles T. Wright, Jr. Visualizing the Performance of SPMD and
Data-Parallel Programs . . . . . . . . . 129--146
Sekhar R. Sarukkai and
Dennis Gannon SIEVE: A Performance Debugging
Environment for Parallel Programs . . . 147--168
Venkat Natarajan and
Derek Chiou and
Boon Seong Ang Performance visualization on Monsoon . . 169--180
Joan M. Francioni and
Jay Alan Jackson Breaking the Silence: Auralization of
Parallel Program Behavior . . . . . . . 181--194
Alva L. Couch Categories and Context in Scalable
Execution Visualization . . . . . . . . 195--204
James Kohn and
Winifred Williams ATExpert . . . . . . . . . . . . . . . . 205--222
Wentong T. Cai and
Wendy J. Milne and
Stephen J. Turner Graphical Views of the Behavior of
Parallel Programs . . . . . . . . . . . 223--230
Xiaodong D. Zhang and
Naga S. Nalluri and
Xiaohan H. Qin MIN-Graph: A Tool for Monitoring and
Visualizing MIN-Based Multiprocessor
Performance . . . . . . . . . . . . . . 231--241
Sekhar R. Sarukkai and
Doug Kimelman and
Larry Rudolph A Methodology for Visualizing
Performance of Loosely Synchronous
Programs . . . . . . . . . . . . . . . . 242--251
Mark Vincent LaPolla and
Joseph L. Sharnowski and
Betty H. C. Cheng and
Kevin Anderson Data Parallel Program Visualizations
from Formal Specifications . . . . . . . 252--257
John T. Stasko and
Eileen Kraemer A Methodology for Building
Application-Specific Visualizations of
Parallel Programs . . . . . . . . . . . 258--264
Barton P. Miller What to Draw? When to Draw? An Essay on
Parallel Program Visualization . . . . . 265--269
Guang Gao and
Jean-Luc Gaudiot and
Lubomir Bic Dataflow and Multithreaded
Architectures: Guest Editors'
Introduction . . . . . . . . . . . . . . 271--272
James Hicks and
Derek Chiou and
Boon Seong Ang and
Arvind Performance Studies of Id on the Monsoon
Dataflow System . . . . . . . . . . . . 273--300
A. P. Willem Bohm and
Robert E. Hiromoto The Dataflow Time and Space Complexity
of FFTs . . . . . . . . . . . . . . . . 301--313
Walid A. Najjar and
A. P. Wim Bohm and
W. Marcus Miller A Quantitative Analysis of Dataflow
Program Execution --- Preliminaries to a
Hybrid Design . . . . . . . . . . . . . 314--326
Thomas Lawrence Sterling and
Jeffrey M. Arnold Fine Grain Dataflow Computation without
Tokens for Balanced Execution . . . . . 327--339
Darin Johnson and
Francine Berman Performance of the Efficient Data-Driven
Evaluation Scheme . . . . . . . . . . . 340--346
David E. Culler and
Seth Copen Goldstein and
Klaus Erik Schauser and
Thorsten Von Eicken TAM -- A Compiler Controlled Threaded
Abstract Machine . . . . . . . . . . . . 347--370
Helene Young-Myers and
Louiqa Raschid An Experimental Study of Three Dataflow
Paradigms in Multithreaded Database
Transitive Closure Algorithms on Shared
Memory Multiprocessors . . . . . . . . . 371--389
Yi-Bing Lin Special Issue on Parallel Discrete Event
Simulation: Guest Editor's Introduction 391--394
David M. Nicol and
Philip Heidelberger Optimistic Parallel Simulation of
Continuous Time Markov Chains Using
Uniformization . . . . . . . . . . . . . 395--410
Ian F. Akyildiz and
Liang Chen and
Samir Ranjan Das and
Richard M. Fujimoto and
Richard F. Serfozo The Effect of Memory Capacity on Time
Warp Performance . . . . . . . . . . . . 411--422
Friedemann Mattern Efficient Algorithms for Distributed
Snapshots and Global Virtual Time
Approximation . . . . . . . . . . . . . 423--434
Paul F. Reynolds, Jr. and
Carmen M. Pancerella and
Sudhir Srinivasan Design and Performance Analysis of
Hardware Support for Parallel
Simulations . . . . . . . . . . . . . . 435--453
Marc Abrams and
Vasant Sanjeevan and
Debra S. Richardson Termination and Output Measure
Generation in Parallel Simulations . . . 454--472
Vijay K. Madisetti and
David A. Hardaker and
Richard M. Fujimoto The MIMDIX Environment for Parallel
Simulation . . . . . . . . . . . . . . . 473--483
Bruno Gaujal and
Albert G. Greenberg and
David M. Nicol A Sweep Algorithm for Massively Parallel
Simulation of Circuit-Switched Networks 484--500
Rassul Ayani and
Boris Berkman Parallel Discrete Event Simulation on
SIMD Computers . . . . . . . . . . . . . 501--508
Tapas K. Som and
Robert G. Sargent A New Process to Processor Assignment
Criterion for Reducing Rollbacks in
Optimistic Simulation . . . . . . . . . 509--515
Jiajen M. Lin and
Santosh G. Abraham Utilizing Global Simulation Information
in Conservative Parallel Simulation on
Shared Memory Multiprocessors . . . . . 516--523
Sushil Prasad Efficient and Scalable PRAM Algorithms
for Discrete-Event Simulation of Bounded
Degree Networks . . . . . . . . . . . . 524--530
Anonymous Author Index for Volume 18 . . . . . . . 531--531
Jih-Kwon K. Peir and
Yann-Hang H. Lee Look-Ahead Routing Switches for
Multistage Interconnection Networks . . 1--10
Dar-Tzen T. Peng and
Kang G. Shin A New Performance Measure for Scheduling
Independent Real-Time Tasks . . . . . . 11--26
Xian-He H. Sun and
Lionel M. Ni Scalable Problems and Memory-Bounded
Speedup . . . . . . . . . . . . . . . . 27--37
Yi-Chieh C. Chang and
Kang G. Shin Optimal Load Sharing in Distributed
Real-Time Systems . . . . . . . . . . . 38--50
Marco Ferretti The Generalized Hough Transform on
Mesh-Connected Computers . . . . . . . . 51--57
David Nassimi and
Yuh-Dong D. Tsai An Efficient Implementation of Batcher's
Odd-Even Merge on a SIMD Hypercube . . . 58--63
Nian-Feng F. Tzeng A Reliable Cube-Connected Cycles
Structure . . . . . . . . . . . . . . . 64--71
Ajay K. Gupta and
Susanne E. Hambrusch Multiple Network Embeddings into
Hypercubes . . . . . . . . . . . . . . . 73--82
Theodore Brown and
Renbing B. Xiong A Parallel Quicksort Algorithm . . . . . 83--89
C. H. Huang and
P. Sadayappan Communication-Free Hyperplane
Partitioning of Nested Loops . . . . . . 90--102
D. H. Gill and
T. J. Smith and
T. E. Gerasch and
J. V. Warren and
C. L. McCreary and
R. E. K. Stirewalt Spatial-Temporal Analysis of Program
Dependence Graphs for Useful Parallelism 103--118
Adair Dingle and
I. Hal Sudborough Simulation of Binary Trees and X-Trees
on Pyramid Networks . . . . . . . . . . 119--124
Sang Bang Choi and
Arun K. Somani Rearrangeable Circuit-Switched Hypercube
Architectures for Routing Permutations 125--130
Sanjay Ranka and
Jhy-Chun C. Wang and
Nangkang Yeh Embedding Meshes on the Star Graph . . . 131--135
Yen-Chun C. Lin Perfectly Overlapped Generation of Long
Runs for Sorting Large Files . . . . . . 136--142
Dharma P. Agrawal and
Lalit M. Patnaik Special Issue on Performance of
Supercomputers: Guest Editors'
Introduction . . . . . . . . . . . . . . 143--147
Stiram Vajapeyam and
Wei-Chung C. Hsu Toward Effective Scalar Hardware for
Highly Vectorizable Applications . . . . 147--162
Qing Yang Performance of Cache Memories for Vector
Computers . . . . . . . . . . . . . . . 163--178
Ashwini K. Nanda and
Laxmi N. Bhuyan Efficient Mapping of Applications on
Cache Based Multiprocessors . . . . . . 179--191
Ravi Ponnusamy and
Rajeev Thakur and
Alok Choudhary and
Kishore Velamakanni and
Zeki Bozkus and
Geoffrey Fox Experimental Performance Evaluation of
the CM-5 . . . . . . . . . . . . . . . . 192--202
Richard M. Wolski and
John T. Feo Program Partitioning for NUMA
Multiprocessor Computer Systems . . . . 203--218
Gene Saghi and
Howard Jay Siegel and
Jeffrey L. Gray Predicting Performance and Selecting
Modes of Parallelism: A Case Study Using
Cyclic Reduction on Three Parallel
Machines . . . . . . . . . . . . . . . . 219--233
Anshul Gupta and
Vipin Kumar Performance Properties of Large Scale
Parallel Systems . . . . . . . . . . . . 234--244
Mengjou Lin and
Rose P. Tsang and
David H. C. Du and
Alan E. Klietz and
Stephen Saroff Performance characteristics of the
Connection Machine hypertree network . . 245--254
Lubomir Bic and
Mayez Al-Mouhamed The EM-4 under Implicit Parallelism . . 255--261
John K. Antonio and
Richard C. Metzger Hypersphere Mapper: A Nonlinear
Programming Approach to the Hypercube
Embedding Problem . . . . . . . . . . . 262--270
Wayne G. Nation and
Anthony A. Maciejewski and
Howard Jay Siegel A Methodology for Exploiting Concurrency
among Independent Tasks in Partitionable
Parallel Processing Systems . . . . . . 271--278
Serge M. Manning and
David G. Meyer Analysis of Asynchronous Execution
Streams with I-Caching in Massively
Parallel Systems . . . . . . . . . . . . 279--291
G. R. Gao An Efficient Hybrid Dataflow
Architecture Model . . . . . . . . . . . 293--307
Shlomit Weiss and
Ilan Y. Spillinger and
Gabriel M. Silberman Architectural Improvements for a
Data-Driven VLSI Processing Array . . . 308--322
W. B. Ligon, III and
U. Ramachandran An Empirical Methodology for Exploring
Reconfigurable Architectures . . . . . . 323--337
Cecile Germain and
Jean-Luc L. Bechennec and
Daniel Etiemble and
Jean-Paul P. Sansonnet A Communication Architecture for a
Massively Parallel Message-Passing
Multicomputer . . . . . . . . . . . . . 338--348
Hyeong-Ah A. Choi and
B. Narahari Efficient Algorithms for Mapping and
Partitioning a Class of Parallel
Computations . . . . . . . . . . . . . . 349--363
Yi-Bing B. Lin On Terminating a Distributed Discrete
Event Simulation . . . . . . . . . . . . 364--371
A. Kavianpour A New Measure in System-Level Diagnosis
of Hypercubes . . . . . . . . . . . . . 372--378
Anonymous Author Index for Volume 19 . . . . . . . 379--379
Mikhail J. Atallah and
Frank Dehne and
Russ Miller and
Andrew Rau-Chaplin and
Jyh-Jong Tsay Multisearch Techniques: Parallel Data
Structures on Mesh-Connected Computers 1--13
C. S. Raghavendra and
M. A. Sridhar Routing Permutations on Hypercube
Machines with Half-Duplex Links . . . . 14--19
Louiqa Raschid and
Timos Sellis and
Alexios Delis A Simulation-Based Study on the
Concurrent Execution of Rules in a
Database Environment . . . . . . . . . . 20--42
Eliezer Dekel and
Jie Hu A Parallel Algorithm for Finding Minimum
Cutsets in Reducible Graphs . . . . . . 43--55
Susanne Hambrusch and
Xin He and
Russ Miller Parallel Algorithms for Gray-Scale
Digitized Picture Component Labeling on
a Mesh-Connected Computer . . . . . . . 56--68
Jing-Fu F. Jenq and
Sartaj Sahni Reconfigurable Mesh Algorithms for the
Hough Transform . . . . . . . . . . . . 69--77
Akok Choudhary and
Rajeev Thakur Connected component labeling on coarse
grain parallel computers: an
experimental study . . . . . . . . . . . 78--83
Selim G. Akl and
Henk Meijer and
Ivan Stojmenovi\vc An Optimal Systolic Algorithm for
Generating Permutations in Lexicographic
Order . . . . . . . . . . . . . . . . . 84--91
Angelo Monfroglio Neural Logic Constraint Solving . . . . 92--98
Wei-Kuo K. Chiang and
Rong-Jaye J. Chen Distributed Fault-Tolerant Routing in
Kautz Networks . . . . . . . . . . . . . 99--106
Dan C. Marinescu and
John R. Rice On High Level Characterization of
Parallelism . . . . . . . . . . . . . . 107--113
Ching-Tien T. Ho and
M. T. Raghunath and
S. Lennart Johnsson An efficient algorithm for
Gray-to-binary permutation on hypercubes 114--120
Allan Gottlieb and
Kai Hwang and
Sartaj Sahni Editorial Message . . . . . . . . . . . v--vii
Hussein M. Alnuweiri and
Viktor K. Prasanna Efficient Parallel Computations on the
Reduced Mesh of Trees Organization . . . 121--135
Gyungho G. Lee and
Clyde P. Kruskal and
David J. Kuck On the Effectiveness of Combining in
Resolving `Hot Spot' Contention . . . . 136--144
Michael A. Palis and
Sanguthevar Rajasekaran and
David S. L. Wei Packet Routing and PRAM Emulation on
Star Graphs and Leveled Networks . . . . 145--157
S. A. Mabbs and
K. E. Forward Performance Analysis of MR-1, a
Clustered Shared-Memory Multiprocessor 158--175
Patrick Weemeeuw and
Bart Demoen A Fine-Grained Parallel Memory
Compaction Algorithm . . . . . . . . . . 176--186
Joseph Y.-T. T. Leung and
Sunil M. Shende On Multidimensional Packet Routing for
Meshes with Buses . . . . . . . . . . . 187--197
Xiaoshu S. Qian and
Qing Yang An Analytical Model for Load Balancing
on Symmetrical Multiprocessor Systems 198--211
Sampath Rangarajan and
Donald Fussell and
Miroslav Malek Pipelined Diagnosis of Wafer-Scale
Linear Arrays . . . . . . . . . . . . . 212--223
Giulio Iannello and
Nicola Mazzocca Communication Workload Analysis for
Symmetrical Concurrent Systems . . . . . 224--235
Nobuo Funabiki and
Yoshiyasu Takefuji A Parallel Algorithm for Traffic Control
Problems in Three-Stage Connecting
Networks . . . . . . . . . . . . . . . . 236--240
A. S. Wagner Embedding the Complete Tree in the
Hypercube . . . . . . . . . . . . . . . 241--247
Weixiong X. Zhang and
Richard E. Korf Parallel Heap Operations on an EREW PRAM 248--255
A. Kavianpour and
S. Shoari and
N. Bagherzadeh A New Approach for Circle Detection on
Multiprocessors . . . . . . . . . . . . 256--260
S. Lennart Johnsson and
Ching-Tien T. Ho Binary Cube Emulation of Butterfly
Networks Encoded by Gray Code . . . . . 261--279
Zhaojun J. Bai A Parallel Algorithm for Computing the
Generalized Singular Value Decomposition 280--288
David Nassimi Nearly Logarithmic-Time Parallel
Algorithms for the Class of $\pm2^b$
ASCEND Computations on a SIMD Hypercube 289--302
Oscar H. Ibarra and
Myung Hee Kim Fast Parallel Algorithms for Solving
Triangular Systems of Linear Equations
on the Hypercube . . . . . . . . . . . . 303--316
Ishfaq Ahmad and
Arif Ghafoor and
Geoffrey C. Fox Hierarchical Scheduling of Dynamic
Parallel Computations on Hypercube
Multicomputers . . . . . . . . . . . . . 317--329
Xiaohua H. Jia and
Kentaro Shimizu and
Mamoru Maekawa A Parallel and Nonblocking Updating
Mechanism for Replicated Directory Files
in Distributed Systems . . . . . . . . . 330--340
Martin C. Herbordt and
James C. Corbett and
Charles C. Weems and
John Spalding Practical Algorithms for Online Routing
on Fixed and Reconfigurable Meshes . . . 341--356
Graham Carey and
Joe Schmidt and
Vineet Singh and
Dennis Yelton A Prototype Scalable, Object-Oriented
Finite Element Solver on Multicomputers 357--379
P. J. Zwietering and
E. H. L. Aarts and
J. Wessels The Minimal Number of Layers of a
Perceptron That Sorts . . . . . . . . . 380--387
Shietung T. Peng and
Win-Tsung T. Lo A Simple Optimal Parallel Algorithm for
a Core of a Tree . . . . . . . . . . . . 388--392
Anonymous Author Index for Volume 20 . . . . . . . 393--393
Joseph JáJá and
Pearl Y. Wang Special Issue on Data Parallel
Algorithms and Programming: Guest
Editors' Introduction . . . . . . . . . 1--3
Guy E. Blelloch and
Jonathan C. Hardwick and
Jay Sipelstein and
Marco Zagha and
Siddhartha Chatterjee Implementation of a Portable Nested
Data-Parallel Language . . . . . . . . . 4--14
Zeki Bozkus and
Alok Choudhary and
Geoffrey Fox and
Tomasz Haupt and
Sanjay Ranka and
Min-You Wu Compiling Fortran 90D/HPF for
distributed memory MIMD computers . . . 15--26
Seema Hiranandani and
Ken Kennedy and
Chau-Wen W. Tseng Evaluating Compiler Optimizations for
Fortran D . . . . . . . . . . . . . . . 27--45
Rhys S. Francis and
Ian D. Mathieson and
Paul G. Whiting and
Martin R. Dix and
Harvey L. Davies and
Leon D. Rotstayn A Data Parallel Scientific Modeling
Language . . . . . . . . . . . . . . . . 46--60
Balaram Sinharoy and
Boleslaw K. Szymanski Data and Task Alignment in Distributed
Memory Architectures . . . . . . . . . . 61--74
Nikos Chrisochoides and
Elias Houstis and
John Rice Mapping Algorithms and Software
Environment for Data Parallel PDE
Iterative Solvers . . . . . . . . . . . 75--95
Cho-Li Wang and
Viktor K. Prasanna and
Hyoung J. Kim and
Ashfaq A. Khokhar Scalable Data Parallel Implementations
of Object Recognition Using Geometric
Hashing . . . . . . . . . . . . . . . . 96--109
Lawrence A. Crowl and
Mark E. Crovella and
Thomas J. LeBlanc and
Michael L. Scott The advantages of multiple
parallelizations in combinatorial search 110--123
Mu-Cheng Wang and
Wayne G. Nation and
James B. Armstrong and
Howard Jay Siegel and
Shin Dug Kim and
Mark A. Nichols and
Michael Gherrity Multiple Quadratic Forms: A Case Study
in the Design of Data-Parallel
Algorithms . . . . . . . . . . . . . . . 124--139
J. G. Sela and
P. B. Anderson and
D. W. Norton and
M. A. Young Massive Parallelization of NMC's
Spectral Model . . . . . . . . . . . . . 140--149
James M. Stichnoth and
David O'Hallaron and
Thomas R. Gross Generating Communication for Array
Statements: Design, Implementation, and
Evaluation . . . . . . . . . . . . . . . 150--159
Nawal Copty and
Sanjay Ranka and
Geoffrey Fox and
Ravi V. Shankar A Data Parallel Algorithm for Solving
the Region Growing Problem on the
Connection Machine . . . . . . . . . . . 160--168
Giovanni Manzini Sparse Matrix Computations on the
Hypercube and Related Networks . . . . . 169--183
Suresh Singh and
James F. Kurose Electing ``Good'' Leaders . . . . . . . 184--201
E. Barragy and
G. F. Carey and
R. Van de Geijn Performance and Scalability of Finite
Element Analysis for Distributed
Parallel Computation . . . . . . . . . . 202--212
Zvi Galil and
Kunsoo Park Parallel Algorithms for Dynamic
Programming Recurrences with More Than
$O(1)$ Dependency . . . . . . . . . . . 213--222
Santoshkumar S. Pande and
Dharma P. Agrawal and
Jon Mauney A Threshold Scheduling Strategy for
Sisal on Distributed Memory Machines . . 223--236
Tony T. Lee Generalized Recursive Sorting Networks 237--245
L. Boguslavsky and
K. Harzallah and
A. Kreinen and
K. Sevcik and
A. Vainshtein Optimal Strategies for Spinning and
Blocking . . . . . . . . . . . . . . . . 246--254
Andrew S. Grimshaw and
Jon B. Weissman and
Emily A. West and
Ed C. Loyot, Jr. Metasystems: an approach combining
parallel processing and heterogeneous
distributed computing systems . . . . . 257--270
D. W. Watson and
H. J. Siegel and
J. K. Antonio and
M. A. Nichols and
M. J. Atallah A Block-Based Mode Selection Model for
SIMD/SPMD Parallel Environments . . . . 271--288
C. J. Callsen and
G. Agha Open Heterogeneous Computing in
ActorSpace . . . . . . . . . . . . . . . 289--300
P. T. Homer and
R. D. Schlichting A Software Platform for Constructing
Scientific Applications from
Heterogeneous Resources . . . . . . . . 301--315
V. Donaldson and
F. Berman and
R. Paturi Program Speedup in a Heterogeneous
Computing Network . . . . . . . . . . . 316--322
W. B. Ligon, III and
U. Ramachandran Evaluating Multigauge Architectures for
Computer Vision . . . . . . . . . . . . 323--333
Anonymous Author Index for Volume 21 . . . . . . . 334--334
M. Uemit Uyar and
A. P. Reeves Fault Reconfiguration for the Near
Neighbor Task in a Multistage-Network
MIMD System . . . . . . . . . . . . . . 1--15
Q. Ke and
S. G. Akl and
H. Meijer On Some Properties and Algorithms for
the Star and Pancake Interconnection
Networks . . . . . . . . . . . . . . . . 16--25
R. Lin and
S. Olariu An Optimal Parallel Matching Algorithm
for Cographs . . . . . . . . . . . . . . 26--36
F. Makedon and
A. Symvonis Optimal Algorithms for Multipacket
Routing Problems on Rings . . . . . . . 37--43
A. D. Kshemkalyani and
M. Singhal On Characterization and Correctness of
Distributed Deadlock Detection . . . . . 44--59
V. Kumar and
A. Y. Grama and
Nageshwara Rao Vempaty Scalable Load Balancing Techniques for
Parallel Computers . . . . . . . . . . . 60--79
S. Bhattacharya and
G. Elsesser and
W.-T. Tsai and
D.-Z. Du Multicasting in Generalized Multistage
Interconnection Networks . . . . . . . . 80--95
Pei-Ji J. Yang and
Sing-Ban B. Tien and
C. S. Raghavendra Reconfiguration of Rings and Meshes in
Faulty Hypercubes . . . . . . . . . . . 96--106
E. Eberbach CSA: In the Direction of Greater
Representational Power for
Neurocomputing . . . . . . . . . . . . . 107--112
D. Bhagavathi and
S. Olariu and
W. Shen and
L. Wilson A Time-Optimal Multiple Search Algorithm
on Enhanced Meshes, with Applications 113--120
M. A. Bauer and
S. T. Feeney and
I. Gargantini Parallel 3-D Filling with Octrees . . . 121--128
J. A. Ellis and
M. Mata-Montero and
H. Müller Serial and Parallel Algorithms for
$(k,2)$-Partite Graphs . . . . . . . . . 129--137
C. Walinsky and
D. Banerjee A Data-Parallel FP Compiler . . . . . . 138--153
S. Chalasani and
C. S. Raghavendra and
A. Varma Fault-Tolerant Routing in MIN-Based
Supercomputers . . . . . . . . . . . . . 154--167
M. P. Evett and
J. A. Hendler and
L. Spector Parallel knowledge representation on the
Connection Machine . . . . . . . . . . . 168--184
Joaquim Gabarró and
Ricard Gavald\`a An Approach to Correctness of Data
Parallel Algorithms . . . . . . . . . . 185--201
S. Anik and
W. M. W. Hwu Performance Implications of
Synchronization Support for Parallel
Fortran Programs . . . . . . . . . . . . 202--215
J. Misic and
Z. Jovanovic Routing Function and Deadlock Avoidance
in a Star Graph Interconnection Network 216--228
A. A. Bertossi and
F. Logi Parallel String Matching with Variable
Length Don't Cares . . . . . . . . . . . 229--234
A. Beguelin and
G. Nutt Visual Parallel Programming and
Determinacy: A Language Specification,
an Analysis Technique, and a Programming
Tool . . . . . . . . . . . . . . . . . . 235--250
A. V. Gerbessiotis and
L. G. Valiant Direct Bulk-Synchronous Parallel
Algorithms . . . . . . . . . . . . . . . 251--267
Chunming M. Qiao and
R. Melhem and
D. Chiarulli and
S. Levitan Dynamic Reconfiguration of Optically
Interconnected Networks with
Time-Division Multiplexing . . . . . . . 268--278
Ge-Ming M. Chiu and
S. Chalasani and
C. S. Raghavendra Flexible Routing Criteria for
Circuit-Switched Hypercubes . . . . . . 279--294
Jie Wu An Optimal Fault-Tolerant Nonredundant
Broadcasting Scheme in Injured
Hypercubes . . . . . . . . . . . . . . . 295--313
M. Moonen and
J. Vandewalle A Jacobi-Type Systolic Algorithm for
Riccati and Lyapunov Equations . . . . . 314--320
B. Goertzel Lagrange Interpolation on a Processor
Tree with Ring Connections . . . . . . . 321--323
R. A. Van de Geijn On Global Combine Operations . . . . . . 324--328
L. Higham and
E. Schenk Maintaining B-Trees on an EREW PRAM . . 329--335
J.-C. Bajard and
J. Duprat and
S. Kla and
J.-M. Muller Some Operators for On-Line Radix-$2$
Computations . . . . . . . . . . . . . . 336--345
M. Gusev and
D. J. Evans A New Matrix Vector Product Systolic
Array . . . . . . . . . . . . . . . . . 346--349
G. Huang and
W. Ongsakul An Efficient Load-Balancing Processor
Scheduling Algorithm for Parallelization
of Gauss-Seidel Type Algorithms . . . . 350--358
A. Yavuz Oruc A Study of Permutation Networks: New
Designs and Some Generalizations . . . . 359--366
T. Johnson A Highly Concurrent Priority Queue . . . 367--373
V. P. Kumar and
A. Gupta Analyzing Scalability of Parallel
Algorithms and Architectures . . . . . . 379--391
Xiaodong D. Zhang and
Yong Yan and
Keqiang Q. He Latency Metric: An Experimental Method
for Measuring and Evaluating Parallel
Program and Architecture Scalability . . 392--410
A. Sivasubramaniam and
A. Singla and
U. Ramachandran and
H. Venkateswaran A Simulation-Based Scalability Study of
Parallel Systems . . . . . . . . . . . . 411--426
R. H. Saavedra and
Weihua H. Mao and
Kai Hwang Performance and Optimization of Data
Prefetching Strategies in Scalable
Multiprocessors . . . . . . . . . . . . 427--448
Hong Xu and
E. T. Kalns and
P. K. McKinley and
L. M. Ni ComPaSS: A Communication Package for
Scalable Software Design . . . . . . . . 449--461
R. Das and
M. Uysal and
J. Saltz and
Yuan-Shin S. Hwang Communication Optimizations for
Irregular Scientific Computations on
Distributed Memory Architectures . . . . 462--478
R. Panwar and
G. Agha A Methodology for Programming Scalable
Architectures . . . . . . . . . . . . . 479--487
S. Dutt and
N. R. Mahapatra Scalable load balancing strategies for
parallel A* algorithms . . . . . . . . . 488--505
H. M. Dewan and
S. J. Stolfo and
L. Woodbury Scalable Parallel and Distributed Expert
Database Systems with Predictive Load
Balancing . . . . . . . . . . . . . . . 506--522
J. J. Dongarra and
R. A. Van de Geijn and
D. W. Walker Scalability Issues Affecting the Design
of a Dense Linear Algebra Library . . . 523--537
D. C. Marinescu and
J. R. Rice On the Scalability of Asynchronous
Parallel Computations . . . . . . . . . 538--546
S. Krishnamoorthy and
A. Choudhary A Scalable Distributed Shared Memory
Architecture . . . . . . . . . . . . . . 547--554
Chienhua H. Chen and
D. P. Agrawal and
J. R. Burke Design and Analysis of a Class of Highly
Scalable Hierarchical Networks: PdBCube 555--564
Ruijin J. Qi and
S. A. Zenios On the Scalability of Data-Parallel
Decomposition Algorithms for Stochastic
Programs . . . . . . . . . . . . . . . . 565--570
Anonymous Author Index for Volume 22 . . . . . . . 571--571
I. M. Demeure and
G. J. Nutt Prototyping and Simulating Parallel,
Distributed Computations . . . . . . . . 1--9
C. Martel and
A. Raghunathan Asynchronous PRAMS with Memory Latency 10--26
M. El-Sharkawy and
Wenlong Tsang and
M. Aburdene Short data parallel vector Slant
transform . . . . . . . . . . . . . . . 27--36
M. Nigam and
S. Sahni Sorting $n$ Numbers on $n \times n$
Reconfigurable Meshes with Buses . . . . 37--48
P. Scheuermann and
A. Yaagoub and
M. Aris Ouksel Compression of Binary Images on a
Hypercube Machine . . . . . . . . . . . 49--59
P. K. Mckinley Multicast Communication in Staircase
Multichannel Networks . . . . . . . . . 60--71
F. Annexstein Embedding Hypercubes and Related
Networks into Mesh-Connected Processor
Arrays . . . . . . . . . . . . . . . . . 72--79
Y. R. Lan Adaptive Fault-Tolerant Multicast in
Hypercube Multicomputers . . . . . . . . 80--93
R. Satyanarayanan and
C. R. Muthukrishnan Multiple Instance Resource Allocation in
Distributed Computing Systems . . . . . 94--100
M. D. Atkinson and
J. R. Sack Uniform Generation of Binary Trees in
Parallel . . . . . . . . . . . . . . . . 101--103
M. C. Heydemann and
J. Opatrny and
D. Sotteau Embeddings of Hypercubes and Grids into
de Bruijn Graphs . . . . . . . . . . . . 104--111
L. Lundberg Performance Bounds on Multiprocessor
Scheduling Strategies for Chain
Structured Programs . . . . . . . . . . 112--118
D. M. Nicol Rectilinear Partitioning of Irregular
Data Parallel Computations . . . . . . . 119--134
J. Gil and
Y. Matias Fast and Efficient Simulations among
CRCW PRAMs . . . . . . . . . . . . . . . 135--148
J. Gil Renaming and Dispersing: Techniques for
Fast Load Balancing . . . . . . . . . . 149--157
K. P. Birman Integrating Runtime Consistency Models
for Distributed Computing . . . . . . . 158--176
E. A. Varvarigos and
D. P. Bertsekas Partial Multinode Broadcast and Partial
Exchange Algorithms for $d$-Dimensional
Meshes . . . . . . . . . . . . . . . . . 177--189
M. M. Eshaghian and
S. H. Lee and
M. E. Shaaban Optical Techniques for Parallel Image
Computing . . . . . . . . . . . . . . . 190--201
J. T. Draper and
J. Ghosh A Comprehensive Analytical Model for
Wormhole Routing in Multicomputer
Systems . . . . . . . . . . . . . . . . 202--214
Yu-Chee C. Tseng and
Ten-Hwang H. Lai and
Li-Fen F. Wu Matrix Representation of Graph Embedding
in a Hypercube . . . . . . . . . . . . . 215--223
G. W. Sabot Optimizing CM Fortran compiler for
Connection Machine computers . . . . . . 224--238
Nam-Sung S. Woo and
B. Naylor Optimal Routing Algorithms for a Class
of Cylindrical Banyan Multicomputers . . 239--245
T. F. Znati and
R. G. Melhem A Uniform Framework for Dynamic Load
Balancing Strategies in Distributed
Processing Systems . . . . . . . . . . . 246--255
F. Dehne and
A. Fabri and
M. Nassar and
A. Rau-Chaplin and
R. Valiveti Construction of $d$-Dimensional
Hyperoctrees on a Hypercube
Multiprocessor . . . . . . . . . . . . . 256--261
Anonymous Editorial Message . . . . . . . . . . . 263--263
A. A. Bertossi and
M. A. Bonuccelli and
M. Roccetti Reconfigurable Tree Architectures for
Gracefully Degradable VLSI Systems . . . 264--277
J. M. Adamo and
L. Trejo Programming Environment for
Phase-Reconfigurable Parallel
Programming on SuperNode . . . . . . . . 278--292
D. Ghose and
V. Mani Distributed Computation with
Communication Delays: Asymptotic
Performance Analysis . . . . . . . . . . 293--305
Yi-Min M. Wang and
Pi-Yu Y. Chung and
W. Kent Fuchs Scheduling for Periodic Concurrent Error
Detection in Processor Arrays . . . . . 306--313
Zicheng C. Guo Optically Interconnected Processor
Arrays with Switching Capability . . . . 314--329
P. K. Dubey and
M. J. Flynn A Bubble Propagation Model for Pipeline
Performance . . . . . . . . . . . . . . 330--337
D. E. Nieman Issues in the Design and Control of
Parallel Rule-Firing Production Systems 338--363
Jie Li and
H. Kameda Optimal Static Load Balancing in Star
Network Configurations with Two-Way
Traffic . . . . . . . . . . . . . . . . 364--375
R. K. Squier and
K. Steiglitz A comparison of two application-specific
architectures for $2$-d mesh
computations . . . . . . . . . . . . . . 376--381
Hongjun J. Lu and
Kian-Lee L. Tan Load-Balanced Join Processing in
Shared-Nothing Systems . . . . . . . . . 382--398
S. Venkatesan and
K. V. S. Ramarao Computing Associative Functions
Distributively in Spite of Link Failures 399--410
J. Bruno and
P. Cappello Implementing the $3$D Alternating
Direction Method on the Hypercube . . . 411--417
A. C. Liang and
S. Bhattacharya and
Wei-Tek T. Tsai Fault-Tolerant Multicasting on
Hypercubes . . . . . . . . . . . . . . . 418--428
L. Kaufman A Parallel QR Algorithm for the
Symmetric Tridiagonal Eigenvalue Problem 429--434
H. E. Conn and
L. J. Podrazik Parallel Recurrence Solvers for Vector
and SIMD Supercomputers . . . . . . . . 435--441
N. Deo and
A. Jain and
M. Medidi Parallel Construction of $(a,b)$-Trees 442--448
Ye-In I. Chang Comments on ``Two Algorithms for Mutual
Exclusion in Real-Time Distributed
Computer Systems'' . . . . . . . . . . . 449--454
Hongchi C. Shi and
G. X. Ritter A Fast Algorithm for Image Component
Labeling with Local Operators on Mesh
Connected Computers . . . . . . . . . . 455--461
Y. J. Han and
Y. Igarashi and
K. Kanai and
K. Miura Broadcasting in Faulty Binary Jumping
Networks . . . . . . . . . . . . . . . . 462--467
Dyi-Rong R. Duh and
Gen-Huey H. Chen Topological Properties of WK-Recursive
Networks . . . . . . . . . . . . . . . . 468--474
S. G. Ziavras and
P. Meer Adaptive Multiresolution Structures for
Image Processing on Parallel Computers 475--483
Anonymous Author Index for Volume 23 . . . . . . . 484--484
Anonymous Editorial Message . . . . . . . . . . . 1--1
J. C. Bermond and
F. Comellas and
D. F. Hsu Distributed Loop Computer Networks: A
Survey . . . . . . . . . . . . . . . . . 2--10
Jaeyoung Y. Choi and
A. W. Bojanczyk Recursive Least-Squares Problems on
Distributed-Memory Multiprocessors . . . 11--26
J. M. Conrad and
D. P. Agrawal Asynchronous Parallel Arc Consistency
Algorithms on a Distributed Memory
Machine . . . . . . . . . . . . . . . . 27--40
H. El-Rewini and
H. H. Ali Static Scheduling of Conditional
Branches in Parallel Programs . . . . . 41--54
P. Fragopoulou and
S. G. Akl Optimal Communication Algorithms on Star
Graphs Using Spanning Tree Constructions 55--71
Cheng-Zhong Z. Xu and
F. C. M. Lau The Generalized Dimension Exchange
Method for Load Balancing in
$\kappa$-ary $n$-Cubes and Variants . . 72--85
Kai-Yeung Y. Siu and
V. Roychowdhury and
T. Kailath Toward Massively Parallel Design of
Multipliers . . . . . . . . . . . . . . 86--93
O. H. Ibarra and
Qi Zheng An Optimal Shortest Path Parallel
Algorithm for Permutation Graphs . . . . 94--99
Xiaojun J. Shen and
Qing Hu and
Weifa F. Liang Embedding $K$-ary Complete Trees into
Hypercubes . . . . . . . . . . . . . . . 100--106
Suchendra M. Bhandarkar and
Hamid R. Arabnia The Hough Transform on a Reconfigurable
Multi-Ring Network . . . . . . . . . . . 107--114
M. Sultan Alam and
R. G. Melhem Channel Multiplexing in Fault-Tolerant
Modular Multiprocessors . . . . . . . . 115--131
Woei-Kae K. Chen and
M. F. M. Stallmann On Embedding Binary Trees into
Hypercubes . . . . . . . . . . . . . . . 132--138
J. Torrellas and
A. Tucker and
A. Gupta Evaluating the Performance of
Cache-Affinity Scheduling in
Shared-Memory Multiprocessors . . . . . 139--151
C. C. Williams and
P. F. Reynolds, Jr. Combining Atomic Actions . . . . . . . . 152--163
D. Agrawal and
A. El Abbadi A Token-Based Fault-Tolerant Distributed
Mutual Exclusion Algorithm . . . . . . . 164--176
H. Nakanishi and
V. Rego and
V. Sunderam On the Effectiveness of Superconcurrent
Computations on Heterogeneous Networks 177--190
M. Barnett and
R. Littlefield and
D. G. Payne and
R. Van de Geijn Global Combine Algorithms for 2-D Meshes
with Wormhole Routing . . . . . . . . . 191--201
Béchir el Ayeb and
Shengrui Wang Abduction-Based Diagnosis: A
Competition-Based Neural Model
Simulating Abductive Reasoning . . . . . 202--212
M. A. Sridhar and
C. S. Raghavendra Computing Large Subcubes in Residual
Hypercubes . . . . . . . . . . . . . . . 213--217
K. Nakano Optimal Initializing Algorithms for a
Reconfigurable Mesh . . . . . . . . . . 218--223
Fuhua Cheng and
G. W. Wasilkowski and
Jiaye Wang and
Caiming Zhang and
Wenping Wang Parallel B-Spline Surface Interpolation
on a Mesh-Connected Processor Array . . 224--229
Anonymous Author Index for Volume 24 . . . . . . . 230--230
Dana Richards and
Arthur L. Liestman Degree-Constrained Pyramid Spanners . . 1--6
Yu-Chee Tseng Detecting Termination by Weight-Throwing
in a Faulty Distributed System . . . . . 7--15
Michael A. Driscoll and
W. Robert Daasch Accurate Predictions of Parallel Program
Execution Time . . . . . . . . . . . . . 16--30
Ju-Wook Jang and
Viktor K. Prasanna An Optimal Sorting Algorithm on
Reconfigurable Mesh . . . . . . . . . . 31--41
Kien A. Hua and
Yu-lung L. Lo and
Honesty C. Young Optimizer-Assisted Load Balancing
Techniques for Multicomputer Database
Management Systems . . . . . . . . . . . 42--57
Sanjay Ranka and
Jhy-Chun C. Wang and
Manoj Kumar Irregular Personalized Communication on
Distributed Memory Machines . . . . . . 58--71
Xin Li and
Kien A. Hua and
J. Michael Moshell Distributed Database Designs and
Computation Strategies for Networked
Interactive Simulations . . . . . . . . 72--90
Guy E. Blelloch and
Siddhartha Chatterjee and
Marco Zagha Solving Linear Recurrences with Loop
Raking . . . . . . . . . . . . . . . . . 91--97
Jehoshua Bruck and
Robert Cypher and
Ching-Tien T. Ho On the Construction of Fault-Tolerant
Cube-Connected Cycles Networks . . . . . 98--106
David E. Van den Bout and
Thomas K. Miller, III TInMANN: the integer Markovian
artificial neural network for performing
competitive and Kohonen learning . . . . 107--114
Dino Karabeg Process Partitioning through Graph
Compaction . . . . . . . . . . . . . . . 115--125
Matthew T. O'Keefe and
Henry G. Dietz Static Barrier MIMD: Architecture and
Performance Analysis . . . . . . . . . . 126--132
Matthew Evett and
James Hendler and
Ambuj Mahanti and
Dana Nau PRA*: Massively Parallel Heuristic
Search . . . . . . . . . . . . . . . . . 133--143
Patrick W. Dowd and
I-Shyan S. Hwang Memory and Network Architecture
Interaction in an Optically
Interconnected Distributed Shared Memory
System . . . . . . . . . . . . . . . . . 144--161
Zhiyong Y. Liu and
Xiaobo B. Li XOR Storage Schemes for Frequently Used
Data Patterns . . . . . . . . . . . . . 162--173
Andrew A. Chien Concurrent Aggregates (CA): design and
experience with a concurrent
object-oriented language based on
aggregates . . . . . . . . . . . . . . . 174--196
Craig M. Wittenbrink and
Arun K. Somani $2$D and $3$D Optimal Parallel Image
Warping . . . . . . . . . . . . . . . . 197--208
Marcelo Moraes de Azevedo and
Nader Bagherzadeh and
Shahram Latifi Broadcasting Algorithms for the
Star-Connected Cycles Interconnection
Network . . . . . . . . . . . . . . . . 209--222
Anonymous Author Index for Volume 25 . . . . . . . 223--223
Ted Szymanski ``Hypermeshes'': Optical Interconnection
Networks for Parallel Computing . . . . 1--23
Ian T. Foster and
K. Mani Chandy FORTRAN M: A Language for Modular
Parallel Programming . . . . . . . . . . 24--35
Sabine Ohring and
Sajal K. Das Incomplete Hypercubes: Embeddings of
Tree-Related Networks . . . . . . . . . 36--47
Sanjeev Khanna and
W. Kent Fuchs A Linear Time Algorithm for Sequential
Diagnosis in Hypercubes . . . . . . . . 48--53
Sumit Sur and
Pradip K. Srimani An Almost Regular Fault Tolerant Network
with Arbitrary Number of Nodes . . . . . 54--60
S. White and
A. Alund and
V. S. Sunderam Performance of the NAS Parallel
Benchmarks on PVM-Based Networks . . . . 61--71
Siddhartha Chatterjee and
John R. Gilbert and
Fred J. E. Long and
Robert Schreiber and
Shang-Hua H. Teng Generating Local Addresses and
Communication Sets for Data-Parallel
Programs . . . . . . . . . . . . . . . . 72--84
Raghu Karinthi and
Kankanahalli Srinivas and
George Almasi A Parallel Algorithm for Computing
Polygon Set Operations . . . . . . . . . 85--98
Sanguthevar Rajasekaran and
Suneeta Ramaswami Optimal Mesh Algorithms for the Voronoi
Diagram of Line Segments and Motion
Planning in the Plane . . . . . . . . . 99--115
K. Arvind and
V. Kamakoti and
C. Pandu Rangan Efficient Parallel Algorithms for
Permutation Graphs . . . . . . . . . . . 116--124
Christophe Giraud-Carrier and
Tony Martinez Analysis of the Convergence and
Generalization of AA1 . . . . . . . . . 125--131
David Peleg A Note on Optimal Time Broadcast in
Faulty Hypercubes . . . . . . . . . . . 132--135
G-H Chen and
S. Olariu and
J. L. Schwing and
B-F Wang and
J. Zhang Constant-Time Tree Algorithms on
Reconfigurable Meshes on Size $n \times
n$ . . . . . . . . . . . . . . . . . . . 137--150
Piyush Maheshwari Partitioning and Scheduling of Parallel
Functional Programs for Larger Grain
Execution . . . . . . . . . . . . . . . 151--165
Manhoi Choy and
Ambuj K. Singh Efficient Implementation of Synchronous
Communication over Asynchronous Networks 166--180
Ernst W. Mayr and
Ralph Werchner Optimal Routing of Parentheses on the
Hypercube . . . . . . . . . . . . . . . 181--192
Fredrik Dahlgren and
Per Stenstrom Using Write Caches to Improve
Performance of Cache Coherence Protocols
in Shared-Memory Multiprocessors . . . . 193--210
Ambuj K. Singh A Framework for Programming with
Nonatomic Memories . . . . . . . . . . . 211--224
Alain Billionnet and
Sourour Elloumi An Algorithm for Finding the $K$-Best
Allocations of a Tree Structured Program 225--232
Sourav Bhattacharya and
Thomas F. Keefe and
Wei-Tek T. Tsai Covert Channel Secure Hypercube Message
Communication . . . . . . . . . . . . . 233--247
Andre Seznec and
Jacques Lenfant Odd Memory Systems: A New Approach . . . 248--256
Sanguthevar Rajasekaran and
Mukund Raghavachari A Randomized Algorithm for Multipacket
Routing on the Mesh . . . . . . . . . . 257--260
Rajendra V. Boppana and
C. S. Raghavendra On Methods to Align and Access Data
Arrays in Parallel Computers . . . . . . 261--269
Anonymous Author Index for Volume 26 . . . . . . . 270--270
Manfred J. Pfluegl and
Douglas M. Blough A New and Improved Algorithm for
Fault-Tolerant Clock Synchronization . . 1--14
Bruce Hendrickson and
Steve Plimpton Parallel Many-Body Simulations without
All-to-All Communication . . . . . . . . 15--25
Prasant Mohapatra and
Chansu S. Yu and
Chita R. Das A Lazy Scheduling Scheme for Hypercube
Computers . . . . . . . . . . . . . . . 26--37
Scott B. Baden and
Scott R. Kohn Portable Parallel Programming of
Numerical Problems under the LPAR System 38--55
Loren Schwiebert and
D. N. Jayasimha Optimal Fully Adaptive Minimal Wormhole
Routing for Meshes . . . . . . . . . . . 56--70
Sajal K. Das and
Kwang Bae Min A Unified Approach to the Parallel
Construction of Search Trees . . . . . . 71--78
A. Stewart Reasoning About Data-Parallel Array
Assignment . . . . . . . . . . . . . . . 79--85
V. Bokka and
H. Gurla and
S. Olariu and
J. L. Schwing Constant-Time Convexity Problems on
Reconfigurable Meshes . . . . . . . . . 86--99
Stephan Olariu and
Michael Overstreet and
Zhaofang F. Wen Reconstructing a Binary Tree from Its
Traversals in Doubly Logarithmic CREW
Time . . . . . . . . . . . . . . . . . . 100--105
Mohan S. Kankanhalli and
Wm. Randolph Franklin Area and Perimeter Computation of the
Union of a Set of Iso-rectangles in
Parallel . . . . . . . . . . . . . . . . 107--117
Jaswinder Pal Singh and
Chris Holt and
Takashi Totsuka and
Anoop Gupta and
John Hennessy Load Balancing and Data Locality in
Adaptive Hierarchical $N$-Body Methods:
Barnes-Hut, Fast Multipole, and
Radiosity . . . . . . . . . . . . . . . 118--141
D. Bhagavathi and
S. Olariu and
J. L. Schwing and
W. Shen and
L. Wilson and
J. Zhang Convexity Problems on Meshes with
Multiple Broadcasting . . . . . . . . . 142--156
Venkat Konda and
Anup Kumar A Systematic Framework for the
Dependence Cycle Removal in Practical
Loops . . . . . . . . . . . . . . . . . 157--171
Gianfranco Bilardi and
Franco P. Preparata Horizons of Parallel Computation . . . . 172--182
W. Marcus Miller and
Walid A. Najjar and
A. P. Wim Bohm Exploiting Data Structure Locality in
the Dataflow Model . . . . . . . . . . . 183--200
Roberto Baldoni and
Bruno Ciciani and
Giacomo Cioffi On the Correctness of Goscinski's
Algorithm . . . . . . . . . . . . . . . 201--204
Douglas M. Blough and
Hongying Y. Wang Cooperative Diagnosis and Routing in
Fault-Tolerant Multiprocessor Systems 205--211
Anonymous Author Index for Volume 27 . . . . . . . 213--213
Daniel A. Menasce and
Debanjan Saha and
Stella C. da Silva Porto and
Virgilio A. F. Almeida and
Satish K. Tripathi Static and Dynamic Processor Scheduling
Disciplines in Heterogeneous Parallel
Architectures . . . . . . . . . . . . . 1--18
Xiaola Lin and
Philip K. McKinley and
Abdol-Hossein Esfahanian Adaptive Multicast Wormhole Routing in
$2$D Mesh Multicomputers . . . . . . . . 19--31
Robert R. Seban A Distributed Critical Section Protocol
for General Topology . . . . . . . . . . 32--42
Jae H. Kim and
Andrew A. Chien Network Performance Under Bimodal
Traffic Loads . . . . . . . . . . . . . 43--64
D. B. Skillicorn and
W. Cai A Cost Calculus for Parallel Functional
Programming . . . . . . . . . . . . . . 65--83
Eric Maillet and
Cecile Tron On Efficiently Implementing Global Time
for Performance Evaluation on
Multiprocessor Systems . . . . . . . . . 84--93
To-Yat Y. Cheung and
Xinming M. Ye A Fault-Detection Approach to the
Conformance Testing of Nondeterministic
Systems . . . . . . . . . . . . . . . . 94--100
Kamal Kumar Jain and
V. Rajaraman Improved Lower Bounds on Time and
Processors for Scheduling Precedence
Graphs on Multicomputer Systems . . . . 101--108
C. Rhee and
S. K. Dhall and
S. Lakshmivarahan The Minimum Weight Dominating Set
Problem for Permutation Graphs Is in NC 109--112
Sheng-Tzong T. Cheng and
Ashok K. Agrawala Optimal Replication of Series-Parallel
Graphs for Computation-Intensive
Applications . . . . . . . . . . . . . . 113--129
Yaw-Huei H. Chen and
Stanley Y. W. Su Identification- and Elimination-Based
Parallel Query Processing Techniques for
Object-Oriented Databases . . . . . . . 130--148
Dal-Soo Ryang and
Kyu Ho Park A Two-Level Distributed Detection
Algorithm of AND/OR Deadlocks . . . . . 149--161
Mark J. Clement and
Michael J. Quinn Overlapping Computations, Communications
and I/O in Parallel Sorting . . . . . . 162--172
Ozalp Babaoglu and
Michel Raynal Specification and Verification of
Dynamic Properties in Distributed
Computations . . . . . . . . . . . . . . 173--185
Rajive Bagrodia and
Mani Chandy and
Maneesh Dhagat UC: A Set-Based Language for
Data-Parallel Programming . . . . . . . 186--201
Mark Charney The Role of Network Bandwidth in Barrier
Synchronization . . . . . . . . . . . . 202--212
Anonymous Author Index for Volume 28 . . . . . . . 215--215
Cho-Chin C. Lin and
Viktor K. Prasanna Bounds on the Diameter of
One-Dimensional PEC Networks . . . . . . 1--16
Richard Anderson and
Joao C. Setubal A Parallel Implementation of the
Push-Relabel Algorithm for the Maximum
Flow Problem . . . . . . . . . . . . . . 17--26
Ferng-Ching C. Lin and
Feng-Hsu H. Wang Message Pattern Routing in Hypercubes: A
Distribute- Concentrate Approach . . . . 27--42
Alain Darte and
Yves Robert Affine-by-Statement Scheduling of
Uniform and Affine Loop Nests over
Parametric Domains . . . . . . . . . . . 43--59
David M. Nicol and
Weizhen Z. Mao Automated Parallelization of Timed
Petri-Net Simulations . . . . . . . . . 60--74
Massimo Bernaschi and
Giorgio Richelli Development and results of PVMe on the
IBM 9076 SP1 . . . . . . . . . . . . . . 75--83
Mokhtar A. Aboelaze and
Benjamin W. Wah A Processor Array with Bounded I/O Ports
for Computing Transitive Closures . . . 84--90
Xianzhi Fan and
Nael B. Abu-Ghazaleh and
Philip A. Wilsey On the Complexity of Scheduling MIMD
Operations for SIMD Interpretation . . . 91--95
E. Memin and
F. Heitz and
F. Charot Efficient Parallel Nonlinear Multigrid
Relaxation Algorithms for Low-Level
Vision Applications . . . . . . . . . . 96--103
Anonymous Call for Papers: Special Issue . . . . . 104--104
N. F. Tzeng and
P. C. Yew Special Issue on Distributed Shared
Memory Systems --- Guest Editors'
Introduction . . . . . . . . . . . . . . 105--107
Michel Dubois and
Jonas Skeppstedt and
Per Strenstrom Essential Misses and Data Traffic in
Coherence Protocols . . . . . . . . . . 108--125
Pete Keleher and
Alan L. Cox and
Sandhya Dwarkadas and
Willy Zwaenepoel An Evaluation of Software-Based Release
Consistent Protocols . . . . . . . . . . 126--141
Harjinder S. Sandhu Algorithms for Dynamic Software Cache
Coherence . . . . . . . . . . . . . . . 142--157
Karin Petersen and
Kai Li Multiprocessor Cache Coherence Based on
Virtual Memory Support . . . . . . . . . 158--178
Leonidas I. Kontothanassis and
Michael L. Scott High Performance Software Coherence for
Current and Future Architectures . . . . 179--195
M. F. P. O'Boyle and
L. Kervella and
F. Bodin Synchronization Minimization in a SPMD
Execution Model . . . . . . . . . . . . 196--210
Bob Janssens and
W. Kent Fuchs Ensuring Correct Rollback Recovery in
Distributed Shared Memory Systems . . . 211--218
John B. Carter Design of the Munin distributed shared
memory system . . . . . . . . . . . . . 219--227
Amit Agarwala and
Chita R. Das Experimenting with a Shared Virtual
Memory Environment for Hypercubes . . . 228--235
Anonymous Call for Papers: Special Issues . . . . 236--236
Anonymous Author Index for Volume 29 . . . . . . . 239--239
Yosi Ben-Asher and
Dan Gordon and
Assaf Schuster Efficient Self-Simulation Algorithms for
Reconfigurable Arrays . . . . . . . . . 1--22
Timothy Mark Pinkston and
Uzi Efron and
Michael Campbell Applying Optical Interconnects to the
3-D Computer: A Performance Evaluation 23--37
Ten-Hwang H. Lai and
Ming-Jye J. Sheng Triangulation on Reconfigurable Meshes:
A Natural Decomposition Approach . . . . 38--51
M. Atiquzzaman and
M. S. Akhtar Performance of Buffered Multistage
Interconnection Networks in a Nonuniform
Traffic Environment . . . . . . . . . . 52--63
S. Venkatesan and
K. V. S. Ramarao Making Fault-Sensitive Algorithms
Tolerate Link Failures . . . . . . . . . 64--75
Ilan Newman and
Assaf Schuster Hot Potato Worm Routing via
Store-and-Forward Packet Routing . . . . 76--84
Rajib K. Das and
Bhabani P. Sinha Optimal Communication Algorithms in
Distributed Loop Networks . . . . . . . 85--90
Meenakshi Sundaram Gopi and
Swami Manohar A Parallel Architecture for the
Computation of Uniform Rational B-Spline
Patches . . . . . . . . . . . . . . . . 91--98
J. E. L. Hollis and
T. E. Cronk Multiprocessor Image Rotation . . . . . 99--106
Arif Ghafoor and
C-Y Roger Chen Special Issue on Multimedia Processing
and Technology: Guest Editors'
Introduction . . . . . . . . . . . . . . 107--110
Gregory W. Cook and
Edward J. Delp An investigation of scalable SIMD I/O
techniques with application to parallel
JPEG compression . . . . . . . . . . . . 111--128
Shahriar M. Akramullah and
Ishfaq Ahmad and
Ming L. Liou A Data-Parallel Approach for Real-Time
MPEG-2 Video Encoding . . . . . . . . . 129--146
Jenwei Hsieh and
Mengjou Lin and
Jonathan C. L. Liu and
David H. C. Du and
Thomas M. Ruwart Performance of a Mass Storage System for
Video-on-Demand . . . . . . . . . . . . 147--167
Asit Dan and
Perwez Shahabuddin and
Dinkar Sitaram and
Don Towsley Channel Allocation under Batching and
VCR Control in Video-on-Demand Systems 168--179
H. J. Chen and
T. D. C. Little and
D. Venkatesh A Storage and Retrieval Technique for
Scalable Delivery of MPEG-Encoded Video 180--189
Divyesh Jadav and
Chutimet Srinilta and
Alok Choudhary and
P. Bruce Berra Techniques for Scheduling I/O in a High
Performance Multimedia-on-Demand Server 190--203
Aurel A. Lazar and
Shailendra K. Bhonsle and
Koon-Seng S. Lim A Binding Architecture for Multimedia
Networks . . . . . . . . . . . . . . . . 204--216
Anonymous Author Index for Volume 30 . . . . . . . 217--217
Richard N. Draper and
Vance Faber The Diameter and Average Distance of
Supertoroidal Networks . . . . . . . . . 1--13
Aart J. C. Bik and
Harry A. G. Wijshoff Advanced Compiler Optimizations for
Sparse Computations . . . . . . . . . . 14--24
Wei Shu Parallel Implementation of a Sparse
Simplex Algorithm on MIMD Distributed
Memory Computers . . . . . . . . . . . . 25--40
Song Chen and
Mary M. Eshaghian and
Richard F. Freund and
Jerry L. Potter and
Ying-Chieh Wu Evaluation of Two Programming Paradigms
for Heterogeneous Computing . . . . . . 41--55
Mayez Al-Mouhamed and
Lubomir Bic Effects of Loop Fusion and Statement
Migration on the Speedup of Vector
Multiprocessors . . . . . . . . . . . . 56--64
Joseph Y-T Leung and
Tommy W. Tam and
C. S. Wong and
Gilbert H. Young Routing Messages with Release Time and
Deadline Constraints . . . . . . . . . . 65--76
Rita Cucchiara and
Luigi Di Stefano and
Massimo Piccardi Detection of Circular Objects by Wave
Propagation on a Mesh-Connected Computer 77--87
Francisco Arguello and
Javier D. Bruguera and
Emilio L. Zapata A Parallel Architecture for the
Self-Sorting FFT Algorithm . . . . . . . 88--97
Allan Gottlieb and
Kai Hwang and
Sartaj Sahni Editorial Message . . . . . . . . . . . 99--100
Priyalal Kulasinghe and
Ahmed El-Amawy On Achieving Maximum Performance in
Time-Varying Arrays . . . . . . . . . . 101--111
Jerzy Brzezinski and
Jean-Michel M. Helary and
Michel Raynal and
Mukesh Singhal Deadlock Models and a General Algorithm
for Distributed Deadlock Detection . . . 112--125
David F. Robinson and
Dan Judd and
Philip K. McKinley and
Betty H. C. Cheng Efficient Multicast in All-Port
Wormhole-Routed Hypercubes . . . . . . . 126--140
Ulrich Buker and
Barbel Mertsching Parallel Evaluation of Hierarchical
Image Databases . . . . . . . . . . . . 141--152
Ronald I. Greenberg and
H-C C. Oh Packet Routing in Networks with Long
Wires . . . . . . . . . . . . . . . . . 153--158
Bruce Litow and
S. Hossein Hosseini and
K. Vairavan and
Gregory S. Wolffe Performance Characteristics of a Load
Balancing Algorithm . . . . . . . . . . 159--165
Shahram Latifi Migration of Tasks in Interconnection
Networks Based on the Star Graph . . . . 166--173
S. Haldar and
K. Vidyasankar Buffer-Optimal Constructions of 1-Writer
Multireader Multivalued Atomic Shared
Variables . . . . . . . . . . . . . . . 174--180
Paolo Ferragina A Technique to Speed Up Parallel Fully
Dynamic Algorithms for MST . . . . . . . 181--189
I-Ling L. Yen and
Farokh B. Bastani Parallel Hashing: Collision Resolution
Strategies and Performance . . . . . . . 190--198
Anonymous Author Index for Volume 31 . . . . . . . 199--199
Anne Dierstein and
Roman Hayer and
Thomas Rauber The ADDAP System on the iPSC/860:
Automatic Data Distribution and
Parallelization . . . . . . . . . . . . 1--10
Umakishore Ramachandran and
Joonwon Lee Cache-Based Synchronization in Shared
Memory Multiprocessors . . . . . . . . . 11--27
Paul Wang and
William E. Weihl Scalable Concurrent B-Trees Using
Multi-Version Memory . . . . . . . . . . 28--48
Jong-Pyng Li and
Matt W. Mutka Real-Time Virtual Channel Flow Control 49--65
Weifa Liang and
Xiaojun Shen and
Qing Hu Parallel Algorithms for the
Edge-Coloring and Edge-Coloring Update
Problems . . . . . . . . . . . . . . . . 66--73
Theodore Johnson and
Richard Newman-Wolfe A Comparison of Fast and Low Overhead
Distributed Priority Locks . . . . . . . 74--89
Jinwoo Kim and
Bernard P. Zeigler A Framework for Multiresolution
Optimization in a Parallel/Distributed
Environment: Simulation of Hierarchical
GAs . . . . . . . . . . . . . . . . . . 90--102
Loren Schwiebert and
D. N. Jayasimha A Necessary and Sufficient Condition for
Deadlock-Free Wormhole Routing . . . . . 103--117
Kleanthis Psarris The Banerjee-Wolfe and GCD tests on
exact data dependence information . . . 119--138
Susanne E. Hambrusch and
Ashfaq A. Khokhar $C^3$: A Parallel Model for
Coarse-Grained Machines . . . . . . . . 139--154
S. K. S. Gupta and
S. D. Kaushik and
C.-H. Huang and
P. Sadayappan Compiling Array Expressions for
Efficient Execution on
Distributed-Memory Machines . . . . . . 155--172
Paraskevi Fragopoulou and
Selim G. Akl and
Henk Meijer Optimal Communication Primitives on the
Generalized Hypercube Network . . . . . 173--187
Lucas Roh and
Walid A. Najjar and
Bhanu Shankar and
A. P. Wim Böhm Generation, Optimization, and Evaluation
of Multithreaded Code . . . . . . . . . 188--204
Duane Buck and
Mukesh Singhal An Analytic Study of Caching in Computer
Systems . . . . . . . . . . . . . . . . 205--214
Stephan Olariu and
James L. Schwing A Novel Deterministic Sampling Scheme
with Applications to Broadcast-Efficient
Sorting on the Reconfigurable Mesh . . . 215--222
Guanghua Lin and
Nian-Feng Tzeng Effective Utilization of Hypercubes in
the Presence of Faults . . . . . . . . . 223--231
Anonymous Erratum: Volume 31, Number 2 (1995),
pages 112--125, in the article
``Deadlock Models and a General
Algorithm for Distributed Deadlock
Detection,'' by Jerzy Brzezinski,
Jean-Michel Helary, Michel Raynal, and
Mukesh Singhal . . . . . . . . . . . . . 232--232
Anonymous Author Index for Volume 32 . . . . . . . 233--233
Antoine N. Mourad and
W. Kent Fuchs and
Daniel G. Saab Site Partitioning for Redundant Arrays
of Distributed Disks . . . . . . . . . . 1--11
Janche Sang and
Edward Mascarenhas and
Vernon Rego Mobile-Process-Based Parallel Simulation 12--23
Jong-Chuang Tsay and
Pen-Yuang Chang Designing Lower-Dimensional Regular
Arrays for Algorithms with Uniform
Dependencies . . . . . . . . . . . . . . 24--32
Lesley R. Matheson and
Robert E. Tarjan Analysis of Multigrid Algorithms on
Massively Parallel Computers:
Architectural Implications . . . . . . . 33--43
Margus Veanes and
Jonas Barklund Natural Cycletrees: Flexible
Interconnection Graphs . . . . . . . . . 44--54
Sandeep N. Bhatt and
Fan R. K. Chung and
F. Thomas Leighton and
Arnold L. Rosenberg Scheduling Tree-Dags Using FIFO Queues:
A Control-Memory Trade-Off . . . . . . . 55--68
J.-C. Bermond and
C. Peyrat and
I. Sakho and
M. Tchuente Parallelization of the Gaussian
Elimination Algorithm on Systolic Arrays 69--75
Paola Flocchini and
Bernard Mans Optimal Elections in Labeled Hypercubes 76--83
Steven Cheung and
Francis C. M. Lau Routing with Locality on Meshes with
Buses . . . . . . . . . . . . . . . . . 84--90
Yordan Rouskov and
Shahram Latifi and
Pradip K. Srimani Conditional Fault Diameter of Star Graph
Networks . . . . . . . . . . . . . . . . 91--97
M. Y. Chan and
F. Chin and
C. N. Chu and
W. K. Mak Dilation-$5$ Embedding of
$3$-Dimensional Grids into Hypercubes 98--106
Ye-In Chang A Simulation Study on Distributed Mutual
Exclusion . . . . . . . . . . . . . . . 107--121
Simon C. Merrall Parallel Execution of Nested Parallel
Expressions . . . . . . . . . . . . . . 122--130
Marc Abrams Geometric Performance Analysis of
Periodic Behavior . . . . . . . . . . . 131--144
Charles E. Leiserson and
Zahi S. Abuhamdeh and
David C. Douglas and
Carl R. Feynman and
Mahesh N. Ganmukhi and
Jeffrey V. Hill and
W. Daniel Hillis and
Bradley C. Kuszmaul and
Margaret A. St Pierre and
David S. Wells and
Monica C. Wong-Chan and
Shaw-Wen Yang and
Robert Zak The network architecture of the
Connection Machine CM-5 . . . . . . . . 145--158
D. P. Helmbold and
C. E. McDowell A Taxonomy of Race Conditions . . . . . 159--164
S. Banerjee and
R. K. Ghosh and
A. P. K. Reddy Parallel Algorithm for Shortest Pairs of
Edge-Disjoint Paths . . . . . . . . . . 165--171
David K. Poulsen and
Pen-Chung Yew Integrating Fine-Grained Message Passing
in Cache Coherent Shared Memory
Multiprocessors . . . . . . . . . . . . 172--188
Omkar M. Dighe and
Ramachandran Vaidyanathan and
S. Q. Zheng The Bus-Connected Ringed Tree: A
Versatile Interconnection Network . . . 189--196
Michael J. Quinn and
Philip J. Hatcher On the Utility of
Communication-Computation Overlap in
Data-Parallel Programs . . . . . . . . . 197--204
Santosh Pande and
Kleanthis Psarris Program Repartitioning on Varying
Communication Cost Parallel
Architectures . . . . . . . . . . . . . 205--213
Anonymous Author Index for Volume 33 . . . . . . . 214--214
Mohamed Naimi and
Michel Trehel and
André Arnold A Log ($N$) Distributed Mutual Exclusion
Algorithm Based on Path Reversal . . . . 1--13
Neng-Pin Lu and
Chung-Ping Chung A Fault-Tolerant Multistage Combining
Network . . . . . . . . . . . . . . . . 14--28
Laura A. Sanchis and
Matthew B. Squire Parallel Algorithms for Counting and
Randomly Generating Integer Partitions 29--35
Christophe Calvin and
Denis Trystram Matrix Transpose for Block Allocations
on Torus and de Bruijn Networks . . . . 36--49
Vincent W. Freeh A Comparison of Implicit and Explicit
Parallel Programming . . . . . . . . . . 50--65
Aydin Üresin and
Michel Dubois Effects of Asynchronism on the
Convergence Rate of Iterative Algorithms 66--81
Jerry L. Trahan and
Ramachandran Vaidyanathan and
Ratnapuri K. Thiruchelvan On the Power of Segmenting and Fusing
Buses . . . . . . . . . . . . . . . . . 82--94
Aart J. C. Bik and
Harry A. G. Wijshoff The Use of Iteration Space Partitioning
to Construct Representative Simple
Sections . . . . . . . . . . . . . . . . 95--110
Satoshi Fujita and
Masafumi Yamashita A Nonoblivious Bus Access Scheme Yields
an Optimal Partial Sorting Algorithm . . 111--116
Alexander D. Stoyenko and
Jan Bosch and
Mehmet Ak\vsit and
Thomas J. Marlowe Load Balanced Mapping of Distributed
Objects to Minimize Network
Communication . . . . . . . . . . . . . 117--136
S. K. S. Gupta and
C.-H. Huang and
P. Sadayappan and
R. W. Johnson A Framework for Generating
Distributed-Memory Parallel Programs for
Block Recursive Algorithms . . . . . . . 137--153
Donald D. Chinn and
Tom Leighton and
Martin Tompa Minimal Adaptive Routing on the Mesh
with Bounded Queue Size . . . . . . . . 154--170
Tao Yang and
Oscar H. Ibarra Performance Prediction in Symbolic
Scheduling of Partitioned Programs with
Weight Variation . . . . . . . . . . . . 171--182
Randall L. Hyde and
Brett D. Fleisch An Analysis of Degenerate Sharing and
False Coherence . . . . . . . . . . . . 183--195
Andreas Schikarski and
Dorothea Wagner Efficient Parallel Matrix Inversion on
Interconnection Networks . . . . . . . . 196--201
C. S. Raghavendra and
M. A. Sridhar Exact Solutions to Diameter and Routing
Problems in PEC Networks . . . . . . . . 202--210
Joseph Y-T Leung and
Tommy W. Tam and
Gilbert H. Young On-Line Routing of Real-Time Messages 211--217
X. Wang and
E. K. Blum Parallel Execution of Iterative
Computations on Workstation Clusters . . 218--226
Gheorghe Antonoiu and
Pradip K. Srimani A Self-Stabilizing Leader Election
Algorithm for Tree Graphs . . . . . . . 227--232
Duane Buck and
Mukesh Singhal Erratum: Volume 32, Number 2 (1996), pp.
205--214: Duane Buck and Mukesh Singhal,
``An Analytic Study of Caching in
Computer Systems'' . . . . . . . . . . . 233--233
Anonymous Author Index for Volume 34 . . . . . . . 234--234
Anonymous Editorial Announcement . . . . . . . . . 1--1
Allan Gottlieb and
Kai Hwang and
Sartaj Sahni Editorial Announcement . . . . . . . . . 1--1
Gwen Clarke and
David T. Barnard An LR Substring Parser Applied in a
Parallel Environment . . . . . . . . . . 2--17
Dror G. Feitelson and
Larry Rudolph Evaluation of Design Choices for Gang
Scheduling Using Distributed
Hierarchical Control . . . . . . . . . . 18--34
Junguk L. Kim and
Geneva G. Belford A Distributed Election Protocol for
Unreliable Networks . . . . . . . . . . 35--42
Mohamed G. Gouda and
F. Furman Haddix The Stabilizing Token Ring in Three Bits 43--48
Lawrence L. Larmore and
Teresa M. Przytycka A Parallel Algorithm for Optimum
Height-Limited Alphabetic Binary Trees 49--56
C. S. Raghavendra and
M. A. Sridhar Dimension Ordering and Broadcast
Algorithms in Faulty SIMD Hypercubes . . 57--66
Kenneth F. Wong and
Mark Franklin Checkpointing in Distributed Computing
Systems . . . . . . . . . . . . . . . . 67--75
Greg Eisenhauer and
Karsten Schwan Design and Analysis of a Parallel
Molecular Dynamics Application . . . . . 76--90
Ravikanth Ganesan and
Kannan Govindarajan and
Min-You Wu Comparing SIMD and MIMD Programming
Modes . . . . . . . . . . . . . . . . . 91--96
Xuemin Lin and
Maria E. Orlowska An Optimal Voting Scheme for Minimizing
the Overall Communication Cost in
Replicated Data Management . . . . . . . 97--103
Kemal Efe Embedding Large Complete Binary Trees in
Hypercubes with Load Balancing . . . . . 104--109
Mike Barnett and
David G. Payne and
Robert A. van de Geijn and
Jerrell Watts Broadcasting on Meshes with Wormhole
Routing . . . . . . . . . . . . . . . . 111--122
Yeong-Sheng Chen and
Sheng-De Wang and
Chien-Min Wang Tiling Nested Loops into Maximal
Rectangular Blocks . . . . . . . . . . . 123--132
David S. Greenberg and
James K. Park and
Eric J. Schwabe The Cost of Complex Communication on
Simple Networks . . . . . . . . . . . . 133--141
John May and
Francine Berman Retargetability and Extensibility in a
Parallel Debugger . . . . . . . . . . . 142--155
Yong Yan and
Xiaodong Zhang and
Haixu Yang A Fast Token-Chasing Mutual Exclusion
Algorithm in Arbitrary Network
Topologies . . . . . . . . . . . . . . . 156--172
David A. Bader and
Joseph JáJá Parallel Algorithms for Image
Histogramming and Connected Components
with an Experimental Study . . . . . . . 173--190
Nabanita Das and
Jayasree Dattagupta Two-pass rearrangeability in faulty
Benes networks . . . . . . . . . . . . . 191--198
D. Antony Louis Piriyakumar and
C. Siva Ram Murthy Optimal Compile-Time Multiprocessor
Scheduling Based on the $0-1$ Linear
Programming Algorithm with the Branch
and Bound Technique . . . . . . . . . . 199--204
Kuo-Liang Chung and
Wen-Ming Yan Parallel B-Spline Surface Fitting on
Mesh-Connected Computers . . . . . . . . 205--210
Sunggu Lee and
Jong Kim Path Selection for Message Passing in a
Circuit-Switched Multicomputer . . . . . 211--218
Anonymous Author Index for Volume 35 . . . . . . . 219--219
Shangping Ren and
Gul A. Agha and
Masahiko Saito A Modular Approach to Programming
Distributed Real-Time Systems . . . . . 4--12
Jack P. C. Verhoosel and
Lonnie R. Welch and
Dieter K. Hammer and
Erik J. Luit Incorporating Temporal Considerations
during Assignment and Pre-run-time
Scheduling of Objects and Processes . . 13--31
Lodewijk Bergmans and
Mehmet Ak\vsit Composing Synchronization and Real-Time
Constraints . . . . . . . . . . . . . . 32--52
P. D. V. van der Stok Atomic Objects for Real-Time Distributed
Systems with Mixed Time Constraints . . 53--65
Christer Eriksson and
Jukka Maki-Turja and
Kjell Post and
Mikael Gustafsson and
Jan Gustafsson and
Kristian Sandstrom and
Ellus Brorsson An Overview of RealTimeTalk, a Design
Framework for Real-Time Systems . . . . 66--80
Chris Zimmermann Reflections on an Adaptable Real-Time
Metalevel Architecture . . . . . . . . . 81--89
Maher Kaddoura and
Sanjay Ranka and
Albert Wang Array Decompositions for Nonuniform
Computational Environments . . . . . . . 91--105
Debendra Das Sharma and
Dhiraj K. Pradhan Submesh Allocation in Mesh
Multicomputers Using Busy-List: A
Best-Fit Approach with Complete
Recognition Capability . . . . . . . . . 106--118
Lynn Choi and
Andrew A. Chien The design and performance evaluation of
the DI-multicomputer . . . . . . . . . . 119--143
Stephan Olariu and
Ivan Stojmenovi\vc Time-Optimal Nearest-Neighbor
Computations on Enhanced Meshes . . . . 144--155
Ky MacPherson and
Prithviraj Banerjee Parallel Algorithms for VLSI Layout
Verification . . . . . . . . . . . . . . 156--172
Cindy K. Y. Ng and
Lawrence K. L. Pun and
Dixon M. C. Ip and
Mounir Hamdi and
Ishfaq Ahmad Embedding Pyramids into 3D Meshes . . . 173--184
Joseph Gil and
Yossi Matias An Effective Load Balancing Policy for
Geometric-Decaying Algorithms . . . . . 185--188
Sying-Jyan Wang Load-Balancing in Multistage
Interconnection Networks under
Multiple-Pass Routing . . . . . . . . . 189--194
Andrew Sohn Parallel Satisfiability Test with
Synchronous Simulated Annealing on
Distributed-Memory Multiprocessor . . . 195--204
Anonymous Author Index for Volume 36 . . . . . . . 206--206
Seth Copen Goldstein and
Klaus Erik Schauser and
David E. Culler Lazy Threads: Implementing a Fast
Parallel Call . . . . . . . . . . . . . 5--20
Vijay Karamcheti and
John Plevyak and
Andrew A. Chien Runtime Mechanisms for Efficient Dynamic
Multithreading . . . . . . . . . . . . . 21--40
David K. Lowenthal and
Vincent W. Freeh and
Gregory R. Andrews Using Fine-Grain Threads and Run-Time
Decision Making in Parallel Computing 41--54
Robert D. Blumofe and
Christopher F. Joerg and
Bradley C. Kuszmaul and
Charles E. Leiserson and
Keith H. Randall and
Yuli Zhou Cilk: An Efficient Multithreaded Runtime
System . . . . . . . . . . . . . . . . . 55--69
Ian Foster and
Carl Kesselman and
Steven Tuecke The Nexus Approach to Integrating
Multithreading and Communication . . . . 70--82
Ricardo Bianchini and
Beng-Hong Lim Evaluating the Performance of
Multithreading and Prefetching in
Multiprocessors . . . . . . . . . . . . 83--97
Neelakantan Sundaresan and
Dennis Gannon Coir: An Object-Oriented System for
Control and Dynamic Data Parallelism . . 98--105
Charles Severance and
Richard Enbody and
Paul Petersen Managing the Overall Balance of
Operating System Threads on a
Multiprocessor Using Automatic
Self-Allocating Threads (ASAT) . . . . . 106--112
Frank Bellosa and
Martin Steckermeier The Performance Implications of Locality
Information Usage in Shared-Memory
Multiprocessors . . . . . . . . . . . . 113--121
Paola Alimonti and
Paola Flocchini and
Nicola Santoro Finding the Extrema of a Distributed
Multiset . . . . . . . . . . . . . . . . 123--133
Avinash C. Palaniswamy and
Philip A. Wilsey Parameterized Time Warp (PTW): An
Integrated Adaptive Solution to
Optimistic PDES . . . . . . . . . . . . 134--145
R. T. McLay and
S. Swift and
G. F. Carey Maximizing Sparse Matrix-Vector Product
Performance on RISC Based MIMD Computers 146--158
Bernardo Rodriguez and
Leslie Hart and
Tom Henderson Parallelizing Operational Weather
Forecast Models for Portable and Fast
Execution . . . . . . . . . . . . . . . 159--170
Robert K. Gjertsen, Jr. and
Mark T. Jones and
Paul E. Plassmann Parallel Heuristics for Improved,
Balanced Graph Colorings . . . . . . . . 171--186
Sanguthevar Rajasekaran Randomized Selection on the Hypercube 187--193
Sang-Kyun Yun and
Kyu Ho Park Hierarchical Hypercube Networks (HHN)
for Massively Parallel Computers . . . . 194--199
Yu-Chee Tseng and
Ten-Hwang Lai On the Embedding of a Class of Regular
Graphs in a Faulty Hypercube . . . . . . 200--206
D. Janaki Ram and
T. H. Sreenivas and
K. Ganapathy Subramaniam Parallel Simulated Annealing Algorithms 207--212
Tom Hameenanttila and
Xin-Li Guan and
Jo Dale Carothers and
Jian-Xin Chen The Flexible Hypercube: A New
Fault-Tolerant Architecture for Parallel
Computing . . . . . . . . . . . . . . . 213--220
Anonymous Author Index for Volume 37 . . . . . . . 221--221
Didier El Baz and
Pierre Spiteri and
Jean Claude Miellou and
Didier Gazen Asynchronous Iterative Algorithms with
Flexible Communication for Nonlinear
Network Flow Problems . . . . . . . . . 1--15
Chiung-San Lee and
Tai-Ming Parng Performance Modeling and Evaluation of a
Two-Dimensional Disk Array System . . . 16--27
Kuo-Chan Huang and
Feng-Jian Wang and
Pei-Chi Wu Parallelizing a Level 3 BLAS Library for
LAN-Connected Workstations . . . . . . . 28--36
Rob F. Van der Wijngaart and
Sekhar R. Sarukkai and
Pankaj Mehra Analysis and Optimization of Software
Pipeline Performance on MIMD Parallel
Computers . . . . . . . . . . . . . . . 37--50
Taegeun Park A Parallel Algorithm for Global Routing
Using an Associative Processor . . . . . 51--62
Yong Yang and
Xiaodong Zhang and
Yongsheng Song An Effective and Practical Performance
Prediction Model for Parallel Computing
on Nondedicated Heterogeneous NOW . . . 63--80
Steven A. Moyer and
V. S. Sunderam Characterizing Concurrency Control
Performance for the PIOUS Parallel File
System . . . . . . . . . . . . . . . . . 81--91
Li-Xin Gao and
Arnold L. Rosenberg Toward Efficient Scheduling of Evolving
Computations on Rings of Processors . . 92--100
B. C. Bromley Quasirandom Number Generators for
Parallel Monte Carlo Algorithms . . . . 101--104
Santosh Pande and
Dharma P. Agrawal Special Issue on Compilation Techniques
for Distributed Memory Systems: Guest
Editors' Introduction . . . . . . . . . 107--113
Mary W. Hall and
Seema Hiranandani and
Ken Kennedy and
Chau-Wen Tseng Interprocedural Compilation of Fortran D 114--129
Arvind Krishnamurthy and
Katherine Yelick Analyses and Optimizations for Shared
Address Space Programs . . . . . . . . . 130--144
Siddhartha Chatterjee and
John R. Gilbert and
Leonid Oliker and
Robert Schreiber and
Thomas J. Sheffler Algorithms for Automatic Alignment of
Arrays . . . . . . . . . . . . . . . . . 145--157
Daniel J. Palermo and
Eugene W. Hodges IV and
Prithviraj Banerjee Dynamic Data Partitioning for
Distributed-Memory Multicomputers . . . 158--175
Mich\`ele Dion and
Cyril Randriamaro and
Yves Robert Compiling Affine Nested Loops: How to
Optimize the Residual Communications
after the Alignment Phase . . . . . . . 176--187
Ashwath Thirumalai and
J. Ramanujam Efficient Computation of Address
Sequences in Data Parallel Programs
Using Closed Forms for Basis Vectors . . 188--203
Seungjo Bae and
Sanjay Ranka PACK/UNPACK on Coarse-Grained
Distributed Memory Parallel Machines . . 204--216
Shankar Ramaswamy and
Barbara Simons and
Prithviraj Banerjee Optimizations for Efficient Array
Redistribution on Distributed Memory
Multicomputers . . . . . . . . . . . . . 217--228
Fabien Coelho and
Corinne Ancourt Optimal Compilation of HPF Remappings 229--236
S. D. Kaushik and
C.-H. Huang and
P. Sadayappan Efficient Index Set Generation for
Compiling HPF Array Statements on
Distributed-Memory Machines . . . . . . 237--247
Martin C. Carlisle and
Anne Rogers Software caching and computation
migration in Olden . . . . . . . . . . . 248--255
Manuel Ujaldon and
Emilio L. Zapata and
Shamik D. Sharma and
Joel Saltz Parallelization Techniques for Sparse
Matrix Applications . . . . . . . . . . 256--266
Sibabrata Ray and
Hong Jiang and
Qing Yang A Compiler-Directed Approach to Network
Latency Reduction for Distributed Shared
Memory Multiprocessors . . . . . . . . . 267--276
Rajesh Bordawekar and
Alok Choudhary and
J. Ramanujam Compilation and Communication Strategies
for Out-of-Core Programs on Distributed
Memory Machines . . . . . . . . . . . . 277--288
Anonymous Author Index for Volume 38 . . . . . . . 289--289
Afonso Ferreira and
John Michael Robson Fast and Scalable Parallel Algorithms
for Knapsack-like Problems . . . . . . . 1--13
Zhichen Xu and
Xiaodong Zhang and
Lin Sun Semi-empirical Multiprocessor
Performance Predictions . . . . . . . . 14--28
Ion Stoica and
Florin Sultan and
David Keyes A Hyperbolic Model for Communication in
Layered Parallel Processing Environments 29--45
Thomas Fahringer Compile-Time Estimation of Communication
Costs for Data Parallel Programs . . . . 46--65
Marlin H. Mickle and
JoAnn M. Paul Load Balancing Using Heterogeneous
Processors for Continuum Problems on a
Mesh . . . . . . . . . . . . . . . . . . 66--73
Bryan Beresford-Smith and
Oliver Diessel and
Hossam ElGindy Optimal Algorithms for Constrained
Reconfigurable Meshes . . . . . . . . . 74--78
Pei Ouyang and
Krishna V. Palem Very Efficient Cyclic Shifts on
Hypercubes . . . . . . . . . . . . . . . 79--86
Rajib K. Das and
Bhabani P. Sinha A New Topology with Odd Degree for
Multiprocessor Systems . . . . . . . . . 87--94
Phillip Krueger and
Davender Babbar The Effects of Precedence and Priority
Constraints on the Performance of Scan
Scheduling for Hypercube Multiprocessors 95--104
Baruch Awerbuch and
Bonnie Berger and
Lenore Cowen and
David Peleg Fast Distributed Network Decompositions
and Covers . . . . . . . . . . . . . . . 105--114
D. B. Skillicorn Parallel Implementation of Tree
Skeletons . . . . . . . . . . . . . . . 115--125
Carl J. Beckmann Generating Self-Scheduling Code for
Nonloop Parallelism . . . . . . . . . . 126--145
Krishnan R. Subramaniam and
Suraj C. Kothari and
Don Heller A Communication Library Using Active
Messages to Improve Performance of PVM 146--152
Lúcia Maria de A. Drummond and
Valmir C. Barbosa Distributed Breakpoint Detection in
Message-Passing Programs . . . . . . . . 153--167
Håkan Grahn and
Per Stenström Evaluation of a Competitive-Update Cache
Coherence Protocol with Migratory Data
Detection . . . . . . . . . . . . . . . 168--180
Prasant Mohapatra Processor Allocation Using Partitioning
in Mesh Connected Parallel Computers . . 181--190
Anonymous Call for Papers: Special Issue on
Parallel and Distributed Data Structures 191--191
Anonymous Call for Papers: Special Issue on
Irregular Problems in Supercomputing
Applications . . . . . . . . . . . . . . 192--192
Anonymous Author Index for Volume 39 . . . . . . . 193--193
Dhabaleswar K. Panda and
Lionel M. Ni Special Issue on Workstation Clusters
and Network-Based Computing: Guest
Editors' Introduction . . . . . . . . . 1--3
Mario Lauria and
Andrew Chien MPI-FM: High Performance MPI on
Workstation Clusters . . . . . . . . . . 4--18
Jehoshua Bruck and
Danny Dolev and
Ching-Tien Ho and
Marcel-C\uat\ualin Ro\csu and
Ray Strong Efficient Message Passing Interface
(MPI) for Parallel Computing on Clusters
of Workstations . . . . . . . . . . . . 19--34
Ian Foster and
Jonathan Geisler and
Carl Kesselman and
Steven Tuecke Managing Multiple Communication Methods
in High-Performance Networked Computing
Systems . . . . . . . . . . . . . . . . 35--48
Henry Bal and
Raoul Bhoedjang and
Rutger Hofman and
Ceriel Jacobs and
Koen Langendoen and
Tim Rühl and
Kees Verstoep Performance of a High-Level Parallel
Language on a High-Speed Network . . . . 49--64
Gilbert Cabillic and
Isabelle Puaut Stardust: An Environment for Parallel
Programming on Networks of Heterogeneous
Workstations . . . . . . . . . . . . . . 65--80
Ravi B. Konuru and
Steve W. Otto and
Jonathan Walpole A Migratable User-Level Process Package
for PVM . . . . . . . . . . . . . . . . 81--102
Juan Carlos Gomez and
Vernon Rego and
V. S. Sunderam Efficient Multithreaded User-Space
Transport for Network Computing: Design
and Test of the TRAP Protocol . . . . . 103--117
Bulent Abali and
Craig B. Stunkel and
Caroline Benveniste Clock Synchronization on a Multicomputer 118--130
Donald Johnson and
David Lilja and
John Riedl and
James Anderson Low-Cost, High-Performance Barrier
Synchronization on Networks of
Workstations . . . . . . . . . . . . . . 131--137
Angelos Bilas and
Edward W. Felten Fast RPC on the SHRIMP Virtual Memory
Mapped Network Interface . . . . . . . . 138--146
David M. Koppelman Sticky States in Banyan Network Queues
and Their Application to Analysis . . . 147--161
Xiaotie Deng and
Hai-Ning Liu and
JunSheng Long and
Bing Xiao Competitive Analysis of Network Load
Balancing . . . . . . . . . . . . . . . 162--172
Chao-Ju Hou and
Kang G. Shin Implementation of Decentralized Load
Sharing in Networked Workstations Using
the Condor Package . . . . . . . . . . . 173--184
Dajin Wang and
Zhongxian Wang Minimum Assignment of Test Links for
Hypercubes with Lower Fault Bounds . . . 185--193
Mohan Ahuja and
Shivakant Mishra Units of Computation in Fault-Tolerant
Distributed Systems . . . . . . . . . . 194--209
Denis Barthou and
Jean-François Collard and
Paul Feautrier Fuzzy Array Dataflow Analysis . . . . . 210--226
Jeng Kuen Lee and
Ing-Kuen Tsaur and
San-Yih Hwang Parallel Array Object I/O Support on
Distributed Environments . . . . . . . . 227--241
R. Sarnath and
Xin He On Parallel Selection and Searching in
Partial Orders: Sorted Matrices . . . . 242--247
Alan A. Bertossi and
Alessandro Mei $P$-Bandwidth Priority Queues on
Reconfigurable Tree of Meshes . . . . . 248--255
Andrew Sohn and
Mitsuhisa Sato and
Namhoon Yoo and
Jean-Luc Gaudiot Data and Workload Distribution in a
Multithreaded Architecture . . . . . . . 256--264
Anonymous Author Index for Volume 40 . . . . . . . 265--265
Mary M. Eshaghian and
Eugen Schenfeld Special Issue on Parallel Computing with
Optical Interconnects: Guest Editors'
Introduction . . . . . . . . . . . . . . 1--2
Phil May and
Myunghee Lee and
Scott T. Wilkinson and
Olivier Vendier and
Zhuang Ho and
Steven W. Bond and
D. Scott Wills and
Martin Brooke and
Nan M. Jokerst and
April Brown A 100 Mbps, LED Through-Wafer
Optoelectronic Link for Multicomputer
Interconnection Networks . . . . . . . . 3--19
Philippe J. Marchand and
Ashok V. Krishnamoorthy and
Gökçe I. Yayla and
Sadik C. Esener and
Uzi Efron Optically Augmented 3-D Computer: System
Technology and Architecture . . . . . . 20--35
Yosi Ben-Asher Optical Routing in Meshes Using the
Duplication Model . . . . . . . . . . . 36--41
D. A. B. Miller and
H. M. Ozaktas Limit to the Bit-Rate Capacity of
Electrical Interconnects from the Aspect
Ratio of the System Architecture . . . . 42--52
Chunming Qiao A Two-Level Process for Diagnosing
Crosstalk in Photonic Dilated Benes
Networks . . . . . . . . . . . . . . . . 53--66
Leo J. Irakliotis and
Carl W. Wilmsen and
Pericles A. Mitkas The Optical Memory-Electric Computer
Interface as a Parallel Processing
Architecture . . . . . . . . . . . . . . 67--77
Joon-Ho Ha and
Timothy Mark Pinkston SPEED DMON: Cache Coherence on an
Optical Multichannel Interconnect
Architecture . . . . . . . . . . . . . . 78--91
M. A. Hands and
W. Peiffer and
H. Thienpont and
A. Kirk and
T. J. Hall and
D. Pignon and
P. Parmiter Proposal for Stochastic Bit Stream
Processing Using Optoelectronic Smart
Pixels: A Neural Network Architectural
Case Study . . . . . . . . . . . . . . . 92--108
Ashok V. Krishnamoorthy and
David A. B. Miller Firehose Architectures for Free-Space
Optically Interconnected VLSI Circuits 109--114
Seok Ho Song and
El-Hang Lee Parallel Optical Packet Address
Detection Using Planar Optical
Interconnections . . . . . . . . . . . . 115--119
J. A. B. Dines and
J. F. Snowdon and
M. P. Y. Desmulliez and
D. B. Barsky and
A. V. Shafarenko and
C. R. Jesshope Optical Interconnectivity in a Scalable
Data-Parallel System . . . . . . . . . . 120--130
Richard G. Rozier and
Fouad E. Kiamilev and
Ashok V. Krishnamoorthy Design and Evaluation of a Photonic FFT
Processor . . . . . . . . . . . . . . . 131--136
Anonymous Call for Papers: Special Issue of the
Journal of Parallel and Distributed
Computing on Dynamic Load Balancing . . 137--137
Mounir Hamdi and
Richard W. Hall RCC-Full: An Effective Network for
Parallel Computations . . . . . . . . . 139--155
William Tsun-yuk Hsu and
Pen-Chung Yew Performance Evaluation of Wire-Limited
Hierarchical Networks . . . . . . . . . 156--172
Alexander I. Tomlinson and
Vijay K. Garg Monitoring Functions on Global States of
Distributed Programs . . . . . . . . . . 173--189
Ravi Prakash and
Michel Raynal and
Mukesh Singhal An Adaptive Causal Ordering Algorithm
Suited to Mobile Computing Environments 190--204
Nayeem Islam Customized Message Passing . . . . . . . 205--224
Sanguthevar Rajasekaran and
David S. L. Wei Selection, Routing, and Sorting on the
Star Graph . . . . . . . . . . . . . . . 225--233
Anonymous Volume 38, Number 1 (1996), in the
article ``An Effective and Practicle
Performance Prediction Model for
Parallel Computing on Nondedicated
Heterogeneous NOW,'' by Yong Yan,
Xiaodong Zhang, and Yongsheng Song,
pages 63--80 . . . . . . . . . . . . . . 234--234
Anonymous Author Index for Volume 41 . . . . . . . 235
B. B. Zhou and
R. P. Brent A Parallel Ring Ordering Algorithm for
Efficient One-Sided Jacobi SVD
Computations . . . . . . . . . . . . . . 1--10
Leszek Gasieniec and
Andrzej Pelc Broadcasting with a Bounded Fraction of
Faulty Nodes . . . . . . . . . . . . . . 11--20
Y. Kopidakis and
M. Lamari and
V. Zissimopoulos On the Task Assignment Problem: Two New
Efficient Heuristic Algorithms . . . . . 21--29
Yizhou Yu and
Oscar H. Ibarra and
Tao Yang Parallel Progressive Radiosity with
Adaptive Meshing . . . . . . . . . . . . 30--41
Jingling Xue Communication-Minimal Tiling of Uniform
Dependence Loops . . . . . . . . . . . . 42--59
Toshimitsu Masuzawa and
Nobuki Tokura An Algorithm for Finding the Causal
Distributed Breakpoint . . . . . . . . . 60--66
M. O. Tokhi and
M. A. Hossain and
M. J. Baxter and
P. J. Fleming Performance Evaluation Issues in
Real-Time Parallel Signal Processing and
Control . . . . . . . . . . . . . . . . 67--74
Injae Hwang An Efficient Processor Allocation
Algorithm Using Two- Dimensional Packing 75--81
Tom P. Ajith and
C. Siva Ram Murthy An Improved Algorithm for Module
Allocation in Distributed Computing
Systems . . . . . . . . . . . . . . . . 82--90
Daniel Andresen and
Tao Yang and
Oscar H. Ibarra Toward a Scalable Distributed WWW Server
on Workstation Clusters . . . . . . . . 91--100
Pallab Dasgupta and
A. K. Majumder and
P. Bhattacharya V\_THR: An Adaptive Load Balancing
Algorithm . . . . . . . . . . . . . . . 101--108
Chao-Wei Ou and
Sanjay Ranka Parallel Remapping of Adaptive Problems 109--121
Shlomi Dolev Self-Stabilizing Routing and Related
Protocols . . . . . . . . . . . . . . . 122--127
Richard Neves and
Robert B. Schnabel Threaded Runtime Support for Execution
of Fine Grain Parallel Code on Coarse
Grain Multiprocessors . . . . . . . . . 128--142
Cong Fu and
Tao Yang Run-Time Techniques for Exploiting
Irregular Task Parallelism on
Distributed Memory Architectures . . . . 143--156
Poting Wu and
Elias N. Houstis EPPOD: A Problem Solving Environment for
Parallel Electronic Prototyping of
Physical Object Design . . . . . . . . . 157--172
Bülent Yener and
Inderpal Bhandari and
Yoram Ofek and
Moti Yung Fault-Tolerant Convergence Routing . . . 173--183
Anonymous Author Index for Volume 42 . . . . . . . 184--184
Allan Gottlieb and
Kai Hwang and
Sartaj Sahni Editorial Message . . . . . . . . . . . 1--2
Chi Chung Lam and
C.-H. Huang and
P. Sadayappan Optimal Algorithms for All-to-All
Personalized Communication on Rings and
Two Dimensional Tori . . . . . . . . . . 3--13
Li-Hsing Yen and
Ting-Lu Huang Resetting Vector Clocks in Distributed
Systems . . . . . . . . . . . . . . . . 15--20
Gagan Hasteer and
Prithviraj Banerjee Simulated Annealing Based Parallel State
Assignment of Finite State Machines . . 21--35
Ashok Khemka and
R. K. Shyamasundar An Optimal Multiprocessor Real-Time
Scheduling Algorithm . . . . . . . . . . 37--45
Pierre Fraigniaud and
Sandrine Vial Approximation Algorithms for
Broadcasting and Gossiping . . . . . . . 47--55
Koichi Wada and
Takaharu Ikeo and
Kimio Kawaguchi and
Wei Chen Highly Fault-Tolerant Routings and
Fault-Induced Diameter for Generalized
Hypercube Graphs . . . . . . . . . . . . 57--62
Dhabaleswar K. Panda and
Lionel M. Ni Special Issue on Workstation Clusters
and Network-Based Computing: Guest
Editors' Introduction . . . . . . . . . 63--64
Honghui Lu and
Sandhya Dwarkadas and
Alan L. Cox and
Willy Zwaenepoel Quantifying the Performance Differences
between PVM and TreadMarks . . . . . . . 65--78
Magnus Karlsson and
Per Stenström Effectiveness of Dynamic Prefetching in
Multiple-Writer Distributed Virtual
Shared-Memory Systems . . . . . . . . . 79--93
Manolis G. H. Katevenis and
Evangelos P. Markatos and
George Kalokerinos and
Apostolos Dollas Telegraphos: A Substrate for
High-Performance Computing on
Workstation Clusters . . . . . . . . . . 94--108
Stergios V. Anastasiadis and
Kenneth C. Sevcik Parallel Application Scheduling on
Networks of Workstations . . . . . . . . 109--124
James S. Plank and
Youngbae Kim and
Jack J. Dongarra Fault-Tolerant Matrix Operations for
Networks of Workstations Using Diskless
Checkpointing . . . . . . . . . . . . . 125--138
Chi-Chung Hui and
Samuel T. Chanson Theoretical Analysis of the
Heterogeneous Dynamic Load-Balancing
Problem Using a Hydrodynamic Approach 139--146
Adam Beguelin and
Erik Seligman and
Peter Stephan Application Level Fault Tolerance in
Heterogeneous Networks of Workstations 147--155
Mohammed Javeed Zaki and
Wei Li and
Srinivasan Parthasarathy Customized Dynamic Load Balancing for a
Network of Workstations . . . . . . . . 156--162
Maher Kaddoura and
Sanjay Ranka Runtime Support for Parallelization of
Data-Parallel Applications on Adaptive
and Nonuniform Computational
Environments . . . . . . . . . . . . . . 163--168
Scott T. Leutenegger and
Xian-He Sun Limitations of Cycle Stealing for
Parallel Processing on a Network of
Homogeneous Workstations . . . . . . . . 169--178
Jeffrey M. Nick and
Gary M. King and
Jen-Yao Chung and
Nicholas S. Bowen and
Ching-Shan Peng Parallel Sysplex: A Scalable, Highly
Available, High Performance Commercial
System . . . . . . . . . . . . . . . . . 179--189
Anonymous Author Index for Volume 43 . . . . . . . 190
Hsien-Kuang Chiou and
Willard Korfhage Detecting ENF Event Predicates in
Distributed Systems . . . . . . . . . . 1--13
Ravi V. Shankar and
Sanjay Ranka Random Data Accesses on a Coarse-Grained
Parallel Machine. I. One-to-One Mappings 14--23
Ravi V. Shankar and
Sanjay Ranka Random Data Accesses on a Coarse-Grained
Parallel Machine. II. One-to-Many and
Many-to-One Mappings . . . . . . . . . . 24--34
Yan Alexander Li and
John K. Antonio and
Howard Jay Siegel and
Min Tan and
Daniel W. Watson Determining the Execution Time
Distribution for a Data Parallel Program
in a Heterogeneous Computing Environment 35--52
Paul J. Murtagh and
Ah Chung Tsoi A Reconfigurable Bit-Serial VLSI
Systolic Array Neuro-Chip . . . . . . . 53--70
Albert Alexandrov and
Mihai F. Ionescu and
Klaus E. Schauser and
Chris Scheiman LogGP: Incorporating Long Messages into
the LogP Model for Parallel Computation 71--79
David Hawking A Distributed Memory Algorithm for
Lexicon Building . . . . . . . . . . . . 80--87
Min-You Wu and
Wei Shu DDE: A Modified Dimension Exchange
Method for Load Balancing in $k$-ary
$n$-cubes . . . . . . . . . . . . . . . 88--96
Stefan Thomas Obenaus and
Ted H. Szymanski Embeddings of Star Graphs into Optical
Meshes without Bends . . . . . . . . . . 97--106
K. Bhuvaneswari and
K. N. Balasubramanya Murthy and
C. Siva Ram Murthy A New and Faster Gaussian Elimination
Based Fault Tolerant Systolic Linear
System Solver . . . . . . . . . . . . . 107--122
G. Manimaran and
C. Siva Ram Murthy and
Machiraju Vijay and
Krithi Ramamritham New Algorithms for Resource Reclaiming
from Precedence Constrained Tasks in
Multiprocessor Real-Time Systems . . . . 123--132
F. Ercal and
H. C. Lee Time-Efficient Maze Routing Algorithms
on Reconfigurable Mesh Architectures . . 133--140
Trevor E. Meyer and
James A. Davis and
Jennifer L. Davidson Analysis of Load Average and its
Relationship to Program Run Time on
Networks of Workstations . . . . . . . . 141--146
Qian-Ping Gu and
Hisao Tamaki Routing a Permutation in the Hypercube
by Two Sets of Edge Disjoint Paths . . . 147--152
Clémentin Tayou Djamegni and
Maurice Tchuenté A Cost-Optimal Pipeline Algorithm for
Permutation Generation in Lexicographic
Order . . . . . . . . . . . . . . . . . 153--159
Anonymous Call for Papers . . . . . . . . . . . . 160--160
Anonymous Author Index for Volume 44 . . . . . . . 161
Srinivas Aluru Lagged Fibonacci Random Number
Generators for Distributed Memory
Parallel Computers . . . . . . . . . . . 1--12
Allen Leung and
Krishna V. Palem and
Cristian Ungureanu Run-Time versus Compile-Time Instruction
Scheduling in Superscalar (RISC)
Processors: Performance and Trade-Off 13--28
Cheolwhan Lee and
Yuan-Fang Wang and
Tao Yang Global Optimization for Mapping Parallel
Image Processing Tasks on Distributed
Memory Machines . . . . . . . . . . . . 29--45
A. Basermann Conjugate Gradient and Lanczos Methods
for Sparse Matrices on Distributed
Memory Multiprocessors . . . . . . . . . 46--52
Phillip M. Feldman and
Raisa E. Feldman and
David B. Kim Predicting Speedup for Distributed
Computing on a Token Ring Network . . . 53--62
Lo\"\ic Prylli and
Bernard Tourancheau Fast Runtime Block Cyclic Data
Redistribution on Multiprocessors . . . 63--72
Luisa Gargano and
Adele A. Rescigno and
Ugo Vaccaro Communication Complexity of Gossiping by
Packets . . . . . . . . . . . . . . . . 73--81
N. Guil and
E. L. Zapata Fast Hough Transform on Multiprocessors:
A Branch and Bound Approach . . . . . . 82--89
Shih-Mim Liu and
G. P. Papavassilopoulos A Parallel Algorithm for Linear Programs
with an Additional Reverse Convex
Constraint . . . . . . . . . . . . . . . 91--103
David F. Robinson and
Philip K. McKinley and
Betty H. C. Cheng Path-Based Multicast Communication in
Wormhole-Routed Unidirectional Torus
Networks . . . . . . . . . . . . . . . . 104--121
Perry Fizzano and
David Karger and
Clifford Stein and
Joel Wein Distributed Job Scheduling in Rings . . 122--133
V. K. Garg and
C. M. Chase and
Richard Kilgore and
J. Roger Mitchell Efficient Detection of Channel
Predicates in Distributed Systems . . . 134--147
Ian Foster and
David R. Kohr, Jr. and
Rakesh Krishnaiyer and
Alok Choudhary A Library-Based Approach to Task
Parallelism in a Data-Parallel Language 148--158
Rumen Andonov and
Sanjay Rajopadhye Optimal Orthogonal Tiling of 2-D
Iterations . . . . . . . . . . . . . . . 159--165
Valerie E. Taylor and
Rick L. Stevens and
Kathryn E. Arnold Parallel Molecular Dynamics:
Implications for Massively Parallel
Machines . . . . . . . . . . . . . . . . 166--175
Anonymous Author Index for Volume 45 . . . . . . . 176--176
Jerry L. Trahan and
Ramachandran Vaidyanathan and
Chittur P. Subbaraman Constant Time Graph Algorithms on the
Reconfigurable Multiple Bus Machine . . 1--14
Sekhar Darbha and
Dharma P. Agrawal A Task Duplication Based Scalable
Scheduling Algorithm for Distributed
Memory Systems . . . . . . . . . . . . . 15--27
Vijay K. Naik and
Sanjeev K. Setia and
Mark S. Squillante Processor Allocation in Multiprogrammed
Distributed-Memory Parallel Computer
Systems . . . . . . . . . . . . . . . . 28--47
Steven Homer and
Marcus Peinado Design and Performance of Parallel and
Distributed Approximation Algorithms for
Maxcut . . . . . . . . . . . . . . . . . 48--61
Xiaodong Wang and
Vwani P. Roychowdhury Optimal Communication Algorithms for
Heterogeneous Computing over ATM
Networks . . . . . . . . . . . . . . . . 62--79
Bernard Mans Optimal Distributed Algorithms in
Unlabeled Tori and Chordal Rings . . . . 80--90
Prasant Mohapatra Dynamic Real-Time Task Scheduling on
Hypercubes . . . . . . . . . . . . . . . 91--100
Sudarshan Banerjee and
Sanjeev Saxena Parallel Algorithm for Finding the Most
Vital Edge in Weighted Graphs . . . . . 101--104
Sanguthevar Rajasekaran and
Wang Chen and
Shibu Yooseph Unifying Themes for Selection on Any
Network . . . . . . . . . . . . . . . . 105--111
Bernardo Rodriguez and
Harry Jordan and
Gita Alaghband A Metric for the Temporal
Characterization of Parallel Programs 113--124
Xing Du and
Xiaodong Zhang Coordinating Parallel Processes on
Networks of Workstations . . . . . . . . 125--135
Chris L. Elford and
Daniel A. Reed Technology Trends and Disk Array
Performance . . . . . . . . . . . . . . 136--147
Craig M. Wittenbrink and
Arun K. Somani Time and Space Optimal Data Parallel
Volume Rendering Using Permutation
Warping . . . . . . . . . . . . . . . . 148--164
Hyunmin Park and
Dharma P. Agrawal Efficient Deadlock-Free Wormhole Routing
and Virtual-Channel Reduction in
Shuffle-Based Networks . . . . . . . . . 165--179
Sorin G. Nastea and
Ophir Frieder and
Tarek El-Ghazawi Load-Balanced Sparse Matrix-Vector
Multiplication on Parallel Computers . . 180--193
Thomas Andreae and
Michael Nolle and
Gerald Schreiber Embedding Cartesian Products of Graphs
into de Bruijn Graphs . . . . . . . . . 194--200
Anonymous Author Index for Volume 46 . . . . . . . 201--201
Albert Y. Zomaya and
Stephan Olariu Special Issue on Parallel Evolutionary
Computing . . . . . . . . . . . . . . . 1--7
Lee Wang and
Howard Jay Siegel and
Vwani P. Roychowdhury and
Anthony A. Maciejewski Task Matching and Scheduling in
Heterogeneous Computing Environments
Using a Genetic-Algorithm-Based Approach 8--22
Subburajan Ponnuswamy and
Minesh B. Amin and
Rakesh Jha and
David A. Castañon A $C^3I$ Parallel Benchmark Based on
Genetic Algorithms --- Implementation
and Performance Analysis . . . . . . . . 23--38
Franciszek Seredynski Competitive Coevolutionary Multi-Agent
Systems: The Application to Mapping and
Scheduling Problems . . . . . . . . . . 39--57
Yu-Kwong Kwok and
Ishfaq Ahmad Efficient Scheduling of Arbitrary Task
Graphs to Multiprocessors Using a
Parallel Genetic Algorithm . . . . . . . 58--77
Tadeusz Szuba and
Robert Stras Parallel Evolutionary Computing with the
Random PROLOG Processor . . . . . . . . 78--85
Patrice Calégari and
Frédéric Guidec and
Pierre Kuonen and
Daniel Kobler Parallel Island-Based Genetic Algorithm
for Radio Network Design . . . . . . . . 86--90
A. Schoneveld and
J. F. de Ronde and
P. M. A. Sloot Task Allocation by Parallel Evolutionary
Computing . . . . . . . . . . . . . . . 91--97
Andrew Sohn and
Rupak Biswas Special Issue on Dynamic Load Balancing 99--101
C. Walshaw and
M. Cross and
M. G. Everett Parallel Dynamic Graph Partitioning for
Adaptive Unstructured Meshes . . . . . . 102--108
Kirk Schloegel and
George Karypis and
Vipin Kumar Multilevel Diffusion Schemes for
Repartitioning of Adaptive Meshes . . . 109--124
Lars Nyland and
Jan Prins and
Ru Huai Yun and
Jan Hermans and
Hye-Chung Kum and
Lei Wang Achieving Scalable Parallel Molecular
Dynamics Using Dynamic Spatial Domain
Decomposition Techniques . . . . . . . . 125--138
J. E. Flaherty and
R. M. Loy and
M. S. Shephard and
B. K. Szymanski and
J. D. Teresco and
L. H. Ziantz Adaptive Local Refinement with Octree
Load Balancing for the Parallel Solution
of Three-Dimensional Conservation Laws 139--152
David M. Nicol and
Gianfranco Ciardo Automated Parallelization of Discrete
State-Space Generation . . . . . . . . . 153--167
Soumen Chakrabarti and
James Demmel and
Katherine Yelick Models and Scheduling Algorithms for
Mixed Data and Task Parallel Programs 168--184
Torben Hagerup Allocating Independent Tasks to Parallel
Processors: An Experimental Study . . . 185--197
Anonymous Author Index for Volume 47 . . . . . . . 198
Andrew Shaw and
Arvind and
Kyoo-Chan Cho and
Christopher Hill and
R. Paul Johnson and
John Marshall A Comparison of Implicitly Parallel
Multithreaded and Data-Parallel
Implementations of an Ocean Model . . . 1--51
Shahram Latifi Fast Broadcasting and Gathering in
$q$-ary Cubes Using Error-Correction
Codes . . . . . . . . . . . . . . . . . 52--63
Anders Dessmark and
Andrzej Lingas Improved Bounds for Integer Sorting in
the EREW PRAM Model . . . . . . . . . . 64--70
George Karypis and
Vipin Kumar A Parallel Algorithm for Multilevel
Graph Partitioning and Sparse Matrix
Ordering . . . . . . . . . . . . . . . . 71--95
George Karypis and
Vipin Kumar Multilevel $k$-way Partitioning Scheme
for Irregular Graphs . . . . . . . . . . 96--129
Joseph M. Joy and
R. Daniel Bergeron The Hypercube as a Dynamically
Reconfigurable Processor Mesh . . . . . 130--142
Qing Yang and
Sridar Adina and
T. Sun Performance of One's Complement Caches 143--164
X. Lin and
A-H. Esfahanian and
A. Burago Adaptive Wormhole Routing in Hypercube
Multicomputers . . . . . . . . . . . . . 165--174
Abdel-Elah Al-Ayyoub and
Khaled Day The Hyperstar Interconnection Network 175--199
Sajal K. Das and
M. Cristina Pinotti $O(\log \log N)$ Time Algorithms for
Hamiltonian Suffix and Min-Max-Pair Heap
Operations on the Hypercube . . . . . . 200--211
Anonymous Calls for Papers . . . . . . . . . . . . 212--214
Anonymous Author Index for Volume 48 . . . . . . . 215--215
Sajal K. Das and
Stephan Olariu and
Sushil K. Prasad Special Issue on Parallel and
Distributed Data Structures: Guest
Editors' Introduction . . . . . . . . . 1--3
Gerth Stolting Brodal and
Jesper Larsson Traff and
Christos D. Zaroliagis A Parallel Priority Queue with Constant
Time Operations . . . . . . . . . . . . 4--21
Vincenzo Auletta and
Amelia De Vivo and
Vittorio Scarano Multiple Templates Access of Trees in
Parallel Memory Systems . . . . . . . . 22--39
Ralf Heckmann and
Ralf Klasing and
Burkhard Monien and
Walter Unger Optimal Embedding of Complete Binary
Trees into Lines and Grids . . . . . . . 40--56
Daniel Andresen and
Tao Yang and
Oscar H. Ibarra and
Ömer E\ugecio\uglu