Dynamic memory management for embedded real-time systems

被引:0
作者
Crespo, A. [1 ]
Ripoll, I. [1 ]
Masmano, M. [1 ]
机构
[1] Univ Politecn Valencia, Valencia 46022, Spain
来源
FROM MODEL-DRIVEN DESIGN TO RESOURCE MANAGEMENT FOR DISTRIBUTED EMBEDDED SYSTEMS | 2006年 / 225卷
关键词
dynamic memory allocation; real-time systems; embedded systems;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Dynamic memory storage has been widely used during years in computer science. However, its use in real-time systems has not been considered as an important issue because the spatial and temporal worst case for allocation and deallocation operations were unbounded or bounded but with a very large bound. TLSF (Two Level Segregated Fit) is a new allocator has been designed specifically to meet real-time constraints. These constraints are addressed in two axis: Time and Space. While the temporal behaviour of TLSF is excellent, 0(l), the spatial behaviour is as the best of the known allocators. The spatial constraint is specially required in embedded systems with mitided resources. An efficient and guaranteed use of memory is needed for these systems. In this paper we compare the temporal and spatial performances of the TLSF allocator comparing it with the most relevant allocators.
引用
收藏
页码:195 / +
页数:2
相关论文
共 13 条
[1]  
JOHNSTONE MS, 1998, P INT S MEM MAN VANC
[2]  
Knuth Donald E., 1973, ART COMPUTER PROGRAM, V1
[3]  
LEA D, 1996, UNIX MAIL
[4]   TLSF: a new dynamic memory allocator for real-time systems [J].
Masmano, M ;
Ripoll, I ;
Crespo, A ;
Real, J .
16TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2004, :79-88
[5]   DYNAMIC MEMORY ALLOCATION IN COMPUTER-SIMULATION [J].
NIELSEN, NR .
COMMUNICATIONS OF THE ACM, 1977, 20 (11) :864-873
[6]  
OGASAWARA T, 1995, 2 INT WORKSH REAL TI, P21
[7]   BOUNDS FOR SOME FUNCTIONS CONCERNING DYNAMIC STORAGE ALLOCATION [J].
ROBSON, JM .
JOURNAL OF THE ACM, 1974, 21 (03) :491-499
[8]   ESTIMATE OF STORE SIZE NECESSARY FOR DYNAMIC STORAGE ALLOCATION [J].
ROBSON, JM .
JOURNAL OF THE ACM, 1971, 18 (03) :416-&
[9]   WORST CASE FRAGMENTATION OF 1ST FIT AND BEST FIT STORAGE ALLOCATION STRATEGIES [J].
ROBSON, JM .
COMPUTER JOURNAL, 1977, 20 (03) :242-244
[10]  
Sedgewick R., 1998, ALGORITHMS C, V3rd