메뉴 건너뛰기




Volumn 2622, Issue , 2003, Pages 185-199

Integrating generations with advanced reference counting garbage collectors

Author keywords

Garbage collection; Generational Garbage Collection; Memory management; Runtime systems

Indexed keywords

REFUSE COLLECTION;

EID: 35248881561     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36579-6_14     Document Type: Article
Times cited : (9)

References (26)
  • 1
    • 35248818432 scopus 로고    scopus 로고
    • Technical Report, Faculty of Computer Science, Technion, Israel Institute of Technology, October
    • Hezi Azatchi and Erez Petrank. Integrating Generations with Advanced Reference Counting Garbage Collectors. Technical Report, Faculty of Computer Science, Technion, Israel Institute of Technology, October 2002. Available at http://www.cs.technion.ac.il/∼erez/publications.html.
    • (2002) Integrating Generations with Advanced Reference Counting Garbage Collectors
    • Azatchi, H.1    Petrank, E.2
  • 4
    • 35248817461 scopus 로고    scopus 로고
    • Concurrent Cycle Collection in Reference Counted Systems
    • University Eötvös Lorand, Budapest, Hungary, June 18-22
    • D. Bacon and V. Rajan. Concurrent Cycle Collection in Reference Counted Systems. Fifteenth European Conference on Object-Oriented Programming (ECOOP), University Eötvös Lorand, Budapest, Hungary, June 18-22 2001.
    • (2001) Fifteenth European Conference on Object-Oriented Programming (ECOOP)
    • Bacon, D.1    Rajan, V.2
  • 5
    • 0017956645 scopus 로고
    • List processing in real-time on a serial computer
    • Henry G. Baker. List processing in real-time on a serial computer. Communications of the ACM, 21(4):280-94, 1978.
    • (1978) Communications of the ACM , vol.21 , Issue.4 , pp. 280-294
    • Baker, H.G.1
  • 6
    • 84976807106 scopus 로고
    • Minimising reference count updating with deferred and anchored pointers for functional data structures
    • September
    • Henry G. Baker. Minimising reference count updating with deferred and anchored pointers for functional data structures. ACM SIGPLAN Notices, 29(9), September 1994.
    • (1994) ACM SIGPLAN Notices , vol.29 , Issue.9
    • Baker, H.G.1
  • 8
    • 84945708437 scopus 로고
    • A method for overlapping and erasure of lists
    • December
    • George E. Collins. A method for overlapping and erasure of lists. Communications of the ACM, 3(12):655-657, December 1960.
    • (1960) Communications of the ACM , vol.3 , Issue.12 , pp. 655-657
    • Collins, G.E.1
  • 10
    • 0016993741 scopus 로고
    • An efficient incremental automatic garbage collector
    • September
    • L. Peter Deutsch and Daniel G. Bobrow. An efficient incremental automatic garbage collector. Communications of the ACM, 19(9):522-526, September 1976.
    • (1976) Communications of the ACM , vol.19 , Issue.9 , pp. 522-526
    • Deutsch, L.P.1    Bobrow, D.G.2
  • 12
    • 0028121963 scopus 로고
    • Portable, unobtrusive garbage collection for multiprocessor systems
    • Damien Doligez and Georges Gonthier. Portable, unobtrusive garbage collection for multiprocessor systems. In POPL 1994.
    • (1994) POPL
    • Doligez, D.1    Gonthier, G.2
  • 13
    • 0027206301 scopus 로고
    • A concurrent generational garbage collector for a multi-threaded implementation of ML
    • Damien Doligez and Xavier Leroy. A concurrent generational garbage collector for a multi-threaded implementation of ML. In POPL 1993.
    • (1993) POPL
    • Doligez, D.1    Leroy, X.2
  • 16
    • 35248896376 scopus 로고
    • Parallel conservative garbage collection with fast allocation
    • Paul R. Wilson and Barry Hayes, editors, October
    • Shinichi Furusou, Satoshi Matsuoka, and Akinori Yonezawa. Parallel conservative garbage collection with fast allocation. In Paul R. Wilson and Barry Hayes, editors, GC workshop at OOPSLA, October 1991.
    • (1991) GC Workshop at OOPSLA
    • Furusou, S.1    Matsuoka, S.2    Yonezawa, A.3
  • 18
    • 0020765079 scopus 로고
    • A Real Time Garbage Collector Based on the Lifetimes of Objects
    • H. Lieberman and C. E. Hewitt. A Real Time Garbage Collector Based on the Lifetimes of Objects. Communications of the ACM, 26(6), pages 419-429, 1983.
    • (1983) Communications of the ACM , vol.26 , Issue.6 , pp. 419-429
    • Lieberman, H.1    Hewitt, C.E.2
  • 19
    • 0005299837 scopus 로고
    • Static analysis for optimising reference counting
    • August
    • Young G. Park and Benjamin Goldberg. Static analysis for optimising reference counting. IPL, 55(4):229-234, August 1995.
    • (1995) IPL , vol.55 , Issue.4 , pp. 229-234
    • Park, Y.G.1    Goldberg, B.2
  • 21
    • 0034592435 scopus 로고    scopus 로고
    • A generational mostly-concurrent garbage collector
    • Tony Printezis and David Detlefs. A generational mostly-concurrent garbage collector. ISMM 2000.
    • (2000) ISMM
    • Printezis, T.1    Detlefs, D.2
  • 22
    • 0010828503 scopus 로고    scopus 로고
    • One-bit counts between unique and sticky
    • October ACM Press
    • David J. Roth and David S. Wise. One-bit counts between unique and sticky. ACM SIGPLAN Notices, pages 49-56, October 1998. ACM Press.
    • (1998) ACM SIGPLAN Notices , pp. 49-56
    • Roth, D.J.1    Wise, D.S.2
  • 23
    • 35248829187 scopus 로고    scopus 로고
    • Standard Performance Evaluation Corporation, http://www.spec.org/
  • 24
    • 84976790288 scopus 로고
    • Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm
    • May
    • D. Ungar. Generation Scavenging: A Non-disruptive High Performance Storage Reclamation Algorithm. ACM SIGPLAN Notices Vol. 19, No. 5, May 1984, pp. 157-167.
    • (1984) ACM SIGPLAN Notices , vol.19 , Issue.5 , pp. 157-167
    • Ungar, D.1
  • 25
    • 0005258563 scopus 로고
    • Symmetric list processor
    • September
    • J. Weizenbaum. Symmetric list processor. Communications of the ACM, 6(9):524-544, September 1963.
    • (1963) Communications of the ACM , vol.6 , Issue.9 , pp. 524-544
    • Weizenbaum, J.1
  • 26
    • 4243264434 scopus 로고
    • Technical Report 360, Indiana University, Computer Science Department, March
    • David S. Wise. Stop and one-bit reference counting. Technical Report 360, Indiana University, Computer Science Department, March 1993.
    • (1993) Stop and One-bit Reference Counting
    • Wise, D.S.1


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