Sciweavers

155 search results - page 16 / 31
» Online Scheduling of Equal-Length Jobs on Parallel Machines
Sort
View
AOR
2007
107views more  AOR 2007»
13 years 8 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
ISPASS
2009
IEEE
14 years 2 months ago
Machine learning based online performance prediction for runtime parallelization and task scheduling
—With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as w...
Jiangtian Li, Xiaosong Ma, Karan Singh, Martin Sch...
IPPS
1998
IEEE
14 years 2 days ago
Utilization and Predictability in Scheduling the IBM SP2 with Backfilling
Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs ar...
Dror G. Feitelson, Ahuva Mu'alem Weil
PDP
2009
IEEE
14 years 2 months ago
Effects of Job and Task Placement on Parallel Scientific Applications Performance
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
Javier Navaridas, Jose Antonio Pascual, José...
ANOR
2008
123views more  ANOR 2008»
13 years 8 months ago
An approach to predictive-reactive scheduling of parallel machines subject to disruptions
: In this paper, a new predictive-reactive approach to a parallel machine scheduling problem in the presence of uncertain disruptions is presented. The approach developed is based ...
Alejandra Duenas, Dobrila Petrovic