ParT: An Asynchronous Parallel Abstraction for Speculative Pipeline Computations

  • Kiko Fernandez-Reyes
  • Dave Clarke
  • Daniel S. McCain
Conference paper

DOI: 10.1007/978-3-319-39519-7_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9686)
Cite this paper as:
Fernandez-Reyes K., Clarke D., McCain D.S. (2016) ParT: An Asynchronous Parallel Abstraction for Speculative Pipeline Computations. In: Lluch Lafuente A., Proença J. (eds) Coordination Models and Languages. COORDINATION 2016. Lecture Notes in Computer Science, vol 9686. Springer, Cham

Abstract

The ubiquity of multicore computers has forced programming language designers to rethink how languages express parallelism and concurrency. This has resulted in new language constructs and new combinations or revisions of existing constructs. In this line, we extended the programming languages Encore (actor-based), and Clojure (functional) with an asynchronous parallel abstraction called ParT, a data structure that can dually be seen as a collection of asynchronous values (integrating with futures) or a handle to a parallel computation, plus a collection of combinators for manipulating the data structure. The combinators can express parallel pipelines and speculative parallelism. This paper presents a typed calculus capturing the essence of ParT, abstracting away from details of the Encore and Clojure programming languages. The calculus includes tasks, futures, and combinators similar to those of Orc but implemented in a non-blocking fashion. Furthermore, the calculus strongly mimics how ParT is implemented, and it can serve as the basis for adaptation of ParT into different languages and for further extensions.

Copyright information

© IFIP International Federation for Information Processing 2016

Authors and Affiliations

  • Kiko Fernandez-Reyes
    • 1
  • Dave Clarke
    • 1
  • Daniel S. McCain
    • 1
  1. 1.Department of Information TechnologyUppsala UniversityUppsalaSweden

Personalised recommendations