Algorithms for scheduling imprecise computations

Citations Over TimeTop 1% of 1991 papers

Abstract

The imprecise computation technique, which prevents timing faults and achieves graceful degradation by giving the user an approximate result of acceptable quality whenever the system cannot produce the exact result in time, is considered. Different approaches for scheduling imprecise computations in hard real-time environments are discussed. Workload models that quantify the tradeoff between result quality and computation time are reviewed. Scheduling algorithms that exploit this tradeoff are described. These include algorithms for scheduling to minimize total error, scheduling periodic jobs, and scheduling parallelizable tasks. A queuing-theoretical formulation of the imprecise scheduling problem is presented.>

Related Papers

• → Alts: An Adaptive Load Balanced Task Scheduling Approach for Cloud Computing(2021)39 cited
• Simple Scheduling Algorithm with Load Balancing for Grid Computing(2012)
• → Data Traffic Scheduling for Cyber Physical Systems With Application in Voltage Control of Distributed Generations: A Hybrid System Framework(2014)20 cited
• → Community-Aware Scheduling Protocol for Grids(2010)7 cited
• → Exploring the throughput-fairness tradeoff of deadline scheduling in heterogeneous computing environments(2008)1 cited