article

Free access

Architectural support for the management of tightly-coupled fine-grain goals in flat concurrent Prolog

Authors:

Miloš ErcegovacAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 18, Issue 2SI

Pages 292 - 301

https://doi.org/10.1145/325096.325155

Published: 01 May 1990 Publication History

Abstract

We propose architectural support for goal management as part of a special-purpose processor architecture for the efficient execution of Flat Concurrent Prolog. Goal management operations: halt, spawn, suspend and commit are decoupled from goal reduction, and overlapped in the Goal Management Unit. Their efficient execution is enabled using a Goal Cache. We evaluate the performance of the goal management support using an analytic performance model and program parameters characteristic of the System's Development Workload. Most goal management operations are completely overlapped, resulting in a speedup of 2. Higher speedups are obtained for workloads that exhibit greater goal management complexity.

References

[1]

L. Alkalaj. Architectural Support for Concurrent Logic Programming Languages. Doctoral Dissertation UCLA/CSD 890047, University of California, Los Angeles, June 1989.

Digital Library

[2]

L. Alkalaj. Flat Concurrent Prolog Abstract Machine Characteristics. TR CSD-890018, University of California, Los Angeles, April 1989.

[3]

L. Alkalaj and E. Shapiro. An Architectural Model for a Flat Concurrent Prolog Processor, In Pro-PI ceedings of the 5th Inter. Conference/Symposium on Logic Programming, Aug 88.

[4]

U. Bar-on. A Distributed Implementation of Flat Concurrent Prolog. Master's Thesis CS 86, Weizmann Institute of Science, Applied Mathematics Department, January 1986.

[5]

J. Crammond. An Execution Model for Committed-Choice Non-Deterministic Languages. In 1986 Symposium on Logic Programming, pages 148 - 158, Sept. 1986.

[6]

W. J. Dally and D. S. Wills. Universal Mechanisms for Concurrency. Artificial Intelligence Laboratory and Laboratory for Computer Science, MIT, Cambridge, Massachusetts, 1989.

[7]

S . Gregory. Parallel Logic Programming in PARLOG, The Language and its Implementation. Addison-Wesley, 1987.

Digital Library

[8]

A. Houri and E. Shapiro. The Sequential Abstract Machine for Flat Concurrent Prolog. Master's Thesis CS 86-20, Weizmann Institute of Science, Applied Mathematics Department, July 1986.

[9]

A. Shafrir and E. Shapiro. Distributed Programming in Concurrent Prolog. TR CS 84-02, Weizmann Institute of Science, Applied Mathematics Department, January 1984.

[10]

E. Shapiro. A Subset of Concurrent Prolog and its Interpreter. ICOT, tr-003, Institute of Fifth Generation Computers, January 1983.

[11]

E. Shapiro. The Family of Concurrent Logic Programming Languages. TR CS 89-08, Weizmann Institute of Science, Applied Mathematics Department, May 1989.

[12]

W. Silverman, M. Hirsch, A. Houri, and E. Shapiro. The Logix System User Manual. TR CS 21, Weizmann Institute of Science, Applied Mathematics Department, Nov. 1988.

[13]

S. Taylor. Parallel Logic Programming Techniques. Prentice Hall, 1989.

Digital Library

[14]

S. Taylor, R. Shapiro, and E. Shapiro. FCP: A Summary of Performance Results. In The Third Conference on Hypercube Concurrent Computers and Applications, pages 1364 - 1373, January 1988.

Digital Library

[15]

E. Tick. Performance of Parallel Logic Programming Architectures. TR 421-88, ICOT, Japan.

[16]

K. Ueda. Guarded Horn Clauses. Doctoral dissertation, University of Tokyo, March 1986.

Cited By

Davison A(2002)Logic Programming Languages for the InternetComputational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I10.5555/646001.675774(66-104)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.5555/646001.675774
Massey BTick E(2005)Sequentialization of parallel logic programs with mode analysisLogic Programming and Automated Reasoning10.1007/3-540-56944-8_54(205-216)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-56944-8_54

Index Terms

Architectural support for the management of tightly-coupled fine-grain goals in flat concurrent Prolog
1. Hardware
  1. Hardware validation

Recommendations

Architectural support for the management of tightly-coupled fine-grain goals in flat concurrent Prolog
ISCA '90: Proceedings of the 17th annual international symposium on Computer Architecture

We propose architectural support for goal management as part of a special-purpose processor architecture for the efficient execution of Flat Concurrent Prolog. Goal management operations: halt, spawn, suspend and commit are decoupled from goal reduction,...
Architectural Support for Goal Management in Flat Concurrent Prolog
Special issue on sharing: high performance at low cost

A special-purpose architectural support that reduces the goal-management execution time in flat concurrent Prolog (FCP) is described. The architectural support consists of a dedicated goal-management unit that executes high-level goal-management ...
Exploiting fine grain parallelism in prolog

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 18, Issue 2SI

Special Issue: Proceedings of the 17th annual international symposium on Computer Architecture

June 1990

356 pages

ISSN:0163-5964

DOI:10.1145/325096

Issue’s Table of Contents

ISCA '90: Proceedings of the 17th annual international symposium on Computer Architecture
May 1990
378 pages
ISBN:0897913663
DOI:10.1145/325164
Chairmen:
Jean-Loup Baer,
Larry Snyder,
James Goodman

Copyright © 1990 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Published in SIGARCH Volume 18, Issue 2SI

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
316
Total Downloads

Downloads (Last 12 months)44
Downloads (Last 6 weeks)12

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Davison A(2002)Logic Programming Languages for the InternetComputational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I10.5555/646001.675774(66-104)Online publication date: 1-Jan-2002
https://dl.acm.org/doi/10.5555/646001.675774
Massey BTick E(2005)Sequentialization of parallel logic programs with mode analysisLogic Programming and Automated Reasoning10.1007/3-540-56944-8_54(205-216)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-56944-8_54

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents