Sciweavers

1609 search results - page 43 / 322
» A Microeconomic Scheduler for Parallel Computers
Sort
View
PDP
2008
IEEE
15 years 10 months ago
QoS-constrained List Scheduling Heuristics for Parallel Applications on Grids
This paper presents QLSE (QoS-constrained List Scheduling hEuristics), a Quality of Service-based launch time scheduling algorithm for wide area Grids. QLSE considers applications...
Nicola Tonellotto, Ranieri Baraglia, Renato Ferrin...
PDP
2008
IEEE
15 years 10 months ago
Just-In-Time Scheduling for Loop-based Speculative Parallelization
Scheduling for speculative parallelization is a problem that remained unsolved despite its importance. Simple methods such as Fixed-Size Chunking (FSC) need several ‘dry-runs’...
Diego R. Llanos Ferraris, David Orden, Belé...
EGC
2005
Springer
15 years 10 months ago
Optimising Parallel Applications on the Grid Using Irregular Array Distributions
In this paper we propose a new approach for scheduling data parallel applications on the Grid using irregular array distributions. We implement the scheduler as a new case study fo...
Radu Prodan, Thomas Fahringer
IPPS
2008
IEEE
15 years 10 months ago
Online scheduling in grids
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
Uwe Schwiegelshohn, Andrei Tchernykh, Ramin Yahyap...
ICS
1995
Tsinghua U.
15 years 8 months ago
Optimum Modulo Schedules for Minimum Register Requirements
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...
Alexandre E. Eichenberger, Edward S. Davidson, San...