Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Parallel Distrib.~Comput. AND Volume=52
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A randomized parallel sorting algorithm with an experimental study
David R. Helman
,
David A. Bader
,
Joseph Jájá
Journal Parallel Distributed Computing
52
(1), 1998, pp. 1-23
Multiple graph embeddings into a processor array with spanning buses
Sook-Yeon Kim
,
Kyung-Yong Chwa
Journal Parallel Distributed Computing
52
(1), 1998, pp. 24-39
Performance improvement of allocation schemes for mesh-connected computers
Chung-yen Chang
,
Prasant Mohapatra
Journal Parallel Distributed Computing
52
(1), 1998, pp. 40-68
Models for control unit synchronization on shared control architectures
Nael B. Abu-Ghazaleh
,
Philip A. Wilsey
Journal Parallel Distributed Computing
52
(1), 1998, pp. 69-81
Adaptive virtual cut-through as a viable routing method
Ho Won Kim
,
Hyun Suk Lee
,
Sunggu Lee
,
Jong Kim
Journal Parallel Distributed Computing
52
(1), 1998, pp. 82-95
An efficient parallel algorithm for maximum matching for some classes of graphs
I. Parfenoff
Journal Parallel Distributed Computing
52
(1), 1998, pp. 96-108
Limited combining strategies for large-scale shared-memory multiprocessors
Gyungho Lee
,
Byung-Chang Kang
Journal Parallel Distributed Computing
52
(2), 1998, pp. 109-119
Embedding of
k
-ary complete trees into hypercubes with uniform load
Jan Trdlic̑ka
,
Pavel Tvrdík
Journal Parallel Distributed Computing
52
(2), 1998, pp. 120-131
A comparison of implementation strategies for nonuniform data-parallel computations
Salvatore Orlando
,
Raffaele Perego
Journal Parallel Distributed Computing
52
(2), 1998, pp. 132-149
PLUM: Parallel load balancing for adaptive unstructured meshes
Leonid Oliker
,
Rupak Biswas
Journal Parallel Distributed Computing
52
(2), 1998, pp. 150-177