Data structures and dynamic memory management in reversible languages

Martin Holm  Cservenka; Robert Glück; Tue Haulund; Torben Ægidius Mogensen

doi:10.1007/978-3-319-99498-7_19

Data structures and dynamic memory management in reversible languages

Martin Holm Cservenka, Robert Glück, Tue Haulund, Torben Ægidius Mogensen

3 Citationer (Scopus)

Abstract

We present a method for reversible dynamic memory management based on a reversible version of the Buddy Memory system. This method supports decoupled allocation and deallocation of variable-sized records and can be applied to any reversible language with heap storage. We demonstrate how these new capabilities allow for the direct realization of commonplace data structures such as trees, heaps and queues which until now has not been practical in a reversible language. Finally, we provide a definition of our method in the high-level reversible language Janus as well as a description of its fragmentation and garbage-generation characteristics. The reversible memory management system has been fully implemented and tested in a compiler for a reversible object-oriented programming language targeting the reversible assembly language PISA.

Originalsprog	Engelsk
Titel	Reversible Computation : 10th International Conference, RC 2018, 2018, Proceedings
Redaktører	Jarkko Kari, Irek Ulidowski
Forlag	Springer
Publikationsdato	2018
Sider	269-285
ISBN (Elektronisk)	978-3-319-59936-6
DOI	https://doi.org/10.1007/978-3-319-99498-7_19
Status	Udgivet - 2018
Begivenhed	10th International Conference on Reversible Computation, RC 2018 - Leicester, Storbritannien Varighed: 12 sep. 2018 → 14 sep. 2018

Konference

Konference	10th International Conference on Reversible Computation, RC 2018
Land/Område	Storbritannien
By	Leicester
Periode	12/09/2018 → 14/09/2018

Navn	Lecture notes in computer science
Vol/bind	11106
ISSN	0302-9743

Adgang til dokumentet

10.1007/978-3-319-99498-7_19

Andre filer og links

Link to publication in Scopus

Citationsformater

Cservenka, M. H., Glück, R., Haulund, T., & Mogensen, T. Æ. (2018). Data structures and dynamic memory management in reversible languages. I J. Kari, & I. Ulidowski (red.), Reversible Computation: 10th International Conference, RC 2018, 2018, Proceedings (s. 269-285). Springer. Lecture notes in computer science Bind 11106 https://doi.org/10.1007/978-3-319-99498-7_19

Data structures and dynamic memory management in reversible languages. / Cservenka, Martin Holm ; Glück, Robert; Haulund, Tue et al.

Reversible Computation: 10th International Conference, RC 2018, 2018, Proceedings. red. / Jarkko Kari; Irek Ulidowski. Springer, 2018. s. 269-285 (Lecture notes in computer science, Bind 11106).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review

Cservenka, MH, Glück, R, Haulund, T & Mogensen, TÆ 2018, Data structures and dynamic memory management in reversible languages. i J Kari & I Ulidowski (red), Reversible Computation: 10th International Conference, RC 2018, 2018, Proceedings. Springer, Lecture notes in computer science, bind 11106, s. 269-285, 10th International Conference on Reversible Computation, RC 2018, Leicester, Storbritannien, 12/09/2018. https://doi.org/10.1007/978-3-319-99498-7_19

@inproceedings{77dff0db7d224cf2ae8c6edab886c8a9,

title = "Data structures and dynamic memory management in reversible languages",

abstract = "We present a method for reversible dynamic memory management based on a reversible version of the Buddy Memory system. This method supports decoupled allocation and deallocation of variable-sized records and can be applied to any reversible language with heap storage. We demonstrate how these new capabilities allow for the direct realization of commonplace data structures such as trees, heaps and queues which until now has not been practical in a reversible language. Finally, we provide a definition of our method in the high-level reversible language Janus as well as a description of its fragmentation and garbage-generation characteristics. The reversible memory management system has been fully implemented and tested in a compiler for a reversible object-oriented programming language targeting the reversible assembly language PISA.",

author = "Cservenka, {Martin Holm} and Robert Gl{\"u}ck and Tue Haulund and Mogensen, {Torben {\AE}gidius}",

year = "2018",

doi = "10.1007/978-3-319-99498-7_19",

language = "English",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "269--285",

editor = "Jarkko Kari and Irek Ulidowski",

booktitle = "Reversible Computation",

note = "10th International Conference on Reversible Computation, RC 2018 ; Conference date: 12-09-2018 Through 14-09-2018",

}

TY - GEN

T1 - Data structures and dynamic memory management in reversible languages

AU - Cservenka, Martin Holm

AU - Glück, Robert

AU - Haulund, Tue

AU - Mogensen, Torben Ægidius

PY - 2018

Y1 - 2018

N2 - We present a method for reversible dynamic memory management based on a reversible version of the Buddy Memory system. This method supports decoupled allocation and deallocation of variable-sized records and can be applied to any reversible language with heap storage. We demonstrate how these new capabilities allow for the direct realization of commonplace data structures such as trees, heaps and queues which until now has not been practical in a reversible language. Finally, we provide a definition of our method in the high-level reversible language Janus as well as a description of its fragmentation and garbage-generation characteristics. The reversible memory management system has been fully implemented and tested in a compiler for a reversible object-oriented programming language targeting the reversible assembly language PISA.

AB - We present a method for reversible dynamic memory management based on a reversible version of the Buddy Memory system. This method supports decoupled allocation and deallocation of variable-sized records and can be applied to any reversible language with heap storage. We demonstrate how these new capabilities allow for the direct realization of commonplace data structures such as trees, heaps and queues which until now has not been practical in a reversible language. Finally, we provide a definition of our method in the high-level reversible language Janus as well as a description of its fragmentation and garbage-generation characteristics. The reversible memory management system has been fully implemented and tested in a compiler for a reversible object-oriented programming language targeting the reversible assembly language PISA.

UR - http://www.scopus.com/inward/record.url?scp=85053527768&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-99498-7_19

DO - 10.1007/978-3-319-99498-7_19

M3 - Article in proceedings

T3 - Lecture notes in computer science

SP - 269

EP - 285

BT - Reversible Computation

A2 - Kari, Jarkko

A2 - Ulidowski, Irek

PB - Springer

T2 - 10th International Conference on Reversible Computation, RC 2018

Y2 - 12 September 2018 through 14 September 2018

ER -

Data structures and dynamic memory management in reversible languages

Abstract

Konference

Adgang til dokumentet

Andre filer og links

Fingeraftryk

Citationsformater