Storage allocation for real-time, embedded systems

Steven M. Donahue; Matthew P. Hampton; Morgan Deters; Jonathan M. Nye; Ron K. Cytron; Krishna M. Kavi

doi:10.1007/3-540-45449-7_10

Storage allocation for real-time, embedded systems

Steven M. Donahue
, Matthew P. Hampton
, Morgan Deters
, Jonathan M. Nye
, Ron K. Cytron
, Krishna M. Kavi

Department of Computer Science & Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can offer. However, time-critical applications cannot be written in such languages unless the time taken to allocate and deallocate storage can be reasonably bounded. In this paper, we present algorithms for automatic storage allocation that are appropriate for real-time and embedded systems. We have implemented these algorithms, and results are presented that validate the predictability and efficiency of our approach.

Original language	English
Title of host publication	Embedded Software - 1st International Workshop, EMSOFT 2001, Proceedings
Editors	Thomas A. Henzinger, Christoph M. Kirsch
Publisher	Springer Verlag
Pages	131-147
Number of pages	17
ISBN (Print)	3540426736, 9783540426738
DOIs	https://doi.org/10.1007/3-540-45449-7_10
State	Published - 2001
Event	1st International Workshop on Embedded Software, EMSOFT 2001 - Tahoe City, United States Duration: Oct 8 2001 → Oct 10 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2211
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	1st International Workshop on Embedded Software, EMSOFT 2001
Country/Territory	United States
City	Tahoe City
Period	10/8/01 → 10/10/01

Access to Document

10.1007/3-540-45449-7_10

Cite this

Donahue, S. M., Hampton, M. P., Deters, M., Nye, J. M., Cytron, R. K., & Kavi, K. M. (2001). Storage allocation for real-time, embedded systems. In T. A. Henzinger, & C. M. Kirsch (Eds.), Embedded Software - 1st International Workshop, EMSOFT 2001, Proceedings (pp. 131-147). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2211). Springer Verlag. https://doi.org/10.1007/3-540-45449-7_10

Donahue, Steven M. ; Hampton, Matthew P. ; Deters, Morgan et al. / Storage allocation for real-time, embedded systems. Embedded Software - 1st International Workshop, EMSOFT 2001, Proceedings. editor / Thomas A. Henzinger ; Christoph M. Kirsch. Springer Verlag, 2001. pp. 131-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f76e70c22f1a45d6b73cfe94b814270d,

title = "Storage allocation for real-time, embedded systems",

abstract = "Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can offer. However, time-critical applications cannot be written in such languages unless the time taken to allocate and deallocate storage can be reasonably bounded. In this paper, we present algorithms for automatic storage allocation that are appropriate for real-time and embedded systems. We have implemented these algorithms, and results are presented that validate the predictability and efficiency of our approach.",

author = "Donahue, \{Steven M.\} and Hampton, \{Matthew P.\} and Morgan Deters and Nye, \{Jonathan M.\} and Cytron, \{Ron K.\} and Kavi, \{Krishna M.\}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; 1st International Workshop on Embedded Software, EMSOFT 2001 ; Conference date: 08-10-2001 Through 10-10-2001",

year = "2001",

doi = "10.1007/3-540-45449-7\_10",

language = "English",

isbn = "3540426736",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "131--147",

editor = "Henzinger, \{Thomas A.\} and Kirsch, \{Christoph M.\}",

booktitle = "Embedded Software - 1st International Workshop, EMSOFT 2001, Proceedings",

}

Donahue, SM, Hampton, MP, Deters, M, Nye, JM, Cytron, RK & Kavi, KM 2001, Storage allocation for real-time, embedded systems. in TA Henzinger & CM Kirsch (eds), Embedded Software - 1st International Workshop, EMSOFT 2001, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2211, Springer Verlag, pp. 131-147, 1st International Workshop on Embedded Software, EMSOFT 2001, Tahoe City, United States, 10/8/01. https://doi.org/10.1007/3-540-45449-7_10

Storage allocation for real-time, embedded systems. / Donahue, Steven M.; Hampton, Matthew P.; Deters, Morgan et al.
Embedded Software - 1st International Workshop, EMSOFT 2001, Proceedings. ed. / Thomas A. Henzinger; Christoph M. Kirsch. Springer Verlag, 2001. p. 131-147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2211).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Storage allocation for real-time, embedded systems

AU - Donahue, Steven M.

AU - Hampton, Matthew P.

AU - Deters, Morgan

AU - Nye, Jonathan M.

AU - Cytron, Ron K.

AU - Kavi, Krishna M.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can offer. However, time-critical applications cannot be written in such languages unless the time taken to allocate and deallocate storage can be reasonably bounded. In this paper, we present algorithms for automatic storage allocation that are appropriate for real-time and embedded systems. We have implemented these algorithms, and results are presented that validate the predictability and efficiency of our approach.

AB - Dynamic storage allocation and automatic garbage collection are among the most popular features that high-level languages can offer. However, time-critical applications cannot be written in such languages unless the time taken to allocate and deallocate storage can be reasonably bounded. In this paper, we present algorithms for automatic storage allocation that are appropriate for real-time and embedded systems. We have implemented these algorithms, and results are presented that validate the predictability and efficiency of our approach.

UR - https://www.scopus.com/pages/publications/84947265331

U2 - 10.1007/3-540-45449-7_10

DO - 10.1007/3-540-45449-7_10

M3 - Conference contribution

AN - SCOPUS:84947265331

SN - 3540426736

SN - 9783540426738

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 131

EP - 147

BT - Embedded Software - 1st International Workshop, EMSOFT 2001, Proceedings

A2 - Henzinger, Thomas A.

A2 - Kirsch, Christoph M.

PB - Springer Verlag

T2 - 1st International Workshop on Embedded Software, EMSOFT 2001

Y2 - 8 October 2001 through 10 October 2001

ER -

Donahue SM, Hampton MP, Deters M, Nye JM, Cytron RK, Kavi KM. Storage allocation for real-time, embedded systems. In Henzinger TA, Kirsch CM, editors, Embedded Software - 1st International Workshop, EMSOFT 2001, Proceedings. Springer Verlag. 2001. p. 131-147. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45449-7_10

Storage allocation for real-time, embedded systems

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this