Journal: Parallel Processing Letters

Volume 10, Issue 4

253 -- 266Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
267 -- 278Jacek Blazewicz, Frédéric Guinand, Bernard Penz, Denis Trystram. Scheduling Complete Trees on Two Uniform Processors with Integer Speed Ratios and Communication Delays
279 -- 294Jie Wu. On Finding a Hamiltonian Path in a Tournament Using Semi-Heap
295 -- 304Miriam Di Ianni. Wormhole Deadlock Prediction
305 -- 314Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano. Symmetric Communication in All-Optical Tree Networks
315 -- 326Christos Kaklamanis, Charalampos Konstantopoulos, Andreas Svolos. A Hypercube Algorithm for Sliding Window Compression
327 -- 342Abhijit Sengupta, Suresh Viswanathan. Deadlock-Free Fault-Tolerant Multicast Routing in Hypercubes
343 -- 358Josep Díaz, Jordi Petit, Maria J. Serna. Faulty Random Geometric Networks
359 -- 370Joonseon Ahn, Taisook Han. An Analytical Method for Parallelization of Recursive Functions
371 -- 382Soulla Louca, Neophytos Neophytou, Adrianos Lachanas, Paraskevas Evripidou. MPI-FT: Portable Fault Tolerance Scheme for MPI
383 -- 393Frédéric Gruau, John Tromp. Cellular Gravity

Volume 10, Issue 2/3

153 -- 164Pedro V. Artigas, Manish Gupta, Samuel P. Midkiff, José E. Moreira. Automatic Loop Transformations and Parallelization for Java
165 -- 176Edwin Rijpkema, Ed F. Deprettere, Bart Kienhuis. Deriving Process Networks from Nested Loop Algorithms
177 -- 188Vincent Loechner, Catherine Mongenet. Memory Cost Due to Anticipated Broadcast
189 -- 200Thomas Brandes. HPF Library and Compiler Support for Halos in Data Parallel Irregular Computations
201 -- 214Gabriel Antoniu, Luc Bougé, Raymond Namyst, Christian Pérez. Compiling Data-Parallel Programs to a Distributed Runtime Environment with Thread Isomigration
215 -- 226Daniel J. Quinlan. ROSE: Compiler Support for Object-Oriented Frameworks
227 -- 238Seon Wook Kim, Rudolf Eigenmann. Where Does the Speedup Go: Quantitative Modeling of Performance Losses in Shared-Memory Programs
239 -- 250Christoph A. Herrmann, Christian Lengauer. HDC: A Higher-Order Language for Divide-and-Conquer

Volume 10, Issue 1

1 -- 2Michel Cosnard. Editorial Note
3 -- 14Franck Petit, Vincent Villain. Optimality and Self-Stabilization in Rooted Tree Networks
15 -- 27Clémentin Tayou Djamégni, Maurice Tchuente. A New Algorithm for Dynamic Programming on Regular Arrays
29 -- 37Bong-Wan Kim, Jong Hyuk Choi, Kwang-Il Park, Kyu Ho Park. A Wormhole Router with Embedded Broadcasting Virtual Bus for Mesh Computers
39 -- 49Gianluca De Marco, Adele A. Rescigno. Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults
51 -- 58Sven Venema, Hong Shen, Francis Suraweera. NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
59 -- 72Hervé Guyennet, Michel Tréhel. Load Balancing Using Processor Groups
73 -- 86Chun-Mok Chung, Pil-Sup Shin, Shin-Dug Kim. An Effective Configuration Method for Java-Internet Computing Environment
87 -- 98Joonseon Ahn, Taisook Han. An Analytical Method for Parallelization of Recursive Functions
99 -- 110Mark Oskin, Lucian Vlad Lita, Frederic T. Chong, Justin Hensley, Diana Keen. Algorithmic Complexity with Page-Based Intelligent Memory
111 -- 132Voon-Yee Vee, Wen-Jing Hsu. Locality-Preserving Load-Balancing Mechanisms for Synchronous Simulations on Shared-Memory Multiprocessors
133 -- 140Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König. Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications
141 -- 150Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter. A Parallel Algorithm for Planar Orthogonal Grid Drawings