Improved results for scheduling batched parallel jobs by using a generalized analysis framework
From MaRDI portal
Publication:666034
DOI10.1016/j.jpdc.2009.03.004zbMath1233.68110OpenAlexW2010421047MaRDI QIDQ666034
Publication date: 7 March 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2009.03.004
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing total flow time and total completion time with immediate dispatching
- On multiprocessor system scheduling
- Non-clairvoyant scheduling for minimizing mean slowdown
- Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
- Approximation Techniques for Average Completion Time Scheduling
- A provable time and space efficient implementation of NESL
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
- Minimizing flow time nonclairvoyantly
- Characterisation of programs for scheduling in multiprogrammed parallel systems
- Smart SMART Bounds for Weighted Response Time Scheduling
- Space-Efficient Scheduling of Multithreaded Computations
- Implementing a dynamic processor allocation policy for multiprogrammed parallel applications in the SolarisTM
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Scheduling in the dark
- Algorithms and Computation
This page was built for publication: Improved results for scheduling batched parallel jobs by using a generalized analysis framework
