Journal of Parallel and Distributed Computing
, Volume 52, 1998
Volume 52, Number 1, 10 July 1998
David R. Helman
,
David A. Bader
,
Joseph JáJá
:
A Randomized Parallel Sorting Algorithm with an Experimental Study.
1-23
Sook-Yeon Kim
,
Kyung-Yong Chwa
:
Multiple Graph Embeddings into a Processor Array with Spanning Buses.
24-39
Chung-yen Chang
,
Prasant Mohapatra
:
Performance Improvement of Allocation Schemes for Mesh-Connected Computers.
40-68
Nael B. Abu-Ghazaleh
,
Philip A. Wilsey
:
Models for Control Unit Synchronization on Shared Control Architectures.
69-81
Howon Kim
,
Hyun Suk Lee
,
Sunggu Lee
,
Jong Kim
:
Adaptive Virtual Cut-Through as a Viable Routing Method.
82-95
Igor Parfenoff
:
An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs.
96-108
Volume 52, Number 2, August 1, 1998
Gyungho Lee
,
Byung-Chang Kang
:
Limited Combining Strategies for Large-Scale Shared-Memory Multiprocessors.
109-119
Jan Trdlicka
,
Pavel Tvrdík
:
Embedding of k-ary Complete Trees into Hypercubes with Uniform Load.
120-131
Salvatore Orlando
,
Raffaele Perego
:
A Comparison of Implementation Strategies for Nonuniform Data-Parallel Computations.
132-149
Leonid Oliker
,
Rupak Biswas
:
PLUM: Parallel Load Balancing for Adaptive Unstructured Meshes.
150-177
Last update Thu May 23 19:11:17 2013 CET by the
DBLP Team
—
Data released under the
ODC-BY 1.0 license
— See also our
legal information page