상세정보
학술대회
A Fast Lock-Free User Memory Space Allocator for Embedded Systems
- 발행일
- 201106
- 출처
- International Conference on Computational Science and Its Applications (ICCSA), pp.227-230
- 협약과제
- 11MS1900, 고신뢰 자율제어 SW를 위한 CPS핵심기술 개발, 김원태
- 초록
- Many embedded systems get improvements on hardware such as massive memory and multi-cores. According these improvements, some application that demands per-formance of excessive operations per seconds has been app-eared. These applications often use dynamic memory allocation. But, existing allocators does not scale well, thus those applications is limited theirs performance by allocators. Moreover, because the applications that run on embedded systems are rarely powered-off, the external fragmentation problem is critical. This paper introduces the allocator, lock-free and scalable that free the synchronization cost and low the fragmentation. Our allocator has per-thread heap and allocate the close size memory instead of the exact size of memory to reduce synchronization cost and allocation/de-allocation time. Our result on test application that can be run with 1 to 32 threads demonstrate that our allocator yields low average fragmentation and improves overall program performance over the standard Linux allocator by up to a factor of 60 on 32 threads, and up to a factor of 10 over the next best allocator we tested. © 2011 IEEE.
- KSP 제안 키워드
- Dynamic memory allocation, Embedded system, Fast lock, Memory space, external fragmentation, lock-free, multi-Core