Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient approach to cyclic reference counting based on a coarse-grained search

From MaRDI portal
Publication:1944025
Jump to:navigation, search

DOI10.1016/j.ipl.2010.10.004zbMath1260.68126OpenAlexW2022852806MaRDI QIDQ1944025

Chin-Yang Lin, Ting-Wei Hou

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.004


zbMATH Keywords

algorithmscyclic data structuregarbage collectionreference counting


Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Data structures (68P05)



Uses Software

  • GC
  • SPECjvm98


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Cyclic reference counting with local mark-scan
  • Cyclic reference counting with lazy mark-scan
  • Generational cyclic reference counting
  • An efficient algorithm for cyclic reference counting.
  • Recursive functions of symbolic expressions and their computation by machine, Part I
  • An efficient, incremental, automatic garbage collector


This page was built for publication: An efficient approach to cyclic reference counting based on a coarse-grained search

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1944025&oldid=14380895"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki