文章基本信息

标题：Minimizing the overheads of dependent {AND}-parallelism
本地全文：下载
作者：Peter Wang ; Zoltan Somogyi
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2011
卷号：11
页码：128-138
DOI：10.4230/LIPIcs.ICLP.2011.128
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：synchronization; program transformation