Sciweavers

312 search results - page 7 / 63
» Scheduling Jobs on Grid Processors
Sort
View
EUROPAR
2008
Springer
14 years 11 months ago
Dynamic Grid Scheduling Using Job Runtime Requirements and Variable Resource Availability
We describe a scheduling technique in which estimated job runtimes and estimated resource availability are used to efficiently distribute workloads across a homogeneous grid of res...
Sam Verboven, Peter Hellinckx, Jan Broeckhove, Fra...
HPCS
2007
IEEE
15 years 3 months ago
Improved Grid Metascheduler Design using the Plackett-Burman Methodology
In the context of computational grids, a metascheduler is the service responsible for scheduling jobs across many geographically distributed processor clusters. Typically, these s...
Daniel C. Vanderster, Nikitas J. Dimopoulos, Randa...
95
Voted
ICPP
1998
IEEE
15 years 1 months ago
Response Time Analysis for Distributed Real-Time Systems with Bursty Job Arrivals
This paper presents a new schedulability analysis methodology for distributed hard real-time systems with bursty job arrivals. The schedulability is analyzed by comparing worst-ca...
Chengzhi Li, Riccardo Bettati, Wei Zhao
JSSPP
2005
Springer
15 years 3 months ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan
ANSS
2002
IEEE
15 years 2 months ago
Scheduling a Job Mix in a Partitionable Parallel System
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...
Helen D. Karatza, Ralph C. Hilzer Jr.