default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Processing Letters, Volume 7, 1997
Volume 7, Number 1, March 1997
- Andrzej Lingas, Anil Maheshwari:
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree. 3-11 - Mallika De, Bhabani P. Sinha:
Fast Parallel Multiplication Using Redundant Quarternary Number System. 13-23 - Christos D. Zaroliagis
:
Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem. 25-37 - Michele Flammini:
On the Hardness of Devising Interval Routing Schemes. 39-47 - Yaagoub Ashir, Iain A. Stewart:
On Embedding Cycles in k-Ary n-Cubes. 49-55 - Adele A. Rescigno:
Fault-Tolerant Parallel Communication in the Star Network. 57-68 - Adam Malinowski:
Efficient Byzantine Agreement in Networks with Random Faults. 69-76 - Shahram Latifi, Ramesh Gajjala:
Reliability Evaluation of Braided Networks Using a Recursive Method. 77-88 - Tim Brecht, Xiaotie Deng, Nian Gu:
Competitive Dynamic Multiprocessor Allocation for Parallel Applications. 89-100 - Jean-Paul Bodeveix, Mamoun Filali:
Towards the Automatic Verification of Atomic Memory Protocols. 101-112
Volume 7, Number 2, June 1997
- Jean-Francois Collard, Martin Griebl:
Array Dataflow Analysis for Explicitly Parallel Programs. 117-131 - Alain Darte, Frédéric Vivien:
Parallelizing Nested Loops with Approximations of Distance Vectors: A Survey. 133-144 - Manish Gupta, Edith Schonberg:
Static Analysis to Reduce Synchronization Costs in Data-Parallel Programs with Remote Memory Copy. 145-156 - Chi-Chung Lam, P. Sadayappan, Rephael Wenger:
On Optimizing a Class of Multi-Dimensional Loops with Reductions for Parallel Execution. 157-168 - Hyuk-Jae Lee, José A. B. Fortes:
Modular Mappings and Data Distribution Independent Computations. 169-180 - Patrice Quinton, Sanjay V. Rajopadhye, Tanguy Risset:
On Manipulating Z-Polyhedra Using a Canonical Representation. 181-194 - Arun Venkatachar, J. Ramanujam, Ashwath Thirumalai:
Communication Generation for Block-Cyclic Distributions. 195-202 - Doran Wilde, Sanjay V. Rajopadhye:
Memory Reuse Analysis in the Polyhedral Model. 203-215
Volume 7, Number 3, September 1997
- Sanguthevar Rajasekaran, Sartaj Sahni:
Determinisitic Routing on the Array with Reconfigurable Optical Buses. 219-224 - Petrisor Panaite:
Routing Permutations on a 2D Grid with On-Way Edges. 225-235 - Maurelio Boari, Antonio Corradi, Cesare Stefanelli, Letizia Leonardi:
A Routing Strategy for Object-Oriented Applications in Massively Parallel Architectures. 237-247 - Paul G. Spirakis, Vassilis Triantafillou:
Pure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations. 249-258 - Frank K. Hwang, Tzai-Shunne Lin, Rong-Hong Jan:
A Permutation Routing Algorithm for Double Loop Networks. 259-265 - Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih:
Parallel Algorithms for Single-Layer Channel Routing. 267-277 - Chihming Chang, Rami G. Melhem:
Arbitrary Size Benes Networks. 279-284 - Jin-Soo Kim, Seung Ryoul Maeng, Hyunsoo Yoon:
Ring Embedding in Hypercubes with Faculty Nodes. 285-296 - Daniel S. Hirschberg, Lynn M. Stauffer:
Dictionary Compression on the PRAM. 297-308 - Nadjib Badache, Aomar Maddi:
Gradual Design of a Causal Broadcast Protocol. 309-320 - Marina Papatriantafilou, Philippas Tsigas:
On Self-Stabilizing Wait-Free Clock Synchronization. 321-328 - Mourad Debbabi:
A Model-Based Concurrent Specification Language Over CML: Semantic Foundations. 329-356
Volume 7, Number 4, December 1997
- Xin Yuan, Rajiv Gupta, Rami G. Melhem:
Demand-Driven Data Flow Analysis for Communication Optimization. 359-370 - Ulrich Kremer:
Optimal and Near-Optimal Solutions for Hard Compilation Problems. 371-378 - Alain Darte, Georges-André Silber, Frédéric Vivien:
Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling. 379-392 - Wesley K. Kaplow, Boleslaw K. Szymanski:
Compile-Time Cache Performance Prediction and its Application to Tiling. 393-407 - Jingling Xue:
On Tiling as a Loop Transformation. 409-424 - Yunheung Paek, David A. Padua:
Compiling for Scalable Multiprocessors with Polaris. 425-436 - Robert Schreiber:
High Performance Fortran, Version 2. 437-449
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-16 21:51 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:
