Sciweavers

239 search results - page 21 / 48
» On-line scheduling of parallel jobs on two machines
Sort
View
JSSPP
2000
Springer
13 years 11 months ago
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements
Abstract. Buffered coscheduling is a new methodology that can substantially increase resource utilization, improve response time, and simplify the development of the run-time suppo...
Fabrizio Petrini, Wu-chun Feng
ICMAS
1998
13 years 9 months ago
Multi-Machine Scheduling - A Multi-Agent Learning Approach
Multi-machine scheduling, that is, the assigment of jobs to machines such that certain performance demands like cost and time effectiveness are fulfilled, is a ubiquitous and comp...
Wilfried Brauer, Gerhard Weiß
HPDC
2006
IEEE
14 years 1 months ago
Task Scheduling and File Replication for Data-Intensive Jobs with Batch-shared I/O
This paper addresses the problem of efficient execution of a batch of data-intensive tasks with batch-shared I/O behavior, on coupled storage and compute clusters. Two scheduling...
Gaurav Khanna 0002, Nagavijayalakshmi Vydyanathan,...
JSSPP
2004
Springer
14 years 1 months ago
Scheduling on the Top 50 Machines
The well-known TOP500 list ranks the 500 most powerful high-performance computers. However, the list lacks details about the job management and scheduling on these machines. As thi...
Carsten Ernemann, Martin Krogmann, Joachim Lepping...
EOR
2007
103views more  EOR 2007»
13 years 7 months ago
Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
Consider a single machine and a set of   jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao