Scheduling imprecise computation tasks on uniform processors

DOI10.1016/j.ipl.2007.05.004zbMath1184.68140OpenAlexW2036829682WikidataQ126262170 ScholiaQ126262170MaRDI QIDQ2379995

Guohua Wan, Joseph Y.-T. Leung, Michael L. Pinedo

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.05.004

zbMATH Keywords

algorithmscombinatorial problemsanalysis of algorithmspreemptive schedulingpolynomial time algorithmsuniform processorsimprecise computation task

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches ⋮ SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION

Cites Work

• Unnamed Item
• Minimizing mean weighted execution time loss on identical and uniform processors
• 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
• Minimizing the weighted number of tardy task units
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Single Machine Scheduling to Minimize Total Late Work
• Minimizing Maximum Weighted Error for Imprecise Computation Tasks
• A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS

This page was built for publication: Scheduling imprecise computation tasks on uniform processors