Inferring Ownership Transfer for Efficient Message Passing

被引:15
|
作者
Negara, Stas [1 ]
Karmani, Rajesh K. [1 ]
Agha, Gul [1 ]
机构
[1] Univ Illinois, Urbana, IL 61801 USA
关键词
Actors; Message Passing; Ownership Transfer; Static Analysis; Languages; Performance;
D O I
10.1145/2038037.1941566
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
One of the more popular paradigms for concurrent programming is the Actor model of message passing; it has been adopted in one form or another by a number of languages and frameworks. By avoiding a shared local state and instead relying on message passing, the Actor model facilitates modular programming. An important challenge for message passing languages is to transmit messages efficiently. This requires retaining the pass-by-value semantics of messages while avoiding making a deep copy on sequential or shared memory multicore processors. A key observation is that many messages have an ownership transfer semantics; such messages can be sent efficiently using pointers without introducing shared state between concurrent objects. We propose a conservative static analysis algorithm which infers if the content of a message is compatible with an ownership transfer semantics. Our tool, called SOTER (for Safe Ownership Transfer enablER(1)) transforms the program to avoid the cost of copying the contents of a message whenever it can infer the content obeys the ownership transfer semantics. Experiments using a range of programs suggest that our conservative static analysis method is usually able to infer ownership transfer. Performance results demonstrate that the transformed programs execute up to an order of magnitude faster than the original programs.
引用
收藏
页码:81 / 90
页数:10
相关论文
共 50 条
  • [1] Inferring the origin of an epidemic with a dynamic message-passing algorithm
    Lokhov, Andrey Y.
    Mezard, Marc
    Ohta, Hiroki
    Zdeborova, Lenka
    [J]. PHYSICAL REVIEW E, 2014, 90 (01):
  • [2] Efficient message passing on shared memory multiprocessors
    [J]. Lect Notes Comput Sci, (221):
  • [3] Efficient message passing for cascade size distributions
    Burkholz, Rebekka
    [J]. SCIENTIFIC REPORTS, 2019, 9 (1)
  • [4] Efficient message passing for cascade size distributions
    Rebekka Burkholz
    [J]. Scientific Reports, 9
  • [5] An efficient and reliable message passing by mobile agent
    Jung, IY
    Yeom, HY
    [J]. 15TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING, PROCEEDINGS, 2001, : 900 - 905
  • [6] Efficient Sequential Clamping for Lifted Message Passing
    Hadiji, Fabian
    Ahmadi, Babak
    Kersting, Kristian
    [J]. KI 2011: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2011, 7006 : 122 - 133
  • [7] PushNet: Efficient and Adaptive Neural Message Passing
    Busch, Julian
    Pi, Jiaxing
    Seidl, Thomas
    [J]. ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 1039 - 1046
  • [8] PREDICATE TRANSFER AND TIMEOUT IN MESSAGE PASSING SYSTEMS
    BERNSTEIN, AJ
    [J]. INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 43 - 52
  • [9] Passing the message — mRNA transfer between plants
    Isabel Lokody
    [J]. Nature Reviews Genetics, 2014, 15 : 643 - 643
  • [10] Passing the message - mRNA transfer between plants
    Lokody, Isabel
    [J]. NATURE REVIEWS GENETICS, 2014, 15 (10) : 643 - 643