Abstract Parallel computing plays a vital role when solving large problems in computational mechanics, which might not be tractable by serial computers. Yet, order to utilize parallel hardware effectively, appropriate balancing of the work load among all processes is crucial speed up computations and avoid waste resources. The present contribution addresses question optimal context contact with...

Recently, switch-based networks of workstations (NOWs) have been introduced as an alternative for traditional parallel computers. Although many dynamic load balancing algorithms have been developed for point-to-point networks (static networks), little progress has been made on the load balancing in switch-based networks (dynamic networks). Thus, in this paper, we propose a dynamic load balancin...

We propose static and dynamic load balancing policies for parallel real time sys tems A parallel real time system in this context is considered as a computational environment consisting of a number of processors where stringent timing require ments of processes should be met This would encompass massively parallel systems at one end of the spectrum and a group of computers connected by a local ...

Load balancing and data locality are the two most important factors affecting the performance of parallel programs running on distributed-memory multiprocessors. A good balancing scheme should evenly distribute the workload among the available processors, and locate the tasks close to their data to reduce communication and idle time. In this paper, we study the load balancing problem of data-pa...