Please use this identifier to cite or link to this item:
Title: An empirical evaluation of extendible arrays
Authors: Joannou, Stelios
Raman, Rajeev
First Published: May-2011
Presented at: 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece
Start Date: 5-May-2011
End Date: 7-May-2011
Publisher: Springer Verlag Berlin
Citation: Experimental Algorithms, 2011, 6630, pp. 447-458
Abstract: We study the performance of several alternatives for implementing extendible arrays, which allow random access to elements stored in them, whilst allowing the arrays to be grown and shrunk. The study not only looks at the basic operations of grow/shrink and accessing data, but also the effects of memory fragmentation on performance.
Series/Report no.: Lecture Notes in Computer Science;Vol. 6630
DOI Link: 10.1007/978-3-642-20662-7_38
ISSN: 0302-9743
ISBN: 978-3-642-20661-0
Version: Post-print
Status: Peer-reviewed
Type: Conference Paper
Rights: Copyright © 2011, Springer-Verlag Berlin Heidelberg. Deposited with reference to the publisher’s open access archiving policy.
Description: The final publication is available at
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
092_joannou.pdfPost-review (final submitted)324.13 kBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.