An empirical evaluation of extendible arrays
conference contribution
posted on 2014-04-09, 10:40 authored by Stelios Joannou, Rajeev RamanWe 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.
History
Citation
Experimental Algorithms, 2011, 6630, pp. 447-458Author affiliation
/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer ScienceSource
10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, GreeceVersion
- AM (Accepted Manuscript)
Published in
Experimental AlgorithmsPublisher
Springer Verlag Berlinissn
0302-9743isbn
978-3-642-20661-0Copyright date
2011Available date
2014-04-09Publisher DOI
Publisher version
http://link.springer.com/book/10.1007/978-3-642-20662-7 http://www.springer.com/computer/theoretical+computer+science/book/978-3-642-20661-0 http://link.springer.com/chapter/10.1007/978-3-642-20662-7_38Notes
The final publication is available at link.springer.comEditors
Pardalos, PM;Rebennack, SBook series
Lecture Notes in Computer Science;Vol. 6630Temporal coverage: start date
2011-05-05Temporal coverage: end date
2011-05-07Language
enAdministrator link
Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC