By Topic

Efficient parallel global garbage collection on massively parallel computers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kamada, T. ; Tokyo Univ., Japan ; Matsuoka, S. ; Yonezawa, A.

On distributed-memory high-performance massively parallel computers (MPPs) where processors are interconnected by an asynchronous network, efficient garbage collection (GC) becomes difficult, due to inter-node references and references within pending, unprocessed messages. Our parallel global GC algorithm (1) takes advantage of reference locality, (2) efficiently traverses references over nodes, (3) admits a minimum pause time for the ongoing computations, and (4) has been shown to scale up to 1024-node MPPs. The algorithm employs a global weight counting scheme to substantially reduce message traffic. Two methods for confirming the arrival of pending messages are used: one counts the number of messages and the other uses network `bulldozing'. Performance evaluations in actual implementations on a multicomputer with from 32 to 1024 nodes, the Fujitsu AP1000, reveals various favorable properties of the algorithm

Published in:

Supercomputing '94., Proceedings

Date of Conference:

14-18 Nov 1994