Sciweavers

169 search results - page 16 / 34
» New Challenges of Parallel Job Scheduling
Sort
View
ICALP
2004
Springer
14 years 3 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
RTSS
2007
IEEE
14 years 4 months ago
Utilization-Bound Based Schedulability Analysis of Weighted Round Robin Schedulers
Schedulability analysis is a cornerstone of modern real-time scheduling theory development. Utilizationbound based schedulability test is considered one of most efficient and effe...
Jianjia Wu, Jyh-Charn Liu, Wei Zhao
HPDC
2010
IEEE
13 years 10 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
JSSPP
1995
Springer
14 years 1 months ago
Time Space Sharing Scheduling and Architectural Support
In this paper, we describe a new job scheduling class, called \Time Space Sharing Scheduling" (TSSS) for dynamically partitionable parallel machines. As an instance of TSSS, ...
Atsushi Hori, Takashi Yokota, Yutaka Ishikawa, Shu...
JSSPP
1997
Springer
14 years 2 months ago
An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors
In this paper we describe the design, implementation and experimental evaluation of a technique for operating system schedulers called processor pool-based scheduling [51]. Our tec...
Tim Brecht