Studies in prolong architectures
Thesis/Dissertation
·
OSTI ID:7183854
This dissertation addresses the problem of how logic programs can be made to execute at high speeds. Prolog, chosen as a representative logic programming language, differs from procedural languages in that it is applicative, nondeterminate and uses unification as its primary operation. Program performance is directly related to memory performance because high-speed processors are ultimately limited by memory bandwidth, and architectures that require less bandwidth have greater potential for high performance. This dissertation reports the dynamic data and instruction referencing characteristics of both sequential and parallel Prolog architectures and corresponding uniprocessor and multiprocessor memory-hierarchy performance tradeoffs. Initially, a family of canonical architectures, corresponding closely to Prolog, is defined from the principles of ideal machine architectures of Flynn, and is then refined into the realizable Warren Abstract Machine (WAM) architecture. The memory-referencing behavior of these architecture sis examined by tracing memory references during emulation of a set of Prolog benchmarks. Two-level memory hierarchies for both sequential (WAM) and parallel (PWAM) Prolog architectures are modeled. PWAM is the Restricted-AND Parallel architecture of Hermenegildo.
- Research Organization:
- Stanford Univ., CA (USA)
- OSTI ID:
- 7183854
- Country of Publication:
- United States
- Language:
- English
Similar Records
High-performance architecture for Prolog
Memory performance of Prolog architectures
Proceedings of the 16th annual international symposium on computer architecture
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:6818819
Memory performance of Prolog architectures
Book
·
Thu Dec 31 23:00:00 EST 1987
·
OSTI ID:5805551
Proceedings of the 16th annual international symposium on computer architecture
Conference
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:7222500