S. Taylor. Parallel Logic Programming Techniques. Prentice Hall, Englewood Clis, NJ, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... it seems currently more geared towards the design of constraint based systems than toward the de nition of explicit coordination primitives [32] Moreover, the restriction of Concurrent Prolog to its at subset constrains the language toward a synchronous style of programming, according to [48]. In the following, we sketch the operational model of concurrent logic languages to compare it with Gammalog, the reader interested to a more formal and comprensive approach can refer to [45, 18] Stream based logic programs are based on the process reading of logic programs, each goal atom A is ....

S. Taylor. Parallel Logic Programming Techniques. Prentice Hall, Englewood Clis, NJ, 1989.

....for specifying interconnections between software chips. The integration of this calculus into a programming notation is not discussed, and the notion of virtual topology is absent. The use of virtual topologies to abstract mapping decisions was first proposed by Martin [22] Hudak [20] and Taylor [26], among others, have used similar ideas to specify mapping decisions in declarative programming systems. In Hudak s scheme, arbitrary integer functions can be used to specify both relative and absolute locations. Taylor uses them to specify relative locations in an infinite computing surface. ....

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

....aspects of program design such as scalability constraints, partitioning, mapping, and granularity. The implementation of an abstraction is combined with problem specific information to form a complete application. In previous work, wc have explored these ideas in the context of mapping [39], self scheduling computations [18] and trcc reduction problems [20] In this paper, wc show how the speci fication and implementation of such abstractions can bc incorporated into the compilation process. 1.4 Compiler Techniques We seek techniques that permit efficient implementation of ....

....evaluators to compile away the overhead of interpretation [35] However, we find the complexity of this approach unnecessary and prefer to implement transformations directly. The abstract machine design that we employ builds on our previous work in run time support for concurrent programming [19, 39]. Unlike our previous designs and other uniprocessor systems [25, 30, 40] the PCN abstract machine emphasizes mutable data structures and the integration of sequential procedures, written in languages such as C, C , and Fortran, into concurrent programs. In addition, we have focused on ....

[Article contains additional citation context not shown here]

Taylor, S., Parallel Logic Programming Techniques, Prentice-Hall, Englewood Cliffs, N.J., 1989. 36

....di#erent processors. IMPACT NLI 1998 2 26 5 Research Suggestions IMPACT Architecture of parallel machine Since the majority of the massively parallel machines are based on a distributed architecture, it is preferable if a parallel implementation of a parser is suited for distributed processing. [Tay89] gives some results of a distributed implementation of FCP on a four dimensional hypercube. It turns out that some programs achieve acceptable speedups, whereas other programs perform poorly. Most notably, a simple systolic implementation (lacking load balancing) does not achieve acceptable ....

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

....processors. IMPACT NLI 1998 2 26 5 Research Suggestions IMPACT Architecture of parallel machine Since the majority of the massively parallel machines are based on a distributed architecture, it is preferable if a parallel implementation of a parser is suited for distributed processing. [Tay89] gives some results of a distributed implementation of FCP on a four dimensional hypercube. It turns out that some programs achieve acceptable speedups, whereas other programs perform poorly. Most notably, a simple systolic implementation (lacking load balancing) does not achieve acceptable ....

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

