Compile-Time Analysis and Specialization of Clocks in Concurrent Programs

被引:0
|
作者
Vasudevan, Nalini [1 ]
Tardieu, Olivier [2 ]
Dolby, Julian [2 ]
Edwards, Stephen A. [1 ]
机构
[1] Columbia Univ, Dept Comp Sci, New York, NY 10027 USA
[2] IBM TJ Watson Res Ctr, New York, NY USA
来源
关键词
Concurrency; Static Analysis; Synchronization; Clocks; X10; NuSMV;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Clocks are a mechanism for providing synchronization barriers in concurrent programming languages. They are usually implemented using primitive communication mechanisms and thus spare the programmer from reasoning about low-level implementation details such as remote procedure calls and error conditions. Clocks provide flexibility, but programs often use them in specific ways that do not require their full implementation. In this paper, we describe a tool that mitigates the overhead of general-purpose clocks by statically analyzing how programs use them and choosing optimized implementations when available. We tackle the clock implementation in the standard library of the X10 programming language-a parallel, distributed object-oriented language. We report our findings for a small set of analyses and benchmarks. Our tool only adds a few seconds to analysis time, making it practical to use as part of a compilation chain.
引用
收藏
页码:48 / +
页数:2
相关论文
共 50 条
  • [1] A COMPILE-TIME MEMORY-REUSE SCHEME FOR CONCURRENT LOGIC PROGRAMS
    DUVVURU, S
    SUNDARARAJAN, R
    TICK, E
    SASTRY, AVS
    HANSEN, L
    ZHONG, X
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 637 : 264 - 276
  • [2] COMPILE-TIME ANALYSIS OF OBJECT-ORIENTED PROGRAMS
    VITEK, J
    HORSPOOL, RN
    UHL, JS
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 641 : 236 - 250
  • [3] A FOUNDATION FOR ADVANCED COMPILE-TIME ANALYSIS OF LINDA PROGRAMS
    CARRIERO, N
    GELERNTER, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 589 : 389 - 404
  • [4] Efficient compile-time analysis of cache behaviour for programs with IF statements
    Vera, X
    Xue, JL
    [J]. FIFTH INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS, 2002, : 396 - 407
  • [5] COMPILE-TIME ESTIMATION OF COMMUNICATION COSTS OF PROGRAMS
    GUPTA, M
    BANERJEE, P
    [J]. JOURNAL OF PROGRAMMING LANGUAGES, 1994, 2 (03): : 191 - 225
  • [6] COMPILE-TIME PARTITIONING AND SCHEDULING OF PARALLEL PROGRAMS
    SARKAR, V
    HENNESSY, J
    [J]. SIGPLAN NOTICES, 1986, 21 (07): : 17 - 26
  • [7] Compile-time concurrent marking write barrier removal
    Nandivada, VK
    Detlefs, D
    [J]. CGO 2005: INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, 2005, : 37 - 48
  • [8] Specialization of Run-time Configuration Space at Compile-time: An Exploratory Study
    Ternava, Xhevahire
    Acher, Mathieu
    Combemale, Benoit
    [J]. 38TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2023, 2023, : 1459 - 1468
  • [9] Compile-time debugging of C programs working on trees
    Elgaard, J
    Moller, A
    Schwartzbach, MI
    [J]. PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2000, 1782 : 119 - 134
  • [10] Compile-time estimation of communication costs for data parallel programs
    Fahringer, T
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 39 (01) : 46 - 65