Towards granularity based control of parallelism in logic programs

  • López García, Pedro
  • Hermenegildo, Manuel V.
  • Debray, S.K.
Publication date
January 1994
Publisher
Facultad de Informática (UPM)

Abstract

Several types of parallelism can be exploited in logic programs while preserving correctness and efficiency, i.e. ensuring that the parallel execution obtains the same results as the sequential one and the amount of work performed is not greater. However, such results do not take into account a number of overheads which appear in practice, such as process creation and scheduling, which can induce a slow-down, or, at least, limit speedup, if they are not controlled in some way. This paper describes a methodology whereby the granularity of parallel tasks, i.e. the work available under them, is efficiently estimated and used to limit parallelism so that the effect of such overheads is controlled. The run-time overhead associated with the appr...

Extracted data

Loading...

Related items

A methodology for granularity-based control of parallelism in logic programs
  • Debray, S.K.
  • Hermenegildo, Manuel V.
  • López García, Pedro
January 1996

Several types of parallelism can be exploited in logic programs while preserving correctness and eff...

A Methodology for Granularity-Based Control of Parallelism in Logic Programs
  • LOPEZ, P.
  • HERMENEGILDO, M.
  • DEBRAY, S.
April 1996

AbstractSeveral types of parallelism can be exploited in logic programs while preserving correctness...

Task granularity analysis in logic programs
  • Debray, S.K.
  • Nai-Wei, Lin
  • Hermenegildo, Manuel V.
June 1990

While logic programming languages offer a great deal of scope for parallelism, there is usually som...

We use cookies to provide a better user experience.