Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
From MaRDI portal
Publication:4419672
DOI10.1109/12.372040zbMATH Open1062.68532OpenAlexW2161419436MaRDI QIDQ4419672FDOQ4419672
Publication date: 15 October 2003
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b2dbb9ee6873d04abe555b27c93fd3dfb4f70b5f
Cited In (10)
- Title not available (Why is that?)
- Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
- On-Line Scheduling of Imprecise Computations to Minimize Error
- Minimizing the number of late tasks with error constraint
- IMPROVED COMPETITIVE ALGORITHMS FOR TWO-PROCESSOR REAL-TIME SYSTEMS
- Energy-aware scheduling mandatory/optional tasks in multicore real-time systems
- Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Maintaining thermal comfort in buildings: feasibility, algorithms, implementation, evaluation
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
Recommendations
- Algorithms for Scheduling Imprecise Computations with Timing Constraints π π
- On-Line Scheduling of Imprecise Computations to Minimize Error π π
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks π π
- Title not available (Why is that?) π π
- Scheduling imprecise computation tasks on uniform processors π π
This page was built for publication: Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4419672)