User-Transparent Scheduling of Structured Parallel Applications in Grid Environments
نویسنده
چکیده
The problem of scheduling parallel applications on Grids is notoriously difficult: schedulers must consider the heterogeneity of involved resources and management systems, and they often require the users to provide information about the expected application behavior. We suggest that increasingly popular structured programming approaches, using components with well-defined semantics, facilitate a more efficient and usertransparent scheduling. We illustrate our approach to scheduling using HOCs (Higher-Order Components) that capture typical patterns of parallelism (Farm-HOC, Pipeline-HOC, etc.) and come as Web Services with pre-packaged implementation and middleware setup. We take a particular Grid scheduler, KOALA, and enhance it for Grid applications built of HOCs: we propose and implement a novel scheduling algorithm that optimizes communications in such structured applications. We report experimental results of running our scheduler on the DAS-2 Grid testbed combining over 200 nodes at five sites in the Netherlands.
منابع مشابه
User-Transparent Scheduling for Software Components on the Grid
Grid applications are increasingly being developed as workflows using well-structured, reusable components. We argue that components with well-defined semantics facilitate an efficient scheduling on the Grid. We have previously developed a user-transparent scheduling approach for Higher-Order Components (HOCs) – parallel implementations of typical programming patterns, accessible and customizab...
متن کاملImproving the palbimm scheduling algorithm for fault tolerance in cloud computing
Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملComputing Applications Adaptive Scheduling for Task Farming Adaptive Scheduling for Task Farming with Grid Middleware
Scheduling in metacomputing environments is an active field of research as the vision of a Computational Grid becomes more concrete. An important class of Grid applications are long-running parallel computations with large numbers of somewhat independent tasks (Monte Carlo simulations, parameter-space searches, etc.). A number of Grid middleware projects are available to implement such applicat...
متن کامل