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=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An LR substring parser applied in a parallel environment
Gwen Clarke
,
David T. Barnard
Journal Parallel Distributed Computing
35
(1), 1996, pp. 2-17
Evaluation of design choices for gang scheduling using distributed hierarchical control
Dror G. Feitelson
,
Larry Rudolph
Journal Parallel Distributed Computing
35
(1), 1996, pp. 18-34
A distributed election protocol for unreliable networks
Junguk L. Kim
,
Geneva G. Belford
Journal Parallel Distributed Computing
35
(1), 1996, pp. 35-42
The stabilizing token ring in three bits
Mohamed G. Gouda
,
F. Furman Haddix
Journal Parallel Distributed Computing
35
(1), 1996, pp. 43-48
A parallel algorithm for optimum height-limited alphabetic binary trees
Lawrence L. Larmore
,
Teresa M. Przytycka
Journal Parallel Distributed Computing
35
(1), 1996, pp. 49-56
Dimension ordering and broadcast algorithms in faulty SIMD hypercubes
C.S. Raghavendra
,
M.A. Sridhar
Journal Parallel Distributed Computing
35
(1), 1996, pp. 57-66
Checkpointing in distributed computing systems
Kenneth F. Wong
,
Mark Franklin
Journal Parallel Distributed Computing
35
(1), 1996, pp. 67-75
Design and analysis of a parallel molecular dynamics application
Greg Eisenhauer
,
Karsten Schwan
Journal Parallel Distributed Computing
35
(1), 1996, pp. 76-90
Comparing SIMD and MIMD programming modes
Ravikanth Ganesan
,
Kannan Govindarajan
,
Min-You Wu
Journal Parallel Distributed Computing
35
(1), 1996, pp. 91-96
An optimal voting scheme for minimizing the overall communication cost in replicated data management
Xuemin Lin
,
Maria E. Orlowska
Journal Parallel Distributed Computing
35
(1), 1996, pp. 97-103
Embedding large complete binary trees in hypercubes with load balancing
Kemal Efe
Journal Parallel Distributed Computing
35
(1), 1996, pp. 104-109
Broadcasting on meshes with wormhole routing
Mike Barnett
,
David G. Payne
,
Robert A. van de Geijn
,
Jerrell Watts
Journal Parallel Distributed Computing
35
(2), 1996, pp. 111-122
Tiling nested loops into maximal rectangular blocks
Yeong-Sheng Chen
,
Sheng-De Wang
,
Chien-Min Wang
Journal Parallel Distributed Computing
35
(2), 1996, pp. 123-132
The cost of complex communication on simple networks
David S. Greenberg
,
James K. Park
,
Eric J. Schwabe
Journal Parallel Distributed Computing
35
(2), 1996, pp. 133-141
Retargetability and extensibility in a parallel debugger
John May
,
Francine Berman
Journal Parallel Distributed Computing
35
(2), 1996, pp. 142-155
A fast token-chasing mutual exclusion algorithm in arbitrary network topologies
Yong Yan
,
Xiaodong Zhang
,
Haixu Yang
Journal Parallel Distributed Computing
35
(2), 1996, pp. 156-172
Parallel algorithms for image histogramming and connected components with an experimental study
David A. Bader
,
Joseph Jájá
Journal Parallel Distributed Computing
35
(2), 1996, pp. 173-190
Two-pass rearrengeability in faulty Benes networks
Nabanita Das
,
Jayasree Dattagupta
Journal Parallel Distributed Computing
35
(2), 1996, pp. 191-198
Optimal compile-time multiprocessor scheduling based on the
O-1
linear programming algorithm with the branch and bound technique
D. Antony Louis Piriyakumar
,
C. Siva Ram Murthy
Journal Parallel Distributed Computing
35
(2), 1996, pp. 199-204
Parallel B-spline surface fitting on mesh-connected computers
Kuo-Liang Chung
,
Wen-Ming Yan
Journal Parallel Distributed Computing
35
(2), 1996, pp. 205-210
Path selection for message passing in a circuit-switched multicomputer
Sunggu Lee
,
Jong Kim
Journal Parallel Distributed Computing
35
(2), 1996, pp. 211-218