TU Darmstadt / ULB / TUbiblio

SimAnMo-A parallelized runtime model generator

Burger, Michael ; Nguyen, Giang Nam ; Bischof, Christian (2021)
SimAnMo-A parallelized runtime model generator.
In: Concurrency and Computation: Practice and Experience, (Early Access)
doi: 10.1002/cpe.6771
Artikel, Bibliographie

Dies ist die neueste Version dieses Eintrags.

Kurzbeschreibung (Abstract)

In this article, we present the novel features of the recent version of SimAnMo, the Simulated Annealing Modeler. The tool creates models that correlate the size of one input parameter of an application to the corresponding runtime and thus SimAnMo allows predictions for larger input sizes. A focus lies on applications whose runtime grows exponentially in the input parameter size. Such programs are, for example, of high interest for cryptanalysis to analyze practical security of traditional and post-quantum secure schemes. However, SimAnMo also generates reliable models for the widespread case of polynomial runtime behavior and also for the important case of factorial runtime increase. SimAnMo's model generation is based on a parallelized simulated annealing procedure and heuristically minimizes the costs of a model. Those may rely on different quality metrics. Insights into SimAnMo's software design and its usage are provided. We demonstrate the quality of SimAnMo's models for different algorithms from various application fields. We show that our approach also works well on ARM architectures.

Typ des Eintrags: Artikel
Erschienen: 2021
Autor(en): Burger, Michael ; Nguyen, Giang Nam ; Bischof, Christian
Art des Eintrags: Bibliographie
Titel: SimAnMo-A parallelized runtime model generator
Sprache: Englisch
Publikationsjahr: 14 Dezember 2021
Verlag: John Wiley & Sons Ltd.
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Concurrency and Computation: Practice and Experience
(Heft-)Nummer: Early Access
DOI: 10.1002/cpe.6771
URL / URN: https://onlinelibrary.wiley.com/doi/10.1002/cpe.6771
Zugehörige Links:
Kurzbeschreibung (Abstract):

In this article, we present the novel features of the recent version of SimAnMo, the Simulated Annealing Modeler. The tool creates models that correlate the size of one input parameter of an application to the corresponding runtime and thus SimAnMo allows predictions for larger input sizes. A focus lies on applications whose runtime grows exponentially in the input parameter size. Such programs are, for example, of high interest for cryptanalysis to analyze practical security of traditional and post-quantum secure schemes. However, SimAnMo also generates reliable models for the widespread case of polynomial runtime behavior and also for the important case of factorial runtime increase. SimAnMo's model generation is based on a parallelized simulated annealing procedure and heuristically minimizes the costs of a model. Those may rely on different quality metrics. Insights into SimAnMo's software design and its usage are provided. We demonstrate the quality of SimAnMo's models for different algorithms from various application fields. We show that our approach also works well on ARM architectures.

Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik
20 Fachbereich Informatik > Scientific Computing
DFG-Sonderforschungsbereiche (inkl. Transregio)
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche
DFG-Sonderforschungsbereiche (inkl. Transregio) > Sonderforschungsbereiche > SFB 1119: CROSSING – Kryptographiebasierte Sicherheitslösungen als Grundlage für Vertrauen in heutigen und zukünftigen IT-Systemen
Hinterlegungsdatum: 18 Jul 2022 08:49
Letzte Änderung: 03 Jul 2024 02:57
PPN:
Export:
Suche nach Titel in: TUfind oder in Google

Verfügbare Versionen dieses Eintrags

Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen