A parallel copying garbage collection scheme for shared-memory multiprocessors

Ali, Khayri A. M.

doi:10.1007/bf03037218

Cited by 4 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…-the proposal by [Ali 1995], which provides a parallel version of a copying garbage collector, refined to guarantee avoidance of unnecessary copying (e.g., copy the same data twice) and load balancing between workers during garbage collection; -the proposal by [Bevemyr 1995], which extends the work by Ali into a generational copying garbage collector (objects are divided in generations, where newer generations contains objects more recently created; the new generation is garbage collected more often then the old one).…”

Section: Memory Managementmentioning

confidence: 99%

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

115

View full text Add to dashboard Cite

Since the early days of logic programming, researchers in the field realized the potential for exploitation of parallelism present in the execution of logic programs. Their high-level nature, the presence of non-determinism, and their referential transparency, among other characteristics, make logic programs interesting candidates for obtaining speedups through parallel execution. At the same time, the fact that the typical applications of logic programming frequently involve irregular computations, make heavy use of dynamic data structures with logical variables, and involve search and speculation, makes the techniques used in the corresponding parallelizing compilers and run-time systems potentially interesting even outside the field. The objective of this paper is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in the field. Focus is mostly given to the challenges emerging from the parallel execution of Prolog programs. The paper describes the major techniques used for shared memory implementation of Or-parallelism, Andparallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualization.

show abstract

Section: Memory Managementmentioning

confidence: 99%

Parallel execution of prolog programs

Gupta

Pontelli

Ali

et al. 2001

ACM Trans. Program. Lang. Syst.

115

View full text Add to dashboard Cite

show abstract

“…This results in a lower performance compared to execution-driven or host-supported systems|namely a slow-down of approximately 25 ; 100 per simulated processor compared to the real execution. 1 We also need to deal with a signicantly more complex software engineering problem in building the simulator. This e ect is, of course, di cult to quantify, but it is signi cant.…”

Section: The Simics Simulatormentioning

confidence: 99%