Integrating loop and data optimizations for locality within a constraint network based framework

Guilin Chen, Ozcan Ozturk, Mahmut Kandemir, Ibrahim Kolcu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

In the context of data-intensive embedded applications, there have been two complementary approaches to data locality problem: restructuring code and restructuring data layout. Conceivably, an integrated approach that combines these two can generate much better results than each individual approach. However, there is an inherent difficulty in optimizing both data layout and loop access pattern simultaneously under a unified setting. This difficulty occurs due to the fact that a given data structure can be accessed by different loop nests of the application, and each such loop nest can demand a different memory layout transformation for the said data structure. This results in a coupling problem, where the behaviors of two (or more) loop nests are coupled to each other as a result of data sharing between them. In this paper, we present a constraint network (CN) based formulation of the integrated loop-data optimization problem. We present two alternate solutions to the data locality problem with our CN based formulation and discuss the pros and cons of each scheme. The first solution is a pure backtracking based one, whereas the second one improves upon the first one by employing three additional optimizations, including backjumping.

Original languageEnglish (US)
Title of host publicationProceedings of theICCAD-2005
Subtitle of host publicationInternational Conference on Computer-Aided Design
Pages279-282
Number of pages4
Volume2005
DOIs
StatePublished - Dec 1 2005
EventICCAD-2005: IEEE/ACM International Conference on Computer-Aided Design, 2005 - San Jose, CA, United States
Duration: Nov 6 2005Nov 10 2005

Other

OtherICCAD-2005: IEEE/ACM International Conference on Computer-Aided Design, 2005
CountryUnited States
CitySan Jose, CA
Period11/6/0511/10/05

Fingerprint

Data structures
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

Chen, G., Ozturk, O., Kandemir, M., & Kolcu, I. (2005). Integrating loop and data optimizations for locality within a constraint network based framework. In Proceedings of theICCAD-2005: International Conference on Computer-Aided Design (Vol. 2005, pp. 279-282). [1560078] https://doi.org/10.1109/ICCAD.2005.1560078
Chen, Guilin ; Ozturk, Ozcan ; Kandemir, Mahmut ; Kolcu, Ibrahim. / Integrating loop and data optimizations for locality within a constraint network based framework. Proceedings of theICCAD-2005: International Conference on Computer-Aided Design. Vol. 2005 2005. pp. 279-282
@inproceedings{7f8af9dbd03b41c581eade9cb7ca2ad4,
title = "Integrating loop and data optimizations for locality within a constraint network based framework",
abstract = "In the context of data-intensive embedded applications, there have been two complementary approaches to data locality problem: restructuring code and restructuring data layout. Conceivably, an integrated approach that combines these two can generate much better results than each individual approach. However, there is an inherent difficulty in optimizing both data layout and loop access pattern simultaneously under a unified setting. This difficulty occurs due to the fact that a given data structure can be accessed by different loop nests of the application, and each such loop nest can demand a different memory layout transformation for the said data structure. This results in a coupling problem, where the behaviors of two (or more) loop nests are coupled to each other as a result of data sharing between them. In this paper, we present a constraint network (CN) based formulation of the integrated loop-data optimization problem. We present two alternate solutions to the data locality problem with our CN based formulation and discuss the pros and cons of each scheme. The first solution is a pure backtracking based one, whereas the second one improves upon the first one by employing three additional optimizations, including backjumping.",
author = "Guilin Chen and Ozcan Ozturk and Mahmut Kandemir and Ibrahim Kolcu",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ICCAD.2005.1560078",
language = "English (US)",
isbn = "078039254X",
volume = "2005",
pages = "279--282",
booktitle = "Proceedings of theICCAD-2005",

}

Chen, G, Ozturk, O, Kandemir, M & Kolcu, I 2005, Integrating loop and data optimizations for locality within a constraint network based framework. in Proceedings of theICCAD-2005: International Conference on Computer-Aided Design. vol. 2005, 1560078, pp. 279-282, ICCAD-2005: IEEE/ACM International Conference on Computer-Aided Design, 2005, San Jose, CA, United States, 11/6/05. https://doi.org/10.1109/ICCAD.2005.1560078

Integrating loop and data optimizations for locality within a constraint network based framework. / Chen, Guilin; Ozturk, Ozcan; Kandemir, Mahmut; Kolcu, Ibrahim.

Proceedings of theICCAD-2005: International Conference on Computer-Aided Design. Vol. 2005 2005. p. 279-282 1560078.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Integrating loop and data optimizations for locality within a constraint network based framework

AU - Chen, Guilin

AU - Ozturk, Ozcan

AU - Kandemir, Mahmut

AU - Kolcu, Ibrahim

PY - 2005/12/1

Y1 - 2005/12/1

N2 - In the context of data-intensive embedded applications, there have been two complementary approaches to data locality problem: restructuring code and restructuring data layout. Conceivably, an integrated approach that combines these two can generate much better results than each individual approach. However, there is an inherent difficulty in optimizing both data layout and loop access pattern simultaneously under a unified setting. This difficulty occurs due to the fact that a given data structure can be accessed by different loop nests of the application, and each such loop nest can demand a different memory layout transformation for the said data structure. This results in a coupling problem, where the behaviors of two (or more) loop nests are coupled to each other as a result of data sharing between them. In this paper, we present a constraint network (CN) based formulation of the integrated loop-data optimization problem. We present two alternate solutions to the data locality problem with our CN based formulation and discuss the pros and cons of each scheme. The first solution is a pure backtracking based one, whereas the second one improves upon the first one by employing three additional optimizations, including backjumping.

AB - In the context of data-intensive embedded applications, there have been two complementary approaches to data locality problem: restructuring code and restructuring data layout. Conceivably, an integrated approach that combines these two can generate much better results than each individual approach. However, there is an inherent difficulty in optimizing both data layout and loop access pattern simultaneously under a unified setting. This difficulty occurs due to the fact that a given data structure can be accessed by different loop nests of the application, and each such loop nest can demand a different memory layout transformation for the said data structure. This results in a coupling problem, where the behaviors of two (or more) loop nests are coupled to each other as a result of data sharing between them. In this paper, we present a constraint network (CN) based formulation of the integrated loop-data optimization problem. We present two alternate solutions to the data locality problem with our CN based formulation and discuss the pros and cons of each scheme. The first solution is a pure backtracking based one, whereas the second one improves upon the first one by employing three additional optimizations, including backjumping.

UR - http://www.scopus.com/inward/record.url?scp=33751417845&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33751417845&partnerID=8YFLogxK

U2 - 10.1109/ICCAD.2005.1560078

DO - 10.1109/ICCAD.2005.1560078

M3 - Conference contribution

SN - 078039254X

SN - 9780780392540

VL - 2005

SP - 279

EP - 282

BT - Proceedings of theICCAD-2005

ER -

Chen G, Ozturk O, Kandemir M, Kolcu I. Integrating loop and data optimizations for locality within a constraint network based framework. In Proceedings of theICCAD-2005: International Conference on Computer-Aided Design. Vol. 2005. 2005. p. 279-282. 1560078 https://doi.org/10.1109/ICCAD.2005.1560078