ACM Home Page
Please provide us with feedback. Feedback
Protected heap sharing for memory-constrained java environments
Full text PdfPdf (208 KB)
Source International Conference on Compilers, Architecture and Synthesis for Embedded Systems archive
Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems table of contents
Seoul, Korea
SESSION: Memory systems table of contents
Pages: 212 - 222  
Year of Publication: 2006
ISBN:1-59593-543-6
Authors
Yoonseo Choi  Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea
Hwansoo Han  Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Republic of Korea
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
SIGBED: ACM Special Interest Group on Embedded Systems
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 60,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1176760.1176787
What is a DOI?

ABSTRACT

Multitasking is one of capabilities we often want to have in memory-constrained embedded systems. To support multiple address spaces within a small physical memory, a simple memory management frequently encounters the lack of available memory. Our paper presents an efficient heap memory management scheme that reduces memory footprints by adaptively sharing heaps among multiple tasks in JVM environments. We modified KVM from Sun Microsystems so that Java applications acquire or release heaps in a shared pool on an as-needed basis. To protect address spaces among tasks in the absence of virtual memory capabilities, we use memory protection units (MPUs) by incorporating them into our heap sharing scheme. Our experiments with J2ME MIDP applications show significant reductions by 33% on average, ranging from 6% to 50% in memory usage over the execution. The overheads of our scheme in garbage collection are kept low. The execution times in our scheme increase only by 0.2% on average.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
A. Sloss, D. Symes, and C. Wright. ARM System Developer's Guide. Morgan Kaufmann Publishers, San Francisco, CA, 2004.
4
5
6
 
7
 
8
Connected, Limited Device Configuration (CLDC) 1.0.4. {Online}. Available: http://java.sun.com/javame
 
9
KVM Porting Guide, CLDC, Version 1.0.4, Java 2 Platform, Micro Edition, Santa Clara, CA, Sun Microsystems, Inc., 2002.
 
10
 
11
 
12
MacroExpress® {Online}. Available: http://www.macros.com
 
13
midlet.org -- Wireless Java Download. {Online}. Available: http://midlet.org
 
14
Minoraxis, Inc. {Online}. Available: http://www.minoraxis.com
 
15
Mobile Information Device Profile (MIDP) v2.0. {Online}. Available: http://java.sun.com/javame


Collaborative Colleagues:
Yoonseo Choi: colleagues
Hwansoo Han: colleagues