Home // ICSEA 2014, The Ninth International Conference on Software Engineering Advances // View article
Authors:
Michael Bogner
Andreas Hofer
Maria Hronek
Franz Wiesinger
Keywords: performance patterns; sequence container; run-time complexity; modern microprocessors;
Abstract:
Classic data structures, such as vectors and lists are used for storage and organization of data. Certain basic operations have a specified run-time behavior, which is essentially influenced by the choice of the data structure. However, further advances in the development of modern microprocessors have achieved sophisticated optimizations in hardware. These optimizations affect the run-time behavior of certain operations, which further affects the choice of data structures. This paper presents the results of our research activities focused on the impacts of these changed conditions. We selected various algorithms and operations frequently used in todays software development. Remarkable differences and modified characteristics will be discussed. The performances of both selected data structures, namely vector and list, have been determined empirically using the programming language C++. The results are interpreted and discussed in terms of run-time complexity and modern processor development.
Pages: 615 to 621
Copyright: Copyright (c) IARIA, 2014
Publication date: October 12, 2014
Published in: conference
ISSN: 2308-4235
ISBN: 978-1-61208-367-4
Location: Nice, France
Dates: from October 12, 2014 to October 16, 2014