DMCA
Synthesis of Hard Real-Time Application Specific Systems (1998)
| Citations: | 19 - 2 self |
BibTeX
@MISC{Lee98synthesisof,
author = {Chunho Lee and Miodrag Potkonjak and Wayne Wolf},
title = {Synthesis of Hard Real-Time Application Specific Systems},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents a system level approach for the synthesis of hard real-time multitask application specific systems. The algorithm takes into account task precedence constraints among multiple hard real-time tasks and targets a multiprocessor system consisting of a set of heterogeneous off-the-shelf processors. The optimization goal is to select a minimal cost multi-subset of processors while satisfying all the required timing and precedence constraints. There are three design phases: resource allocation, assignment, and scheduling. Since the resource allocation is a search for a minimal cost multi-subset of processors, we adopted an A* search based technique for the first synthesis phase. A variation of the force-directed optimization technique is used to assign a task to an allocated processor. The final scheduling of a hard-real time task is done by the task level scheduler which is based on Earliest Deadline First (EDF) scheduling policy. Our task level scheduler incorporates force-directed scheduling methodology to address the situations where EDF is not optimal. The experimental results on a variety of examples show that the approach is highly effective and efficient.
Keyphrases
hard real-time application specific system minimal cost multi-subset task level scheduler resource allocation first synthesis phase multiprocessor system force-directed optimization technique optimization goal final scheduling system level approach scheduling policy design phase multiple hard real-time task hard-real time task earliest deadline first heterogeneous off-the-shelf processor required timing experimental result account task precedence constraint precedence constraint
