Serial combinators: "optimal" grains of parallelism

Hudak, Paul; Goldberg, Benjamin

doi:10.1007/3-540-15975-4_49

Cited by 58 publications

(15 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In general, parallelism obtained from referential transparency in pure functional languages is of too fine granularity, not yielding good performance. The search for ways of controlling the degree of parallelism of functional programs by means of automatic mechanisms, either static or dynamic, had little success [15,26,18]. Compilers that exploit implicit parallelism have been facing difficulty to promote good load balancing amongst processors and to keep commu=ication costs low.…”

Section: Acm Symposium On Applied Computalionmentioning

confidence: 99%

Coordinating functional processes with Haskell _#

Carvalho

Lima²,

Lins

2002

Proceedings of the 2002 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

This paper presents Haskell#, a parallel functional language based on coordination. Hazkell# supports lazy atream commnnication and facilities, at coordination level, to the specification of data parallel programs. Haskell~ supports a clean and complete, semantic and syntactic, separation between coordination and computation levels of programming, with several benefits to parallel program engineering. The implementation of some well-known applications in Haskell# is presented, demonstrating its expressiveness, allowing for elegant, simple, and concise specification of any static pattern of parallel, concurrent or distributed computation.

show abstract

Section: Acm Symposium On Applied Computalionmentioning

confidence: 99%

Coordinating functional processes with Haskell _#

Carvalho

Lima²,

Lins

2002

Proceedings of the 2002 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…Because of the Church-Rosser property, researchers have concentrated on techniques to automatically compile functional programs for parallel execution [Arvind et al 1986;Nikhil et al 1995;Hudak and Goldberg 1985;Treleaven et al 1982]. The goal has been to free the programmer from concerns about the underlying parallel machine model.…”

Section: Introductionmentioning

confidence: 99%

First-class monadic schedules

Mirani

Hudak

2004

ACM Trans. Program. Lang. Syst.

Self Cite

View full text Add to dashboard Cite

Parallel functional languages often use meta-linguistic annotations to provide control over parallel evaluation. In this paper we explore a flexible mechanism to control when an expression is evaluated: first-class monadic schedules. We discuss the advantages of using such first-class values over traditional annotation-based systems. In particular, it is often desirable to make decisions about the operational behavior of parallel programs depending on the dynamic state of the system. For example, we may want to measure the system load before deciding to evaluate expressions in parallel. For this purpose, we show how monads can be used to access dynamic system parameters in a referentially transparent manner (up to termination).As a mechanism to reason about schedules, we present a set of algebraic properties that any implementation of schedules must satisfy. We also describe an implementation that translates schedules into a dialect of Scheme extended with futures. We prove that this implementation satisfies the given set of algebraic properties, and give performance results for a parallel solution to the n-body problem using the Barnes-Hut method.Although our ideas were developed specifically for nonstrict functional languages such as Haskell, we briefly discuss how they can be used with strict functional languages and imperative languages as well.

show abstract

“…Based on these advantages, reseachers have concentrated on completely automatic techniques for parallel execution of functional programs -their goal has been for the user to remain completely unaware of the underlying parallelism. Dataflow and reduction machines [15], hybrid machines [3,6,11], and fancy compilation strategies [7] have all contributed to the success of this line of research.…”

Section: Introductionmentioning

confidence: 99%

Pomset interpretations of parallel functional programs

Hudak

Anderson

1987

Functional Programming Languages and Computer Architecture

Self Cite

View full text Add to dashboard Cite

A new framework is presented, based on the notion of a partially ordered multiset (or pomset), which is able to provide not only a precise operational semantics of parallel functional program evaluation, but also a handle through which to control such behavior. As an operational semantics, pomsets are able to distinguish between call-by-value, call-by-name, call-by-need, and call-by-speculation evaluation strategies (even though all but the first of these have the same standard semantics); and as a "handle" from which to control operational behavior, pomsets can express most of the behaviors achieved by previously proposed annotations that control not only evaluation order but also the spatial mapping of program to machine.

show abstract

Serial combinators: "optimal" grains of parallelism

Cited by 58 publications

References 10 publications

Coordinating functional processes with Haskell _#

Coordinating functional processes with Haskell _#

First-class monadic schedules

Pomset interpretations of parallel functional programs

Contact Info

Product

Resources

About

Serial combinators: "optimal" grains of parallelism

Cited by 58 publications

References 10 publications

Coordinating functional processes with Haskell #

Coordinating functional processes with Haskell #

First-class monadic schedules

Pomset interpretations of parallel functional programs

Contact Info

Product

Resources

About

Coordinating functional processes with Haskell _#

Coordinating functional processes with Haskell _#