ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 A Dynamic Stack Allocating Method in Multi-Threaded Operating Systems for Wireless Sensor Network Platforms
Cited 2 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
김상철, 김해용, 송준근, 마평수
발행일
200706
출처
International Symposium on Consumer Electronics (ISCE) 2007, pp.1-6
DOI
https://dx.doi.org/10.1109/ISCE.2007.4382142
협약과제
06MW2500, 자동차 센서노드용 초소형 운영체제 개발, 마평수
초록
Typical sensor nodes have a small amount of memory with 2 - 10 KB and even no hardware devices for memory protection such as MMU. Consider multi-threaded sensor applications running on such a memory-constrained hardware platform. In most sensor operating systems, it is assumed that thread stacks are statically allocated. However, this static allocation is not appropriate for memory constrained sensor hardware because shortage of stack memory space can bring in the stack overflow problem. As an alternative method, this paper proposes a dynamic, stack allocating method, which enables to adoptively adjust the stack size of each threads based on the stack usage information. The information of the stack usage is obtained by measurement at run-time. The proposed method also defines a stack reallocating problem and solves it in n steps, where n is the number of thread stacks. Our experimental results showed that the proposed method significantly minimizes the waste of thread stack memory space compared to the static stack allocating method.
KSP 제안 키워드
Alternative method, Hardware Devices, Hardware platform, Memory protection, Memory space, Memory-constrained, Multi-threaded, Run time, Sensor node, Stack Overflow, Static wireless sensor networks(WSNs)