Evaluation of parallel copying garbage collection on a shared-memory multiprocessor

A parallel copying garbage collection algorithm for symbolic languages executing on shared-memory multiprocessors is proposed. The algorithm is an extension of Baker's sequential algorithm with a novel method of heap allocation to prevent fragmentation and facilitate load distribution during ga...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on parallel and distributed systems Ročník 4; číslo 9; s. 1030 - 1040
Hlavní autori: Imai, A., Tick, E.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Los Alamitos, CA IEEE 01.09.1993
IEEE Computer Society
Predmet:
Algorithm design and analysis
Applied sciences
Clustering algorithms
Computer science
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Logic programming
Logic testing
Parallel algorithms
Performance analysis
Production
Software
Storage automation
System performance
Garbage collection
Load distribution
Parallelism
Logical programming
Distributed system
Shared-memory multiprocessor
Shared memory
Fragmentation
ISSN:1045-9219
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A parallel copying garbage collection algorithm for symbolic languages executing on shared-memory multiprocessors is proposed. The algorithm is an extension of Baker's sequential algorithm with a novel method of heap allocation to prevent fragmentation and facilitate load distribution during garbage collection. An implementation of the algorithm within a concurrent logic programming system, VPIM, has been evaluated and the results, for a wide selection of benchmarks, are analyzed here. The authors show 1) how much the algorithm reduces the contention for critical sections during garbage collection, 2) how well the load-balancing strategy works and its expected overheads, and 3) the expected speedup achieved by the algorithm.< >
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1045-9219
DOI:10.1109/71.243529