School of Computing

A multi-processor shared memory architecture

Rafael D Lins

Technical Report 1-92*, University of Kent, Computing Laboratory, University of Kent, Canterbury, UK, March 1992.

Abstract

As an alternative to mark-scan algorithms Lins presents a shared memory architecture for parallel cyclic reference counting, based on the algorithm for cyclic reference counting with local and lazy mark-scan.

In this paper we generalise this architecture in such a way that multiple mutators and collectors share the same workspace. This generalisation is simple and keeps the properties of the one-mutator-one-collector architecture.

(to appear in Microprocessing & Microprogramming - Aug/92)

Download publication 44 kbytes

Bibtex Record

@techreport{102,
author = {Rafael D Lins},
title = {A Multi-Processor Shared Memory Architecture},
month = {March},
year = {1992},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1992/102},
    address = {University of Kent, Canterbury, UK},
    hensa_abstractfilename = {pub/misc/ukc.reports/comp.sci/abstracts/1-92},
    hensa_ftpaddress = {unix.hensa.ac.uk},
    hensa_reportfilename = {pub/misc/ukc.reports/comp.sci/reports/1-92.ps.Z},
    institution = {University of Kent, Computing Laboratory},
    number = {1-92*},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014