Skip to main navigation Skip to search Skip to main content

Parallel garbage collection and graph reducer

  • Wen Yan Kuo*
  • , Sy Yen Kuo
  • *Corresponding author for this work
  • Fu Jen Catholic University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper we investigate the problem of parallel evaluation of functional programs. We have developed a novel approach to deal with sharing in graph reduction. Share nodes are introduced to explicitly handle sharing. By using share nodes, we have a garbage collection method that is on-the-fly (real time), parallel, distributed, and incremental. In our parallel graph reducer, copying can be done in parallel to make an exponential growth of program tree nodes. Since each node represents a simple operation, the growth of program trees is a natural distribution of computation work. Load balancing becomes very easy and can be done automatically. A simulator is implemented to simulate a tree structured parallel computer to run our graph reducer. Examples such as parallel matrix addition and multiplication are tested.

Original languageEnglish
Title of host publicationProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
Editors Anon
PublisherPubl by IEEE
Pages100-103
Number of pages4
ISBN (Print)081864222X
StatePublished - 1993
Externally publishedYes
EventProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: 01 12 1993 → 04 12 1993

Publication series

NameProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

Conference

ConferenceProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
CityDallas, TX, USA
Period01/12/93 → 04/12/93

Fingerprint

Dive into the research topics of 'Parallel garbage collection and graph reducer'. Together they form a unique fingerprint.

Cite this