default search action
Parallel Processing Letters, Volume 6, 1996
Volume 6, Number 1, March 1996
- Brian Grayson, Robert A. van de Geijn
:
A High Performance Parallel Strassen Implementation. 3-12 - Clémentin Tayou Djamégni, Maurice Tchuenté:
Scheduling of the DAG Associated with Pipeline Inversion of Triangular Matrices. 13-26 - Ivan Stojmenovic:
Generating n-Ary Reflected Gray Codes on a Linear Array of Processors. 27-34 - Dany Breslauer, Ramesh Hariharan:
Optimal Parallel Construction of Minimal Suffix and Factor Automata. 35-44 - Min-You Wu:
A Parallel Scheduling Algorithm for Tree Structured Interconnection Networks. 45-54 - Marios D. Dikaiakos, Anne Rogers, Kenneth Steiglitz:
Functional Algorithm Simulation of the Fast Multipole Method: Architectural Implications. 55-66 - Andreas A. Veglis
Memory Bandwidth Analysis of Shared-Memory Multiprocessors Using Dynamic Request Rate. 67-74 - Geunmo Kim, Hyunsoo Yoon:
Free Submesh List Strategy: a Best Fit Submesh Allocation in Mesh Connected Multicomputers. 75-86 - Yosi Ben-Asher, Assaf Schuster:
Low Crosstalk Address Encodings for Optical Message Switching Systems. 87-100 - André Hily, Dominique Sotteau:
Gossiping in d-Dimensional Mesh-Bus Networks. 101-113 - Krishnamurthi Ravishankar, Suresh Singh:
Gossiping on a Ring with Radios. 115-126 - Qian-Ping Gu, Shietung Peng:
Fault Tolerant Routing in Hypercubes and Star Graphs. 127-136 - David M. Koppelman:
A Lower Bound on the Average Physical Length of Edges in the Physical Realization of Graphs. 137-143 - Alain Darte, Michèle Dion, Yves Robert:
A Characterization of One-to-One Modular Mappings. 145-157 - Jordi Garcia
Using a 0-1 Integer Programming Model for Automatic Static Data Distribution. 159-171 - Wesley K. Kaplow, Boleslaw K. Szymanski
Program Optimization Based on Compile-Time Cache Performance Prediction. 173-184
Volume 6, Number 2, June 1996
- Joseph F. JáJá, Kwan Woo Ryu:
An Optimal Randomized Parallel Algorithm for the Single Function Coarsest Partition Problem. 187-193 - Clive N. Galley:
AN Omega(log n-k log k) TIME LINEAR COST LOWER BOUND FOR THE k FUNCTIONS COARSEST PARTITION PROBLEM. 195-202 - Jean-Louis Roch, Gilles Villard:
Fast Parallel Computation of the Jordan Normal Form of Matrices. 203-212 - Paolo Ferragina
Three Techniques for Parallel Maintenance of a Minimum Spanning Tree under Batch of Updates. 213-222 - Shiva Chaudhuri, Yannis Dimopoulos, Christos D. Zaroliagis:
On the Parallel Complexity of Acyclic Logic Programs. 223-230 - Yosi Ben-Asher, Assaf Schuster:
Time-Size Tradeoffs for Reconfigurable Meshes. 231-245 - Chris Armen, Donald B. Johnson:
Deterministic Leader Election on the Asynchronous QRQW PRAM. 247-250 - J. Allen Carruth, Jayadev Misra:
Proof of a Real-Time Mutual-Exclusion Algorithm. 251-257 - Ambuj K. Singh:
Bounded Timestamps in Process Networks. 259-264 - Masaaki Mizuno, Mitchell L. Neilsen, Michel Raynal:
An Optimistic Protocol for a Linearizable Distributed Shared Memory System. 265-278 - Zully N. Grant-Duff, Peter G. Harrison
Parallelism via Homomorphisms. 279-295
Volume 6, Number 3, September 1996
- Costas S. Iliopoulos, Maureen Korda:
Optimal Parallel Superprimitivity Testing for Square Arrays. 299-308 - Giulio Destri, Paolo Marenzoni:
Benchmarking Lattice-Based Applications on Parallel Architectures. 309-320 - Martin Fürer
Parallel Edge Coloring Approximation. 321-329 - Biing-Feng Wang:
A Better Analysis of Ben-Asher's Algorithm for the Conditional Cartesian Product Problem. 331-344 - Kuo-Liang Chung:
Image Template Matching on Reconfigurable Meshes. 345-353 - Michael P. Bekakos, Odysseas Efremides:
A Class of Systolic Tridiagonal Linear Solvers. 355-364 - José M. Claver
Solving Discrete-Time Lyapunov Equations for the Cholesky Factor on a Shared Memory Multiprocessor. 365-376 - Ronald Fernandes, Arkady Kanevsky:
On Recursive Interconnection Networks and their Extensions. 377-388 - David M. Nicol, Weizhen Mao:
On Bottleneck Partitioning of k-Ary n-Cubes. 389-399 - Jingling Xue
Generalising the Unimodular Approach to Restructure Imperfectly Nested Loops. 401-414 - Yann Le Guyadec, Bernard Virot:
Sequential-like Proofs of Data-Parallel Programs. 415-426 - Claude Jard, Guy-Vincent Jourdan:
Incremental Transitive Dependency Tracking in Distributed Computations. 427-435
Volume 6, Number 4, December 1996
- Madhumangal Pal, G. P. Bhattacharjee:
An Optimal Parallel Algorithm to Color an Interval Graph. 439-449 - Danny Z. Chen, Xiaobo Sharon Hu:
Fast and Efficient Operations on Parallel Priority Queues. 451-467 - Ding-Ming Kwai, Behrooz Parhami:
A Generalization of Hypercubic Networks Based on their Chordal Ring Structures. 469-477 - Pradip K. Srimani:
Super Rotator: Incrementally Extensible Directed Network Graph of Sublogarithmic Diameter. 479-490 - David Cachera, Gil Utard:
Proving Data-Parallel Programs: a Unifying Approach. 491-505 - Luis Díaz de Cerio
Communication Pipelining in Hypercubes. 507-523 - Christoph Armin Herrmann, Christian Lengauer:
On the Space-Time Mapping of a Class of Divide-and-Conquer Recursions. 525-537 - Chris J. Scheiman, Peter R. Cappello:
A Processor-Time-Minimal Design for 3D Rectilinear Mesh Algorithms. 539-550 - Ajay K. Gupta
Applications of Evolutionary Strategies to Fine-Grained Task Scheduling. 551-561 - Bu-Sung Lee, Alfred Heng, Wentong Cai
Task Scheduling Facility for PVM. 563-574 - Hava T. Siegelmann:
On NIL: the Software Constructor of Neural Networks. 575-582 - Dominique Ambroise, Brigitte Rozoy:
Marrella: a Tool to Analyse the Graph of States. 583-594
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.
last updated on 2025-01-15 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: