Conflict-free allocation of arrays during parallel computations

被引:0
|
作者
Shteinberg, BY
机构
关键词
Array Element; Great Common Divisor; Index Expression; Data Allocation; Pipeline Execution;
D O I
10.1007/BF02667925
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
[No abstract available]
引用
收藏
页码:155 / 164
页数:10
相关论文
共 50 条
  • [41] Extremal Results on Conflict-Free Coloring
    Bhyravarapu, Sriram
    Gupta, Shiwali
    Kalyanasundaram, Subrahmanyam
    Mathew, Rogers
    JOURNAL OF GRAPH THEORY, 2025,
  • [42] Strong conflict-free connection of graphs
    Ji, Meng
    Li, Xueliang
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 364
  • [43] Priority conflict-free Petri nets
    Hsu-Chun Yen
    Acta Informatica, 1998, 35 : 673 - 688
  • [44] Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
    Bertossi, AA
    Pinotti, CM
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2002, 62 (08) : 1314 - 1333
  • [45] Priority conflict-free Petri nets
    Yen, HC
    ACTA INFORMATICA, 1998, 35 (08) : 673 - 688
  • [46] Complexity of conflict-free colorings of graphs
    Gargano, Luisa
    Rescigno, Adele A.
    THEORETICAL COMPUTER SCIENCE, 2015, 566 : 39 - 49
  • [47] CONFLICT-FREE COLORINGS OF SHALLOW DISCS
    Alon, Noga
    Smorodinsky, Shakhar
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2008, 18 (06) : 599 - 604
  • [48] Separability in conflict-free Petri nets
    Best, Eike
    Esparza, Javier
    Wimmel, Harro
    Wolf, Karsten
    PERSPECTIVES OF SYSTEMS INFORMATICS, 2007, 4378 : 1 - +
  • [49] Online conflict-free coloring of intervals
    Abam, M. A.
    Seraji, M. J. Rezaei
    Shadravan, M.
    SCIENTIA IRANICA, 2014, 21 (06) : 2138 - 2141
  • [50] Conflict-Free Coloring of String Graphs
    Chaya Keller
    Alexandre Rok
    Shakhar Smorodinsky
    Discrete & Computational Geometry, 2021, 65 : 1337 - 1372