Peter Tinker. Performance and pragmatics of an OR-parallel logic programming system. International Journal of Parallel Programming, ?, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... only after visiting more nodes thus giving sublinear speedup) This type of behavior is common for a variety of parallel search algorithms, and is referred to as speedup anomaly [18, 19] The superlinear speedup in isolated executions of parallel DFS has been reported by many researchers [12, 25, 22, 7, 33, 20]. It may appear that on the average the speedup would be either linear or sublinear; otherwise, even parallel DFS executed on sequential processor via time slicing would perform better than sequential DFS. This paper considers the average case speedup anomalies in parallel DFS algorithms that are ....

Peter Tinker. Performance and pragmatics of an OR-parallel logic programming system. International Journal of Parallel Programming, ?, 1988.

....As with Janakiram s scheme[8] the work done by each processor in this scheme can be executed in parallel using our work distribution method to give additional speedup. Most systems for exploiting OR parallelism in logic programs are essentially implementations of parallel depth first search [9, 17, 28, 5, 30, 2]. These systems also use dynamic work sharing to divide the work evenly among processors. A major problem in such systems is that the size of the stack grows very rapidly for many logic programs, which makes stack splitting rather expansive. Hence much of the current research in such systems is on ....

Peter Tinker. Performance and pragmatics of an OR-parallel logic programming system. International Journal of Parallel Programming, ?, 1988.

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