A garbage collection algorithm for shared memory parallel processors

Journal Article · Wed Nov 30 23:00:00 EST 1988 · International Journal of Parallel Programming; (USA)

DOI:https://doi.org/10.1007/BF01407816· OSTI ID:6036933

Crammond, J ^[1]

---

1. Imperial College, London (England)

This paper describes a technique for adapting the Morris sliding garbage collection algorithm to execute on parallel machines with shared memory. The algorithm is described within the framework of an implementation of the parallel logic language Parlog. However, the algorithm is a general one and can easily be adapted to parallel Prolog systems and to other languages. The performance of the algorithm executing a few simple Parlog benchmarks is analyzed. Finally, it is shown how the technique for parallelizing the sequential algorithm can be adapted for a semi-space copying algorithm.

• OSTI ID: 6036933
• Journal Information: International Journal of Parallel Programming; (USA), Journal Name: International Journal of Parallel Programming; (USA) Vol. 17:6; ISSN IJPPE; ISSN 0885-7458
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMPUTER ARCHITECTURE
COMPUTER CODES
EFFICIENCY
IMPLEMENTATION
MATHEMATICAL LOGIC
MATHEMATICS
MEMORY DEVICES
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE
PROGRAMMING
PROGRAMMING LANGUAGES
PROLOG
STATISTICS