Electronic Proceedings Article
@InProceedings
Internet-Beitrag in Tagungsband, Workshop


Show entries of:

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

Action:

login to update

Options:








Author, Editor

Author(s):

Kettner, Lutz

dblp



Editor(s):

Lumsdaine, Andrew
Schupp, Sibylle

dblp
dblp

Not MPII Editor(s):

Lumsdaine, Andrew
Schupp, Sibylle

BibTeX cite key*:

Kettner2005Handle

Title, Conference

Title*:

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

Booktitle*:

Library-Centric Software Design (LCSD'05)

Event Address*:

San Diego, CA, USA

URL of the conference:

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

Event Date*:
(no longer used):


URL for downloading the paper:

http://lcsd05.cs.tamu.edu/papers/kettner.pdf

Event Start Date:

16 October 2005

Event End Date:

16 October 2005

Language:

English

Organization:


Publisher

Publisher's Name:

Department of Computer Science, Texas A&M University

Publisher's URL:

http://www.cs.tamu.edu/

Address*:

College Station, TX, USA

Type:


Vol, No, pp., Year

Series:


Volume:


Number:


Month:

October

Pages:

1-10



Sequence Number:


Year*:

2005

ISBN/ISSN:






Abstract, Links, ©

URL for Reference:


Note:


(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\texttt{++} 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



Tags, Categories, Keywords:


HyperLinks / References / URLs:


Copyright Message:


Personal Comments:


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

BibTeX Entry:
@INPROCEEDINGS{Kettner2005Handle,
AUTHOR = {Kettner, Lutz},
EDITOR = {Lumsdaine, Andrew and Schupp, Sibylle},
TITLE = {Reference Counting in Library Design---Optionally and with Union-Find Optimization},
BOOKTITLE = {Library-Centric Software Design (LCSD'05)},
PUBLISHER = {Department of Computer Science, Texas A&M University},
YEAR = {2005},
PAGES = {1--10},
ADDRESS = {San Diego, CA, USA},
MONTH = {October},
}


Entry last modified by Christine Kiesel, 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)
Lutz Kettner
Created
01/12/2006 11:31:58 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Lutz Kettner
Lutz Kettner
Edit Dates
06.07.2006 09:37:01
13.06.2006 10:54:41
20.04.2006 18:56:42
01/13/2006 11:03:02 AM
01/12/2006 11:31:58 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section