The Computer Games Journal

, Volume 6, Issue 3, pp 153–169 | Cite as

The Advanced “Jump-Counting” Skipfield Pattern

A CPU Cache-Efficient Replacement for Boolean Skipfields
  • Matthew BentleyEmail author


This document describes a numeric pattern for indicating skippable items in data sequences and methods to adjust this pattern when the skippable status for an individual item changes. The pattern provides up to 525% faster iteration speeds (dependent on the ratio of skipped to unskipped items) than an equivalent boolean skipfield on a modern pipelined CPU. This is due to a lack of branching code, reduced number of skipfield reads and a reduced instruction count during iteration, when compared with the boolean pattern. This efficiency is accomplished without significantly impacting the duration taken to change an item’s skippable status. The pattern has significant application in generalized computer science but specifically in the implementation of data containers.


Boolean Erasure field Skipfield Cache Efficiency Containers Performance 



I would like to thank both Dr. Gisela Klette of The Auckland University of Technology and Dr. Robert Hurley for their invaluable advice and support in both the critiquing and editing of this document. Also thanks for Steven Cantwell for his advice and Baptiste Wicht for his assistance in building useful benchmarks.


  1. Babka, V., Marek, L., & Tuma, P. (2009). When misses differ: Investigating impact of cache misses on observed performance. In 15th international conference on Parallel and distributed systems (ICPADS), 2009 (pp. 112–119). IEEE.Google Scholar
  2. Bentley, M. R. (2017). Introduction of std::colony to the standard library.
  3. Bulka, D., & Mayhew, D. (2000). Efficient C++: Performance programming techniques. Boston: Addison-Wesley.Google Scholar
  4. Garcia, J. D., & Stroustrup, B. (2015). Improving performance and maintainability through refactoring in C++ 11.
  5. Goldthwaite, L. (2006). Technical report on C++ performance. ISO/IEC PDTR, 18015.Google Scholar
  6. Gregoire, M. (2014). Professional C++. Hoboken: Wiley.Google Scholar
  7. Guyot, A., Hochet, B., & Muller, J. M. (1987). A way to build efficient carry-skip adders. IEEE Transactions on Computers, 36(10), 1144–1152.CrossRefzbMATHGoogle Scholar
  8. Kejariwal, A., Veidenbaum, A. V., Nicolau, A., Tian, X., Girkar, M., Saito, H., et al. (2008). Comparative architectural characterization of SPEC CPU2000 and CPU2006 benchmarks on the intel Core 2 Duo processor. In Embedded computer systems: Architectures, modeling, and simulation, SAMOS. Center for embedded computer systems, University of California: Irvine.Google Scholar
  9. Kowarschik, M., & Weiß, C. (2003). An overview of cache optimization techniques and cache-aware numerical algorithms. In U. Meyer, P. Sanders, & J. Sibeyn (Eds.), Algorithms for memory hierarchies: Advanced lectures. Berlin: Springer.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Ronin InstituteMontclairUSA

Personalised recommendations