Compilation of Vector Statements of C[] Language for Architectures with Multilevel Memory Hierarchy

被引：0
|
作者：
A. Ya. Kalinov
A. L. Lastovetsky
I. N. Ledovskikh
M. A. Posypkin
机构：
[1] Russian Academy of Sciences,Institute of System Programming
来源：
Programming and Computer Software | 2001年 / 27卷
关键词：
Operating System; Artificial Intelligence; Vector Statement; Wide Class; Reduction Statement;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In the paper, the use of tiling for compilation of reduction statements in the C[] language is considered. A class of statements is distinguished for which the tiling transformation is proven to be correct and a scheme of their transformation to a sequence of reduction statements of a wide class is given. On the basis of a cache interference model, formulas are obtained that make it possible to accurately compute tiling parameters. It is shown that the code for reduction statements generated by the C[] compiler is comparable with (and, often, even better than) specially designed subroutines in terms of the efficiency.
引用
收藏
页码：111 / 122
页数：11
相关论文
共 50 条
  • [1] Compilation of vector statements of C language for architectures with multilevel memory hierarchy
    Kalinov, A.Ya.
    Lastovetskij, A.L.
    Ledovskikh, I.N.
    Posypkin, M.A.
    [J]. Programmirovanie, 2001, 27 (03): : 3 - 19
  • [2] Compilation of vector statements of C[] language for architectures with multilevel memory hierarchy
    Kalinov, AY
    Lastovetsky, AL
    Ledovskikh, IN
    Posypkin, MA
    [J]. PROGRAMMING AND COMPUTER SOFTWARE, 2001, 27 (03) : 111 - 122
  • [3] ON THE COMPILATION OF A LANGUAGE FOR GENERAL CONCURRENT TARGET ARCHITECTURES
    Bernard, Thomas A. M.
    Grelck, Clemens
    Jesshope, Chris R.
    [J]. PARALLEL PROCESSING LETTERS, 2010, 20 (01) : 51 - 69
  • [4] Efficient tree layout in a multilevel memory hierarchy
    Bender, MA
    Demaine, ED
    Farach-Colton, M
    [J]. ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 165 - 173
  • [5] Impact of the memory hierarchy on shared memory architectures in multicore programming models
    Badia, Rosa M.
    Perez, Josep M.
    Ayguade, Eduard
    Labarta, Jesus
    [J]. PROCEEDINGS OF THE PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, 2009, : 437 - +
  • [6] Memory Access Optimization in Compilation for Coarse-Grained Reconfigurable Architectures
    Kim, Yongjoo
    Lee, Jongeun
    Shrivastava, Aviral
    Paek, Yunheung
    [J]. ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2011, 16 (04)
  • [7] EFFICIENT ARCHITECTURES FOR DATA ACCESS IN A SHARED MEMORY-HIERARCHY
    PADMANABHAN, K
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 11 (04) : 314 - 327
  • [8] Automatically Exploiting the Memory Hierarchy of GPUs through Just-in-Time Compilation
    Papadimitriou, Michail
    Fumero, Juan
    Stratikopoulos, Athanasios
    Kotselidis, Christos
    [J]. PROCEEDINGS OF THE 17TH ACM SIGPLAN/SIGOPS INTERNATIONAL CONFERENCE ON VIRTUAL EXECUTION ENVIRONMENTS (VEE '21), 2021, : 57 - 70
  • [9] The compilation of SL, a set-based logic language for generic parallel architectures
    Succi, G
    Uhrik, C
    [J]. JOURNAL OF PROGRAMMING LANGUAGES, 1997, 5 (01): : 37 - 84
  • [10] Verified Compilation for Shared-Memory C
    Beringer, Lennart
    Stewart, Gordon
    Dockins, Robert
    Appel, Andrew W.
    [J]. PROGRAMMING LANGUAGES AND SYSTEMS, 2014, 8410 : 107 - 127
12345