|
Volumn 23, Issue 6, 1997, Pages 388-400
|
An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems
a a a |
Author keywords
Dynamic; Dynamic scheduling theory; Feasibility analysis; Hard real time; Slack scheduling; Soft aperiodic tasks
|
Indexed keywords
ALGORITHMS;
COMPUTATIONAL COMPLEXITY;
ONLINE SYSTEMS;
POLYNOMIALS;
REAL TIME SYSTEMS;
RESOURCE ALLOCATION;
RESPONSE TIME (COMPUTER SYSTEMS);
DYNAMIC SCHEDULING THEORY;
SOFT APERIODIC TASKS;
SYSTEMS ANALYSIS;
|
EID: 0031163904
PISSN: 00985589
EISSN: None
Source Type: Journal
DOI: 10.1109/32.601081 Document Type: Article |
Times cited : (37)
|
References (13)
|