Finding Memory Bound of Cloned Objects in Software Transactional Memory Programs.
Saved in:
| Title: | Finding Memory Bound of Cloned Objects in Software Transactional Memory Programs. |
|---|---|
| Authors: | Nguyen, Ngoc-Khai, Truong, Anh-Hoang, Dang, Duc-Hanh |
| Source: | International Journal of Software Engineering & Knowledge Engineering; Jun2022, Vol. 32 Issue 6, p791-818, 28p |
| Subject Terms: | MEMORY, COMPUTER software |
| Abstract: | Software transactional memory (STM) programs usually use more memory resources than traditional programs. Therefore, estimating an upper bound of memory resources used by an STM program is crucial for optimizing the program and reducing the risks of out-of-memory runtime exceptions. However, due to the complex nesting of transactions and threads, the estimation problem is challenging. In our previous work, we have developed several type systems to address the problem for core imperative languages with STM primitives. This work advances our previous works, in which we add object-oriented constructs to the language while keeping the STM primitives, to make the language closer to practical languages. Then, we built a type system to statically estimate the maximum memory required by well-typed programs of the language. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Software Engineering & Knowledge Engineering is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Nájsť tento článok vo Web of Science Be the first to leave a comment!