default search action
Parallel Processing Letters, Volume 10, 2000
Volume 10, Number 1, March 2000
- Michel Cosnard:
Editorial Note. Parallel Process. Lett. 10(1): 1-2 (2000) - Franck Petit, Vincent Villain:
Optimality and Self-Stabilization in Rooted Tree Networks. 3-14 - Clémentin Tayou Djamégni, Maurice Tchuenté:
A New Algorithm for Dynamic Programming on Regular Arrays. 15-27 - Bong Wan Kim, Jong Hyuk Choi, Kwang-Il Park, Kyu Ho Park:
A Wormhole Router with Embedded Broadcasting Virtual Bus for Mesh Computers. 29-37 - Gianluca De Marco, Adele A. Rescigno:
Tighter Time Bounds on Broadcasting in Torus Networks in Presence of Dynamic Faults. 39-49 - Sven Venema, Hong Shen, Francis Suraweera:
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths. 51-58 - Hervé Guyennet, Michel Tréhel:
Load Balancing Using Processor Groups. 59-72 - Chun-Mok Chung, Pil-Sup Shin, Shin-Dug Kim:
An Effective Configuration Method for Java-Internet Computing Environment. 73-86 - Joonseon Ahn, Taisook Han:
An Analytical Method for Parallelization of Recursive Functions. 87-98 - Mark Oskin, Lucian Vlad Lita, Frederic T. Chong, Justin Hensley, Diana Keen:
Algorithmic Complexity with Page-Based Intelligent Memory. 99-110 - Voon-Yee Vee, Wen-Jing Hsu:
Locality-Preserving Load-Balancing Mechanisms for Synchronous Simulations on Shared-Memory Multiprocessors. 111-132 - Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. 133-140 - Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott Vitter:
A Parallel Algorithm for Planar Orthogonal Grid Drawings. 141-150
Volume 10, Number 2/3, June/September 2000
- Pedro V. Artigas, Manish Gupta, Samuel P. Midkiff, José E. Moreira:
Automatic Loop Transformations and Parallelization for Java. 153-164 - Edwin Rijpkema, Ed F. Deprettere, Bart Kienhuis:
Deriving Process Networks from Nested Loop Algorithms. 165-176 - Vincent Loechner, Catherine Mongenet:
Memory Cost Due to Anticipated Broadcast. 177-188 - Thomas Brandes:
HPF Library and Compiler Support for Halos in Data Parallel Irregular Computations. 189-200 - Gabriel Antoniu, Luc Bougé, Raymond Namyst, Christian Pérez:
Compiling Data-Parallel Programs to a Distributed Runtime Environment with Thread Isomigration. 201-214 - Daniel J. Quinlan:
ROSE: Compiler Support for Object-Oriented Frameworks. 215-226 - Seon Wook Kim, Rudolf Eigenmann:
Where Does the Speedup Go: Quantitative Modeling of Performance Losses in Shared-Memory Programs. 227-238 - Christoph A. Herrmann, Christian Lengauer:
HDC: A Higher-Order Language for Divide-and-Conquer. 239-250
Volume 10, Number 4, December 2000
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. 253-266 - Jacek Blazewicz, Frédéric Guinand, Bernard Penz, Denis Trystram:
Scheduling Complete Trees on Two Uniform Processors with Integer Speed Ratios and Communication Delays. 267-278 - Jie Wu:
On Finding a Hamiltonian Path in a Tournament Using Semi-Heap. 279-294 - Miriam Di Ianni:
Wormhole Deadlock Prediction. 295-304 - Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Symmetric Communication in All-Optical Tree Networks. 305-314 - Christos Kaklamanis, Charalampos Konstantopoulos, Andreas Svolos:
A Hypercube Algorithm for Sliding Window Compression. 315-326 - Abhijit Sengupta, Suresh Viswanathan:
Deadlock-Free Fault-Tolerant Multicast Routing in Hypercubes. 327-342 - Josep Díaz, Jordi Petit, Maria J. Serna:
Faulty Random Geometric Networks. 343-358 - Joonseon Ahn, Taisook Han:
An Analytical Method for Parallelization of Recursive Functions. 359-370 - Soulla Louca, Neophytos Neophytou, Adrianos Lachanas, Paraskevas Evripidou:
MPI-FT: Portable Fault Tolerance Scheme for MPI. 371-382 - Frédéric Gruau, John Tromp:
Cellular Gravity. 383-393
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.