GENERATING FEASIBLE CYCLIC SCHEDULES

A Burns; N Hayes; M F Richardson

GENERATING FEASIBLE CYCLIC SCHEDULES

A Burns, N Hayes, M F Richardson

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

The use of a cyclic executive represents the normal implementation scheme for periodic real-time systems, such systems being found in many areas of the control industry. One difficulty with this form of cyclic scheduling is that the schedule itself is difficult to lay out and is fragile in its response to even minor changes to the software it contains. This paper addresses the issues involved in automatically generating, or re-generating, cyclic executives. Four techniques are considered: heuristic search, simulated annealing, stochastic evolution and genetic algorithms, the first two being investigated in derail with prototype tools being implemented and applied to a representative case study. The paper concludes that tool support for this activity is viable. The paper also considers the limitations of static scheduling and considers the use of a more flexible scheme.

Original language	English
Pages (from-to)	151-162
Number of pages	12
Journal	Control engineering practice
Volume	3
Issue number	2
Publication status	Published - Feb 1995

Keywords

SCHEDULABILITY
TIMING ANALYSIS
SIMULATED ANNEALING
TASKS

Cite this

@article{203661a05b3240bb84cf912f4c123b30,

title = "GENERATING FEASIBLE CYCLIC SCHEDULES",

abstract = "The use of a cyclic executive represents the normal implementation scheme for periodic real-time systems, such systems being found in many areas of the control industry. One difficulty with this form of cyclic scheduling is that the schedule itself is difficult to lay out and is fragile in its response to even minor changes to the software it contains. This paper addresses the issues involved in automatically generating, or re-generating, cyclic executives. Four techniques are considered: heuristic search, simulated annealing, stochastic evolution and genetic algorithms, the first two being investigated in derail with prototype tools being implemented and applied to a representative case study. The paper concludes that tool support for this activity is viable. The paper also considers the limitations of static scheduling and considers the use of a more flexible scheme.",

keywords = "SCHEDULABILITY, TIMING ANALYSIS, SIMULATED ANNEALING, TASKS",

author = "A Burns and N Hayes and Richardson, {M F}",

year = "1995",

month = feb,

language = "English",

volume = "3",

pages = "151--162",

journal = "Control engineering practice",

issn = "0967-0661",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - GENERATING FEASIBLE CYCLIC SCHEDULES

AU - Burns, A

AU - Hayes, N

AU - Richardson, M F

PY - 1995/2

Y1 - 1995/2

N2 - The use of a cyclic executive represents the normal implementation scheme for periodic real-time systems, such systems being found in many areas of the control industry. One difficulty with this form of cyclic scheduling is that the schedule itself is difficult to lay out and is fragile in its response to even minor changes to the software it contains. This paper addresses the issues involved in automatically generating, or re-generating, cyclic executives. Four techniques are considered: heuristic search, simulated annealing, stochastic evolution and genetic algorithms, the first two being investigated in derail with prototype tools being implemented and applied to a representative case study. The paper concludes that tool support for this activity is viable. The paper also considers the limitations of static scheduling and considers the use of a more flexible scheme.

AB - The use of a cyclic executive represents the normal implementation scheme for periodic real-time systems, such systems being found in many areas of the control industry. One difficulty with this form of cyclic scheduling is that the schedule itself is difficult to lay out and is fragile in its response to even minor changes to the software it contains. This paper addresses the issues involved in automatically generating, or re-generating, cyclic executives. Four techniques are considered: heuristic search, simulated annealing, stochastic evolution and genetic algorithms, the first two being investigated in derail with prototype tools being implemented and applied to a representative case study. The paper concludes that tool support for this activity is viable. The paper also considers the limitations of static scheduling and considers the use of a more flexible scheme.

KW - SCHEDULABILITY

KW - TIMING ANALYSIS

KW - SIMULATED ANNEALING

KW - TASKS

M3 - Article

SN - 0967-0661

VL - 3

SP - 151

EP - 162

JO - Control engineering practice

JF - Control engineering practice

IS - 2

ER -