Universal constructs in distributed computations

被引:0
|
作者
Kshemkalyani, AD [1 ]
Singhal, M
机构
[1] Univ Illinois, Dept EECS, Chicago, IL 60607 USA
[2] Ohio State Univ, Dept CIS, Columbus, OH 43210 USA
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper identifies two classes of communication patterns that occur in distributed computations and explores their properties. It first examines local patterns, primarily IO and OI intervals, that occur at nodes in distributed computations. These local patterns form building blocks that are then used to define the global patterns, termed segments and paths, that occur across nodes in distributed computations. By controlling the predicates on the local patterns used to define segments and paths, various types of segments and paths can be defined. A number of key concepts and structures characterizing distributed computations are special cases of and are expressed in terms of the patterns identified.
引用
收藏
页码:795 / 805
页数:11
相关论文
共 50 条
  • [1] Universal machines and computations - Foreword
    Margenstern, M
    [J]. THEORETICAL COMPUTER SCIENCE, 2000, 231 (02) : 141 - 142
  • [2] Learning Universal Computations with Spikes
    Thalmeier, Dominik
    Uhlmann, Marvin
    Kappen, Hilbert J.
    Memmesheimer, Raoul-Martin
    [J]. PLOS COMPUTATIONAL BIOLOGY, 2016, 12 (06)
  • [3] Dissecting distributed computations
    Guerraoui, R
    [J]. FUTURE DIRECTIONS IN DISTRIBUTED COMPUTING: RESEARCH AND POSITION PAPERS, 2003, 2584 : 68 - 72
  • [4] Distributed symbolic computations
    Petcu, Dana
    [J]. ISPDC 2007: SIXTH INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, : 10 - 11
  • [5] Uncheatable distributed computations
    Golle, P
    Mironov, I
    [J]. TOPICS IN CRYPTOLOGY - CT-RAS 2001, PROCEEDINGS, 2001, 2020 : 425 - 440
  • [6] DISTRIBUTED TERMINATION DETECTION ALGORITHM FOR DISTRIBUTED COMPUTATIONS
    ARORA, RK
    RANA, SP
    GUPTA, MN
    [J]. INFORMATION PROCESSING LETTERS, 1986, 22 (06) : 311 - 314
  • [7] A METHODOLOGY FOR PERFORMANCE ANALYSIS OF PARALLEL COMPUTATIONS WITH LOOPING CONSTRUCTS
    KAPELNIKOV, A
    MUNTZ, RR
    ERCEGOVAC, MD
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 14 (02) : 105 - 120
  • [8] LANGUAGE CONSTRUCTS FOR DISTRIBUTED PROGRAMS
    HOMMEL, G
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 190 : 287 - 341
  • [9] Homological computations in the universal Steenrod algebra
    Ciampella, A
    Lomonaco, LA
    [J]. FUNDAMENTA MATHEMATICAE, 2004, 183 (03) : 245 - 252
  • [10] MEASURE OF PARALLELISM OF DISTRIBUTED COMPUTATIONS
    CHARRONBOST, B
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 434 - 445