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

  • Authors:

  • James Swaine;Kevin Tew;Peter Dinda;Robert Bruce Findler;Matthew Flatt

  • Affiliations:

  • Northwestern University, Chicago, IL, USA;University of Utah, Salt Lake City, UT, USA;Northwestern University, Chicago, IL, USA;Northwestern University, Chicago, IL, USA;University of Utah, Salt Lake City, UT, USA

  • Venue:
  • Proceedings of the ACM international conference on Object oriented programming systems languages and applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many language implementations, particularly for high-level and scripting languages, are based on carefully honed runtime systems that have an internally sequential execution model. Adding support for parallelism in the usual form -- as threads that run arbitrary code in parallel -- would require a major revision or even a rewrite to add safe and efficient locking and communication. We describe an alternative approach to incremental parallelization of runtime systems. This approach can be applied inexpensively to many sequential runtime systems, and we demonstrate its effectiveness in the Racket runtime system and Parrot virtual machine. Our evaluation assesses both the performance benefits and the developer effort needed to implement our approach. We find that incremental parallelization can provide useful, scalable parallelism on commodity multicore processors at a fraction of the effort required to implement conventional parallel threads.