Distance: a New Metric for Controlling Granularity for Parallel Execution

Shen, Kish and Santos Costa, Vitor and King, Andy (1999) Distance: a New Metric for Controlling Granularity for Parallel Execution. Journal of Functional and Logic Programming, 1999 . pp. 1-23. ISSN 1080-5230. (Full text available)

Abstract

Granularity control is a method to improve parallel execution performance by limiting excessive parallelism. The general idea is that if the gain obtained by executing a task in parallel is less than the overheads required to support parallel execution, then the task is better executed sequentially. Traditionally, in logic programming, task size is estimated from the sequential time-complexity of evaluating the task. Tasks are only executed in parallel if task size exceeds a pre-determined threshold. We argue in this paper that the estimation of complexity on its own is not an ideal metric for improving the performance of parallel programs through granularity control. We present a new metric for measuring granularity, based on a notion of distance. We present some initial results with two very simple methods of using this metric for granularity control. We then discuss how more sophisticated granularity control methods can be devised using the new metric.

Item Type:	Article
Additional information:	Special Issue 1; This is a special issue of selected papers from the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages.
Subjects:	A General Works
Divisions:	Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User:	Andy King
Date Deposited:	12 Dec 2013 20:37 UTC
Last Modified:	07 Nov 2018 15:22 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/37585 (The current URI for this page, for reference purposes)