Ever more scientists are employing large-scale distributed systems such as grids for their
computational work, instead of tightly coupled high-performance computing systems …

Focusing on algorithms for distributed-memory parallel architectures, Parallel Algorithms
presents a rigorous yet accessible treatment of theoretical models of parallel computation …

In this paper we analyze MapReduce distributed computations as a divisible load
scheduling problem. The two operations of map** and reducing can be understood as two …

There is extensive literature concerning the divisible load theory. The divisible load theory is
mainly applied for scheduling in the area of distributed computing. It is based on the fact that …

In this paper, we propose distributed algorithms referred to as resource-aware dynamic
incremental scheduling (RADIS) strategies. Our strategies are specifically designed to …

Divisible applications are a class of tasks whose loads can be partitioned into some smaller
fractions, and each part can be executed independently by a processor. A wide variety of …

A divisible load is an amount W of computational work that can be arbitrarily divided into
independent chunks of load. In many divisible load applications, the load can be …

A divisible load is an amount W of computational work that can be arbitrarily divided into
chunks and distributed among a set P of worker processors to be processed in parallel …

Full of practical examples, Introduction to Scheduling presents the basic concepts and
methods, fundamental results, and recent developments of scheduling theory. With …

Cloud computing offers customers an efficient way to flexibly allocate resources to meet
demands. Cloud service vendors can offer consumers three purchasing plans, ie, on …