Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Kettner, Lutz

dblp



Editor(s):

Musser, David
Siek, Jeremy

dblp
dblp

Not MPII Editor(s):

Musser, David
Siek, Jeremy

BibTeX cite key*:

Kettner2006Handle

Title, Booktitle

Title*:

Reference Counting in Library Design---Optionally and with Union-Find Optimization

Booktitle*:

Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05

Event, URLs

URL of the conference:

http://lcsd05.cs.tamu.edu/

URL for downloading the paper:

http://www.cs.rpi.edu/research/pdf/06-12.pdf

Event Address*:

San Diego, CA, USA

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

16 October 2005

Event End Date:

16 October 2005

Publisher

Name*:

Rensselaer Polytechnic Institute, Computer Science Department

URL:

http://www.cs.rpi.edu/

Address*:

110 8th Street, Troy, NY 12180-3590

Type:


Vol, No, Year, pp.

Series:

Technical Report

Volume:

06-12

Number:


Month:


Pages:

34-43

Year*:

2006

VG Wort Pages:

58

ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Reference counting has been used and described in abundance. We
present novel ideas aimed at class implementations in library
design: (1) In library design, generic classes can have variable
size, such that an optimal decision for or against reference
counting is not possible. We \emph{postpone} this decision to the
place of class use. (2) In a context, where equality comparison for
the case of equality is expensive, e.g., for exact algebraic number
representations, we \emph{unify representations} whenever equality
was detected, thus effectively caching equality tests. We explain an
efficient implementation based on an union-find data structure. (3)
Reference counting and \emph{polymorphic class hierarchies} can be
combined reusing the pointer in the handle class for the
polymorphism. A policy-based generic C++ solution realizes all
ideas. \emph{Standard} allocators manage all dynamic memory.

URL for the Abstract:

http://www.mpi-inf.mpg.de/~kettner/pub/handle_design_lcsd_05_a.html



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Kettner2006Handle,
AUTHOR = {Kettner, Lutz},
EDITOR = {Musser, David and Siek, Jeremy},
TITLE = {Reference Counting in Library Design---Optionally and with Union-Find Optimization},
BOOKTITLE = {Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05},
PUBLISHER = {Rensselaer Polytechnic Institute, Computer Science Department},
YEAR = {2006},
VOLUME = {06-12},
PAGES = {34--43},
SERIES = {Technical Report},
ADDRESS = {San Diego, CA, USA},
}


Entry last modified by Regina Kraemer, 07/11/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
01/14/2007 08:53:23 PM
Revision
1.
0.


Editor
Regina Kraemer
Lutz Kettner


Edit Date
04/16/2007 09:58:07 AM
01/14/2007 08:53:24 PM


Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section