Sciweavers

481 search results - page 39 / 97
» Multi-Objective Models for Scheduling Jobs on Parallel Compu...
Sort
View
IPPS
1998
IEEE
15 years 9 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
IPPS
2002
IEEE
15 years 10 months ago
Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
Hongtu Chen, Muthucumaru Maheswaran
CCGRID
2006
IEEE
15 years 7 months ago
A Co-ordinate Based Resource Allocation Strategy for Grid Environments
In this paper, we propose a novel resource scheduling strategy, referred to as the Multi-Resource Scheduling (MRS) algorithm, which is capable of handling several resources to be u...
Benjamin Khoo Boon Tat, Bharadwaj Veeravalli, Tere...
CLUSTER
2005
IEEE
15 years 10 months ago
Minimizing the Network Overhead of Checkpointing in Cycle-harvesting Cluster Environments
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
Daniel Nurmi, John Brevik, Richard Wolski
SC
2003
ACM
15 years 10 months ago
BCS-MPI: A New Approach in the System Software Design for Large-Scale Parallel Computers
Buffered CoScheduled MPI (BCS-MPI) introduces a new approach to design the communication layer for largescale parallel machines. The emphasis of BCS-MPI is on the global coordinat...
Juan Fernández, Eitan Frachtenberg, Fabrizi...