default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Parallel and Distributed Computing, Volume 44, 1997
Volume 44, Number 1, 10 July 1997
- Hsien-Kuang Chiou, Willard Korfhage:
Detecting ENF Event Predicates in Distributed Systems. 1-13 - Ravi V. Shankar, Sanjay Ranka
:
Random Data Accesses on a Coarse-Grained Parallel Machine I: One-to-One Mappings. 14-23 - Ravi V. Shankar, Sanjay Ranka:
Random Data Accesses on a Coarse-Grained Parallel Machine II: One-to-One, Many-to-One Mappings. 24-34 - Yan Alexander Li, John K. Antonio, Howard Jay Siegel, Min Tan, Daniel W. Watson:
Determining the Execution Time Distribution for a Data Parallel Program in a Heterogeneous Computing Environment. 35-52 - Paul J. Murtagh, Ah Chung Tsoi:
A Reconfigurable Bit-Serial VLSI Systolic Array Neuro-Chip. 53-70 - Albert D. Alexandrov, Mihai F. Ionescu, Klaus E. Schauser, Chris J. Scheiman:
LogGP: Incorporating Long Messages into the LogP Model for Parallel Computation. 71-79 - David Hawking:
A Distributed Memory Algorithm for Lexicon Building. 80-87 - Min-You Wu, Wei Shu:
DDE: A Modified Dimension Exchange Method for Load Balancing in k-ary n-Cubes. 88-96
Volume 44, Number 2, 1 August 1997
- Stefan Thomas Obenaus, Ted H. Szymanski:
Embeddings of Star Graphs into Optical Meshes without Bends. 97-106 - K. Bhuvaneswari, K. N. Balasubramanya Murthy, C. Siva Ram Murthy:
A New and Faster Gaussian Elimination Based Fault Tolerant Systolic Linear System Solver. 107-122 - G. Manimaran, C. Siva Ram Murthy, Machiraju Vijay, Krithi Ramamritham:
New Algorithms for Resource Reclaiming from Precedence Constrained Tasks in Multiprocessor Real-Time Systems. 123-132 - Fikret Erçal, Hsi-Chieh Lee:
Time-Efficient Maze Routing Algorithms on Reconfigurable Mesh Architectures. 133-140 - Trevor E. Meyer, James A. Davis, Jennifer L. Davidson:
Analysis of Load Average and its Relationship to Program Run Time on Networks of Workstations. 141-146 - Qian-Ping Gu, Hisao Tamaki:
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths. 147-152 - Clémentin Tayou Djamégni, Maurice Tchuenté:
A Cost-Optimal Pipeline Algorithm for Permutation Generation in Lexicographic Order. 153-159
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-11-15 19:22 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:
