Sciweavers

474 search results - page 65 / 95
» Search-based Job Scheduling for Parallel Computer Workloads
Sort
View
SC
2009
ACM
14 years 3 months ago
Evaluating the impact of inaccurate information in utility-based scheduling
Proponents of utility-based scheduling policies have shown the potential for a 100–1400% increase in value-delivered to users when used in lieu of traditional approaches such as...
Alvin AuYoung, Amin Vahdat, Alex C. Snoeren
HPDC
2012
IEEE
11 years 11 months ago
QBox: guaranteeing I/O performance on black box storage systems
Many storage systems are shared by multiple clients with different types of workloads and performance targets. To achieve performance targets without over-provisioning, a system ...
Dimitris Skourtis, Shinpei Kato, Scott Brandt
ICPPW
2006
IEEE
14 years 2 months ago
Grid Resource Allocation and Task Scheduling for Resource Intensive Applications
Evolution of grid has drawn attention from various resource intensive applications addressing domains of bio-informatics, astrology and multimedia, to name a few. Image analysis a...
Abdul Aziz, Hesham El-Rewini
JSSPP
2005
Springer
14 years 2 months ago
Scheduling Moldable BSP Tasks
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
Pierre-François Dutot, Marco Aurélio...
MFCS
2004
Springer
14 years 1 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa