The Multi-architecture Performance of the Parallel Functional Language GP H (Research Note)

Authors:
Philip W. Trinder;Hans-Wolfgang Loidl;Ed. Barry, Jr.;Kei Davis;Kevin Hammond;Ulrike Klusik;Simon L. Peyton Jones;Álvaro J. Rebón Portillo
Affiliations:
-;-;-;-;-;-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 4
Cited 1

GUM: a portable parallel implementation of Haskell

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs

IEEE Transactions on Parallel and Distributed Systems
High-Performance parallel graph reduction

PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures
Algorithm + strategy = parallelism

Journal of Functional Programming

Orchestrating computational algebra components into a high-performance parallel system

International Journal of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In principle, functional languages promise straightforward architecture-independent parallelism, because of their high level description of parallelism, dynamic management of parallelism and deterministic semantics. However, these language features come at the expense of a sophisticated compiler and/or runtime-system. The problem we address is whether such an elaborate system can deliver acceptable performance on a variety of parallel architectures. In particular we report performance measurements for the GUM runtime-system on eight parallel architectures, including massively parallel, distributed-memory, shared-memory and workstation networks.