Sciweavers

IPPS
1998
IEEE
13 years 8 months ago
Optimal Bounds on Tail Probabilities - A Simplified Approach
Aviad Cohen, Yuri Rabinovich, Assaf Schuster, Hada...
IPPS
1998
IEEE
13 years 8 months ago
Optimal Communication Performance on Fast Ethernet with GAMMA
Abstract. The current prototype of the Genoa Active Message MAchine GAMMA is a low-overhead, Active Messages-based inter-process communication layer implemented mainly at kernel le...
Giuseppe Ciaccio
IPPS
1998
IEEE
13 years 8 months ago
Design, Implementation and Evaluation of Parallel Pipelined STAP on Parallel Computers
This paper presents performance results for the design and implementation of parallel pipelined Space-Time Adaptive Processing (STAP) algorithms on parallel computers. In particul...
Alok N. Choudhary, Wei-keng Liao, Donald Weiner, P...
IPPS
1998
IEEE
13 years 8 months ago
Tailoring UNITY to Distributed Program Design
As a general framework, UNITY does not offer any specific facility for the design of distributed systems. For such systems, distribution aspects must be represented at a low level,...
Michel Charpentier, Mamoun Filali, Philippe Mauran...
IPPS
1998
IEEE
13 years 8 months ago
Affordable Fault Tolerance Through Adaptation
Fault-tolerant programs are typically not only difficult to implement but also incur extra costs in terms of performance or resource consumption. Failures are typically relatively ...
Ilwoo Chang, Matti A. Hiltunen, Richard D. Schlich...
IPPS
1998
IEEE
13 years 8 months ago
The Generalized Lambda Test
In this paper, we generalize the test. The generalized test can be applied towards determining whether there exist data dependences for coupled arrays with both constant and var...
Weng-Long Chang, Chih-Ping Chu, Jesse Wu
IPPS
1998
IEEE
13 years 8 months ago
Memory Space Representation for Heterogeneous Network Process Migration
A major difficulty of heterogeneous process migration is how to collect advanced dynamic data-structures, transform them into machine independent form, and restor them appropriate...
Kasidit Chanchio, Xian-He Sun
IPPS
1998
IEEE
13 years 8 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu