Data linkage dynamics with shedding

TL;DR

This paper introduces shedding in data linkage dynamics, a model where unused links are automatically removed to optimize garbage collection, enhancing resource management in programming with dynamic data structures.

Contribution

It presents shedding as a novel mechanism that complements garbage collection by proactively removing unused links in data linkage dynamics.

Findings

Shedding maximizes garbage collection effectiveness.

Automatic removal of unused links improves resource management.

Shedding enhances the efficiency of dynamic data structures.

Abstract

We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage collection. With shedding, each time a link to a data object is updated by a program, it is determined whether or not the link will possibly be used once again by the program, and if not the link is automatically removed. Thus, everything is made garbage as soon as it can be viewed as garbage. By that, the effectiveness of garbage collection becomes maximal.