SESAME-P: Memory Pool-Based Dynamic Stack Management for Sensor Operating Systems

Authors:
Sangho Yi;Seungwoo Lee;Yookun Cho;Jiman Hong
Affiliations:
School of Computer Science and Engineering, Seoul National University,;Flash Development Division, Hynix Cooperation,;School of Computer Science and Engineering, Seoul National University,;School of Computing, Soongsil University,
Venue:
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Year:
2008

Citing 9
Cited 0

Contiki - A Lightweight and Flexible Operating System for Tiny Networked Sensors

LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
A dynamic operating system for sensor nodes

Proceedings of the 3rd international conference on Mobile systems, applications, and services
Threads without the Pain

Queue - Social Computing
MANTIS OS: an embedded multithreaded operating system for wireless micro sensor platforms

Mobile Networks and Applications
Run-time dynamic linking for reprogramming wireless sensor networks

Proceedings of the 4th international conference on Embedded networked sensor systems
SESAME: space-efficient stack allocation mechanism for multi-threaded sensor operating systems

Proceedings of the 2007 ACM symposium on Applied 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
The emergence of networking abstractions and techniques in TinyOS

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Towards a resilient operating system for wireless sensor networks

ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless sensor networks, each sensor node has very small memory space compared with any other embedded computing systems. For this reason, operating systems running on the sensor nodes cannot allocate sufficient fixed-size stack space for all threads. In the previous work, SESAME was proposed to allocate stack space more space-efficiently, but there is a problem of time overhead. In this paper, we present SESAME-P, which is a dynamic stack allocation scheme based on memory pool. The size of memory pool is predetermined by using static analysis of each function's stack usage information. Using the determined memory pool, SESAME-P reduces the dynamic stack allocation cost. Our experimental results show that SESAME-P significantly reduces the time overhead compared with the existing SESAME.