Scheduling Large-Scale Parallel Computations on Networks of Workstations
نویسندگان
چکیده
Workstation networks are an underutilized yet valuable resource for solving large-scale parallel problems. In this paper, we present \idle-initiated" techniques for eeciently scheduling large-scale parallel computations on workstation networks. By \idle-initiated," we mean that idle computers actively search out work to do rather than wait for work to be assigned. The idle-initiated scheduler operates at both the macro and the micro levels. On the macro level, a computer without work joins an ongoing parallel computation as a participant. On the micro level, a participant without work \steals" work from some other participant of the same computation. We have implemented these scheduling techniques in Phish, a portable system for running dynamic parallel applications on a network of workstations.
منابع مشابه
A Comparison of Two Java Runtime Systems for Parallel Execution of ultithreaded Java Applications on Networks of Workstations
This paper assesses the performance of two Java frameworks for high performance computing (HPC) on networks of workstations (NOWs). The lottery-based work stealing algorithm is intrinsically distributed, and consequetly scalable to an extremely large number of participant workstations. Although proved to be near optimal for the distribution of well-structured multithreaded computations across l...
متن کاملWorkshop on Large − Scale Parallel KDD Systems in conjunction with the 5 th ACM SIGKDD International Conference on
With the emergence of high performance networks, clusters of workstations can now be connected by commodity networks (meta-clusters) or high speed networks (super-clusters) such as the very high speed Backbone Network Service (vBNS) or Internet2's Abilene. Distributed clusters are enabling a new class of data mining applications in which large amounts of data can be transferred using high perfo...
متن کاملOptimal architecture-independent scheduling of fine-grain tree-sweep computations
We present linear-time algorithms for optimally scheduling computations that comprise a sequence of complete up-and/or down-sweeps on a complete binary tree, on parallel architectures in which the communication latency between any two processors is uniform. Such computations include, for instance, those that implement broadcast, accumulation, and the parallel-preex operator; such architec-tures...
متن کاملA High Performance Implementation of the Data Space Transfer Protocol (DSTP)
With the emergence of high performance networks, clusters of workstations can now be connected by commodity networks (meta-clusters) or high speed networks (super-clusters) such as the very high speed Backbone Network Service (vBNS) or Internet2’s Abilene. Distributed clusters are enabling a new class of data mining applications in which large amounts of data can be transferred using high perfo...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کامل