Cover Image
QR Code

Refactoring for Data Locality.

The article discusses refactoring software programs to improve execution speed with respect to caching and data locality. Topics include cache misses due to multiple intervening cache use, the computer code responsible for such “long distance” reusing of data, how the reuse distance can be shortened...

Full description

Published in:Computer (00189162) Vol. 42; no. 2; pp. 62 - 72
Main Authors: Beyls, Kristof, D'Hollander, Erik H.
Format: Article
Published: IEEE Feb2009
Subjects:
Software engineering
Cache memory
Computer programming
Program transformation
Computer storage devices
Algorithms
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=36536306&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 36536306
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00189162
        PUT
      jtl: Computer (00189162)
      issn: 00189162
      maglogo: N
    pubinfo:
      dt: Feb2009
      vid: 42
      iid: 2
      pid: 13605
      pub: IEEE
    artinfo:
      ui:
        36536306
        10.1109/MC.2009.57
      ppf: 62
      ppct: 10
      formats:
      tig:
        atl: Refactoring for Data Locality.
      aug:
        au:
          Beyls, Kristof
          D'Hollander, Erik H.
        affil:
          Software engineer at Tele Atlas.
          Professor, Department of Electronics and Information Systems at Ghent University, Belgium.
      su:
        Software engineering
        Cache memory
        Computer programming
        Program transformation
        Computer storage devices
        Algorithms
      sug:
        subj:
          Software engineering
          Cache memory
          Computer programming
          Program transformation
          Computer storage devices
          Algorithms
      ab: The article discusses refactoring software programs to improve execution speed with respect to caching and data locality. Topics include cache misses due to multiple intervening cache use, the computer code responsible for such “long distance” reusing of data, how the reuse distance can be shortened, and using suggestions for locality optimizations (SLO) for program optimization. Case studies are discussed that involve the use of SLO to examine seven SPEC2000 benchmark programs. The authors regard SLO as having significant value in optimizing data-intensive applications.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2009
    holdings:
      @attributes:
        islocal: N