MPP Haskell is a parallel implementation of the lazy purely-functional language Haskell for the Thinking Machines Inc. CM-5 large-scale distributed-memory multiprocessor. MPP Haskell is a derivative of GUM, a message-based parallel implementation of Haskell. GUM was carefully designed to minimise performance loss from low-bandwidth and high-latency communications. As an apparent consequence MPP Haskell, with the benefit of high-bandwidth and lowlatency communications, achieves remarkably scalable performance; it appears to be the highest performance higher-order lazy functional language implementation extant. Despite existing inefficiencies in lazy language implementation, considerable performance is recouped by automatic dynamic load balan...
Computational GRIDs potentially offer low-cost, readily available, and large-scale high-performance ...
This paper presents the final result of the designing of a new specification for the Haskell# Langua...
In this paper, we investigate the differences and tradeoffs imposed by two parallel Haskell dialects...
GUM is a portable, parallel implementation of the Haskell functional language. Despite sustained res...
GUM is a portable, parallel implementation of the Haskell functional language which has been publicl...
It has often been suggested that functional languages provide an excellent basis for programming par...
<p>With the emergence of commodity multicore architectures, exploiting tightly-coupled paralle...
In principle, pure functional languages promise straightforward architecture-independent parallelism...
In principle, pure functional languages promise straightforward architecture-independent parallelism...
John Hughes [10] argues that the ability to decompose a problem into parts, depends upon the ability...
We investigate the claim that functional languages offer low-cost parallelism in the context of symb...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
The research presented in this thesis is about the design and implementation of Naira, a parallel, p...
Over time, several competing approaches to parallel Haskell programming have emerged. Different appr...
We investigate the claim that functional languages oer low-cost parallelism in the context of symbo...
Computational GRIDs potentially offer low-cost, readily available, and large-scale high-performance ...
This paper presents the final result of the designing of a new specification for the Haskell# Langua...
In this paper, we investigate the differences and tradeoffs imposed by two parallel Haskell dialects...
GUM is a portable, parallel implementation of the Haskell functional language. Despite sustained res...
GUM is a portable, parallel implementation of the Haskell functional language which has been publicl...
It has often been suggested that functional languages provide an excellent basis for programming par...
<p>With the emergence of commodity multicore architectures, exploiting tightly-coupled paralle...
In principle, pure functional languages promise straightforward architecture-independent parallelism...
In principle, pure functional languages promise straightforward architecture-independent parallelism...
John Hughes [10] argues that the ability to decompose a problem into parts, depends upon the ability...
We investigate the claim that functional languages offer low-cost parallelism in the context of symb...
It has long been known that some of the most common uses of for and while-loops in imperative progra...
The research presented in this thesis is about the design and implementation of Naira, a parallel, p...
Over time, several competing approaches to parallel Haskell programming have emerged. Different appr...
We investigate the claim that functional languages oer low-cost parallelism in the context of symbo...
Computational GRIDs potentially offer low-cost, readily available, and large-scale high-performance ...
This paper presents the final result of the designing of a new specification for the Haskell# Langua...
In this paper, we investigate the differences and tradeoffs imposed by two parallel Haskell dialects...