An operational semantics for parallel lazy evaluation

Baker-Finch, Clem; King, David; Trinder, Phil

doi:10.1145/351240.351256

Cited by 27 publications

(29 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This reflects ConCert's distributed memory model implemented by mobile code units (chords). The DSM parallel graph rewriting enables a relatively simple denotational and operational semantics for GPH [24], whereas ConCert uses a modal lambda calculus [25].…”

Section: Low-level Grid Parallelismmentioning

confidence: 99%

Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs

Zain¹,

Trinder²,

Michaelson

et al. 2008

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-Computational GRIDs potentially offer low-cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs pose serious challenges: they are heterogeneous and have hierarchical and often shared interconnects, with high and variable latencies between clusters. This paper investigates whether a programming language with high-level parallel coordination and a Distributed Shared Memory (DSM) model can deliver good and scalable performance on a range of computational GRID configurations. The high-level language Glasgow parallel Haskell (GpH) abstracts over the architectural complexities of the computational GRID, and we have developed GRID-GUM2, a sophisticated grid-specific implementation of GpH, to produce the first high-level DSM parallel language implementation for computational GRIDs. We report a systematic performance evaluation of GRID-GUM2 on combinations of high/low and homogeneous/heterogeneous computational GRIDs. We measure the performance of a small set of kernel parallel programs representing a variety of application areas, two parallel paradigms, and ranges of communication degree and parallel irregularity. We investigate GRI D-GUM2's performance scalability on medium-scale heterogeneous and high-latency computational GRIDs and analyze the performance with respect to the program characteristics of communication frequency and degree of irregular parallelism.

show abstract

Section: Low-level Grid Parallelismmentioning

confidence: 99%

Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs

Zain¹,

Trinder²,

Michaelson

et al. 2008

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…In this section we describe an operational semantics in the style of [1], which in turn is based on Launchbury's natural semantics for lazy evaluation [9].…”

Section: Operational Semanticsmentioning

confidence: 99%

Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics

Hidalgo-Herrero

Verdejo

Ortega-Mallén

2007

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Eden is a parallel extension of the functional language Haskell. On behalf of parallelism Eden overrides Haskell's pure lazy approach, combining a non-strict functional application with eager process creation and eager communication. We desire to investigate alternative semantics for Eden in order to analyze the consequences of some of the decisions adopted during the language design. In this paper we show how to implement in Maude the operational semantics of Eden in such a way that semantic rules can be modified easily. Moreover, other semantic features can be implemented by means of parameterized modules that allow to instantiate in different ways several parameters of the semantics but without modifying the semantic rules.

show abstract

“…As it is usual [1,10] for parallel and concurrent languages, the semantics of GpH and Eden embodies two levels of transition systems: one lower level to handle the local behavior of processes, and an upper level to describe global effects on the system. The local behavior of GpH and Eden are basically the same; the only difference between Eden and GpH in this level, is that Eden does not make any distinction between runnable and active threads.…”

Section: Gph-eden Core Languagementioning

confidence: 99%

Observing intermediate structures in a parallel lazy functional language

Encina

Llana

Rubio

et al. 2007

Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

Due to the use of higher-order functions and laziness, debugging lazy functional programs is not a trivial task. Fortunately, several debuggers have appeared during the last years. However, the difficulty of the debugging process is increased when considering parallel extensions of lazy functional languages. Thus, it is necessary not only to develop practical debuggers, but also to provide a clear semantic environment to understand what the debuggers should do. In this paper we present a formal framework for debugging two different parallel extensions of the lazy functional language Haskell. In order to do that, we define an operational semantics model which allows us to deal with side-effects and parallelism. By doing so, we provide a formalization of a parallel debugger we have already implemented by extending the sequential debugger Hood.

show abstract

An operational semantics for parallel lazy evaluation

Cited by 27 publications

References 21 publications

Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs

Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs

Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics

Observing intermediate structures in a parallel lazy functional language

Contact Info

Product

Resources

About