A message driven OR-parallel machine
Pages 217 - 228
Abstract
A message driven architecture for the execution of OR-parallel logic languages is proposed. The computational model is based on well known compilation techniques for Logic Languages. We present first the multiple binding mechanism for the OR-parallel Prolog architecture and the corresponding OR-parallel abstract machine is described. A scheduling algorithm which does not rely upon the availability of global data structures to direct the search for work is discussed. The message driven processor, the processing node of the parallel machine, is designed to interact with a shared global address space and to efficiently process messages from other processing nodes. We discuss some of the results obtained from a high level functional simulator of the message driven machine.
References
[1]
K. Ali OR-Parallel Execution of Prolog on BC-Maehine In R. Kowalski, K.Bowen (editor), Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1531-1545. Seatle, August, 1988.
[2]
U. Baron, J Chassin de Kerfommeaux, M. Hailperin, M. Rateliffe, P. Robert, J-C Syre, H. Westphal, The Parallel ECRC Prolog System PEPSys: An Overview and Evaluation Results, In International Conference on Fifth Generation Computer Systems- Tokyo, Nov-Dec, 1988.
[3]
BBN Butterfly Scheme Reference Manual. Technical Report, BBN Advanced Computers, 1987.
[4]
P. Borgwardt. Parallel Prolog ~asing stack segments on shared memory multiprocessors, nstitution="IEEE", In Symposium on Logic Programming, pages 2-11, 1984.
[5]
R. Buffer, T. Disz, E. Lusk, R. Olson, R. Overbeek, R. Stevens. Scheduling OR-Parallelism: an Argonne Perspective. In The International Conference and Symposium on Logic Programming, August, 1988.
[6]
A. Caldexwood, Scheduling Or-Parallelism in Aurora - the Manchester Scheduler, Technical Report, Gigalips Project, May, 1988.
[7]
A. S. K. Cheng. DTT- An Efficient Indexing Technique for Prolog Databases. Technical Report CSM-093, University of Essex, Dept. Computer Science, November 1986.
[8]
A. Ciepielewski, S. Haridi, Formal Methods for OR-Parallel Execution of Logic Programs. In Mason(editor), IFIPS Congress, North Holland. 1983
[9]
A. Ciepielewsld, B. Hausman. Performance evaluation of a storage model for OR-Parallel execution of logic programs. In Symposium on Logic Progranvning, Sep, 1986.
[10]
J. S. Conery. Binding Environments for Parallel Logic Programs in Nonshared memory multiprocessors. In Symposium on Logic Programming, pages 457-467, August, 1987.
[11]
J. A. Crammond. A comparative study of unification algorithms for OR-parallel Execution of logic languages. In International Conference on Parallel Processing, pages 131-138. August, 1985.
[12]
W. Dally. Wire Efficient VLSI Multiprocessor Communication Networks. In Stanford Conference on Advanced Research in VLS1. 1987
[13]
S. A. Delgado-Rannauro, T.J. Reynolds, A.S.K Cheng, S. Marriott. Brave Abstract Machine Definiton. Technical Report CSM- 118, University of Essex, Dept. Computer Science, July 1988.
[14]
P.A. Franazek, C.I. Georgiou. Multipath Hierarchies in Interconnection Networks. In E.N. Housfis, T.S. Papatheodorou and C.D. Polychronopoulos (editor), Supercomputing 1st. international Conference. pages 112-123. June, 1987.
[15]
L.R. Gloke, G.J. Lipovski. Banyan networks for partitioning mulfiprocessor systems. In First Annual Symposium on Computer Architecture. pages 21-28. 1973.
[16]
B. Hausman, A. Ciepielewski and S. Haridi. OR-parallel Prolog Made Efficient on Shared Memory Multiprocessors. Research Report SICS 87006, Swedish Institute of Computer Science, 1987.
[17]
G. Lindstrom. OR-Parallelism on Applicative Architectures. In Second International Conference on Logic Programming. July, 1984.
[18]
E. Lusk, R. Butler,T. Disz, R. Olson, R. Overbeek, R. Stevens, D.H.D Warren, A. Calderwood, P. Szerecli, S. Haridi, P. Brand, M. Carlsson, A. Ciepielewski, B. Hausman. The Aurora Or-Parallel Prolog System. In International Conference on Fifth Generation Computers- Tokyo. pages 819-830. Nov-Dec 1988.
[19]
T. Miyazaki, A. Takeuchi, T. Chikayama. A Sequential Implementation of Concurrent Prolog Based on the Shallow binding scheme. In Symposium on Logic Programming, pages 110-118. 1985.
[20]
T.J. Reynolds, A.I. Beaumont, A.S.K. Cheng, S.A. Delgado- Rannauro and L.A. S pacek. BRAVE- A Parallel Logic Language for Artificial Intelligence In Frontiers in Computing. pages 221-235. December, 1987.
[21]
E. Tick. Memory Performance of Prolog Architectures. Kluwer Academic, 1987.
[22]
H. Touafi and A. Despain. An Empirical Study of the Warren Abstract Machine. In Symposium on Logic Programming. pages 114-124, August, 1987.
[23]
D.H.D Warren. Implementing Prolog. Compiling Predicate Logic. Research Report No. 39, Vol. 1-2, Dept. of Artificial Intelligence, University of Edinburgh. 1977.
[24]
D.H.D Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, 1983.
[25]
D.H.D Warren. The SRI Model for Or-parallel Execution of Prolog - Abstract Design and Implementation Issues. In Symposium on Logic Programming, pages 92-102. August, 1987.
[26]
D.S. Warren, Efficient Prolog memory management for flexible control strategy. In Symposium on Logic Programming. pages 198-202. 1984.
[27]
M.I. Wise. A Parallel Prolog: The Construction of a data driven model. In Symposium on LiSP and Functional Programming. pages 55-66. August, 1982.
Index Terms
- A message driven OR-parallel machine
Recommendations
A message driven OR-parallel machine
ASPLOS III: Proceedings of the third international conference on Architectural support for programming languages and operating systemsA message driven architecture for the execution of OR-parallel logic languages is proposed. The computational model is based on well known compilation techniques for Logic Languages. We present first the multiple binding mechanism for the OR-parallel ...
Compiling machine-independent parallel programs
Initial evidence is presented that explicitly parallel, machine-independent programs can automatically be translated into parallel machine code that is competitive in performance with hand-written code.The programming language used is Modula-2*, an ...
Parallel compilation for a parallel machine
Proceedings of the SIGPLAN '89 symposium on Interpreters and interpretive techniquesAn application for a parallel computer with multiple, independent processors often includes different programs (functions) for the individual processors; compilation of such functions can proceed independently. We implemented a compiler that exploits ...
Comments
Information & Contributors
Information
Published In
Copyright © 1989 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1989
Published in SIGARCH Volume 17, Issue 2
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 310Total Downloads
- Downloads (Last 12 months)29
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in