Work

Task granularity analysis in logic programs

Year: 1990

Type: conference-paper

Abstract: While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the work involved in task creation and scheduling. In practice, therefore, the “granularity” of a goal, i.e. an estimate of the work available under it, should be taken into account when deciding whether or not to execute a goal concurrently as a separate task. This paper describes a method for estimating the granularity of a goal at compile time. The runtime overhead associated with our approach is usually quite small, and the performance improvements resulting from the incorporation of grainsize control can be quite good. This is shown by means of experimental results.

Source: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

DOI: 10.1145/93542.93564

Authors: Saumya K. Debray, Nai-Wei Lin, Manuel Hermnegildo

Institution: University of Arizona

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Award: Analysis and Optimization of Logic Programs