检索结果-内蒙古大学图书馆

parallel logic programming systems on scalable architectures

JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2000年第7期60卷 835-852页

作者： Costa, VS Bianchini, R Dutra, ID Univ Fed Rio de Janeiro Dept Syst Engn & Comp Sci Rio De Janeiro Brazil

parallel logic programming (PLP) systems are sophisticated examples of symbolic computing systems. PLP systems address problems such as allocating dynamic memory, scheduling irregular computations, and managing different types of implicit parallelism. Most PLP systems have been developed for bus-based architectures. However, the complexity of PLP systems and the large amount of data they process raise the question of whether logic programming systems can still achieve good performance on modern scalable architectures, such its distributed shared-memory (DSM) systems. In this work we use execution-driven simulation of a cache-coherent DSM architecture to investigate the performance of Andorra-I, a state-of-the-art PLP system, on a modern multiprocessor. The results of this simulation show that Andorra-I exhibits reasonable running time performance. bat it does not scale well. Our detailed analysis of cache misses and their sources expose several opportunities for improvements in Andorra-I. Based on this analysis, we modify Andorra-I using a set of simple techniques that led to significantly better running time and scalability. These results suggest that Andorra-I can and should perform well on modern multiprocessors. Furthermore, as Andorra-I shares its main data structures with several PLP systems, we conclude that the methodology and techniques used in our work can greatly benefit those other PLP systems. (C) 2000 Academic Press.

关键词： DSM architectures parallel logic programming

来源：评论

学校读者我要写书评

暂无评论

parallel logic programming for problem solving

引用

INTERNATIONAL JOURNAL OF parallel programming 2000年第3期28卷 275-319页

作者： Arias, RV Vela, CR Peinador, JP González, CA Univ Oviedo Ctr Inteligencia Artificial E-33271 Gijon Spain

We present a new model for parallel evaluation of logic programs. This model can exploit the main sources of parallelism that the language of logic expresses: Independent AND parallelism and OR parallelism, together with a secondary source emerging as a consequence of the Independent AND parallelism: the producer/consumer parallelism. The efficiency is derived from the use of ordered structures for managing the information generated throughout the search process. The model is suitable for evaluating programs with a high degree of non-determinism because it never generates two processes for solving the same subgoal and hence it can exploit the same real parallelism generating a lower number of processes than other models. As an application example, we consider the Job Shop Scheduling problem. We report experimental results showing that logic programs can be designed that exhibit parallelism, and that the use of heuristic information translates into speedup in obtaining answers.

关键词： parallel logic programming ordered structures heuristics problem solving

来源：评论

学校读者我要写书评

暂无评论

The parallel logic programming system in the FGCS project and its future directions

引用

parallel COMPUTING 1999年第13-14期25卷 1601-1633页

作者： Uchida, S Aiba, A Rokusawa, K Chikayama, T Hasegawa, R Res Inst Adv Informat Technol Minato Ku Tokyo 1050014 Japan Univ Tokyo Bunkyo Ku Tokyo 113 Japan Kyushu Univ Kasuga Fukuoka 816 Japan

In the fifth generation computer systems (FGCS) project, a parallel logic programming language, KL1, was adopted as the project's kernel language. It was not only used to determine architectures of highly parallel machines called parallel inference machines (PIMs) consisting of about 1000 element processors but also used as a system description language to develop basic software such as a parallel operating system (PIMOS), and symbolic processing and knowledge processing application systems such as knowledge description languages, a parallel theorem prover, and a protein sequence analysis program. It achieved great success in exploiting of parallelism involved in several important application systems. The prototype of the FGCS attained a linear speed-up that was proportional to the number of processing elements (PEs) for the application systems we had targeted. The MGTP parallel theorem prover was one of such application systems, and can prove theorems based on full first-order logic. Thus, it indicates the possibility of designing a new practical knowledge representation language whose expressive power will be much greater than that of conventional ones. In the FGCS follow-on project, KL1 and its programming system were ported to Unix-based stock parallel machines. This new system called KLIC is expected to greatly extend the use of highly parallel systems. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： FGCS project parallel logic programming parallel inference knowledge processing theorem proving

来源：评论

学校读者我要写书评

暂无评论

An experiment for truly parallel logic programming

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 1996年第2期16卷 169-184页

作者： Efthivoulidis, G Vlassis, N Tsanakas, P Papakonstantinou, G Department of Electrical and Computer Engineering National Technical University of Athens Zografou Campus GR-15773 Athens Greece

A truly parallel logic programming system is proposed. The system is based on the commercially available parallel logic programming language STRAND, which has been extended in order to overcome the inherent limitations of such systems, like AND-type of parallelism, lack of backtracking, limited unification, etc. The system has been tested using an example from the area of natural language processing.

关键词： parallel logic programming STRAND language natural language processing

来源：评论

学校读者我要写书评

暂无评论

Coalgebraic Semantics for parallel Derivation Strategies in logic programming

Coalgebraic Semantics for Parallel Derivation Strategies in ...

引用

13th International Conference on Algebraic Methodology and Software Technology

作者： Komendantskaya, Ekaterina McCusker, Guy Power, John Univ Dundee Dept Comp Dundee DD1 4HN Scotland Univ Bath Dept Comp Sci Bath England

ISBN: (纸本)9783642177958

logic programming, a class of programming languages based on first-order logic, provides simple and efficient tools for goal-oriented proof-search. logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either P-f P-f-coalgebras or P-f List-coalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (proof-trees, SLD-trees, and-or parallel trees) used in logic programming, and show how they can be modelled coalgebraically.

