A. Houri and E. Shapiro. A sequential abstract machine for flat concurrent prolog. Technical Report CS86-20, Dept. of Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel, July 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....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 minimality in order to achieve a higher degree of portability and ....

Houri, A. and Shapiro, E., A sequential abstract machine for Flat Concurrent Prolog, Weizmann Institute Technical Report CS86-19, Rehovot, 1986.

....mention Aquarius Prolog [28] whose compiler generates optimised code based on abstract interpretation techniques. We do not use Aquarius Prolog in our experiments because it is only supported for SunOS machines. It is also worth mentioning the committed choice languages such as Concurrent Prolog [15] or Parlog [12] that allow concurrent Prolog execution, and the parallel systems. 4 3 Conventional x Logic Programming In general, a problem solution can be divided in two parts: logic and control. When solving a problem using an imperative language, the programmer needs to concentrate on both ....

Avshalom Houri and Ehud Shapiro. A sequential abstract machine for flat concurrent Prolog. The Journal of Logic Programming, 7(2):85--124, September 1989.

....procedures. To do this we must have a broad outline of the functionality of each component. Roughly speaking, the store is intended to respond to ask and tell requests and the transformed procedures should act in accord with those responses. The store is not required, contrary to the full emulator [27], to maintain a list of suspended processes, or even a list of queued processes awaiting execution. This function is left to the underlying language. 4 It will, however, maintain a list of blocked asks, which will be retried at a future time. The only response the store may give in answer to ....

....We now study this queue. The Suspension Queue The suspension queue is not a queue per say, but rather a collection of suspended ask operations. However, the major issue here is not how these suspended asks are stored but when should they be re tried. In the FCP emulator [27] processes are held on hangers pointed at by those variables whose insufficient grounding was the (probable) cause of suspension. Thus the emulator can efficiently detect an appropriate moment to retry the process; namely when one of the variables pointing to the hanger is further instantiated. We ....

Avshalom Houri and Ehud Shapiro. A sequential abstract machine for Flat Concurrent Prolog. In Shapiro [65], chapter 38, pages 513--539. BIBLIOGRAPHY 182

.... semantics and behavior, either relying on low level machinery [46] or on a mixture of compile time techniques and specialized machinery [10] Other proposals depart from standard Prolog semantics, mainly restricting or disallowing backtracking and using matching instead of general unification [50, 32, 34, 12, 2]. In general, these decisions simplify the architecture of the system. 1.3 ACE: An And Or Parallel System and Execution Model The ACE (And or parallel Copying based Execution) model [21, 41] uses stack copying [1] and recomputation [19] to efficiently support combined or and independent ....

A. Houri and E. Shapiro. A sequential abstract machine for flat concurrent prolog. Technical Report CS86-20, Dept. of Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel, July 1986.

.... towards convergence in the implemenation techniques of systems that are in principle very different, such as the various parallel implementations of Prolog on one hand (see, for example, 17, 27, 2] and the implementations of the various committed choice languages on the other (see, for example, [7, 8, 14, 19, 24, 35, 38, 39]) The former are based on schemes for parallelizing a sequential language; they tend to be stack based, in the sense that (virtual) processors allocate environments on a stack and execute computations locally as far as possible until there is no more work to do, at which point they steal work ....

A. Houri and E. Shapiro. A sequential abstract machine for flat concurrent prolog. Technical Report CS86-20, Dept. of Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel, July 1986.

....1.0 3.2 7.8 Compiled Code 41.2 40.2 39.5 39.1 37.9 35.5 Compiled Alloc. 1.3 1.3 1.1 1.1 1.1 0.9 Table 3. Execution Time Breakdown (by Percentage) 6 Related Work Among the first abstract machine designs for committed choice languages were an implementation of Flat Concurrent Prolog [15] by Houri [9, 16], the Sequential Parlog machine by Gregory et al. 6] and the KL1 machine by Kimura [10] at ICOT. A good summary of work on Parlog appears in Gregory s book [6] The JAM Parlog system [4] is a commonly used Parlog implementation which compiles Parlog into code for an abstract machine interpreter. ....

A. Houri et al. A Sequential Abstract Machine for Flat Concurrent Prolog. In Concurrent Prolog: Collected Papers, vol. 2, pp. 513--574. MIT Press, 1987.

....The benchmarks tested were the following: nrev naive reverse: 1000 iterations on a list of length 30. qsort quicksort: 100 iterations on a list of length 50. tak the Takeuchi benchmark: we timed the call tak(18, 12, 6, hanoi The Towers of Hanoi program: hanoi(13) Adapted from [7]. factorial A program to compute the factorial of 12. The Janus code is typically more than twice as fast as the Sicstus Prolog, and four to eight times faster than Quintus Prolog. Table 2 gives the improvements in speed resulting from the optimizations described at the end of the previous ....

A. Houri and E. Shapiro, "A Sequential Abstract Machine for Flat Concurrent Prolog", in Concurrent Prolog: Collected Papers, vol. 2, ed. E. Shapiro, pp. 513-574. MIT Press, 1987.

....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 minimality in order to achieve a higher degree of portability and maintainability. ....

Houri, A. and Shapiro, E., A sequential abstract machine for Flat Concurrent Prolog, Weizmann Institute Technical Report CS86-19, Rehovot, 1986.

No context found.

A. Houri and E. Shapiro. A sequential abstract machine for flat concurrent prolog. Technical Report CS86-20, Dept. of Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel, July 1986.

No context found.

A. Houri and E. Shapiro, `A sequential abstract machine for flat concurrent Prolog', in E. Shapiro (ed.), Concurrent Prolog: Collected Papers, Vol. 2, MIT Press, 1987, pp. 513--574.

No context found.

A. Houri and E. Shapiro, "A Sequential Abstract Machine for Flat Concurrent Prolog", in Concurrent Prolog: Collected Papers, vol. 2, ed. E. Shapiro, pp. 513-574. MIT Press, 1987.

No context found.

A. Houri and E. Shapiro, "A Sequential Abstract Machine for Flat Concurrent Prolog", in Concurrent Prolog: Collected Papers, vol. 2, ed. E. Shapiro, pp. 513-574. MIT Press, 1987.

No context found.

A. Houri and E. Shapiro, "A Sequential Abstract Machine for Flat Concurrent Prolog", in Concurrent Prolog: Collected Papers, vol. 2, ed. E. Shapiro, pp. 513-574. MIT Press, 1987.

No context found.

Houri, A. and Shapiro, E. (1986). A Sequential Abstract Machine for Flat concurrent Prolog. Technical Report CS86-20, Weizmann Institute of Science, Rehovot, Isael.

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