Places: adding message-passing parallelism to racket

Authors:
Kevin Tew;James Swaine;Matthew Flatt;Robert Bruce Findler;Peter Dinda pdinda@northwestern.edu
Affiliations:
Unversity of Utah, Salt Lake City, UT, USA;Northwestern University, Evanston, IL, USA;University of Utah, Salt Lake City, UT, USA;Northwestern University, Evanston, IL, USA;Northwestern University, Evanston, IL, USA
Venue:
Proceedings of the 7th symposium on Dynamic languages
Year:
2011

Citing 15
Cited 1

A concurrent, generational garbage collector for a multithreaded implementation of ML

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Eraser: a dynamic data race detector for multithreaded programs

ACM Transactions on Computer Systems (TOCS)
Concurrent programming in ML

Concurrent programming in ML
Programming languages as operating systems (or revenge of the son of the lisp machine)

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

CC '02 Proceedings of the 11th International Conference on Compiler Construction
Kill-safe synchronization abstractions

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Memory accounting without partitions

Proceedings of the 4th international symposium on Memory management
X10: an object-oriented approach to non-uniform cluster computing

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Efficient memory management for concurrent programs that use message passing

Science of Computer Programming - Special issue on five perspectives on modern memory management: Systems, hardware and theory
Parallel generational-copying garbage collection with a block-structured heap

Proceedings of the 7th international symposium on Memory management
Implicitly-threaded parallelism in Manticore

Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Runtime support for multicore Haskell

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
GAMBIT: effective unit testing for concurrency libraries

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
x86-TSO: a rigorous and usable programmer's model for x86 multiprocessors

Communications of the ACM
Back to the futures: incremental parallelization of existing sequential runtime systems

Proceedings of the ACM international conference on Object oriented programming systems languages and applications

Seeing the futures: profiling shared-memory parallel racket

Proceedings of the 1st ACM SIGPLAN workshop on Functional high-performance computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Places bring new support for message-passing parallelism to Racket. This paper gives an overview of the programming model and how we had to modify our existing, sequential runtime-system to support places. We show that the freedom to design the programming model helped us to make the implementation tractable; specifically, we avoided the conventional pain of adding just the right amount of locking to a big, legacy runtime system. The paper presents an evaluation of the design that includes both a real-world application and standard parallel benchmarks.