On the Optimization of Iterative Programming with Distributed Data Collections - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2022

On the Optimization of Iterative Programming with Distributed Data Collections

Nils Gesbert
  • Function : Author
  • PersonId : 958488
Pierre Genevès
Nabil Layaïda

Abstract

Big data programming frameworks are becoming increasingly important for the development of applications for which performance and scalability are critical. In those complex frameworks, optimizing code by hand is hard and time-consuming, making automated optimization particularly necessary. In order to automate optimization, a prerequisite is to find suitable abstractions to represent programs; for instance, algebras based on monads or monoids to represent distributed data collections. Currently, however, such algebras do not represent recursive programs in a way which allows for analyzing or rewriting them. In this paper, we extend a monoid algebra with a fixpoint operator for representing recursion as a first class citizen and show how it enables new optimizations. Experiments with the Spark platform illustrate performance gains brought by these systematic optimizations.
Fichier principal
Vignette du fichier
paper.pdf (849.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02066649 , version 1 (13-03-2019)
hal-02066649 , version 2 (16-10-2020)
hal-02066649 , version 3 (16-10-2020)
hal-02066649 , version 4 (16-10-2020)
hal-02066649 , version 5 (02-03-2021)
hal-02066649 , version 6 (24-05-2022)

Identifiers

  • HAL Id : hal-02066649 , version 6

Cite

Sarah Chlyah, Nils Gesbert, Pierre Genevès, Nabil Layaïda. On the Optimization of Iterative Programming with Distributed Data Collections. 2022. ⟨hal-02066649v6⟩
505 View
574 Download

Share

Gmail Facebook X LinkedIn More