This paper presents an experience in use of a parallel mathematical library, ScaLAPACK, on a network composed by heterogeneous workstations. The good performance results have been obtained by means of a distributed programming environment which is able to dynamically evaluate available computing power at each workstation and to distribute accordingly the set of parallel processes.

This paper deals with load balancing of parallel algorithms for distributedmemory computers. The parallel versions of BLAS subroutines for matrix-vector product and LU factorization are considered. Two task partitioning algorithms are investigated and speed-ups are calculated. The cases of homogeneous and heterogeneous collections of computers/processors are studied, and special partitioning al...

We derive guidelines for nearly optimally scheduling data-parallel computations within a draconian mode of cycle-stealing in NOWs. In this computing regimen, workstation A takes control of workstation B’s processor whenever B is idle, with the promise of relinquishing control immediately upon demand—thereby losing work in progress. The typically high communication overhead for supplying worksta...

Nowadays, manufacturing industries are increasing their interest in the energy-efficiency topic, mostly due to major environmental impact of machining activities. Manufacturing processes sustainability can be improved by controlling machine state with energy-efficient control (EEC) policies that switch off/on device. Recently, research demonstrated this approach also applied a workstation compo...

This paper presents an experience in use of a parallel mathematical library, ScaLAPACK, on a network composed by heterogeneous workstations. The good performance results have been obtained by means of a distributed programming environment which is able to dynamically evaluate available computing power at each workstation and to distribute accordingly the set of parallel processes.

Tapping the large amounts of idle time of numerous workstations and parallelizing large, but simply structured computational efforts is a cheap method of advancing to the limits of computationally feasible tasks. Known systems like PVM are able to function under quite general conditions, however, they achieve considerable complexity. The goal of this project at the Seminar for Applied Mathemati...

In this paper a new methodology for load balancing parallel processes on parallel systems is proposed. The problem of load balancing is considered to be an NP-hard optimization task. Taking static parallel tinite element applications as a case study, the benefits and losses that follow from applying the methodology are studied. It is found that the proposed methodology can be especially useful ...

We describe new parallelization techniques applied to a highly parallel ocean circulation application code – the Miami Isopycnic Ocean Coordinate Model or MICOM. We compare three parallel architectures executing MICOM: vector, massively parallel, and a multiprocessor workstation. Results from a high resolution 0.08 MICOM North Atlantic basin calculation on the Cray T3D are described briefly. Th...