Scheduling imprecise computation tasks on uniform processors

DOI10.1016/J.IPL.2007.05.004zbMATH Open1184.68140OpenAlexW2036829682WikidataQ126262170 ScholiaQ126262170MaRDI QIDQ2379995FDOQ2379995

Authors: 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

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

zbMATH Keywords

algorithmsanalysis of algorithmscombinatorial problemspolynomial time algorithmspreemptive schedulinguniform processorsimprecise computation task

Mathematics Subject Classification ID

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

Cites Work

• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Preemptive scheduling on uniform parallel machines with controllable job processing times
• Title not available (Why is that?)
• Single Machine Scheduling to Minimize Total Late Work
• Minimizing mean weighted execution time loss on identical and uniform processors
• Algorithms for Scheduling Imprecise Computations with Timing Constraints
• Minimizing the weighted number of tardy task units
• Real-time scheduling algorithm for minimizing maximum weighted error with \(O(N \log N+cN)\) complexity
• Minimizing Maximum Weighted Error for Imprecise Computation Tasks
• A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS

Cited In (9)

• Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
• 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
• On-Line Scheduling of Imprecise Computations to Minimize Error
• Algorithms for scheduling imprecise computations with timing constraints to minimize maximum error
• Title not available (Why is that?)
• 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

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)