default search action
Parallel Processing Letters, Volume 2, 1992
Volume 2, 1992
- Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater:
Construction of Large Packet Radio Networks. 3-12 - Rainer Feldmann, Walter Unger:
The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. 13-19 - Mitchell Flatebo, Ajoy Kumar Datta:
Distributed Deadlock Detection Algorithms. 21-30 - Pilar de la Torre, Raymond Greenlaw, Teresa M. Przytycka:
Optimal Tree Ranking is in NC. 31-41 - Lorrie Fava Lindon:
Discriminating Analysis and Ist Application to Matrix by Vector Multiplication on the Pram. 43-50 - B. V. Purushotham, Anirban Basu, P. Sreenivasa Kumar, Lalit M. Patnaik:
Performance Estimation of LU Factorisation on Message Passing Multiprocessors. 51-60 - Michael Griebel:
The Combination Technique for the Sparse Grid Solution of PDE's on Multiprocessor Machines. 61-70 - Do-Hyung Kim, Kwang-Moo Choe, Taisook Han:
Refined Mark(s)-Set-Based Backtrack Literal Selection for and Parallelism in Logic Programs. 71-79 - Stuart Ullman, Bhagirath Narahari:
Mapping Binary Precedence Trees to Hypercubes. 81-87 - Ramesh Krishnamurti, Bhagirath Narahari:
Optimal Subcube Assignment for Partitionable Hypercubes. 89-95 - Jean Frédéric Myoupo:
Synthesizing Linear Systolic Arrays for Dynamic Programming Problems. 97-110 - Khaled A. Aly, Patrick W. Dowd:
Reconfigarable Parallel Computer Architecture Based on Wavelenght-Division Multiplexed Optical Interconnection Network. 117-127 - Suresh Rai, Jerry L. Trahan:
A Reconfiguration Technique for Fault Tolerance in a Hypercube. 129-138 - Antonio Corradi, Letizia Leonardi, Franco Zambonelli:
Load Balancing Strategies for Massively Parallel Architectures. 139-148 - Wen-Jing Hsu, Carl V. Page:
Embedding Mesh in a Large Family of Graphs. 149-155 - Stephan Olariu, Zhaofang Wen:
A Parallel Algorithm for Forest Reconstruction. 157-160 - C. S. Yang, Y. M. Tsai, C. Y. Liu:
Performance Evaluation of Multicast Wormhole Routing in D-Torus Multicomputers. 161-170 - Sumit Sur, Pradip K. Srimani:
A Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph. 171-179 - David J. Haglin:
Approximating Maximum 2-CNF Satisfiability. 181-187 - Sarnath Ramnath:
DTML is Logspace Hard under NC1 Reductions. 189-193 - Michel Gastaldo, Michel Morvan, John Michael Robson:
Transitive Closure in Parallel on a Linear Network of Processors. 195-203 - Ian Parberry:
The Pairwise Sorting Network. 205-211 - Miroslaw Kutylowski, Rolf Wanka:
Periodic Sorting on Two-Dimensional Meshes. 213-220 - Pascal Berthomé:
Efficient K-Selection in Hypercube Multiprocessors. 221-230 - Selim G. Akl, Ivan Stojmenovic:
A Simple Optimal Systolic Algorithm for Generating Permutations. 231-239 - Hassan Elhage, Ivan Stojmenovic:
Systolic Generation of combinations from Arbitrary Elements. 241-248 - Dharmavani Bhagavathi, Stephan Olariu, James L. Schwing, Jingyuan Zhang:
Convex Polygon Problems on Meshes with Multiple Broadcasting. 249-256 - A. T. Ali, Erik L. Dagless:
A Parallel Processing Model for Real-Time Computer Vision-Aided Road Traffic Monitoring. 257-264 - Weng-Fai Wong, Chung-Kwong Yuen:
A Model of Speculative Parallelism. 265-272 - Michael Barnett, Christian Lengauer:
Unimodularity and the Prallelization of Loops. 273-281 - Abdelmadjid Bouabdallah, Jean-Claude König:
An Improvement of Maekawa's Mutual Exclusion Algorithm to Make It Fault-Tolerant. 283-290 - Anatoly E. Doroshenko:
On Asynchronous Avoidance of Deadlocks in Parallel Programs. 291-297 - Giulia Galbiati, Francesco Maffioli:
Constructing an Exact Parity Base Is in RNC2. 301-309 - Svante Carlsson, Jingsen Chen:
Parallel Constructions of Heaps and Min-Max Heaps. 311-320 - Eliezer A. Albacea:
Computation List Evaluation and Ist Applications. 321-329 - Terry Bossomaier, Natalina Isidoro, Adrian Loeff:
Dara Parallel Computation of Euclidean Distance Transforms. 331-339 - Bogdan S. Chlebus:
Two Selection Algorithms on a Mesh-Connected Computer. 341-346 - José Duato:
Channel Classes: A New Concept for Deadlock Avoidance in Wormhole Networks. 347-354 - Andrzej Pelc:
Broadcasting time in Sparse Networks with Faulty Transmissions. 355-361 - Evripidis Bampis, Jean-Claude König, Denis Trystram:
A Low Overhead Schedule for a 3D-Grid Graph. 363-372 - Patrick M. Lenders:
Multi-Rate Arrays and Affince Recurrence Equations. 373-380 - Ivan De Falco, Renato Del Balio, Ernesto Tarantino, Roberto Vaccaro:
Simulation of Genetic Algorithms on MIMD Multicomputers. 381-389 - Theodore Johnson, Timothy A. Davis:
Parallel Buddy Memory Management. 391-398
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.