Integrating multithreading into the spineless tagless G-machine

Authors:
Manuel M. T. Chakravarty
Affiliations:
Technische Universität Berlin, Berlin, Germany
Venue:
FP'95 Proceedings of the 1995 international conference on Functional Programming
Year:
1995

Citing 9
Cited 0

TAM—a compiler controlled threaded abstract machine

Journal of Parallel and Distributed Computing - Special issue on dataflow and multithreaded architectures
Separation constraint partitioning: a new algorithm for partitioning non-strict programs into sequential threads

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A design study of the EARTH multiprocessor

PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
GUM: a portable parallel implementation of Haskell

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering

Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
Functional Programming for Loosely-Coupled Multiprocessors

Functional Programming for Loosely-Coupled Multiprocessors
Unboxed Values as First Class Citizens in a Non-Strict Functional Language

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
High-Performance parallel graph reduction

PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures
Automatic Spark Strategies and Granularity for a Parallel Functional Language Reducer

CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

To reduce the adverse effects of long latency communication operations in distributed implementations of the Spineless Tagless G-machine (STGM), a variant of the original abstract machine that contains explicit support for multithreading is introduced. In particular, source-to-source transformations can be used on the level of the abstract machine code to foster the tolerance to long latency communication. The changes to the original STG-language include a separation of demand from case selection together with the introduction of a new construct that provides an abstract notion of thread boundaries and thread synchronization.