Distributed Memory Programming on Many-Cores: A Case Study Using Eden Divide-&-Conquer Skeletons

Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rita Loogen

Abstract

Eden is a parallel extension of the lazy functional language Haskell providing dynamic process creation and automatic data exchange. As a Haskell extension, Eden takes a high-level approach to parallel programming and thereby simplifies parallel program development. The current implementation is tailored to networks of workstations. Recent work has shown that this implementation shows surprisingly competitive performance on many-core machines, compared to dedicated shared-memory implementations of parallel Haskell. In the paper we describe a case study with different Eden divide-and-conquer skeletons. We analyse their performance comparing example applications implemented using these Eden skeletons against parallel Haskell implementations using shared memory on many-core machines
Original languageEnglish
Title of host publicationARCS '09 - 22th International Conference on Architecture of Computing Systems 2009 - Workshop proceedings
EditorsK.E. Großpitsch, A. Henkersdorf, T. Ungerer, J. Hähner
Number of pages9
PublisherVDE Verlag
Publication date2009
Pages47-56
ISBN (Print)978-3-8007-3133-6
Publication statusPublished - 2009
EventARCS '09 - 22th International Conference on Architecture of Computing Systems 2009 - Delft, Netherlands
Duration: 10 Mar 200913 Mar 2009
Conference number: 22

Conference

ConferenceARCS '09 - 22th International Conference on Architecture of Computing Systems 2009
Number22
Country/TerritoryNetherlands
CityDelft
Period10/03/200913/03/2009

Fingerprint

Dive into the research topics of 'Distributed Memory Programming on Many-Cores: A Case Study Using Eden Divide-&-Conquer Skeletons'. Together they form a unique fingerprint.

Cite this