This paper addresses the problem of scheduling concurrent jobs on clusters where
application data is stored on the computing nodes. This setting, in which scheduling …

We present a user-level thread scheduler for shared-memory multiprocessors, and we
analyze its performance under multiprogramming. We model multiprogramming with two …

The scheduling of jobs on parallel supercomputer is becoming the subject of much research.
However, there is concern about the divergence of theory and practice. We review …

In this paper, we propose cyber foraging: a mechanism to augment the computational and
storage capabilities of mobile devices. Cyber foraging uses opportunistically discovered …

Internet centers host services for e-banks, e-auctions and other clients. Hosting centers then
must allocate servers among clients to maximize revenue. The limited number of servers …

Today's high performance computing systems are typically managed and operated by
individual organizations in private. Computing demand is fluctuating, however, resulting in …

In this introductory chapter, we lay the groundwork for the rest of the book by providing a
more detailed picture of the expected purpose, shape, and architecture of future grid …

Many important applications fall into the broad class of iterative convergent algorithms.
Parallel implementations of these algorithms are naturally expressed using the Bulk …

Scheduling algorithms that use application and system knowledge have been shown to be
more effective at scheduling parallel jobs on a multiprocessor than algorithms that do not …

With increasing development of applications for heterogeneous, distributed computing grids,
the focus of performance analysis has shifted from a posteriori optimization on …