Title :
Efficient stack sizing for very large software systems
Author :
Rao, D. T V Ramakrishna
Author_Institution :
Infosys Technol. Ltd., Bangalore, India
Abstract :
Accurate determination of stack sizes for tasks is essential for software systems whose tasks have predeclared stack sizes (for example, embedded systems). Underestimation of the stack size can lead to stack overflows, a particularly insidious run time error. Overestimation will lead to wastage of precious memory space of these often memory starved systems. In this paper, we describe a tool which efficiently computes the stack sizes for tasks of very large software systems supporting multiple products. This is in contrast to existing tools which are mainly targeted at small software systems supporting single products. The efficiency of the tool is achieved by using two different types of caches.
Keywords :
cache storage; graph theory; optimisation; program diagnostics; software tools; flow graphs; memory optimization; memory starved systems; stack overflows; stack sizing; static analysis; very large software systems; Cities and towns; Embedded system; Flow graphs; Operating systems; Programming profession; Runtime; Software systems; Yarn; Stack overflow; caches; efficiency; flow graphs; memory optimization; recursion; stack size; static analysis; tool;
Conference_Titel :
Computing & Informatics, 2006. ICOCI '06. International Conference on
Conference_Location :
Kuala Lumpur
Print_ISBN :
978-1-4244-0219-9
Electronic_ISBN :
978-1-4244-0220-5
DOI :
10.1109/ICOCI.2006.5276453