A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
The &-Prolog system: Exploiting independent and-parallelism
1991
New generation computing
Preserved Fulltext
The &-Prolog system, a practical implementation of a parallel execution niodel for Prolog exploiting strict and non-strict independent and-parallelism, is described. ...
This description includes a summary of the system's language and architecture, some details of its execution model (based on the RAP-WAM model), and data on its performance on sequential workstations and ...
Conclusions We have presented an overview of &-Prolog, its implementation, and its performance on sharedmemory multiprocessors and sequential workstations. ...
doi:10.1007/bf03037164
fatcat:kfxbk6asfvdz3mu4bffihj44rq
Prolog - the language and its implementation compared with Lisp
1977
Proceedings of the 1977 symposium on Artificial intelligence and programming languages -
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We briefly review the language and compare it especially with pure Lisp. ...
These techniques are as incorporated in our DECsystem-lO Prolog compiler (written in Prolog). The code it generates is comparable in speed with that produced by existing DECIO Lisp compilers. ...
Acknowledgements We are indebted to members of the Groupe d'Intelligence Artificielle, Marseille, for developing both the Prolog language and the fundamental structure-sharing technique. ...
doi:10.1145/800228.806939
fatcat:pmuggpyy3feihpfkbm5o4cribe
Prolog - the language and its implementation compared with Lisp
1977
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We briefly review the language and compare it especially with pure Lisp. ...
These techniques are as incorporated in our DECsystem-lO Prolog compiler (written in Prolog). The code it generates is comparable in speed with that produced by existing DECIO Lisp compilers. ...
Acknowledgements We are indebted to members of the Groupe d'Intelligence Artificielle, Marseille, for developing both the Prolog language and the fundamental structure-sharing technique. ...
doi:10.1145/872734.806939
fatcat:ai3qtej2ircehghmla6nuin7by
The performance of parallel Prolog programs
1990
IEEE transactions on computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This paper presents performance results for a parallel execution model for Prolog that supports AND-parallelism, oa-parallelism, and intelligent backtracking. ...
The implications of the performance results for parallel Prolog systems are discussed, and directions for future work are indicated. ...
Each of the three children of a(X) must see the variable X as unbound, and must be able to bind it to its own particular value, independent of the actions of the other children. ...
doi:10.1109/12.61072
fatcat:rdeiqbw3pvcqhnkks2bzhm4fau
A high performance Prolog processor with multiple function units
1989
Proceedings of the 16th annual international symposium on Computer architecture - ISCA '89
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe the Parallel Unification Machine (PLUM), a Prolog processor that exploits fine grain parallelism using multiple function units executing in parallel. ...
In most cases the execution of bookkeeping instruct,ions is almost completely overlapped by unification, and the performance of the processor is limited only by the available unification parallelism. ...
N0039-84-C-0089 and N00014-88-K-0579 The authors also wish to thank Zycad Corporation for the use of their Endot N.2 hardware simulation tools that greatly simplified the task of simulating PLUM. ...
doi:10.1145/74925.74948
dblp:conf/isca/SinghalP89
fatcat:gwb6n7cjgjhrzi7oggkjqcxw7e
Guest editors' introduction: High-performance implementations of logic programming systems
1996
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We were motivated to have a special issue on high-performance implementations, because if one looks at the conference proceedings of ILPSs and ICLPs and at journals such as JLP, one finds very few articles ...
For one abstract we did not receive a full paper because one of its co-authors was from Kobe University. ...
Special thanks go to Maurice Bruynooghe, the editor-in-chief of the JLP, and Manuel Hermenegildo, area editor for implementation and architecture, for not only accepting the idea of a special issue, but ...
doi:10.1016/s0743-1066(96)00066-0
fatcat:j77j3hvo6jbyhjjxvvjg6hkhwa
A high performance Prolog processor with multiple function units
1989
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe the Parallel Unification Machine (PLUM), a Prolog processor that exploits fine grain parallelism using multiple function units executing in parallel. ...
In most cases the execution of bookkeeping instruct,ions is almost completely overlapped by unification, and the performance of the processor is limited only by the available unification parallelism. ...
N0039-84-C-0089 and N00014-88-K-0579 The authors also wish to thank Zycad Corporation for the use of their Endot N.2 hardware simulation tools that greatly simplified the task of simulating PLUM. ...
doi:10.1145/74926.74948
fatcat:uj3gbaiimjae3bvb56ubvnmgna
Designing a high performance parallel logic programming system
1987
SIGARCH Computer Architecture News
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two áreas to which special attention is given are the preservation of sequential performance and storage efficiency, and the use of low overhead mechanisms for controlling parallel execution. ...
This paper offers an overview of the basic concepts and techniques used in the parallel design, simulation tools used, and some of the results obtained to date. ...
Goal Independence AND-Parallelism and Restricted AND-Parallelism Conery [5] showed how "brute forcé" exploitation of AND-Parallelism (i.e. the automatic scheduling of a process for every goal in the ...
doi:10.1145/25372.25377
fatcat:3ol4sv2g5ncjbfepr6klr2gx5m
Performance studies of a parallel Prolog architecture
1987
Proceedings of the 14th annual international symposium on Computer architecture - ISCA '87
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This architecture is designed to support AND-parallelism, OR-parallelism, and intelligent backtracking. ...
We present the most comprehensive experimental results available to date on combined ANDparallelism, OR-parallelism, and intelligent backtracking in Prolog programs. ...
Patt and Vason P. Srini. ...
doi:10.1145/30350.30363
dblp:conf/isca/FaginD87
fatcat:virscausn5fg7ngoxu5j6avd5y
Novel Models for Or-Parallel Logic Programs: A Performance Analysis
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. ...
Recent research has led to two new binding representation approaches that also support independent and-parallelism: the Sparse Binding Array and the Copy-On-Write binding models. ...
Acknowledgments The authors would like to acknowledge and thank the contribution and support from Eduardo Correia. ...
doi:10.1007/3-540-44520-x_102
fatcat:ddyd65s32bb37imab7rgbyfpc4
Memory referencing characteristics and caching performance of AND-Parallel Prolog on shared-memory multiprocessors
1989
New generation computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Ahstract This paper presents the performance analysis results for the RAP-WAM AND-Parallel Prolog architecture on sharedmemory multiprocessor organizations. ...
This paper ofers an overview of the RAP-WAM model and the type of parallelism exploited in it, and presents simulation results supporting the claims of perfrmance, low overhead, and storage efciency. ...
§7 Acknowledgements The authors would like to thank Richard W arren for his comments on earlier drafts of this paper and the Microelectronics and Computer Technology Corporation for its support. ...
doi:10.1007/bf03037507
fatcat:rxeeo35tinhpxptgtwxugwybw4
Tackling Complexity in High Performance Computing Applications
2016
International journal of parallel programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
code or a hard to recover from it. ...
We describe our methodology and illustrate its application in two classes of application: a data intensive commercial video transcoding example and a numerically intensive incompressible Navier-Stokes ...
The workflow defines what computation should be performed, whilst a specific profile defines how it should be performed. ...
doi:10.1007/s10766-016-0422-9
pmid:32226222
pmcid:PMC7089654
fatcat:owxtkvg35bby5d52n24o6f5l7e
DESIGN AND PERFORMANCE MEASUREMENTS OF A PARALLEL MACHINE FOR THE UNIFICATION ALGORITHM
2021
figshare.com
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Unification is known to be the most repeated operation in logic programming and PROLOG interpreters. To speed up the execution of logic programs, the performance of unification must be improved. ...
The machine is simulated at the register transfer level and the simulation results as well as performance comparison with a serial unification coprocessor are presented. ...
As expected, the speed.up increases as the arity is increased exploiting the match parallelism and fast consistency check provided by the machine. ...
doi:10.6084/m9.figshare.13652954.v1
fatcat:u7mlfeuxjjhm7pcsy6n5kjopbe
Code-size conscious pipelining of imperfectly nested loops
2007
Proceedings of the 2007 workshop on MEmory performance DEaling with Applications, systems and architecture - MEDEA '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In addition to preserving precious scratch-pad or cache memory, our method also avoids the performance overhead of prologs and epilogs resulting from pipelined inner loops with short trip count. ...
We propose a method to pipeline multiple inner loops without increasing the size of the loop nest, apart from an outermost prolog and epilog. ...
This is much less harmful to performance than inner prologs and epilogs, yet it may still cause some problems on memory-constrained embedded architectures. ...
doi:10.1145/1327171.1327177
fatcat:ur5bvyxcwbfczk7re3vvrhilvm
High-level characteristics of or- and independent and-parallelism in prolog
1996
International journal of parallel programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present the results of a high-level simulation study of or-and independent and-parallelism with a wide selection of Prolog programs that aims to determine the intrinsic amount of parallelism ...
In addition, the paper examines some of the issues and tradeoffs associated with the combination of and-and or-parallelism and proposes reasonable solutions based on the simulation data obtained. ...
Here we present comparisons between the simulator and results from Aurora and Muse, two or-parallel Prolog systems, and &-Prolog, an independent and-parallel Prolog system. ...
doi:10.1007/bf02583023
fatcat:aqgcmjgarncoxb6dytnbmvoqze
« Previous
Showing results 1 — 15 out of 3,298 results