Sverker Janson and Johan Montelius. The design of the AKL/PS 0.0 prototype implementation of the Andorra Kernel Language. ESPRIT deliverable, EP 2471( PEPMA), SICS, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....suspended. The Basic Andorra Model has been implemented in Andorra I [164, 165, 166, 225] In the Extended Andorra Model [90, 163] a copy of the computation is created for each possible binding of a variable when all deterministic goals have been executed. The extended model is implemented in AKL [107, 108, 140]. Gupta, Santos Costa, Yang, and Hermenegildo [83] combine independent AND parallelism, deterministic dependent AND parallelism and OR parallelism in IDIOM. This built on ideas from AO WAM [86] which is an extension of RAP WAM [95] with OR parallelism. Another approach to solving the problem with ....

....criteria, meaning that less speculative work is performed first. Combined with determinism, we argue that parallel implementation overheads can be made minimal. Our scheme can be viewed as merging deterministic parallel subgoals with the topmost parallel computation. This is similar to AKL [108, 107, 140] where deterministic AND boxes are promoted. Gupta, Pontelli [156, 158] and Tang [157] use a similar technique in ACE for reducing the overheads for independent AND parallelism. Carro, Gupta, Hermenegildo, Pontelli, Santos Costa, Tang [95, 94, 99, 100, 159, 157, 87] and others have proposed ....

S. Janson, J. Montelius, The Design of the AKL/PS 0.0 Prototype Implementation of the Andorra Kernel Language, ESPRIT Deliverable, EP 2471 (PEPMA), Swedish Institute of Computer Science, 1992. --15, 81

....to simulate a PRAM. This ability is given by ports, an extension of the language for process communication, but in the spirit of concurrent constraint programming [6] Pure functional and logic languages do not have this ability. SICS is currently developing a programming environment for AKL [7]. Among our goals are to: 1) develop the necessary implementation technology for efficient (sequential and parallel) execution, 2) develop an execution model which allows different constraint systems to be easily incorporated, 3) offer good interoperability with conventional languages such as ....

Sverker Janson and Johan Montelius. The design of the AKL/PS 0.0 prototype implementation of the Andorra Kernel Language. ESPRIT deliverable, EP 2471 (PEPMA), Swedish Institute of Computer Science, 1992.

No context found.

Sverker Janson and Johan Montelius. The design of the AKL/PS 0.0 prototype implementation of the Andorra Kernel Language. ESPRIT deliverable, EP 2471( PEPMA), SICS, 1992.

....spawned and not the structure of the configuration. If two workers are executing in the same and node the last spawned will record its bindings in a private hash window. Research has been done on compile time analysis for stability detection [6] The sequential prototype implementation of AKL [3] uses a trailing scheme to implement the constraint stores. All bindings are made in place but external bindings are trailed. The implementation uses only a dirty bit to detect stable and nodes with the consequence that once an and node has become unstable it will be marked as unstable even if it ....

S. Janson and J. Montelius. The design of the AKL/PS 0.0 prototype implementation of the Andorra Kernel Language. ESPRIT deliverable, EP 2471 (PEPMA), Swedish Institute of Computer Science, 1992. 14

....AKL terms are use in a program to communicate between AKL processes they are often produced by one worker and later read by another worker. It is therefore very hard to minimize this source of cache misses. Acknowledgments The parallel implementation of AKL has been developed using the AGENTS 1. 0 [10] system as a starting point. Haruyasu Ueda did much of the implementation and analysis of the scheduler. Galal Atlam and Khayri Ali, designed and implemented the garbage collector [3] Thanks to Peter Fritzson at Linkoping University for access to a 20 processor SC2000 for the Penny timings. ....

Janson, S., and Montelius, J. The design of the AKL/PS 0.0 prototype implementation of the Andorra Kernel Language. ESPRIT deliverable, EP 2471 (PEPMA), Swedish Institute of Computer Science, 1992.

....been spawned and not the structure of the configuration. If two workers are executing in the same and box the last spawned will record its bindings in a private hash window. Research is being done on compile time analysis for stability detection [12] The sequential prototype implementation of AKL [10] uses a trailing scheme to implement the constraint stores. All bindings are made in place but external bindings are trailed. The implementation uses only a dirty bit to detect stable and boxes with the consequence that once an and box has become unstable it will be marked as unstable even if it ....

....is divided and distributed among workers. In WAM [16] the environment is used to represent the remaining goals in a body. It is also used in and parallel implementations of Prolog such as Prolog [7] and DDSWAM [15] The method has proved very efficient in the sequential implementations of AKL [10] and we believe that it has additional advantages in a parallel implementation. Apart from the advantages of lazy creation of goals it can keep the granularity of work more coarse. goals The sequence of goals in the guard is represented by a single linked list of insertion points. Each insertion ....

Sverker Janson and Johan Montelius. The design of the AKL/PS 0.0 prototype implementation of the Andorra Kernel Language. ESPRIT deliverable, EP 2471 (PEPMA), Swedish Institute of Computer Science, 1992.

....is however important that the execution model is close enough to a real implementation so that one can estimate the complexity of the primitive operations. The execution model is based on the execution model for the sequential AKL system that was used in the implementation of the AGENTS 1. 0 system [34]. The sequential execution model was designed to favor non suspending computations in order to be competitive with non concurrent languages. The model led to an efficient implementation that has, despite the complexity of the AKL computation model, only a small overhead compared to, for example, ....

....spawned and not the structure of the configuration. If two workers are executing in the same and node the last spawned will record its bindings in a private hash window. Research has been done on compile time analysis for stability detection [47] The sequential prototype implementation of AKL [34] uses a trailing scheme to implement the constraint stores. All bindings are made in place but external bindings are trailed. The implementation uses only a dirty bit to detect stable and nodes with the consequence that once an and node has become unstable it will be marked as unstable even if it ....

S. Janson and J. Montelius. The design of the AKL/PS 0.0 prototype implementation of the Andorra Kernel Language. ESPRIT deliverable, EP 2471 (PEPMA), Swedish Institute of Computer Science, 1992.

....future large parallel machines to exhibit more complex memory hierarchy behavior, in which case we would need to extend SimICS to maintain separate profiles for a larger family of memory hierarchy events. Acknowledgments The parallel implementation of AKL has been developed using the AGENTS 1. 0 [8] system as a starting point. Haruyasu Ueda did much of the implementation and analysis of the scheduler [13] Gallal Atlam and Kahyri Ali, designed and implemented the garbage collector [1, 2] Bengt Werner co designed much of the SimICS front end semantics. Anders Landin has been an enthusiastic ....

S. Janson and J. Montelius. The design of the AKL/PS 0.0 prototype implementation of the Andorra Kernel Language. ESPRIT deliverable, EP 2471 (PEPMA), SICS, 1992.

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