.... or a distributed store, in which each processor holds some component of the store, and the least upper bound of the components represents the (virtual) shared store (as in ordinary message passing systems such as the Cosmic Environment [2] distributed implementations of concurrent logic languages [13, 14, 32], and models of shared virtual memory [16] 2.1 Reactive transition systems By a domain hD; i we mean a set D partially ordered by , which has a least element. We do not require the domain to be a cpo, only that it be complete relative to the transition system, as explained below. We shall ....

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

....and composed with other structures to build concurrent programs. However, resource allocation and locality are not addressed. Virtual computers have been used to achieve portability by hiding information concerning the size and topology of a physical computer. Martin [26] Hudak [23] and Taylor [29] have investigated notations for specifying process mapping on a (potentially infinite) processing surface. In data parallel languages [30, 18] data distribution is specified with respect to a virtual computer, as proposed here; however, hierarchies cannot be defined. While these systems succeed ....

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

....logic languages. Although their theoretical and formal properties are largely studied, currently their impact on the practice of software design and programming is minimal. Alas, it has been claimed that logic languages offer outstanding possibilities for new concepts in parallel programming [23, 26]. The requirements listed above suggest a new way of designing and building parallel systems, and that the logic programming approach can actually be considered a relevant model for coordination issues. This paper is a survey on parallel programming with logic languages. The potentialities of the ....

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

....to concurrent constraint languages and discuss methods of disjunctive and hypothetical reasoning already investigated in logic languages. CHAPTER 1. INTRODUCTION 4 1. 1 Background Concurrent constraint languages [58, 32, 61, 60, 62] grew out of a formalization of concurrent logic languages 2 [46, 65, 72, 66]. The concept of programming with constraints is taken from the work on constraint logic programming [30, 31, 39, 29, 12, 13, 22] which itself is a generalization of Prolog [36, 9, 69] 1.1.1 Terminology For the sake of completeness, and to establish a consistent terminology for the thesis we ....

Stephen Taylor. Parallel Logic Programming Techniques. Prentice-Hall, New Jersey, 1988.

....is the number of operations performed in the blackboard during the execution of the programs. This number was measured by instrumenting the SICStus implementation of the Linda library. The incomplete message program is the standard program implementing a two way communication between processes [12, 28, 29]. The bounded buffer program is also the standard one. The one to many communication with acknowledge program allows several processes to read a stream produced by another, the latter being informed of which process read each element. We argue that, despite the amount of metainterpretation of ....

S. Taylor. Parallel Logic Programming Techniques. Prentice-Hall, Englewood Cliffs, NY, 1989.

....and data to be distributed across the computers in the machine, and is supported at every stage of the program development cycle. Although the concepts are language independent, the prototype system is based on GNU C. The programming system carries the experience gained from previous experiments [12, 26, 14] into a C based system, while exploiting the special features available in the underlying architecture. The basic programming model for the system is: A computation is a collection of concurrent processes that may execute in any order or in parallel. Processes communicate and synchronize using ....

.... Program in CST The Scalable Concurrent Programming group has been involved for several years in developing portable, high performance programming systems that execute efficiently on scalable multicomputers [24] The high level programming systems that have been developed within this group [12, 26, 14], all share the same fine grain process model present in this work. An example program written in one of these languages, PCN, can be found in Figure 2.4. The mapping annotations used by PCN and MDC are identical. Unfortunately, scalable multicomputer architectures have traditionally supported ....

[Article contains additional citation context not shown here]

Taylor, S., Parallel Logic Programming Techniques, Prentice-Hall, Englewood Cliffs, N.J., 1989.

....Programming Languages Delta 131 hence avoiding the need for garbage collection in certain common cases. A garbage collector is nevertheless required in the general case. On distributed memory computers, a shared variable is represented by a single occurrence and one or more remote references [Taylor 1989]; read and write operations on remote references are translated into communication operations. The garbage collector must also trace these interprocessor references; however, individual processors can reclaim storage independently, hence avoiding a need for global synchronization [Foster 1989] ....

....Languages and Systems, Vol. 8, No. 1, January 1999. 150 Delta Ian Foster 5. RELATED WORK The Strand design builds on work in concurrent logic programming at Imperial College [Clark and Gregory 1981; Gregory 1987; Ringwood 1988] the Weizmann Institute [Mierowsky et al. 1985; Shapiro 1987; Taylor 1989], and elsewhere. Concurrent logic programming itself has intellectual roots in logic programming [Clocksin and Mellish 1981; Kowalski 1979] functional programming [Kahn and MacQueen 1977; McLennan 1990] guarded commands [Dijkstra 1975] and CSP [Hoare 1978] However, Strand omits many ....

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

....reuse storage occupied by list cells, hence avoiding the need for garbage collection in certain common cases. A garbage collector is nevertheless required in the general case. On distributed memory computers, a shared variable is represented by a single occurrence and one or more remote references [32]; read and write operations on remote references are translated into communication operations. The garbage collector must also trace these interprocessor references; however, individual processors can reclaim storage independently, hence avoiding a need for global synchronization. The foreign code ....

....and the first compiler was released by Strand Software Technologies in 1989. In 1990, Strand was awarded the British Computer Society s Award for Technical Innovation. The Strand design builds on work in concurrent logic programming at Imperial College [8, 11, 17, 28] the Weizmann Institute [26, 29, 32], and elsewhere. Concurrent logic programming itself has intellectual roots in logic programming [9, 22] functional programming [20, 25] guarded commands [10] and CSP [19] However, Strand omits many characteristic features of logic programming languages, such as unification and backtracking, ....

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

....indicate that the performance of our approach is uniformly better than that of plausible alternative schemes. 1 Introduction There has been a great deal of research, in recent years, on the design and implementation of concurrent logic and constraint programming languages (see, for example, [12, 13, 14, 15, 17]) Much of the implementation effort in this context has focussed on the so called flat versions of these languages: here, a procedure definition consists of alternatives, each alternative preceded by a guard that consists of a set of ask actions or primitive tests. An alternative can be ....

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

....of parallel logic languages to little advantage; features such as unification and or parallelism [4] In common with the other languages Strand employ concurrent processes, communication via single assignment variables and dataflow synchronisation. The interested reader is directed to [4] 18] [21], 2] and [22] for a more detailed discussion of these issues. A consequence of the decision to leave out features that complicate implementation is that Strand has been very efficiently implemented. In [4] Strand is compared to Parlog (a shared memory implementation) and to Flat Concurrent Prolog ....

