The following pages link to (Q3836523):
Displaying 8 items.
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (Q685660) (← links)
- Scheduling parallel jobs to minimize the makespan (Q880560) (← links)
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN (Q1195936) (← links)
- Worst-case analysis of scheduling heuristics of parallel systems (Q1274368) (← links)
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time (Q3777447) (← links)
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS (Q3789320) (← links)
- Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling (Q3990102) (← links)
- A Heuristic of Scheduling Parallel Tasks and Its Analysis (Q3990654) (← links)
