Sciweavers

474 search results - page 29 / 95
» Search-based Job Scheduling for Parallel Computer Workloads
Sort
View
JSSPP
2005
Springer
14 years 2 months ago
Unfairness Metrics for Space-Sharing Parallel Job Schedulers
Sociology, computer networking and operations research provide evidence of the importance of fairness in queuing disciplines. Currently, there is no accepted model for characteriz...
Gerald Sabin, P. Sadayappan
JSSPP
2004
Springer
14 years 1 months ago
Are User Runtime Estimates Inherently Inaccurate?
Computer system batch schedulers typically require information from the user upon job submission, including a runtime estimate. Inaccuracy of these runtime estimates, relative to ...
Cynthia Bailey Lee, Yael Schwartzman, Jennifer Har...
CCGRID
2010
IEEE
13 years 6 months ago
File-Access Characteristics of Data-Intensive Workflow Applications
This paper studies five real-world data intensive workflow applications in the fields of natural language processing, astronomy image analysis, and web data analysis. Data intensiv...
Takeshi Shibata, SungJun Choi, Kenjiro Taura
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
IPPS
1999
IEEE
14 years 24 days ago
Deterministic Batch Scheduling without Static Partitioning
The Irix 6.5 scheduling system provides intrinsic support for batch processing, including support for guaranteed access to resources and policy-based static scheduling. Long range ...
Kostadis Roussos, Nawaf Bitar, Robert English