lnu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Dynamically transforming data structures
Linnaeus University, Faculty of Technology, Department of Computer Science. (Software Technology Labs)
Linnaeus University, Faculty of Technology, Department of Computer Science. (Software Technology Labs)ORCID iD: 0000-0002-7565-3714
2013 (English)In: 2013 IEEE/ACM 28th International Conference on Automated Software Engineering (ASE): Proceedings / [ed] Ewewn Denney, Tevfik Bultan, Andreas Zeller, IEEE, 2013, 410-420 p.Conference paper, Published paper (Refereed)
Abstract [en]

Fine-tuning which data structure implementation to use for a given problem is sometimes tedious work since the optimum solution depends on the context, i.e., on the operation sequences, actual parameters as well as on the hardware available at run time. Sometimes a data structure with higher asymptotic time complexity performs better in certain contexts because of lower constants. The optimal solution may not even be possible to determine at compile time.We introduce transformation data structures that dynamically change their internal representation variant based on a possibly changing context. The most suitable variant is selected at run time rather than at compile time.We demonstrate the effect on performance with a transformation ArrayList data structure using an array variant and a linked hash bag variant as alternative internal representations. Using our transformation ArrayList, the standard DaCapo benchmark suite shows a performance gain of 5.19% in average.

Place, publisher, year, edition, pages
IEEE, 2013. 410-420 p.
Series
IEEE ACM International Conference on Automated Software Engineering, ISSN 1527-1366
Keyword [en]
possibly changing context, transformation ArrayList data structure, hash bag variant, DaCapo benchmark suite, internal representation variant
National Category
Computer Science
Research subject
Computer and Information Sciences Computer Science, Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-28100DOI: 10.1109/ASE.2013.6693099ISI: 000331090200041Scopus ID: 2-s2.0-84893634611ISBN: 978-1-4799-0215-6 (print)OAI: oai:DiVA.org:lnu-28100DiVA: diva2:640521
Conference
28th IEEE/ACM International Conference on Automated Software Engineering (ASE 2013), Palo Alto, CA, NOV 11-15, 2013
Available from: 2013-08-13 Created: 2013-08-13 Last updated: 2017-04-24Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Österlund, ErikLöwe, Welf

Search in DiVA

By author/editor
Österlund, ErikLöwe, Welf
By organisation
Department of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 137 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf