NDLI: Recycling trash in cache

Content Provider	ACM Digital Library
Author	Scheid, Paul T. Kavi, Krishna M. Spilo, Ari J. Shidal, Jonathan Cytron, Ron K.
Abstract	The disparity between processing and storage speeds can be bridged in part by reducing the traffic into and out of the slower memory components. Some recent studies reduce such traffic by determining dead data in cache, showing that a significant fraction of writes can be squashed before they make the trip toward slower memory. In this paper, we examine a technique for eliminating traffic in the other direction, specifically the traffic induced by dynamic storage allocation. We consider recycling dead storage in cache to satisfy a program's storage-allocation requests. We first evaluate the potential for recycling under favorable circumstances, where the associated logic can run at full speed with no impact on the cache's normal behavior. We then consider a more practical implementation, in which the associated logic executes independently from the cache's critical path. Here, the cache's performance is unfettered by recycling, but the operations necessary to determine dead storage and recycle such storage execute as time is available. Finally, we present the design and analysis of a hardware implementation that scales well with cache size without sacrificing too much performance.
Starting Page	118
Ending Page	130
Page Count	13
File Format	PDF
ISSN	03621340 15581160
DOI	10.1145/2887746.2754183
Journal	ACM SIGPLAN Notices (SIGP)
Volume Number	50
Issue Number	11
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1983-05-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Garbage collection Reference counting Cache
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Recycling trash in cache

The space cost of lazy reference counting

Fast conservative garbage collection

A simple and efficient algorithm for cycle collection

Ulterior reference counting:fast garbage collection without a long wait

Down for the count? Getting reference counting back in the ring

A unified theory of garbage collection

Using generational garbage collection to implement cache-conscious data placement

Static and dynamic partitioning of pointers as links and threads

Recycling trash in cache

Similar Documents

Recycling trash in cache

The space cost of lazy reference counting

Fast conservative garbage collection

A simple and efficient algorithm for cycle collection

Ulterior reference counting:fast garbage collection without a long wait

Down for the count? Getting reference counting back in the ring

A unified theory of garbage collection

Using generational garbage collection to implement cache-conscious data placement

Static and dynamic partitioning of pointers as links and threads

Recycling trash in cache