Real-time recursive procedures

Author

Blieberger, J. ; Lieger, R.

Author_Institution

Dept. of Autom., Tech. Univ. Wien, Austria

fYear

1995

fDate

14-16 Jun 1995

Firstpage

229

Lastpage

235

Abstract

The purpose of the paper is to show that recursive procedures can be used for implementing real time applications without harm, if a few conditions are met. These conditions ensure upper bounds for space and time requirements can be derived at compile time. Moreover they are simple enough such that many important recursive algorithms can be implemented, for example Mergesort or recursive tree traversal algorithms

Keywords

programming; programming languages; programming theory; real-time systems; scheduling; Mergesort; real time applications; real-time recursive procedures; recursive algorithms; recursive tree traversal algorithms; space requirements; time requirements; Automation; Computer languages; Embedded computing; Processor scheduling; Real time systems; Recursive estimation; Runtime; Scheduling algorithm; Timing; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems, 1995. Proceedings., Seventh Euromicro Workshop on

Conference_Location

Odense

ISSN

1068-3070

Print_ISBN

0-8186-7112-2

Type

conf

DOI

10.1109/EMWRTS.1995.514316

Filename

514316

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2352892