Enabling Bitwise Reproducibility for the Unstructured Computational Motif

Siklósi Bálint and Mudalige Gihan R. and Reguly Istvan Z.: Enabling Bitwise Reproducibility for the Unstructured Computational Motif.
APPLIED SCIENCES-BASEL, 14 (2). ISSN 2076-3417 (2024)

Text
applsciences.pdf - Published Version
Download (1MB)

Item Type:

Article

Creators:

Creators	ORCID	MTMT szerző azonosító
Siklósi Bálint		10069731
Mudalige Gihan R.
Reguly Istvan Z.

Abstract:

In this paper we identify the causes of numerical non-reproducibility in the unstructured mesh computational motif, a class of algorithms commonly used for the solution of PDEs. We introduce a number of parallel and distributed algorithms to address nondeterminism in the order of floating-point computations, in particular, a new graph coloring scheme that produces identical coloring results regardless of how many parts the graph is partitioned to. We implement these in the OP2 domain specific language (DSL) and show how it can be automatically deployed to any application that uses OP2 without user intervention. We contrast differences in results without reproducibility and then demonstrate how bitwise reproducibility can be gained using our methods on a variety of applications including a production CFD application used at Rolls-Royce. We evaluate the performance and overheads of enforcing bitwise reproducibility on a cluster of CPUs and GPUs.

Journal or Publication Title:

APPLIED SCIENCES-BASEL

Date:

2024

Volume:

Number:

ISSN:

2076-3417

Institution:

Pázmány Péter Katolikus Egyetem

Kar:

Információs Technológiai és Bionikai Kar (2013.07.-)