关键词： logic programming SLD-resolution parallel logic programming Coalgebra Coinduction

来源：评论

学校读者我要写书评

暂无评论

Optimistic parallelism Requires Abstractions

引用

COMMUNICATIONS OF THE ACM 2009年第9期52卷 89-97页

作者： Kulkarni, Milind Pingali, Keshav Walter, Bruce Ramanarayanan, Ganesh Bala, Kavita Chew, L. Paul Univ Texas Austin Austin TX 78712 USA Cornell Univ Ithaca NY USA

The problem of writing software for multicore processors is greatly simplified if we could automatically parallelize sequential programs. Although auto-parallelization has been studied for many decades, it has succeeded only in a few application areas such as dense matrix computations. In particular, auto-parallelization of irregular programs, which are organized around large, pointer-based data structures like graphs, has seemed intractable. The Galois project is taking a fresh look at auto-parallelization. Rather than attempt to parallelize all programs no matter how obscurely they are written, we are designing programming abstractions that permit programmers to highlight opportunities for exploiting parallelism in sequential programs, and building a runtime system that uses these hints to execute the program in parallel. In this paper, we describe the design and implementation of a system based on these ideas. Experimental results for two real-world irregular applications, a Delaunay mesh refinement application and a graphics application that performs agglomerative clustering, demonstrate that this approach is promising.

关键词： Data structures (Computer science) Computer algorithms Data mining parallel logic programming Abstract thought Microprocessors Computer logic Software architecture Sequential processing (Computer science) Program transformation (Computer programming) Computer graphics software Abstract data types (Computer science) Java (Computer program language) Data parsing

来源：评论

学校读者我要写书评

暂无评论

parallel programming with Transactional Memory

引用

COMMUNICATIONS OF THE ACM 2009年第2期52卷 38-43页

作者： Drepper, Ulrich Red Hat

The article discusses the manner in which transactional memory can ease parallel computer programming. The increased number of execution units, or CPU (Central Processing Unit) cores, provided by CPU manufacturers is allowing programmers to increased the speeds of applications, the author states. Topics of discussion include multiple paths of execution having to work together to complete tasks, attempting to split a computer program into multiple pieces that can be executed in parallel, and the controlled fashion required to write access to shared data.

关键词： parallel programming (Computer science) MOTHERBOARDS (Microcomputers) MEMORY management (Computer science) COMPUTER programming parallel logic programming parallel processing (Electronic computers)

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL IMPLEMENTATION OF AND-OR-parallel-PROLOG

引用

FUTURE GENERATION COMPUTER SYSTEMS 1994年第1期10卷 71-92页

作者： GUPTA, G COSTA, VS UNIV BRISTOL DEPT COMP SCIBRISTOL BS8 1TRAVONENGLAND

Most models that have been proposed, or implemented, so far for exploiting both or-parallelism and independent and-parallelism have only considered pure logic programs (pure Prolog). We present an abstract model, called the Composition-Tree, for representing and-or parallelism in full Prolog. The Composition-Tree recomputes independent goals to ensure that Prolog semantics is preserved. We combine the idea of Composition-Tree with ideas developed earlier, to develop an abstract execution model that supports full Prolog semantics while at the same time avoiding redundant inferences when computing solutions to (purely) independent and-parallel goals. This is accomplished by sharing solutions of independent goals when they are pure (i.e. have no side-effects or cuts in them). The Binding Array scheme is extended for and-or parallel execution based on this abstract execution model. This extension enables the Binding Array scheme to support or-parallelism in the presence of independent and-parallelism, both when solutions to independent goals are recomputed as well as when they are shared. We show how extra-logical predicates, such as cuts and side-effects, are supported in this model.

关键词： parallel logic programming OR-parallelISM AND-parallelISM GOAL RECOMPUTATION GOAL REUSE ENVIRONMENT REPRESENTATION PAGED BINDING ARRAYS

来源：评论

学校读者我要写书评

暂无评论

Relating data-parallelism and (and-) parallelism in logic programs

引用

COMPUTER LANGUAGES 1996年第2-3期22卷 143-163页

作者： Hermenegildo, MV Carro, M UNIV POLITECN MADRID FAC INFORMAT BOADILLA DEL MONTE 28660 MADRID SPAIN

Much work has been done in the areas of and-parallelism and data-parallelism in logic Programs. Such work has proceeded to a certain extent in an independent fashion. Both types of parallelism offer advantages and disadvantages. Traditional (and-) parallel models offer generality, being able to exploit parallelism in a large class of programs (including that exploited by data-parallelism techniques). Data-parallelism techniques on the other hand offer increased performance for a restricted class of programs. The thesis of this paper is that these two forms of parallelism are not fundamentally different and that relating them opens the possibility of obtaining the advantages of both within the same system. Some relevant issues are discussed and solutions proposed. The discussion is illustrated through visualizations of actual parallel executions implementing the ideas proposed. Copyright (C) 1996 Elsevier Science Ltd

关键词： parallel logic programming and-parallelism data-parallelism fast task startup scheduling

来源：评论

学校读者我要写书评

暂无评论

Proving termination of GHC programs

引用

NEW GENERATION COMPUTING 1997年第3期15卷 293-338页

作者： Rao, MRKK Kapur, D Shyamasundar, RK TATA INST FUNDAMENTAL RES COMP SCI GRPBOMBAY 400005MAHARASHTRAINDIA SUNY ALBANY DEPT COMP SCIALBANYNY 12222

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed;it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved.

关键词： parallel logic programming verification termination

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：