Performance of C++ bit-vector implementations

V. Pieterse; D.G. Kourie; L.G.W.A. Cleophas; B.W. Watson

doi:10.1145/1899503.1899530

Performance of C++ bit-vector implementations

V. Pieterse, D.G. Kourie, L.G.W.A. Cleophas, B.W. Watson

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

6 Citaten (Scopus)

Samenvatting

This paper describes an experimental study to compare the performance of various dynamically resizable bit-vector implementations for the C++ programming language. We compare the std::vector from the Standard Template Library (STL), boost::dynamic_bitset from Boost, Qt::QBitArray from QT Software, and BitMagic's bm::bvector from the STL with these because it is a dynamically resizable vector implementation that has been suggested to be an acceptable alternative for std::vector. We describe the test data and the methods that were applied to measure memory use and processing time. This lays a foundation for comparing other parts of the different C++ libraries. The results are presented and discussed in terms of the differences in the implementations of these data structures. Although the results reported in this article is specific to the mentioned C++ libraries, the techniques used to measure and compare the performance of the different libraries go beyond C++ bit-vectors and may be used more generally.

Originele taal-2	Engels
Titel	Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT 2010, Bela Bela (Warm Baths), South Africa, October 11-13, 2010)
Uitgeverij	Association for Computing Machinery, Inc
Pagina's	242-250
ISBN van geprinte versie	978-1-60558-950-3
DOI's	https://doi.org/10.1145/1899503.1899530
Status	Gepubliceerd - 2010

Toegang tot document

10.1145/1899503.1899530

Citeer dit

Pieterse, V., Kourie, D. G., Cleophas, L. G. W. A., & Watson, B. W. (2010). Performance of C++ bit-vector implementations. In Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT 2010, Bela Bela (Warm Baths), South Africa, October 11-13, 2010) (blz. 242-250). Association for Computing Machinery, Inc. https://doi.org/10.1145/1899503.1899530

@inproceedings{6141905889b34d1e812df20445f1b349,

title = "Performance of C++ bit-vector implementations",

abstract = "This paper describes an experimental study to compare the performance of various dynamically resizable bit-vector implementations for the C++ programming language. We compare the std::vector from the Standard Template Library (STL), boost::dynamic_bitset from Boost, Qt::QBitArray from QT Software, and BitMagic's bm::bvector from the STL with these because it is a dynamically resizable vector implementation that has been suggested to be an acceptable alternative for std::vector. We describe the test data and the methods that were applied to measure memory use and processing time. This lays a foundation for comparing other parts of the different C++ libraries. The results are presented and discussed in terms of the differences in the implementations of these data structures. Although the results reported in this article is specific to the mentioned C++ libraries, the techniques used to measure and compare the performance of the different libraries go beyond C++ bit-vectors and may be used more generally.",

author = "V. Pieterse and D.G. Kourie and L.G.W.A. Cleophas and B.W. Watson",

year = "2010",

doi = "10.1145/1899503.1899530",

language = "English",

isbn = "978-1-60558-950-3",

pages = "242--250",

booktitle = "Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT 2010, Bela Bela (Warm Baths), South Africa, October 11-13, 2010)",

publisher = "Association for Computing Machinery, Inc",

address = "United States",

}

Pieterse, V, Kourie, DG, Cleophas, LGWA & Watson, BW 2010, Performance of C++ bit-vector implementations. in Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT 2010, Bela Bela (Warm Baths), South Africa, October 11-13, 2010). Association for Computing Machinery, Inc, blz. 242-250. https://doi.org/10.1145/1899503.1899530

Performance of C++ bit-vector implementations. / Pieterse, V.; Kourie, D.G.; Cleophas, L.G.W.A. et al.
Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT 2010, Bela Bela (Warm Baths), South Africa, October 11-13, 2010). Association for Computing Machinery, Inc, 2010. blz. 242-250.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

TY - GEN

T1 - Performance of C++ bit-vector implementations

AU - Pieterse, V.

AU - Kourie, D.G.

AU - Cleophas, L.G.W.A.

AU - Watson, B.W.

PY - 2010

Y1 - 2010

N2 - This paper describes an experimental study to compare the performance of various dynamically resizable bit-vector implementations for the C++ programming language. We compare the std::vector from the Standard Template Library (STL), boost::dynamic_bitset from Boost, Qt::QBitArray from QT Software, and BitMagic's bm::bvector from the STL with these because it is a dynamically resizable vector implementation that has been suggested to be an acceptable alternative for std::vector. We describe the test data and the methods that were applied to measure memory use and processing time. This lays a foundation for comparing other parts of the different C++ libraries. The results are presented and discussed in terms of the differences in the implementations of these data structures. Although the results reported in this article is specific to the mentioned C++ libraries, the techniques used to measure and compare the performance of the different libraries go beyond C++ bit-vectors and may be used more generally.

AB - This paper describes an experimental study to compare the performance of various dynamically resizable bit-vector implementations for the C++ programming language. We compare the std::vector from the Standard Template Library (STL), boost::dynamic_bitset from Boost, Qt::QBitArray from QT Software, and BitMagic's bm::bvector from the STL with these because it is a dynamically resizable vector implementation that has been suggested to be an acceptable alternative for std::vector. We describe the test data and the methods that were applied to measure memory use and processing time. This lays a foundation for comparing other parts of the different C++ libraries. The results are presented and discussed in terms of the differences in the implementations of these data structures. Although the results reported in this article is specific to the mentioned C++ libraries, the techniques used to measure and compare the performance of the different libraries go beyond C++ bit-vectors and may be used more generally.

U2 - 10.1145/1899503.1899530

DO - 10.1145/1899503.1899530

M3 - Conference contribution

SN - 978-1-60558-950-3

SP - 242

EP - 250

BT - Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT 2010, Bela Bela (Warm Baths), South Africa, October 11-13, 2010)

PB - Association for Computing Machinery, Inc

ER -

Pieterse V, Kourie DG, Cleophas LGWA, Watson BW. Performance of C++ bit-vector implementations. In Proceedings of the 2010 Annual Conference of the South African Institute of Computer Scientists and Information Technologists (SAICSIT 2010, Bela Bela (Warm Baths), South Africa, October 11-13, 2010). Association for Computing Machinery, Inc. 2010. blz. 242-250 doi: 10.1145/1899503.1899530

Performance of C++ bit-vector implementations

Samenvatting

Toegang tot document

Vingerafdruk

Citeer dit