On Ordering Problems in Message Passing Software

被引:8
|
作者
Long, Yuheng [1 ]
Bagherzadeh, Mehdi [1 ]
Lin, Eric [1 ]
Upadhyaya, Ganesha [1 ]
Rajan, Hridesh [1 ]
机构
[1] Iowa State Univ, Ames, IA 50011 USA
基金
美国国家科学基金会;
关键词
Message passing; quantification of message ordering problems; asynchronous messages;
D O I
10.1145/2889443.2889444
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The need for concurrency in modern software is increasingly fulfilled by utilizing the message passing paradigm because of its modularity and scalability. In the message passing paradigm, concurrently running processes communicate by sending and receiving messages. Asynchronous messaging introduces the possibility of message ordering problems: two messages with a specific order in the program text could take effect in the opposite order in the program execution and lead to bugs that are hard to find and debug. We believe that the engineering of message passing software could be easier if more is known about the characteristics of message ordering problems in practice. In this work, we present an analysis to study and quantify the relation between ordering problems and semantics variations of their underlying message passing paradigm in over 30 applications. Some of our findings are as follows: (1) semantic variations of the message passing paradigm can cause ordering problems exhibited by applications in different programming patterns to vary greatly; (2) some semantic features such as in-order messaging are critical for reducing ordering problems; (3) modular enforcement of aliasing in terms of data isolation allows small test configurations to trigger the majority of ordering problems.
引用
收藏
页码:54 / 65
页数:12
相关论文
共 50 条
  • [1] Message passing in random satisfiability problems
    Mézard, M
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16, 2004, 16 : 1061 - 1068
  • [2] Ordering Traces Logically to Identify Lateness in Message Passing Programs
    Isaacs, Katherine E.
    Gamblin, Todd
    Bhatele, Abhinav
    Schulz, Martin
    Hamann, Bernd
    Bremer, Peer-Timo
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (03) : 829 - 840
  • [3] Perturbed message passing for Constraint Satisfaction Problems
    Department of Computing Science, University of Alberta, Edmonton
    AB
    T6E 2E8, Canada
    [J]. J. Mach. Learn. Res., (1249-1274):
  • [4] Perturbed Message Passing for Constraint Satisfaction Problems
    Ravanbakhsh, Siamak
    Greiner, Russell
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2015, 16 : 1249 - 1274
  • [5] A simple message passing algorithm for graph partitioning problems
    Onsjo, Mikael
    Tatanabe, Osamu
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 507 - +
  • [6] Integrating Software Distributed Shared Memory and Message Passing Programming
    Wong, H. J.
    Rendell, A. P.
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING AND WORKSHOPS, 2009, : 197 - +
  • [7] On the Convergence and Optimality of Reweighted Message Passing for Channel Assignment Problems
    Moretti, Marco
    Abrardo, Andrea
    Belleschi, Marco
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2014, 21 (11) : 1428 - 1432
  • [8] Software vs. Hardware Message Passing Implementations for FPGA Clusters
    Creedon, Eoin
    Manzke, Michael
    [J]. PARALLEL COMPUTING: FROM MULTICORES AND GPU'S TO PETASCALE, 2010, 19 : 584 - 591
  • [9] On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model
    Li, Yi
    Sun, Xiaoming
    Wang, Chengu
    Woodruff, David P.
    [J]. DISTRIBUTED COMPUTING (DISC 2014), 2014, 8784 : 499 - 513
  • [10] Complete convergence of message passing algorithms for some satisfiability problems
    Feige, Uriel
    Mossel, Elchanan
    Vilenchik, Dan
    [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 339 - 350