Satisfiability of dataflow models of distributed programs

被引：2
|
作者：
Toporkov, VV [1 ]
机构：
[1] Moscow Power Engn Inst, Dept Comp Sci, Moscow 111250, Russia
来源：
PROGRAMMING AND COMPUTER SOFTWARE | 2001年 / 27卷 / 05期
关键词：
Operating System; Artificial Intelligence; Special Form; Process History; Satisfiability Problem;
D O I：
10.1023/A:1012336809259
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The satisfiability problem is discussed for dataflow models of distributed programs represented as processes communicating with each other by exchanging messages through buffers such that each process is initiated as soon as the data are ready for use. The satisfiability means that, when exchanging messages of different kind, parameters of the buffers are coordinated such that any admissible process histories do not result in appearance of deadlock situations, when the communicating processes block each other. The satisfiability problem reduces to finding a stable and irredundant marking of marked nets of special form. Such a marking prevents program hangups for any admissible program histories.
引用
收藏
页码：238 / 244
页数：7
相关论文
共 50 条
  • [21] Dataflow testing of Java programs with DFC
    Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
    Lect. Notes Comput. Sci., 1600, (215-228):
  • [22] A Complete Language for Faceted Dataflow Programs
    Delpeuch, Antonin
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2020, (323): : 1 - 14
  • [23] Highly Scalable Distributed Dataflow Analysis
    Greathouse, Joseph L.
    LeBlanc, Chelsea
    Austin, Todd
    Bertacco, Valeria
    2011 9TH ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION (CGO), 2011, : 277 - 288
  • [24] Handling Iterations in Distributed Dataflow Systems
    Gevay, Gabor E.
    Soto, Juan
    Markl, Volker
    ACM COMPUTING SURVEYS, 2022, 54 (09)
  • [25] Distributed Checkpointing in Dataflow with Static Scheduling
    Alves, Tiago A. O.
    2023 INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING WORKSHOPS, SBAC-PADW, 2023, : 77 - 82
  • [26] Distributed Subgraph Matching on Timely Dataflow
    Lai, Longbin
    Qin, Zhu
    Yang, Zhengyi
    Jin, Xin
    Lai, Zhengmin
    Wang, Ran
    Hao, Kongzhang
    Lin, Xuemin
    Qin, Lu
    Zhang, Wenjie
    Zhang, Ying
    Qian, Zhengping
    Zhou, Jingren
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 12 (10): : 1099 - 1112
  • [27] Learning middleware models for verification of distributed control programs
    Khalili, Ali
    Narizzano, Massimo
    Natale, Lorenzo
    Tacchella, Armando
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2017, 92 : 139 - 151
  • [28] SYNTHETIC MODELS OF DISTRIBUTED-MEMORY PARALLEL PROGRAMS
    POPLAWSKI, DA
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 12 (04) : 423 - 426
  • [29] Hierarchical reconfiguration of dataflow models
    Neuendorffer, S
    Lee, E
    Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, Proceedings, 2004, : 179 - 188
  • [30] Translating Structured Sequential Programs to Dataflow Graphs
    Schneider, Klaus
    2021 19TH ACM-IEEE INTERNATIONAL CONFERENCE ON FORMAL METHODS AND MODELS FOR SYSTEM DESIGN (MEMOCODE), 2022, : 66 - 77
12345