메뉴 건너뛰기




Volumn 38, Issue 11, 2003, Pages 313-325

Object equality profiling

Author keywords

Java language; Object equality; Object mergeability; Profile guided optimization; Profiling; Space savings

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; GRAPH THEORY; JAVA PROGRAMMING LANGUAGE; MERGING; OPTIMIZATION; PROGRAM PROCESSORS; SOFTWARE ENGINEERING; STORAGE ALLOCATION (COMPUTER);

EID: 1442288490     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/949343.949333     Document Type: Conference Paper
Times cited : (49)

References (41)
  • 8
    • 0038519356 scopus 로고
    • Hash-consing garbage collection
    • Technical Report TR-412-93, 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)
    • Appel, A.W.1    Goncalves, M.J.R.2
  • 12
    • 0003048561 scopus 로고
    • An introduction to the theory of lists
    • In M. Broy, editor; Springer
    • R. S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, pages 3-42. Springer, 1987.
    • (1987) Logic of Programming and Calculi of Discrete Design , pp. 3-42
    • Bird, R.S.1
  • 22
    • 1442309362 scopus 로고
    • Monocopy and associative algorithms in an extended Lisp
    • Technical Report 74-03, Information Science Laboratory, University of Tokyo, Tokyo, Japan, May
    • E. Goto. Monocopy and associative algorithms in an extended Lisp. Technical Report 74-03, Information Science Laboratory, University of Tokyo, Tokyo, Japan, May 1974.
    • (1974)
    • Goto, E.1
  • 24
    • 0002197352 scopus 로고
    • An n log n algorithm for minimizing the states in a finite automation
    • Academic Press
    • J. E. Hopcroft. An n log n algorithm for minimizing the states in a finite automation. In The Theory of Machines and Computations, pages 1989-196. Academic Press, 1971.
    • (1971) The Theory of Machines and Computations , pp. 189-196
    • Hopcroft, J.E.1
  • 26
    • 0002444193 scopus 로고
    • Memo functions and machine learning
    • Apr.
    • D. Michie. "memo" functions and machine learning. Nature, 218, Apr. 1968.
    • (1968) Nature , pp. 218
    • Michie, D.1
  • 27
    • 0037842940 scopus 로고    scopus 로고
    • The wizard of tilt: Efficient?, convenient and abstract type representations
    • Technical Report CMU-CS-02-120, School of Computer Science, Carnegie Mellon University, Mar.
    • T. Murphy, B. Harper, and K. Crary. The wizard of tilt: Efficient?, convenient and abstract type representations. Technical Report CMU-CS-02-120, School of Computer Science, Carnegie Mellon University, Mar. 2002. http://www-2.cs.cmu.edu/~tom7/papers/wizard.ps.gz
    • (2002)
    • Murphy, T.1    Harper, B.2    Crary, K.3
  • 35
    • 0031622773 scopus 로고    scopus 로고
    • A study of dead data members in C++ applications
    • In SIGPLAN '98 Conference on Programming Language Design and Implementation; June
    • P. Sweeney and F. Tip. A study of dead data members in C++ applications. In SIGPLAN '98 Conference on Programming Language Design and Implementation, pages 324-332, June 1998. SIGPLAN Notices, 33(5).
    • (1998) SIGPLAN Notices , vol.33 , Issue.5 , pp. 324-332
    • Sweeney, P.1    Tip, F.2
  • 36
    • 0004238565 scopus 로고    scopus 로고
    • SPEC JVM98 Benchmarks
    • The Standard Performance Evaluation Corporation. SPEC JVM98 Benchmarks. http://www.spec.org/osg/jvm98/, 1998.
    • (1998)
  • 38
    • 1442333755 scopus 로고    scopus 로고
    • Package java.lang.ref. http://java.sun.com/j2se/1.4/docs/api/java/lang/ref/package-summary.html.
  • 39
    • 1442309363 scopus 로고    scopus 로고
    • Sept.
    • WebSphere application server development best practices for performance and scalability. White paper available from http://www-3.ibm.com/software/webservers/appserv/ws_bestpractices.pdf, Sept. 2000.
    • (2000)


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