40 search results - page 4 / 8 » Live Heap Space Bounds for Real-Time Systems |
RTSS
2008
IEEE
14 years 1 months ago
2008
IEEE
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
POPL
2003
ACM
14 years 7 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
LCTRTS
2005
Springer
14 years 1 months ago
2005
Springer
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...
ECOOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. While real-time garbage collection is now available in production virtual machines, the lack of generational capability means applications with high allocation rates are ...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...