Parallel implementation of a transportation network model
This paper describes the parallel implementation of a transport network model. A 'Single-Program, Multiple Data' (SPMD) paradigm is employed using a simple data decomposition approach where each processor runs the same program but acts on a different ...
Constructing regular variables in message passing systems
Developing fault-tolerant programs for distributed systems is a difficult task. It seems that it is more difficult to develop fault-tolerant programs for message passing systems than for shared memory systems. Consequently, there has been a lot of ...
Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors
Message-passing network-based multicomputer systems emerge as a potential economical candidate to replace supercomputers. Despite enormous effort to evaluate the performance of those systems and to determine an optimum scheduling algorithm (which is ...
A general framework to understand parallel performance in heterogeneous clusters: analysis of a new adaptive parallel genetic algorithm
This paper presents a general model to define, measure and predict the efficiency of applications running on heterogeneous parallel computer systems. Using this framework, it is possible to understand the influence that the heterogeneity of the hardware ...
The Josephus Cube: analysis of routing and fault tolerance
We introduce a novel interconnection topology, the Josephus Cube, which supports a degree of fault tolerance as well as a simple, cost-effective routing strategy that is minimal, deadlock-free, and livelock-free. The routing strategy is based on an ...
An overhead reducing technique for Time Warp
In this paper, we introduce a technique to reduce the number of state savings and the event queue size of Time Warp. By reducing the state saving and the sizes of event queues, we can decrease the overhead and the maximum memory requirement in Time ...
Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0--1 knapsack problem
The parallelization on a supercomputer of a one list dynamic programming algorithm using dominance technique and processor cooperation for the 0-1 knapsack problem is presented. Such a technique generates irregular data structure, moreover the number of ...
Research note: Parallel algorithms for tree accumulations
Accumulations are abstract operations on trees useful in many applications involving trees. The upward accumulation problem is to aggregate data in the subtree under each node of the tree. The downward accumulation problem is to aggregate data at all ...
