default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Parallel and Distributed Computing, Volume 26
Volume 26, Number 1, 1 April 1995
- Ted H. Szymanski
:
"Hypermeshes": Optical Intercomnnection Network for Parallel Computing. 1-23 - Ian T. Foster, K. Mani Chandy:
Fortran M: A Language for Modular Parallel Programming. 24-35 - Sabine R. Öhring, Sajal K. Das:
Incomplete Hypercubes: embeddings of Tree-Related Networks. 36-47 - Sanjeev Khanna, W. Kent Fuchs:
A Linear Time Algorithm for Sequential Diagnosis in Hypercubes. 48-53 - Sumit Sur, Pradip K. Srimani:
An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes. 54-60 - S. Whit, Anders Ålund, Vaidy S. Sunderam:
Performance of the NAS Parallel Benchmarks on PVM-Based Networks. 61-71 - Siddhartha Chatterjee, John R. Gilbert, Fred J. E. Long, Robert Schreiber, Shang-Hua Teng:
Generating Local Address and Communication Sets for Data-Parallel Programs. 72-84 - Raghu Karinthi, Kankanahalli Srinivas, George Almási:
A Parallel Algorithm for Computing Polygon Set Operations. 85-98 - Sanguthevar Rajasekaran, Suneeta Ramaswami:
Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane. 99-115 - K. Arvind, V. Kamakoti, C. Pandu Rangan:
Efficient Parallel Algorithms for Permutation Graphs. 116-124 - Christophe G. Giraud-Carrier, Tony R. Martinez:
Analysis of the Convergence and Generalization of AA1. 125-131 - David Peleg:
A Note on Optimal Time Broadcast in Faulty Hypercubes. 132-136
Volume 26, Number 2, 15 April 1995
- Gen-Huey Chen, Stephan Olariu, James L. Schwing, Biing-Feng Wang, Jingyuan Zhang:
Constant-Time Tree algorithms on Reconfigurable Meshes on Size n x n. 137-150 - Piyush Maheshwari:
Partitioning and Scheduling of Parallel Functional Programs for Larger Grain. 151-165 - Manhoi Choy, Ambuj K. Singh:
Efficient Implementation of Synchronous Communication over Asynchronous Networks. 166-180 - Ernst W. Mayr, Ralph Werchner:
Optimal Routing of Parentheses on the Hypercube. 181-192 - Fredrik Dahlgren, Per Stenström:
Using Write Caches to Improve Performance of Cache Coherence Protocols in Shared-Memory Multiprocessors. 193-210 - Ambuj K. Singh:
A Framework for Programming with Nonatomic Memories. 211-224 - Alain Billionnet, Sourour Elloumi:
An Algorithm for Finding the K-Best Allocations of a Tree Structured Program. 225-232 - Sourav Bhattacharya, Thomas F. Keefe, Wei-Tek Tsai:
Covert Channel Secure Hypercube Message Communication. 233-247 - André Seznec, Jacques Lenfant:
Odd Memory Systems: A New Approach. 248-256 - Sanguthevar Rajasekaran, Mukund Raghavachari:
A Randomized Algorithm for Multipacket Routing on the Mesh. 257-260 - Rajendra V. Boppana, Cauligi S. Raghavendra:
On Methods to Align and Access Data Arrays in Parallel Computers. 261-269
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 2026-08-06 22:41 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
