Skip to main content

Just-in-Time Data Structures

De Wael, Mattias, Marr, Stefan, De Koster, Joeri, Sartor, Jennifer B., De Meuter, Wolfgang (2015) Just-in-Time Data Structures. In: Proceedings of the 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software. (doi:10.1145/2814228.2814231)

PDF - Author's Accepted Manuscript
Download (273kB) Preview
[img]
Preview
Official URL
http://doi.org/10.1145/2814228.2814231

Abstract

Today, software engineering practices focus on finding the single right data representation (i.e., data structure) for a program. The right data representation, however, might not exist: relying on a single representation of the data for the lifetime of the program can be suboptimal in terms of performance. We explore the idea of developing data structures for which changing the data representation is an intrinsic property. To this end we introduce Just-in-Time Data Structures, which enable representation changes at runtime, based on declarative input from a performance expert programmer. Just-in-Time Data Structures are an attempt to shift the focus from finding the ``right’’ data structure to finding the right sequence of data representations. We present JitDS-Java, an extension to the Java language, to develop Just-in-Time Data Structures. Further, we show two example programs that benefit from changing the representation at runtime.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1145/2814228.2814231
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Stefan Marr
Date Deposited: 26 Dec 2017 17:44 UTC
Last Modified: 29 May 2019 19:38 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/63822 (The current URI for this page, for reference purposes)
Marr, Stefan: https://orcid.org/0000-0001-9059-5180
  • Depositors only (login required):

Downloads

Downloads per month over past year