Performance evaluation of Integrated Prolog Processor IPP
| Autor: | Tadaaki Bandoh, Shigeo Abe, K.-i. Kurosawa, K. Kiriyama |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
Unification
Computer science Programming language Search engine indexing Append computer.software_genre Predicate (grammar) Minicomputer law.invention Prolog TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Procedural programming law TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS sort computer computer.programming_language |
| Zdroj: | Scopus-Elsevier |
| DOI: | 10.1109/aiia.1988.13339 |
| Popis: | The IPP was developed to realize high-speed execution of Prolog and procedural languages on the same computer with less overhead. Previously developed optimization techniques such as clause indexing by optimal argument and global register assignment across determinate built-in predicates were intended to utilize mode information. The main extensions are as follows: to select as the optimal argument the variable that exists in a type checking predicate and to eliminate type checking from a clause code if such a predicate exists; and to detect unification failure as early as possible, and to resolve register conflicts by changing execution order in each unification that may fail and the remaining unification plus goal generation. The performance of the IPP for the append, quick sort, and eight-queen programs was found to be 1.1, 0.49, and 1.1 MLIPS, respectively. > |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|