Sciweavers

IPPS
1999
IEEE
13 years 7 months ago
Fully-Scalable Fault-Tolerant Simulations for BSP and CGM
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The faults are deterministic (i...
Sung-Ryul Kim, Kunsoo Park
IPPS
1999
IEEE
13 years 7 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
IPPS
1999
IEEE
13 years 7 months ago
A Network Status Predictor to Support Dynamic Scheduling in Network-Based Computing Systems
The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth r...
JunSeong Kim, David J. Lilja
IPPS
1999
IEEE
13 years 7 months ago
Fault-Tolerant Routing Algorithms for Hypercube Networks
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Keiichi Kaneko, Hideo Ito
IPPS
1999
IEEE
13 years 7 months ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
IPPS
1999
IEEE
13 years 7 months ago
A Communication Latency Hiding Parallelization of a Traffic Flow Simulation
This work implements and analyses a highway traffic flow simulation based on continuum modeling of traffic dynamics. A traffic-flow simulation was developed and mapped onto a para...
Charles Michael Johnston, Anthony T. Chronopoulos
IPPS
1999
IEEE
13 years 7 months ago
Application Performance of a Linux Cluster Using Converse
Abstract. Clusters of PCs are an attractive platform for parallel applications because of their cost effectiveness. We have implemented an interoperable runtime system called Conve...
Laxmikant V. Kalé, Robert Brunner, James C....
IPPS
1999
IEEE
13 years 7 months ago
Evolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors
The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to...
Piotr Jedrzejowicz, Ireneusz Czarnowski, Henryk Sz...
IPPS
1999
IEEE
13 years 7 months ago
PARADIGM (version 2.0): A New HPF Compilation System
In this paper,a we present sample performance figures for a new linear algebra-based compilation framework implemented in a research HPF compiler called PARADIGM. The metrics cons...
Pramod G. Joisha, Prithviraj Banerjee
IPPS
1999
IEEE
13 years 7 months ago
Non-Preemptive Scheduling of Real-Time Threads on Multi-Level-Context Architectures
The rapid progress in high-performance microprocessor design has made it di cult to adapt real-time scheduling results to new models of microprocessor hardware, thus leaving an un...
Jan Jonsson, Henrik Lönn, Kang G. Shin