License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-31667
URL:

;

Minimizing the overheads of dependent {AND}-parallelism

pdf-format:


Abstract

Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it adds overheads that aren't present in sequential programs. This is an important problem for parallel logic programming systems, because almost every action in such programs requires accessing variables, and the traditional approach of adding synchronization code to all such accesses is so prohibitively expensive that a parallel version of the program may run more slowly on four processors than a sequential version would run on one processor. We present a program transformation for implementing dependent AND-parallelism in logic programming languages that uses mode information to add synchronization code only to the variable accesses that actually need it.

BibTeX - Entry

@InProceedings{wang_et_al:LIPIcs:2011:3166,
  author =	{Peter Wang and Zoltan Somogyi},
  title =	{{Minimizing the overheads of dependent {AND}-parallelism}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) },
  pages =	{128--138},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{John P. Gallagher and Michael Gelfond},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3166},
  URN =		{urn:nbn:de:0030-drops-31667},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.ICLP.2011.128},
  annote =	{Keywords: synchronization, program transformation}
}

Keywords: synchronization, program transformation
Seminar: Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)
Issue date: 2011
Date of publication: 2011


DROPS-Home | Fulltext Search | Imprint Published by LZI