Journal: Parallel Processing Letters

Volume 6, Issue 4

439 -- 449Madhumangal Pal, G. P. Bhattacharjee. An Optimal Parallel Algorithm to Color an Interval Graph
451 -- 467Danny Z. Chen, Xiaobo Sharon Hu. Fast and Efficient Operations on Parallel Priority Queues
469 -- 477Ding-Ming Kwai, Behrooz Parhami. A Generalization of Hypercubic Networks Based on their Chordal Ring Structures
479 -- 490Pradip K. Srimani. Super Rotator: Incrementally Extensible Directed Network Graph of Sublogarithmic Diameter
491 -- 505David Cachera, Gil Utard. Proving Data-Parallel Programs: a Unifying Approach
507 -- 523Luis Díaz de Cerio, Antonio González, Miguel Valero-García. Communication Pipelining in Hypercubes
525 -- 537Christoph Armin Herrmann, Christian Lengauer. On the Space-Time Mapping of a Class of Divide-and-Conquer Recursions
539 -- 550Chris J. Scheiman, Peter R. Cappello. A Processor-Time-Minimal Design for 3D Rectilinear Mesh Algorithms
551 -- 561Ajay K. Gupta, Garrison W. Greenwood. Applications of Evolutionary Strategies to Fine-Grained Task Scheduling
563 -- 574Bu-Sung Lee, Alfred Heng, Wentong Cai, Tai-Ann Tan. Task Scheduling Facility for PVM
575 -- 582Hava T. Siegelmann. On NIL: the Software Constructor of Neural Networks
583 -- 594Dominique Ambroise, Brigitte Rozoy. Marrella: a Tool to Analyse the Graph of States

Volume 6, Issue 3

299 -- 308Costas S. Iliopoulos, Maureen Korda. Optimal Parallel Superprimitivity Testing for Square Arrays
309 -- 320Giulio Destri, Paolo Marenzoni. Benchmarking Lattice-Based Applications on Parallel Architectures
321 -- 329Martin Fürer, Balaji Raghavachari. Parallel Edge Coloring Approximation
331 -- 344Biing-Feng Wang. A Better Analysis of Ben-Asher s Algorithm for the Conditional Cartesian Product Problem
345 -- 353Kuo-Liang Chung. Image Template Matching on Reconfigurable Meshes
355 -- 364M. P. Bekakos, O. B. Efremides. A Class of Systolic Tridiagonal Linear Solvers
365 -- 376José M. Claver, Vicente Hernández, Enrique S. Quintana-Ortí. Solving Discrete-Time Lyapunov Equations for the Cholesky Factor on a Shared Memory Multiprocessor
377 -- 388Ronald Fernandes, Arkady Kanevsky. On Recursive Interconnection Networks and their Extensions
389 -- 399David M. Nicol, Weizhen Mao. On Bottleneck Partitioning of k-Ary n-Cubes
401 -- 414Jingling Xue. Generalising the Unimodular Approach to Restructure Imperfectly Nested Loops
415 -- 426Yann Le Guyadec, Bernard Virot. Sequential-like Proofs of Data-Parallel Programs
427 -- 435Claude Jard, Guy-Vincent Jourdan. Incremental Transitive Dependency Tracking in Distributed Computations

Volume 6, Issue 2

187 -- 193Joseph JáJá, Kwan Woo Ryu. An Optimal Randomized Parallel Algorithm for the Single Function Coarsest Partition Problem
195 -- 202Clive N. Galley. AN Omega(log n-k log k) TIME LINEAR COST LOWER BOUND FOR THE k FUNCTIONS COARSEST PARTITION PROBLEM
203 -- 212Jean-Louis Roch, Gilles Villard. Fast Parallel Computation of the Jordan Normal Form of Matrices
213 -- 222Paolo Ferragina, Fabrizio Luccio. Three Techniques for Parallel Maintenance of a Minimum Spanning Tree under Batch of Updates
223 -- 230Shiva Chaudhuri, Yannis Dimopoulos, Christos D. Zaroliagis. On the Parallel Complexity of Acyclic Logic Programs
231 -- 245Yosi Ben-Asher, Assaf Schuster. Time-Size Tradeoffs for Reconfigurable Meshes
247 -- 250Chris Armen, Donald B. Johnson. Deterministic Leader Election on the Asynchronous QRQW PRAM
251 -- 257J. Allen Carruth, Jayadev Misra. Proof of a Real-Time Mutual-Exclusion Algorithm
259 -- 264Ambuj K. Singh. Bounded Timestamps in Process Networks
265 -- 278Masaaki Mizuno, Mitchell L. Neilsen, Michel Raynal. An Optimistic Protocol for a Linearizable Distributed Shared Memory System
279 -- 295Zully N. Grant-Duff, Peter G. Harrison. Parallelism via Homomorphisms

Volume 6, Issue 1

3 -- 12Brian Grayson, Robert A. van de Geijn. A High Performance Parallel Strassen Implementation
13 -- 26Clémentin Tayou Djamégni, Maurice Tchuente. Scheduling of the DAG Associated with Pipeline Inversion of Triangular Matrices
27 -- 34Ivan Stojmenovic. Generating n-Ary Reflected Gray Codes on a Linear Array of Processors
35 -- 44Dany Breslauer, Ramesh Hariharan. Optimal Parallel Construction of Minimal Suffix and Factor Automata
45 -- 54Min-You Wu. A Parallel Scheduling Algorithm for Tree Structured Interconnection Networks
55 -- 66Marios D. Dikaiakos, Anne Rogers, Kenneth Steiglitz. Functional Algorithm Simulation of the Fast Multipole Method: Architectural Implications
67 -- 74Andreas A. Veglis, Andreas S. Pombortsis. Memory Bandwidth Analysis of Shared-Memory Multiprocessors Using Dynamic Request Rate
75 -- 86Geunmo Kim, Hyunsoo Yoon. Free Submesh List Strategy: a Best Fit Submesh Allocation in Mesh Connected Multicomputers
87 -- 100Yosi Ben-Asher, Assaf Schuster. Low Crosstalk Address Encodings for Optical Message Switching Systems
101 -- 113André Hily, Dominique Sotteau. Gossiping in d-Dimensional Mesh-Bus Networks
115 -- 126Krishnamurthi Ravishankar, Suresh Singh. Gossiping on a Ring with Radios
127 -- 136Qian-Ping Gu, Shietung Peng. Fault Tolerant Routing in Hypercubes and Star Graphs
137 -- 143David M. Koppelman. A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs
145 -- 157Alain Darte, Michèle Dion, Yves Robert. A Characterization of One-to-One Modular Mappings
159 -- 171Jordi Garcia, Eduard Ayguadé, Jesús Labarta. Using a 0-1 Integer Programming Model for Automatic Static Data Distribution
173 -- 184Wesley K. Kaplow, Boleslaw K. Szymanski. Program Optimization Based on Compile-Time Cache Performance Prediction