Name
Abstract | ||
|---|---|---|
Parallel unification algorithms are not nearly so numerous or well-developed as sequential ones. In order to estimate the
improvement in efficiency which may be expected, we define and discuss an objective measure of the effect of parallelism on
a sequential algorithm. This measure, known as thepotential parallel factor (PPF), is applied to parallel versions of the unification algorithms of Yasuura and Jaffar. The PPFs for these algorithms
are measured on a variety of running Prolog programs to estimate what increase in speed may be expected in a Prolog environment
from the use of parallelism. Other potential uses of parallelism may be evaluated by different applications of our general
methods and techniques. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1007/BF03037466 | New Generation Comput. |
Keywords | Field | DocType |
Parallel Unification,Measurement,Complexity,Prolog Programming | Programming language,Task parallelism,Computer science,Unification,Theoretical computer science,Prolog,Data parallelism,Sequential algorithm | Journal |
Volume | Issue | ISSN |
5 | 3 | 0288-3635 |
Citations | PageRank | References |
5 | 0.53 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Harland | 1 | 5 | 0.53 |
| J. Jaffer | 2 | 24 | 5.71 |