Sciweavers

IPPS
1998
IEEE
13 years 8 months ago
Airshed Pollution Modeling: A Case Study in Application Development in an HPF Environment
In this paper, we describe our experience with developing Airshed, a large pollution modeling application, in the Fx programming environment. We demonstrate that high level parall...
Jaspal Subhlok, Peter Steenkiste, James M. Stichno...
IPPS
1998
IEEE
13 years 8 months ago
Performance Range Comparison via Crossing Point Analysis
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
Xian-He Sun
IPPS
1998
IEEE
13 years 8 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
IPPS
1998
IEEE
13 years 8 months ago
Protocols for Non-Deterministic Communication over Synchronous Channels
In this paper, we propose several deadlock-free protocols for implementing the generalized alternative construct, where a process non-deterministically chooses between sending or ...
Erik D. Demaine
IPPS
1998
IEEE
13 years 8 months ago
Efficient Fine-Grain Thread Migration with Active Threads
Thread migration is established as a mechanism for achieving dynamic load sharing. However, fine-grained migration has not been used due to the high thread and messaging overheads...
Boris Weissman, Benedict Gomes, Jürgen Quitte...
IPPS
1998
IEEE
13 years 8 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
IPPS
1998
IEEE
13 years 8 months ago
Nearly Optimal Algorithms for Broadcast on d-Dimensional All-Port and Wormhole-Routed Torus
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
Jyh-Jong Tsay, Wen-Tsong Wang
IPPS
1998
IEEE
13 years 8 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera