OTL: On-Demand Thread Stack Allocation Scheme for Real-Time Sensor Operating Systems

Authors:
Sangho Yi;Seungwoo Lee;Yookun Cho;Jiman Hong
Affiliations:
System Software Research Laboratory, School of Computer Science and Engineering, Seoul National University,;System Software Research Laboratory, School of Computer Science and Engineering, Seoul National University,;System Software Research Laboratory, School of Computer Science and Engineering, Seoul National University,;School of Computing, Soongsil University,
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Year:
2007

Citing 4
Cited 0

Monitors: an operating system structuring concept

Communications of the ACM
Cooperative Task Management Without Manual Stack Management

ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Threads without the Pain

Queue - Social Computing
Why events are a bad idea (for high-concurrency servers)

HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless sensor networks, each sensor node has severe resource constraints in terms of energy, computing device, and memory space. Especially, the memory space of the platform hardware is much smaller than that of the other computing systems. In this paper, we propose a OTL, which is an on-demand thread stack allocation scheme for MMU-less real-time sensor operating systems. The OTL enables to adaptively adjust the stack size by allocating stack frame based on the amount of each function's stack usage. The amount of the function's stack usage is checked at compile-time, and the adaptive adjustment of the stack occurs at run-time. Our experimental results show that the OTL significantly minimizes the spatial overhead of the threads' stacks with tolerable time overhead compared with fixed stack allocation mechanism of the existing sensor operating systems.