liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Analysis of a multiple dispatch algorithm
Linköping University, Department of Computer and Information Science.
2004 (English)Independent thesis Basic level (professional degree)Student thesis
Abstract [en]

The development of the new programming language Scream, within the project Software Renaissance, led to the need of a good multiple dispatch algorithm. A multiple dispatch algorithm, called Compressed n-dimensional table with row sharing; CNT-RS, was developed from the algorithm Compressed n-dimensional table, CNT. The purpose of CNT-RS was to create a more efficient algorithm. This report is the result of the work to analyse the CNT-RS algorithm.

In this report the domain of multiple dispatch, the multiple dispatch algorithm CNT and the new extended algorithm CNT-RS are presented. The correctness of CNT- RS algorithm is shown and it’s proven that the CNT-RS algorithm is at least as good as the CNT algorithm, in regards to space complexity of the dispatch structure.

Place, publisher, year, edition, pages
Institutionen för datavetenskap , 2004.
Keyword [en]
Datalogi, dispatch, multiple dispatch, dispatch table, pole, multipole, influence, type hierarchy, pole hierarchy, multipole hierarchy
Keyword [sv]
National Category
Computer Science
URN: urn:nbn:se:liu:diva-2218ISRN: LITH-IDA-EX--04/018--SEOAI: diva2:19548
Available from: 2004-09-17 Created: 2004-09-17

Open Access in DiVA

fulltext(487 kB)695 downloads
File information
File name FULLTEXT01.pdfFile size 487 kBChecksum MD5
Type fulltextMimetype application/pdf

By organisation
Department of Computer and Information Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 695 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 316 hits
ReferencesLink to record
Permanent link

Direct link