Data linkage dynamics with shedding

Details Data linkage dynamics with shedding Data linkage dynamics with shedding

2008-06-25

arxiv.org/abs/0806.4034v2

Fundamenta Informaticae, 103(1--4):31--52, 2010

Computer Science

Logic in Computer Science

22 pages; introduction improved

Scientific paper

10.3233/FI-2010-317

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.

Affiliated with

Also associated with

No associations

Rating

Data linkage dynamics with shedding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Data linkage dynamics with shedding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data linkage dynamics with shedding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-162372