| P'eter Szeredi. Using dynamic predicates in an or-parallel Prolog system. In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 International Logic Programming Symposium, pages 355--371. MIT Press, October 1991. |
.... and parallel programs and finding performance bugs in them [53, 83, 33] Several or parallel applications for Aurora were studied in [92] and [98] The non synchronized dynamic database features have been exploited in the implementation of a general algorithm for solving optimization problems [131]. Three schedulers are currently operational. Two older schedulers were written [29, 25] but have not been updated to comply with the scheduler engine interface: The Manchester Scheduler. The Manchester scheduler [31] tries to match workers to available work as well as possible. The matching ....
P'eter Szeredi. Using dynamic predicates in an or-parallel Prolog system. In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 International Logic Programming Symposium, pages 355--371. MIT Press, October 1991.
....state how many symbols in the guess were in the right place (bulls) and how many were in a wrong place (cows) The decoder wins when he obtains as an answer to a guess L bulls and no cows. We have chosen such an example because it has been used by several authors in the field of logic programming [40,30,42,16,43]. Moreover, it is well suited for performance evaluation and comparisons, as will be shown in the subsequent sections. For instance, it is simple to change the size of the problem to solve, simplifying the study of the performance of the program. 5.1 The Prolog version The following Prolog ....
P. Szeredi. Using Dynamic Predicates in an Or-Parallel Prolog System. In V. Saraswat and K. Ueda, editors, Proc. Int. Symposium on Logic Programming, pages 355--371, SanDiego, USA, 1991. MIT Press, Cambridge.
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