Load Balancing in Parallel Computers: Theory and Practice is about the essential software
technique of load balancing in distributed memory message-passing parallel computers …

The distributed (Δ+ 1)-coloring problem is one of most fundamental and well-studied
problems in Distributed Algorithms. Starting with the work of Cole and Vishkin in 86, there …

Future requirements for computing speed, system reliability, and cost-effectiveness entail the
development of alternative computers to replace the traditional von Neumann organization …

We consider the following general problem modeling load balancing in a variety of
distributed settings. Given an arbitrary undirected connected graph G=(V. E) and a weight …

We develop a general technique for the quantitative analysis of iterative distributed load
balancing schemes. We illustrate the technique by studying two simple, intuitively appealing …

We consider graph coloring and related problems in the distributed message-passing
model.\em Locally-iterative algorithms are especially important in this setting. These are …

Dynamic load balancing in multicomputers can improve the utilization of processors and the
efficiency of parallel computations through migrating the workload across processors at …

Die Simulation technisch-wissenschaftlicher Vorgänge auf dem Computer gewinnt heute
immer mehr an Bedeutung. In zunehmenden Maße werden Bauteile mit Hilfe des Rechners …

This book presents the history and state of the art of universal routing strategies, which can
be applied to networks independently of their respective topologies. It opens with a self …

The dimension exchange method is a distributed load balancing method for point-to-point
networks. We add a parameter, called the exchange parameter, to the method to control the …