default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Parallel and Distributed Computing, Volume 35, 1996
Volume 35, Number 1, 25 May 1996
- Allan Gottlieb, Kai Hwang, Sartaj Sahni:
Editorial Announcement. J. Parallel Distributed Comput. 35(1): 1 (1996) - Gwen Clarke, David T. Barnard:
An LR Substring Parser Applied in a Parallel Environment. 2-17 - Dror G. Feitelson
, Larry Rudolph:
Evaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical Control. 18-34 - Junguk L. Kim, Geneva G. Belford:
A Distributed Election Protocol for Unreliable Networks. 35-42 - Mohamed G. Gouda, F. Furman Haddix:
The Stabilizing Token Ring in Three Bits. 43-48 - Lawrence L. Larmore, Teresa M. Przytycka:
A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees. 49-56 - Cauligi S. Raghavendra, M. A. Sridhar:
Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes. 57-66 - Kenneth F. Wong, Mark A. Franklin:
Checkpointing in Distributed Computing Systems. 67-75 - Greg Eisenhauer, Karsten Schwan:
Design and Analysis of a Parallel Molecular Dynamics Application. 76-90 - Ravikanth Ganesan, Kannan Govindarajan, Min-You Wu:
Comparing SIMD and MIMD Programming Modes. 91-96 - Xuemin Lin, Maria E. Orlowska:
An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management. 97-103 - Kemal Efe:
Embedding Large Complete Binary Trees in Hypercubes with Load Balancing. 104-109
Volume 35, Number 2, 15 June 1996
- Michael Barnett, David G. Payne, Robert A. van de Geijn, Jerrell Watts:
Broadcasting on Meshes with Wormhole Routing. 111-122 - Yeong-Sheng Chen, Sheng-De Wang, Chien-Min Wang:
Tiling Nested Loops into Maximal Rectangular Blocks. 123-132 - David S. Greenberg, James K. Park, Eric J. Schwabe:
The Cost of Complex Communication on Simple Networks. 133-141 - John May, Francine Berman:
Retargetability and Extensibility in a Parallel Debugger. 142-155 - Yong Yan, Xiaodong Zhang, Haixu Yang:
A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies. 156-172 - David A. Bader, Joseph F. JáJá:
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. 173-190 - Nabanita Das, Jayasree Dattagupta:
Two-Pass Rearrangeability in Faulty Benes Networks. 191-198 - Douglas Antony Louis Piriyakumar, C. Siva Ram Murthy:
Optimal Compile-Time Multiprocessor Scheduling Based on the 0-1 Linear Programming Algorithm with the Branch and Bound Technique. 199-204 - Kuo-Liang Chung, Wen-Ming Yan:
Parallel B-Spline Surface Fitting on Mesh-Connected Computers. 205-210 - Sunggu Lee, Jong Kim:
Path Selection for Message Passing in a Circuit-Switched Multicomputer. 211-218
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 2024-09-23 23:30 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
