Sciweavers

Share
IPPS
1997
IEEE
9 years 9 months ago
Broadcasting and Multicasting in Cut-through Routed Networks
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
Johanne Cohen, Pierre Fraigniaud, Jean-Claude K&ou...
IPPS
1997
IEEE
9 years 9 months ago
An Accurate Model for the Performance Analysis of Deterministic Wormhole Routing
We present a new analytical approach for the performance evaluation of asynchronous wormhole routing in k-ary n-cubes. Through the analysis of network flows, our methodology furni...
Bruno Ciciani, Claudio Paolucci, Michele Colajanni
IPPS
1997
IEEE
9 years 9 months ago
Distributed Submesh Determination in Faulty Tori and Meshes
Torus/mesh-based machines have received increasing attention. It is natural to identify the maximum healthy submeshes in a faulty torus/mesh so as to lower potential performance d...
Hsing-Lung Chen, Shu-Hua Hu
IPPS
1997
IEEE
9 years 9 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
IPPS
1997
IEEE
9 years 9 months ago
Coarse Grained Parallel Next Element Search
Albert Chan, Frank K. H. A. Dehne, Andrew Rau-Chap...
IPPS
1997
IEEE
9 years 9 months ago
Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer System
Abstract — Processor scheduling has received considerable attention in the context of shared-memory multiprocessor systems but has not received as much attention in distributed-m...
Yuet-Ning Chan, Sivarama P. Dandamudi, Shikharesh ...
IPPS
1997
IEEE
9 years 9 months ago
A BSP Approach to the Scheduling of Tightly-Nested Loops
This paper addresses the scheduling of uniformdependence loop nests within the framework of the bulksynchronous parallel (BSP) model. Two broad classes of tightly-nested loops are...
Radu Calinescu
IPPS
1997
IEEE
9 years 9 months ago
A Parallel Priority Data Structure with Applications
We present a parallel priority data structure that improves the running time of certain algorithms for problems that lack a fast and work-efficient parallel solution. As a main a...
Gerth Stølting Brodal, Jesper Larsson Tr&au...
books