A comparison of classical scheduling approaches in power-constrained block-test scheduling

Citations Over TimeTop 10% of 2002 papers

Abstract

Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List scheduling-like approaches are proposed first as greedy algorithms to tackle the fore mentioned problem. Then, distribution-graph based approaches are described in order to achieve balanced test concurrency and test power dissipation. An extended tree growing technique is also used in combination with these classical approaches in order to improve the test concurrency having assigned power dissipation limits. A comparison between the results of the test scheduling experiments highlights the advantages and disadvantages of applying different classical scheduling algorithms to the power-constrained test scheduling problem.

Related Papers

• → One-level and two-level scheduling for real-time systems(2013)1 cited
• Status and Prospect of Network Scheduling Algorithm in Networked Control Systems(2008)
• Job scheduling in a distributed system(1983)
• → Task scheduling in time-triggered real-time systems(2014)