Analysis of an approximation algorithm for scheduling independent parallel tasks
From MaRDI portal
Recommendations
- An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks
- Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
- scientific article; zbMATH DE number 1234084
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
Cited in
(12)- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- Worst-case analysis of scheduling heuristics of parallel systems
- An average-case analysis of online non-clairvoyant scheduling of independent parallel tasks
- Average-case performance analysis of scheduling random parallel tasks with precedence constraints on mesh connected multicomputer systems
- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
- Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- An efficient job scheduling algorithm in partitionable mesh connected systems
- Fast exact and approximate algorithms for k-partition and scheduling independent tasks
- Scheduling parallel jobs to minimize the makespan
This page was built for publication: Analysis of an approximation algorithm for scheduling independent parallel tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3836523)
