Scheduling imprecise computation tasks on uniform processors
From MaRDI portal
Publication:2379995
Recommendations
- Scheduling imprecise computation tasks with \(0/1\)-constraint
- Approximation Algorithms For Scheduling On Uniform Processors
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Scheduling Independent Tasks on Uniform Processors
- Scheduling periodic tasks on uniform multiprocessors
- Scheduling jobs on identical and uniform processors revisited
- On a special case of uniform processor scheduling
- Approximation algorithms for multiprocessor scheduling under uncertainty
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
Cites work
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks
- Minimizing mean weighted execution time loss on identical and uniform processors
- Minimizing the weighted number of tardy task units
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity
- Single Machine Scheduling to Minimize Total Late Work
Cited in
(9)- On-Line Scheduling of Imprecise Computations to Minimize Error
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
- Approximation Algorithms For Scheduling On Uniform Processors
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- scientific article; zbMATH DE number 1760079 (Why is no real title available?)
This page was built for publication: Scheduling imprecise computation tasks on uniform processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379995)