Standard
Reversible languages and incremental state saving in optimistic parallel discrete event simulation. / Schordan, Markus; Oppelstrup, Tomas; Thomsen, Michael Kirkedal; Glück, Robert.
Reversible Computation: Extending Horizons of Computing - Selected Results of the COST Action IC1405. ed. / Irek Ulidowski; Ivan Lanese; Ulrik Pagh Schultz; Carla Ferreira. Springer VS, 2020. p. 187-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12070 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Schordan, M, Oppelstrup, T
, Thomsen, MK & Glück, R 2020,
Reversible languages and incremental state saving in optimistic parallel discrete event simulation. in I Ulidowski, I Lanese, UP Schultz & C Ferreira (eds),
Reversible Computation: Extending Horizons of Computing - Selected Results of the COST Action IC1405. Springer VS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12070 LNCS, pp. 187-207, 12th International Conference on Reversible Computation, RC 2020, Oslo, Norway,
09/07/2020.
https://doi.org/10.1007/978-3-030-47361-7_9APA
Schordan, M., Oppelstrup, T.
, Thomsen, M. K., & Glück, R. (2020).
Reversible languages and incremental state saving in optimistic parallel discrete event simulation. In I. Ulidowski, I. Lanese, U. P. Schultz, & C. Ferreira (Eds.),
Reversible Computation: Extending Horizons of Computing - Selected Results of the COST Action IC1405 (pp. 187-207). Springer VS. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 12070 LNCS
https://doi.org/10.1007/978-3-030-47361-7_9Vancouver
Schordan M, Oppelstrup T
, Thomsen MK, Glück R.
Reversible languages and incremental state saving in optimistic parallel discrete event simulation. In Ulidowski I, Lanese I, Schultz UP, Ferreira C, editors, Reversible Computation: Extending Horizons of Computing - Selected Results of the COST Action IC1405. Springer VS. 2020. p. 187-207. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12070 LNCS).
https://doi.org/10.1007/978-3-030-47361-7_9Author
Schordan, Markus ; Oppelstrup, Tomas ; Thomsen, Michael Kirkedal ; Glück, Robert. / Reversible languages and incremental state saving in optimistic parallel discrete event simulation. Reversible Computation: Extending Horizons of Computing - Selected Results of the COST Action IC1405. editor / Irek Ulidowski ; Ivan Lanese ; Ulrik Pagh Schultz ; Carla Ferreira. Springer VS, 2020. pp. 187-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12070 LNCS).
Bibtex
@inproceedings{8d6171032d9641a185c2ac8f7cbbc109,
title = "Reversible languages and incremental state saving in optimistic parallel discrete event simulation",
abstract = "Optimistic parallel discrete event simulation (PDES) requires to do a distributed rollback if conflicts are detected during a simulation due to the massively parallel optimistic execution approach. When a rollback of a simulation is performed each node that is determined to be in a wrong state must be restored to one of its previous states. This can be achieved through reverse computation or by restoring a previous checkpoint. In this paper we investigate and compare both approaches, reverse computation and a variant of checkpointing, incremental state saving (also called incremental checkpointing), to restore a previous program state as part of an optimistic parallel discrete event simulation. We present a benchmark model that is specifically designed for evaluating the performance of approaches to reversibility in PDES. Our benchmarking model has mathematical properties that allow to tune the amount of arithmetic operations relative to the amount of memory operations. These tuning opportunities are the basis for our systematic performance evaluation.",
author = "Markus Schordan and Tomas Oppelstrup and Thomsen, {Michael Kirkedal} and Robert Gl{\"u}ck",
year = "2020",
doi = "10.1007/978-3-030-47361-7_9",
language = "English",
isbn = "9783030473600",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer VS",
pages = "187--207",
editor = "Irek Ulidowski and Ivan Lanese and Schultz, {Ulrik Pagh} and Carla Ferreira",
booktitle = "Reversible Computation",
note = "12th International Conference on Reversible Computation, RC 2020 ; Conference date: 09-07-2020 Through 10-07-2020",
}
RIS
TY - GEN
T1 - Reversible languages and incremental state saving in optimistic parallel discrete event simulation
AU - Schordan, Markus
AU - Oppelstrup, Tomas
AU - Thomsen, Michael Kirkedal
AU - Glück, Robert
PY - 2020
Y1 - 2020
N2 - Optimistic parallel discrete event simulation (PDES) requires to do a distributed rollback if conflicts are detected during a simulation due to the massively parallel optimistic execution approach. When a rollback of a simulation is performed each node that is determined to be in a wrong state must be restored to one of its previous states. This can be achieved through reverse computation or by restoring a previous checkpoint. In this paper we investigate and compare both approaches, reverse computation and a variant of checkpointing, incremental state saving (also called incremental checkpointing), to restore a previous program state as part of an optimistic parallel discrete event simulation. We present a benchmark model that is specifically designed for evaluating the performance of approaches to reversibility in PDES. Our benchmarking model has mathematical properties that allow to tune the amount of arithmetic operations relative to the amount of memory operations. These tuning opportunities are the basis for our systematic performance evaluation.
AB - Optimistic parallel discrete event simulation (PDES) requires to do a distributed rollback if conflicts are detected during a simulation due to the massively parallel optimistic execution approach. When a rollback of a simulation is performed each node that is determined to be in a wrong state must be restored to one of its previous states. This can be achieved through reverse computation or by restoring a previous checkpoint. In this paper we investigate and compare both approaches, reverse computation and a variant of checkpointing, incremental state saving (also called incremental checkpointing), to restore a previous program state as part of an optimistic parallel discrete event simulation. We present a benchmark model that is specifically designed for evaluating the performance of approaches to reversibility in PDES. Our benchmarking model has mathematical properties that allow to tune the amount of arithmetic operations relative to the amount of memory operations. These tuning opportunities are the basis for our systematic performance evaluation.
U2 - 10.1007/978-3-030-47361-7_9
DO - 10.1007/978-3-030-47361-7_9
M3 - Article in proceedings
AN - SCOPUS:85085517166
SN - 9783030473600
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 187
EP - 207
BT - Reversible Computation
A2 - Ulidowski, Irek
A2 - Lanese, Ivan
A2 - Schultz, Ulrik Pagh
A2 - Ferreira, Carla
PB - Springer VS
T2 - 12th International Conference on Reversible Computation, RC 2020
Y2 - 9 July 2020 through 10 July 2020
ER -
