There are many choices to make when evaluating the performance of a complex system. In
the context of parallel job scheduling, one must decide what workload to use and what …

We explore the creation of a metacomputer by the aggregation of independent sites. Joining
a metacomputer is voluntary, and hence it has to be an endeavor that mutually benefits all …

The recent success of Internet-based computing projects, coupled with rapid developments
in peer-to-peer systems, has stimulated interest in the notion of harvesting idle cycles under …

Abstract 1 In this paper we study hierarchical job scheduling strategies for clusters of
workstations. Our approach uses two-level scheduling: global scheduling and local …

Gang scheduling and related techniques are widely believed to be necessary for efficient
job scheduling on distributed memory parallel computers. This is because they minimize …

This paper presents some ideas for efficiently allocating resources to enhance the
performance of gang scheduling. We first introduce a job re-packing scheme. In this scheme …

The Grid environment is highly dynamic in nature where a variety of users from all over the
world try to access the resources that are again distributed all over. Both the users and …

Grid computing is a group of clusters connected over high-speed networks that involves
coordinating and sharing computational power, resource utilization is an important issue …

Gang scheduling is currently the most popular scheduling scheme for parallel processing in
a time shared environment. One major drawback of using gang scheduling is the problem of …

Summary form only given. Scheduling policies are proposed for parallelizing data intensive
particle physics analysis applications on computer clusters. Particle physics analysis jobs …