On-Line Scheduling of Imprecise Computations to Minimize Error
From MaRDI portal
Recommendations
- Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
- scientific article; zbMATH DE number 2112446
- Scheduling imprecise computation tasks on uniform processors
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Scheduling imprecise computation tasks with \(0/1\)-constraint
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- Approximation in Preemptive Stochastic Online Scheduling
- Approximation and Online Algorithms
- Nearly on-line scheduling of multiprocessor systems with memories
Cited in
(8)- Minimizing the number of late tasks with error constraint
- Partial servicing of on-line jobs
- Scheduling imprecise computation tasks with \(0/1\)-constraint
- Minimizing mean flow time with error constraint
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks
- Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
- scientific article; zbMATH DE number 2112446 (Why is no real title available?)
- Resource estimation algorithm under impreciseness using inclusion scheduling
This page was built for publication: On-Line Scheduling of Imprecise Computations to Minimize Error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4714561)