Orthogonal Serialisation for Haskell

Berthold, Jost

doi:10.1007/978-3-642-24276-2_3

Cited by 2 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All memory objects in PM are stored in their native closure layout and can be directly accessed, so that data does not have to be serialized before it is copied to PM. This native closure layout contains pointers to code in the statically-linked binary, which currently restricts PM structures to be used by a single application [Berthold 2010;Yang et al 2015]. To support multiple binaries the code needs to be shared between them, e.g.…”

Section: Persistent Heap and Automatic Memory Managementmentioning

confidence: 99%

Persistent software transactional memory in Haskell

Krauter

Raaf

Braam

et al. 2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Emerging persistent memory in commodity hardware allows byte-granular accesses to persistent state at memory speeds. However, to prevent inconsistent state in persistent memory due to unexpected system failures, different write-semantics are required compared to volatile memory. Transaction-based library solutions for persistent memory facilitate the atomic modification of persistent data in languages where memory is explicitly managed by the programmer, such as C/C++. For languages that provide extended capabilities like automatic memory management, a more native integration into the language is needed to maintain the high level of memory abstraction. It is shown in this paper how persistent software transactional memory (PSTM) can be tightly integrated into the runtime system of Haskell to atomically manage values of persistent transactional data types. PSTM has a clear interface and semantics extending that of software transactional memory (STM). Its integration with the language’s memory management retains features like garbage collection and allocation strategies, and is fully compatible with Haskell's lazy execution model. Our PSTM implementation demonstrates competitive performance with low level libraries and trivial portability of existing STM libraries to PSTM. The implementation allows further interesting use cases, such as persistent memoization and persistent Haskell expressions.

show abstract

Section: Persistent Heap and Automatic Memory Managementmentioning

confidence: 99%

Persistent software transactional memory in Haskell

Krauter

Raaf

Braam

et al. 2021

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…In doing so, however, they also provide type-and evaluation-agnostic data persistence for Haskell. This has several important uses (Berthold, 2011), including supporting persistence for memoised functions and checkpointing. Figure 22 shows how Haskell-level serialisation can be realised, supported by PAEAN primitive operations.…”

Section: Haskell-level Serialisation For Paeanmentioning

confidence: 99%

PAEAN: Portable and scalable runtime support for parallel Haskell dialects

Berthold

Loidl²,

Hammond

2016

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

Over time, several competing approaches to parallel Haskell programming have emerged. Different approaches support parallelism at various different scales, ranging from small multicores to massively parallel high-performance computing systems. They also provide varying degrees of control, ranging from completely implicit approaches to ones providing full programmer control. Most current designs assume a shared memory model at the programmer, implementation and hardware levels. This is, however, becoming increasingly divorced from the reality at the hardware level. It also imposes significant unwanted runtime overheads in the form of garbage collection synchronisation etc. What is needed is an easy way to abstract over the implementation and hardware levels, while presenting a simple parallelism model to the programmer.The PAEAN (PArallEl shAred Nothing) runtime system design aims to provide a portable and high-level shared-nothing implementation platform for parallel Haskell dialects. It abstracts over major issues such as work distribution and data serialisation, consolidating existing, successful designs into a single framework. It also provides an optional virtual shared-memory programming abstraction for (possibly) shared-nothing parallel machines, such as modern multicore/manycore architectures or cluster/cloud computing systems. It builds on, unifies, and extends, existing well-developed support for shared-memory parallelism that is provided by the widely-used GHC Haskell compiler. This paper summarises the state-of-the-art in shared-nothing parallel Haskell implementations, introduces the PAEAN abstractions, shows how they can be used to implement three distinct parallel Haskell dialects, and demonstrates that good scalability can be obtained on recent parallel machines. * Corresponding author. Reported work performed while at the University of Copenhagen (DIKU).

show abstract

Orthogonal Serialisation for Haskell

Cited by 2 publications

References 8 publications

Persistent software transactional memory in Haskell

Persistent software transactional memory in Haskell

PAEAN: Portable and scalable runtime support for parallel Haskell dialects

Contact Info

Product

Resources

About