Sciweavers

123 search results - page 16 / 25
» A Bi-criteria Algorithm for Scheduling Parallel Task Graphs ...
Sort
View
IEEEPACT
1998
IEEE
13 years 11 months ago
Adaptive Scheduling of Computations and Communications on Distributed Memory Systems
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
Mayez A. Al-Mouhamed, Homam Najjari
GRID
2004
Springer
14 years 26 days ago
MARS: A Metascheduler for Distributed Resources in Campus Grids
Computational grids are increasingly being deployed in campus environments to provide unified access to distributed and heterogeneous resources such as clusters, storage arrays, ...
Abhijit Bose, Brian Wickman, Cameron Wood
CLUSTER
2002
IEEE
13 years 7 months ago
Online Prediction of the Running Time of Tasks
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
Peter A. Dinda
CCGRID
2005
IEEE
14 years 1 months ago
Mapping DAG-based applications to multiclusters with background workload
Before an application modelled as a Directed Acyclic Graph (DAG) is executed on a heterogeneous system, a DAG mapping policy is often enacted. After mapping, the tasks (in the DAG...
Ligang He, Stephen A. Jarvis, Daniel P. Spooner, D...
PACT
2009
Springer
14 years 1 days ago
Parallel Evidence Propagation on Multicore Processors
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
Yinglong Xia, Xiaojun Feng, Viktor K. Prasanna