Sciweavers

474 search results - page 48 / 95
» Search-based Job Scheduling for Parallel Computer Workloads
Sort
View
COR
2007
106views more  COR 2007»
15 years 2 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
Sinan Gurel, M. Selim Akturk
115
Voted
PPOPP
2009
ACM
16 years 3 months ago
Application-aware management of parallel simulation collections
This paper presents a system deployed on parallel clusters to manage a collection of parallel simulations that make up a computational study. It explores how such a system can ext...
Siu Yau, Vijay Karamcheti, Denis Zorin, Kostadin D...
IPPS
2007
IEEE
15 years 8 months ago
Capacity Sharing and Stealing in Dynamic Server-based Real-Time Systems
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making a...
Luís Nogueira, Luís Miguel Pinho
JSSPP
2004
Springer
15 years 7 months ago
Enhancements to the Decision Process of the Self-Tuning dynP Scheduler
The self-tuning dynP scheduler for modern cluster resource management systems switches between different basic scheduling policies dynamically during run time. This allows to reac...
Achim Streit
138
Voted
CCGRID
2007
IEEE
15 years 8 months ago
Analysis and Synthesis of Pseudo-Periodic Job Arrivals in Grids: A Matching Pursuit Approach
Pseudo-periodicity is one of the basic job arrival patterns on data-intensive clusters and Grids. In this paper, a signal decomposition methodology called matching pursuit is appl...
Hui Li, Richard Heusdens, Michael Muskulus, Lex Wo...