DROPS

Document

DOI: 10.4230/OASIcs.ICCSW.2015.3

Language Run-time Systems: an Overview

Authors: Evgenij Belikov

Published in: OASIcs, Volume 49, 2015 Imperial College Computing Student Workshop (ICCSW 2015)

Abstract

The proliferation of high-level programming languages with advanced language features and the need for portability across increasingly heterogeneous and hierarchical architectures require a sophisticated run-time system to manage program execution and available resources. Additional benefits include isolated execution of untrusted code and the potential for dynamic optimisation, among others. This paper provides a high-level overview of language run-time systems with a focus on execution models, support for concurrency and parallelism, memory management, and communication, whilst briefly mentioning synchronisation, monitoring, and adaptive policy control. Two alternative approaches to run-time system design are presented and several challenges for future research are outlined. References to both seminal and recent work are provided.

Cite as

Evgenij Belikov. Language Run-time Systems: an Overview. In 2015 Imperial College Computing Student Workshop (ICCSW 2015). Open Access Series in Informatics (OASIcs), Volume 49, pp. 3-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@InProceedings{belikov:OASIcs.ICCSW.2015.3,
  author =	{Belikov, Evgenij},
  title =	{{Language Run-time Systems: an Overview}},
  booktitle =	{2015 Imperial College Computing Student Workshop (ICCSW 2015)},
  pages =	{3--12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-000-2},
  ISSN =	{2190-6807},
  year =	{2015},
  volume =	{49},
  editor =	{Schulz, Claudia and Liew, Daniel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2015.3},
  URN =		{urn:nbn:de:0030-drops-54753},
  doi =		{10.4230/OASIcs.ICCSW.2015.3},
  annote =	{Keywords: Run-time Systems, Virtual Machines, Adaptive Policy Control}
}

Document

DOI: 10.4230/OASIcs.ICCSW.2014.3

History-Based Adaptive Work Distribution

Authors: Evgenij Belikov

Published in: OASIcs, Volume 43, 2014 Imperial College Computing Student Workshop

Abstract

Exploiting parallelism of increasingly heterogeneous parallel architectures is challenging due to the complexity of parallelism management. To achieve high performance portability whilst preserving high productivity, high-level approaches to parallel programming delegate parallelism management, such as partitioning and work distribution, to the compiler and the run-time system. Random work stealing proved efficient for well-structured workloads, but neglects potentially useful context information that can be obtained through static analysis or monitoring at run time and used to improve load balancing, especially for irregular applications with highly varying thread granularity and thread creation patterns. We investigate the effectiveness of an adaptive work distribution scheme to improve load balancing for an extension of Haskell which provides a deterministic parallel programming model and supports both shared-memory and distributed-memory architectures. This scheme uses a less random work stealing that takes into account information on past stealing successes and failures. We quantify run time performance, communication overhead, and stealing success of four divide-and-conquer and data parallel applications for three different update intervals on a commodity 64-core Beowulf cluster of multi-cores.

Cite as

Evgenij Belikov. History-Based Adaptive Work Distribution. In 2014 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 43, pp. 3-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@InProceedings{belikov:OASIcs.ICCSW.2014.3,
  author =	{Belikov, Evgenij},
  title =	{{History-Based Adaptive Work Distribution}},
  booktitle =	{2014 Imperial College Computing Student Workshop},
  pages =	{3--10},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-76-7},
  ISSN =	{2190-6807},
  year =	{2014},
  volume =	{43},
  editor =	{Neykova, Rumyana and Ng, Nicholas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2014.3},
  URN =		{urn:nbn:de:0030-drops-47671},
  doi =		{10.4230/OASIcs.ICCSW.2014.3},
  annote =	{Keywords: Adaptive Load Balancing, Work Stealing, Work Pushing, High-Level Parallel Programming, Context-Awareness}
}

Search Results

Documents authored by Belikov, Evgenij

Language Run-time Systems: an Overview

Abstract

Cite as

History-Based Adaptive Work Distribution

Abstract

Cite as

Thanks for your feedback!

Could not send message