223 search results - page 17 / 45 » Improving First-Come-First-Serve Job Scheduling by Gang Sche... |
ICCSA
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
JSSPP
2004
Springer
14 years 27 days ago
2004
Springer
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...
CLOUDCOM
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--Driven by the need to provision resources on demand, scientists are turning to commercial and research test-bed Cloud computing resources to run their scientific experime...
RTAS
2011
IEEE
12 years 11 months ago
2011
IEEE
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...