Name
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. |
Year | Venue | Keywords |
|---|---|---|
2001 | EMSOFT | deallocate storage,popular feature,automatic storage allocation,storage allocation,time-critical application,present algorithm,high-level language,automatic garbage collection,embedded system,dynamic storage allocation,garbage collection,high level language |
Field | DocType | ISBN |
Predictability,Computer science,Real-time operating system,Real-time computing,Resource allocation,Garbage collection,Storage management,Software development,Bounded function,Distributed computing,Embedded system | Conference | 3-540-42673-6 |
Citations | PageRank | References |
9 | 1.46 | 4 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Steven M. Donahue | 1 | 9 | 1.46 |
| Matthew P. Hampton | 2 | 9 | 1.46 |
| Morgan Deters | 3 | 283 | 17.25 |
| Jonathan M. Nye | 4 | 9 | 1.46 |
| Ron K. Cytron | 5 | 1922 | 198.39 |
| Krishna M. Kavi | 6 | 342 | 44.89 |