Volume 9,
Number 1,
March,
1999
- Vassilios V. Dimakopoulos, Nikitas J. Dimopoulos:
On Broadcasting Time.
3-8
- Pierre Fraigniaud, Sandrine Vial:
Comparison of Heuristics for One-to-All and All-to All Communications in Partial Meshes.
9-20
- Jyh-Jian Sheu, Lih-Hsing Hsu:
Fault Diameter for Subercubes.
21-30
- Anil Maheshwari, Jörg-Rüdiger Sack:
Simple Optimal Algorithms for Rectilinear Link Path and Polygon Separation Problems.
31-42
- Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko, Gen-Huey Chen:
Efficient Parallel Algorithms on Distance Hereditary Graphs.
43-52
- Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon Zakeri:
Construction of Time Relaxed Minimal Broadcast Networks.
53-68
- Alexandros V. Gerbessiotis, Constantinos J. Siniolakis:
Efficient Deterministic Sorting on the BSP Model.
69-79
- Emmanuel Delacourt, Jean Frédéric Myoupo, David Semé:
A Constant Time Parallel Detection of Repetitions.
81-92
- Vincent Vajnovszki, Chris Phillips:
Systolic Generation of k-Ary Trees.
93-101
- Limin Xiang:
Kazuo Ushijima: Decoding and Drawing on BSR for a Binary Tree from Its i-p Sequence.
103-110
- Sajal K. Das, Paolo Ferragina:
An EREW PRAM Algorithm for Updating Minimum Spanning Trees.
111-122
- Vijay K. Garg, Michel Raynal:
Normality: A Consistency Condition for Concurrent Objects.
123-134
- Gagan Agrawal:
Data Distribution Analysis for Irregular and Adaptive Codes.
135-146
- Peter Benner, José M. Claver, Enrique S. Quintana-Ortí:
Parallel Distributed Solvers for Large Stable Generalized Lyapunov Equations.
147-158
- Frederic T. Chong, Anant Agarwal:
Shared Memory Versus Message Passing for Iterative Solution of Sparse Irregular Problems.
159-170
Volume 9,
Number 2,
June,
1999
Message Passing and Performance Tools
Information Power Grid Infrastructure and Programming Environment
Cluster Based Computing and Networking Tools
Languages,
Libraries and Fault Tolerance
Volume 9,
Number 3,
September 1999
- Michel Cosnard:
Editorial Note.
311-312
- Franck Petit, Vincent Villain:
Optimality and Self-Stabilization in Rooted Tree Networks.
313-323
- Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Fast Deterministic Parallel Branch-and-Bound.
325-333
- Zhenjiang Hu, Masato Takeichi:
Calculating an Optimal Homomorphic Algorithm for Bracket Matching.
335-345
- Basilio B. Fraguela, Ramon Doallo, Emilio L. Zapata:
Memory Hierarchy Performance Prediction for Blocked Sparse Algorithms.
347-360
- Susanne E. Hambrusch, Hyeong-Seok Lim:
Minimizing the Diameter in Tree Networks Under Edge Reductions.
361-371
- Hossam A. ElGindy, Sanguthevar Rajasekaran:
Sorting and Selection on a Linear Array with Optical Bus System.
373-383
- Lin Chen, Julius Y. Jiang, Maung T. Nyeu:
Provably Fastest Parallel Algorithms for Bipartite Permutation Graphs.
385-390
- Alain Azagury, Elliot K. Kolodner, Erez Petrank:
A Note on the Implementation of Replication-Based Garbage Collection for Multithreaded Applications and Multiprocessor Environments.
391-399
- Bu-Sung Lee, Yan Gu, Wentong Cai, Alfred Heng:
Performance Evaluation of JPVM.
401-410
- Afonso Ferreira, Nicolas Schabanel:
A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem.
411-422
- V. Vaidehi, C. N. Krishnan, P. Swaminathan:
An Aided Genetic Algorithm for Multiprocessor Scheduling.
423-436
- Michel Charpentier, Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec:
The Observation: An Abstract Communication Mechanism.
437-450
Volume 9,
Number 4,
December 1999
- Michel Cosnard:
Editorial Note.
451-452
- Manfred Feil, Andreas Uhl, Marián Vajtersic:
Computation of the Continuous Wavelet Transform on Massively Parallel SIMD Arrays.
453-466
- Patricia González, José Carlos Cabaleiro, Tomás F. Pena:
Parallel Incomplete LU Factorization as a Preconditioner for Krylov Subspace Methods.
467-474
- Yoshihide Igarashi, Yasuaki Nishitani:
Speedup of the n-Process Mutual Exclusion Algorithm.
475-485
- Berna L. Massingill:
Experiments with Program Parallelization Using Archetypes and Stepwise Refinement.
487-498
- Selim G. Akl, Stefan D. Bruda:
Parallel Real-Time Optimization: Beyond Speedup.
499-509
- Mikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk:
Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems.
511-520
- CongDuc Pham, Carsten Albrecht:
Tuning Message Aggregation on High Performance Clusters for Efficient Parallel Simulations.
521-532
- Albert Chan, Frank K. H. A. Dehne:
A Note on Coarse Grained Parallel Integer Sorting.
533-538
- Jean Carle, Jean Frédéric Myoupo, David Semé:
All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications.
539-550
- Graham M. Megson, Xiaoping Liu, Xiaofan Yang:
Fault-Tolerant Ring Embedding in a Honeycomb Torus with Node Failures.
551-561
- Sajal K. Das, Ajoy Kumar Datta, Sébastien Tixeuil:
Self-Stabilizing Algorithms in DAG Structured Networks.
563-574
- Amit Jain:
Parallel Search and Multisearch in Matrices with Sorted Columns.
575-586
Copyright © Mon Nov 2 21:50:16 2009
by Michael Ley (ley@uni-trier.de)
