JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25]


Journal of Information Science and Engineering, Vol. 26 No. 3, pp. 1137-1150


An Efficient Stack Management for Sensor Operating Systems

JUNYOUNG HEO1, BONCHEOL GU2, YOOKUN CHO2 AND JIMAN HONG3+
1Department of Computer Engineering 
Hansung University 
Seoul, 136-792 Korea 
2School of Computer Science and Engineering 
Seoul National University 
Seoul, 151-742 Korea 
3School of Computer Science and Engineering 
Soongsil University 
Seoul, 156-743 Korea

    Operating systems for sensor networks must provide energy and memory-space efficient execution environments for applications because of the resource constraints of the sensor nodes. The shared-stack cooperative threads have been proposed to conserve stack memory-space and to minimize the possibility of stack overflow in the sensor operating systems. However, stack switching brings about external fragmentations in the stack space. Compaction may remove the fragmentation but the compaction overhead could degrade the performance. In this paper, we propose an efficient scheme to determine the compaction time of a shared-stack to reduce the number of compactions. For determining the time of a compaction, we evaluated the expected stack overflow time according to our stack model, which is based on the continuous time Markov chain. Our simulation results show that the number of compactions is greatly reduced and the lifetime of the sensor networks is increased with using our proposed scheme.

Keywords: operating systems, sensor networks, cooperative threads, stack overflow, memory external fragmentation, continuous time Markov chain

  Retrieve PDF document (JISE_201003_25.pdf)