Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1531743.1531779acmconferencesArticle/Chapter ViewAbstractPublication PagescfConference Proceedingsconference-collections
research-article

Characterizing the performance penalties induced by irregular code using pointer structures and indirection arrays on the intel core 2 architecture

Published: 18 May 2009 Publication History

Abstract

Irregularity is one of the fundamental causes for performance degradation in applications. Both hardware and software have a hard time coping with irregular memory access patterns and irregularity in flow control. On the hardware side, execution is optimized for regular data accesses and irregular memory access streams cannot be predicted. On the software side, compilers are are not able to reason about memory locations and loop bounds. This prevents many optimizations to be applied. In this paper, we measure and characterize the impact of various facets of irregularity using SPARK00, a set of benchmarks that explicitly targets the measurement of the impact of irregularity, on one of themost commonly used architectures today, the Intel Core 2. The benchmarks consist of kernels that are based on pointers, a notorious cause of irregularity, kernels that use indirection arrays, and kernels that implement regular counterparts of some of the irregular kernels. By employing different data sets and different memory layouts these benchmarks are used to characterize architectural features.

References

[1]
W. Jalby, C. Lemuet, and X. Le Pasteur. WBTK: A new set of microbenchmarks to explore memory system performance for scientific computing. International Journal of High Performance Computing Applications, 18:211--224, 2004.
[2]
Magnus Karlsson, Fredrik Dahlgren, and Per Stenström. A prefetching technique for irregular accesses to linked data structures. pages 206--217, January 2000.
[3]
D. Levinthal. Analyzing and resolving multi-core non scaling on intel core 2 processors. http://www.devx.com/go-parallel/Link/34762.
[4]
Chi-Keung Luk and Todd C. Mowry. Compiler-based prefetching for recursive data structures. In ASPLOS-VII: Proceedings of the seventh international conference on Architectural support for programming languages and operating systems, pages 222--233, New York, NY, USA, 1996. ACM Press.
[5]
Harmen L.A. van der Spek, Erwin M. Bakker, and Harry A.G. Wijshoff. A compile/run-time environment for the automatic transformation of linked list data structures. International Journal of Parallel Programming, 36(6):592--623, December 2008.
[6]
Harmen L.A. van der Spek, Erwin M. Bakker, and Harry A.G. Wijshoff. SPARK00: A benchmark package for the compiler evaluation of irregular/sparse codes. In ASCI 2008: Fourteenth Annual Conference of the Advanced School for Computing and Imaging, 2008.

Cited By

View all
  • (2012)A Compilation Framework for the Automatic Restructuring of Pointer-Linked Data StructuresHigh-Performance Scientific Computing10.1007/978-1-4471-2437-5_4(97-122)Online publication date: 2012
  • (2010)SublimationProceedings of the 23rd international conference on Languages and compilers for parallel computing10.5555/1964536.1964544(106-120)Online publication date: 7-Oct-2010
  • (2010)How to unleash array optimizations on code using recursive data structuresProceedings of the 24th ACM International Conference on Supercomputing10.1145/1810085.1810123(275-284)Online publication date: 2-Jun-2010
  • Show More Cited By

Index Terms

  1. Characterizing the performance penalties induced by irregular code using pointer structures and indirection arrays on the intel core 2 architecture

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      CF '09: Proceedings of the 6th ACM conference on Computing frontiers
      May 2009
      238 pages
      ISBN:9781605584133
      DOI:10.1145/1531743
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 18 May 2009

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. benchmarking
      2. irregularity
      3. memory access
      4. spark00

      Qualifiers

      • Research-article

      Conference

      CF '09
      Sponsor:
      CF '09: Computing Frontiers Conference
      May 18 - 20, 2009
      Ischia, Italy

      Acceptance Rates

      CF '09 Paper Acceptance Rate 26 of 113 submissions, 23%;
      Overall Acceptance Rate 273 of 785 submissions, 35%

      Upcoming Conference

      CF '25

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)2
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 19 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2012)A Compilation Framework for the Automatic Restructuring of Pointer-Linked Data StructuresHigh-Performance Scientific Computing10.1007/978-1-4471-2437-5_4(97-122)Online publication date: 2012
      • (2010)SublimationProceedings of the 23rd international conference on Languages and compilers for parallel computing10.5555/1964536.1964544(106-120)Online publication date: 7-Oct-2010
      • (2010)How to unleash array optimizations on code using recursive data structuresProceedings of the 24th ACM International Conference on Supercomputing10.1145/1810085.1810123(275-284)Online publication date: 2-Jun-2010
      • (2009)Barcelona OpenMP Tasks SuiteProceedings of the 2009 International Conference on Parallel Processing10.1109/ICPP.2009.64(124-131)Online publication date: 22-Sep-2009
      • (2009)Automatic restructuring of linked data structuresProceedings of the 22nd international conference on Languages and Compilers for Parallel Computing10.1007/978-3-642-13374-9_18(263-277)Online publication date: 8-Oct-2009

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media