메뉴 건너뛰기




Volumn , Issue , 2002, Pages 142-160

Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching

Author keywords

Dispatch; Hierarchy; Incremental; Message; Subtyping; Type slicing

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; OBJECT ORIENTED PROGRAMMING; PERFORMANCE; STORAGE ALLOCATION (COMPUTER); SYSTEMS ANALYSIS;

EID: 0037821960     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (22)

References (71)
  • 8
    • 0017216776 scopus 로고
    • Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
    • Dec.
    • K. S. Booth and G. S. Leuker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Sys. Sci., 13(3):335-379, Dec. 1976.
    • (1976) J. Comput. Sys. Sci. , vol.13 , Issue.3 , pp. 335-379
    • Booth, K.S.1    Leuker, G.S.2
  • 9
    • 0003850286 scopus 로고
    • The Cecil language, specification and rationale
    • Technical Report TR-93-03-05, University of Washington, Seattle
    • C. Chambers. The Cecil language, specification and rationale. Technical Report TR-93-03-05, University of Washington, Seattle, 1993.
    • (1993)
    • Chambers, C.1
  • 12
    • 84976654194 scopus 로고
    • Type-extension tests can be performed in constant time
    • N. H. Cohen. Type-extension tests can be performed in constant time. ACM Trans. Prog. Lang. Syst., 13:626-629, 1991.
    • (1991) ACM Trans. Prog. Lang. Syst. , vol.13 , pp. 626-629
    • Cohen, N.H.1
  • 16
    • 0021199937 scopus 로고
    • Efficient implementation of the smalltalk-80 system
    • Salt Lake City, Utah, Jan.; ACM SIGPLAN - SIGACT, ACM Press
    • P. Deutsch and A. Schiffman. Efficient implementation of the Smalltalk-80 system. In 11th Symposium on Principles of Programming Languages, POPL'84, pages 297-302, Salt Lake City, Utah, Jan. 1984. ACM SIGPLAN - SIGACT, ACM Press.
    • (1984) 11th Symposium on Principles of Programming Languages, POPL'84 , pp. 297-302
    • Deutsch, P.1    Schiffman, A.2
  • 17
    • 85032407078 scopus 로고
    • Maintaining order in a linked list
    • San Francisco, California, United States; ACM Press
    • P. F. Dietz. Maintaining order in a linked list. In Proc. of the 14th Ann. ACM Symp. on Theory of Computing, pages 122-127, San Francisco, California, United States, 1982. ACM Press.
    • (1982) Proc. of the 14th Ann. ACM Symp. on Theory of Computing , pp. 122-127
    • Dietz, P.F.1
  • 18
    • 0023545512 scopus 로고
    • Two algorithms for maintaining order in a list
    • New York, New York, United States; ACM Press
    • P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. of the 19th Ann. ACM Symp. on Theory of Computing, pages 365-372, New York, New York, United States, 1987. ACM Press.
    • (1987) Proc. of the 19th Ann. ACM Symp. on Theory of Computing , pp. 365-372
    • Dietz, P.F.1    Sleator, D.D.2
  • 22
    • 26144466805 scopus 로고    scopus 로고
    • Software and hardware techniques for efficient polymorphic calls
    • Technical Report TRCS99-24, University of California, Santa Barbara. Computer Science., July 15
    • K. Driesen. Software and hardware techniques for efficient polymorphic calls. Technical Report TRCS99-24, University of California, Santa Barbara. Computer Science., July 15, 1999.
    • (1999)
    • Driesen, K.1
  • 25
    • 26144473150 scopus 로고
    • Message dispatch on modern computer architectures
    • Technical Report TRCS94-20, University of California, Santa Barbara. Computer Science., Feb. 9
    • K. Driesen, U. Hölzle, and J. Vitek. Message dispatch on modern computer architectures. Technical Report TRCS94-20, University of California, Santa Barbara. Computer Science., Feb. 9, 1995.
    • (1995)
    • Driesen, K.1    Hölzle, U.2    Vitek, J.3
  • 27
    • 4244100340 scopus 로고    scopus 로고
    • Efficient dispatch of multimethods in constant time using dispatch trees
    • Technical Report RR-2892, Inria, Institut National de Recherche en Informatique et en Automatique
    • E. Dujardin. Efficient dispatch of multimethods in constant time using dispatch trees. Technical Report RR-2892, Inria, Institut National de Recherche en Informatique et en Automatique, 1996.
    • (1996)
    • Dujardin, E.1
  • 28
    • 0031598987 scopus 로고    scopus 로고
    • Fast algorithms for compressed multimethod dispatch table generation
    • Jan.
    • E. Dujardin, E. Amiel, and E. Simon. Fast algorithms for compressed multimethod dispatch table generation. ACM Trans. Prog. Lang. Syst., 20(1):116-165, Jan. 1998.
    • (1998) ACM Trans. Prog. Lang. Syst. , vol.20 , Issue.1 , pp. 116-165
    • Dujardin, E.1    Amiel, E.2    Simon, E.3
  • 36
    • 0032662012 scopus 로고    scopus 로고
    • Multi-method dispatching: A geometric approach with applications to string matching problems
    • Atlanta, Georgia, United States; ACM Press
    • P. Ferragina, S. Muthukrishnan, and M. de Berg. Multi-method dispatching: A geometric approach with applications to string matching problems. In Proc. of the 31st Ann. ACM Symp. on Theory of Computing, pages 483-491, Atlanta, Georgia, United States, 1999. ACM Press.
    • (1999) Proc. of the 31st Ann. ACM Symp. on Theory of Computing , pp. 483-491
    • Ferragina, P.1    Muthukrishnan, S.2    De Berg, M.3
  • 42
    • 4243560781 scopus 로고    scopus 로고
    • Multi-method dispatch using single-receiver projections
    • Technical Report TR-98-03, University of Alberta, Edmonton, Alberta, Canada
    • W. Holst, D. Szafron, Y. Leontiev, and C. Pang. Multi-method dispatch using single-receiver projections. Technical Report TR-98-03, University of Alberta, Edmonton, Alberta, Canada, 1998.
    • (1998)
    • Holst, W.1    Szafron, D.2    Leontiev, Y.3    Pang, C.4
  • 46
    • 26144452422 scopus 로고    scopus 로고
    • Efficient compression of generic function dispatch tables
    • Technical Report TR2001-404, Dartmouth College, Computer Science, NH, June
    • E. Kidd. Efficient Compression of Generic Function Dispatch Tables. Technical Report TR2001-404, Dartmouth College, Computer Science, NH, June 2001.
    • (2001)
    • Kidd, E.1
  • 49
    • 0004198444 scopus 로고
    • Object-Oriented Series. Prentice-Hall, Hemel Hempstead, Hertfordshire, UK
    • B. Meyer, EIFFEL the Language. Object-Oriented Series. Prentice-Hall, Hemel Hempstead, Hertfordshire, UK, 1992.
    • (1992) EIFFEL the Language
    • Meyer, B.1
  • 52
    • 0037493576 scopus 로고    scopus 로고
    • Efficient message dispatch in object-oriented systems
    • Mar.
    • M. Naik and R. Kumar. Efficient message dispatch in object-oriented systems. ACM SIGPLAN Notices, 35(3):49-58, Mar. 2000.
    • (2000) ACM SIGPLAN Notices , vol.35 , Issue.3 , pp. 49-58
    • Naik, M.1    Kumar, R.2
  • 57
    • 84947943972 scopus 로고    scopus 로고
    • Multi-method dispatch using multiple row displacement
    • In Pang et al. ECOOP'99. Proceedings of the 13th European Conference on Object-Oriented Programming, number 1628 in Lecture Notes in Computer Science, Lisbon, Portugal, June 14-18 1999. Springer Verlag
    • C. Pang, W. Holst, Y. Leontiev, and D. Szaforon Multi-method dispatch using multiple row displacement. In Pang et al. ECOOP'99. Proceedings of the 13th European Conference on Object-Oriented Programming, number 1628 in Lecture Notes in Computer Science, Lisbon, Portugal, June 14-18 1999. Springer Verlag. pages 304-328.
    • Pang, C.1    Holst, W.2    Leontiev, Y.3    Szaforon, D.4
  • 59
    • 0026995442 scopus 로고
    • Optimizing method search with lookup caches and incremental coloring
    • Vancouver, British Columbia, Canada, Oct. 18-22 1992. OOPSLA'92, ACM SIGPLAN Notices; Oct.
    • A. Royer. Optimizing Method Search with Lookup Caches and Incremental Coloring. In Proceedings of the 7th Annual Conference on Object-Oriented Programming Systems, Languages, and Applications, pages 110-126, Vancouver, British Columbia, Canada, Oct. 18-22 1992. OOPSLA'92, ACM SIGPLAN Notices 27(10) Oct. 1992.
    • (1992) Proceedings of the 7th Annual Conference on Object-Oriented Programming Systems, Languages, and Applications , vol.27 , Issue.10 , pp. 110-126
    • Royer, A.1
  • 61
    • 0004027344 scopus 로고    scopus 로고
    • Addison-Wesley, Reading, Massachusetts, 3rd edition
    • B. Stroustrup. The C++ Programming Language. Addison-Wesley, Reading, Massachusetts, 3rd edition, 1997.
    • (1997) The C++ Programming Language
    • Stroustrup, B.1
  • 63
    • 0002484064 scopus 로고
    • Preserving order in a forest in less than logarithmic time and linear space
    • P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6(3):80-82, 1977.
    • (1977) Information Processing Letters , vol.6 , Issue.3 , pp. 80-82
    • Van Emde Boas, P.1
  • 64
    • 34250391491 scopus 로고
    • Design and implementation of an efficient priority queue
    • P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Systems Theory, 10:99-127, 1977.
    • (1977) Math. Systems Theory , vol.10 , pp. 99-127
    • Van Emde Boas, P.1    Kaas, R.2    Zijlstra, E.3
  • 65
    • 0037831087 scopus 로고
    • Compact dispatch tables for dynamically typed programming languages
    • Master's thesis, University of Victoria
    • J. Vitek. Compact dispatch tables for dynamically typed programming languages. Master's thesis, University of Victoria, 1995.
    • (1995)
    • Vitek, J.1
  • 68
    • 0021449238 scopus 로고
    • New trie data structures which support very fast search operations
    • D. E. Willard. New trie data structures which support very fast search operations. J. Comput. Sys. Sci., 28:379-394, 1984.
    • (1984) J. Comput. Sys. Sci. , vol.28 , pp. 379-394
    • Willard, D.E.1
  • 70
    • 4243986742 scopus 로고    scopus 로고
    • Theory and practice of incremental subtyping tests and message dispatching
    • Manuscript
    • Y. Zibin and J. Y. Gil. Theory and practice of incremental subtyping tests and message dispatching. http://www.cs.technion.ac.il/~zyoav. Manuscript.
    • Zibin, Y.1    Gil, J.Y.2


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