S. Taylor. Parallel Logic Programming Techniques. Prentice Hall, Englewood Cliffs, N.J., 1989.

....computer by changing mapping constructs. 7. 1 Process Placement Constructs The Fortran M process placement constructs are based on the concept of a virtual computer: a collection of virtual processors, which may or may not have the same topology as the physical computer on which a program executes [25, 36]. For consistency with Fortran concepts, a Fortran M virtual computer is an N dimensional array, and the mapping constructs are modeled on Fortran 77 s array manipulation constructs. The PROCESSORS declaration specifies the shape and dimension of a processor array, the LOCATION annotation maps ....

Taylor, S., Parallel Logic Programming Techniques, Prentice-Hall, Englewood Cliffs, N.J., 1989.

....for specifying interconnections between software chips. The integration of this calculus into a programming notation is not discussed, and the notion of virtual topology is absent. The use of virtual topologies to abstract mapping decisions was first proposed by Martin [22] Hudak [20] and Taylor [26], among others, have used similar ideas to specify mapping decisions in declarative programming systems. In Hudak s scheme, arbitrary integer functions can be used to specify both relative and absolute locations. Taylor uses them to specify relative locations in an infinite computing surface. ....

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

No context found.

S. Taylor, Parallel Logic Programming Techniques, Prentice-Hall, Englewood Cliffs, N.J., 1989.

....aspects of program design such as scalability constraints, partitioning, mapping, and granularity. The implementation of an abstraction is combined with problem specific information to form a complete application. In previous work, we have explored these ideas in the context of mapping [39], self scheduling computations [18] and tree reduction problems [20] In this paper, we show how the specification and implementation of such abstractions can be incorporated into the compilation process. 1.4 Compiler Techniques We seek techniques that permit efficient implementation of ....

....evaluators to compile away the overhead of interpretation [35] However, we find the complexity of this approach unnecessary and prefer to implement transformations directly. The abstract machine design that we employ builds on our previous work in runtime support for concurrent programming [19, 39]. Unlike our previous designs and other uniprocessor systems [25, 30, 40] the PCN abstract machine emphasizes mutable data structures and the integration of sequential procedures, written in languages such as C, C , and Fortran, into concurrent programs. In addition, we have focused on ....

[Article contains additional citation context not shown here]

Taylor, S., Parallel Logic Programming Techniques, Prentice-Hall, Englewood Cliffs, N.J., 1989.

....512 computer J machine. The J Machine [1] is an architectural experiment which focuses on the evaluation of hardware mechanisms, such as the integration of messages and processes, to support concurrent programming. The programming system carries the experience gained from our previous experiments [2, 3, 4] into a C based system, while exploiting the special features available in the underlying architecture. The basic programming model for the system is: A computation is a collection of concurrent processes that may execute in any order or in parallel. Processes communicate and synchronize using ....

....Caltech, MIT and The Aerospace Corporation. The Scalable Concurrent Programming group has been involved for several years in developing portable, high performance programming systems that execute efficiently on scalable multicomputers [8] The high level programming systems that we have developed [2, 3, 4], all share the same fine grain process model present in this work. Unfortunately, scalable multicomputer architectures, such as the Intel Delta and Paragon, Thinking Machines CM5 and Symult S2010, have traditionally supported only Unix style, coarsegrain, stack based processes. Thus our previous ....

[Article contains additional citation context not shown here]

Taylor, S., Parallel Logic Programming Techniques, Prentice-Hall, Englewood Cliffs, N.J., 1989.

No context found.

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

No context found.

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

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC