메뉴 건너뛰기




Volumn , Issue , 2005, Pages 68-78

Exploiting frequent field values in java objects for reducing heap memory requirements

Author keywords

Frequent field value; Garbage collection; Heap; Java Virtual Machine

Indexed keywords

EMBEDDED SYSTEMS; OBJECT ORIENTED PROGRAMMING; REFUSE COLLECTION; STORAGE ALLOCATION (COMPUTER);

EID: 32044459895     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064979.1064990     Document Type: Conference Paper
Times cited : (9)

References (30)
  • 8
    • 84858541609 scopus 로고    scopus 로고
    • TinyVM. http://tinyvm.sourceforge.net/index.html.
    • TinyVM
  • 13
    • 0038519356 scopus 로고
    • Hash-consing garbage collection
    • Princeton University, Computer Science Department, Feb.
    • A. W. Appel and M. J. R. Goncalves. Hash-consing garbage collection. Technical Report TR-412-93, Princeton University, Computer Science Department, Feb. 1993.
    • (1993) Technical Report , vol.TR-412-93
    • Appel, A.W.1    Goncalves, M.J.R.2
  • 22
    • 0033338503 scopus 로고    scopus 로고
    • SAMC: A code compression algorithm for embedded processors
    • Dec.
    • H. Lekatsas and W. Wolf. SAMC: a code compression algorithm for embedded processors. IEEE Transactions on CAD, 18(12):1689-1701, Dec. 1999.
    • (1999) IEEE Transactions on CAD , vol.18 , Issue.12 , pp. 1689-1701
    • Lekatsas, H.1    Wolf, W.2
  • 27
    • 0345814794 scopus 로고    scopus 로고
    • A very fast algorithm for RAM compression
    • Apr.
    • L. Rizzo. A very fast algorithm for RAM compression. ACM SIGOPS Operating Systems Review, 31(2):36-45, Apr. 1997.
    • (1997) ACM SIGOPS Operating Systems Review , vol.31 , Issue.2 , pp. 36-45
    • Rizzo, L.1
  • 29


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.