Reducing I/O complexity by simulating coarse grained parallel algorithms

被引：0
|
作者：
Dehne, Frank [1 ]
Hutchinson, David [1 ]
Maheshwari, Anil [1 ]
Dittrich, Wolfgang [1 ]
机构：
[1] Carleton Univ, Ottawa, Canada
来源：
Proceedings of the International Parallel Processing Symposium, IPPS | 1999年
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：14 / 20
相关论文
共 50 条
  • [41] Parallel I/O performance of fine grained data distributions
    Cho, Y
    Winslett, M
    Chen, Y
    Kuo, SW
    SEVENTH INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE DISTRIBUTED COMPUTING - PROCEEDINGS, 1998, : 163 - 170
  • [42] Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
    Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, Cambridge
    MA, United States
    Leibniz Int. Proc. Informatics, LIPIcs,
  • [43] Coarse-grained model for simulating the boiling point of asphaltenes
    Groven, Steven
    Desgranges, Caroline
    Delhommelle, Jerome
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2019, 257
  • [44] Radio network design using coarse-grained parallel genetic algorithms with different neighbor topology
    Guo, TC
    Mu, CD
    PROCEEDINGS OF THE 4TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-4, 2002, : 1840 - 1843
  • [45] COMPLEXITY OF PARALLEL PARTITIONED ALGORITHMS
    VOGELL, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 237 : 338 - 344
  • [46] Exploiting multidirectionality in coarse-grained are consistency algorithms
    Lecoutre, C
    Boussemart, F
    Hemery, F
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2003, PROCEEDINGS, 2003, 2833 : 480 - 494
  • [47] Finding coarse grained parallelism in computational geometry algorithms
    Beletskyy, V
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 3, PROCEEDINGS, 2003, 2669 : 913 - 922
  • [48] A Note on Parallel Selection on Coarse-Grained Multicomputers
    Saukas, E.L.G.
    Song, S.W.
    Algorithmica (New York), 24 (03): : 371 - 380
  • [49] Scalable parallel computational geometry for coarse grained multicomputers
    Dehne, F
    Fabri, A
    RauChaplin, A
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (03) : 379 - 400
  • [50] String search in coarse-grained parallel computers
    Ferragina, P
    Luccio, F
    ALGORITHMICA, 1999, 24 (3-4) : 177 - 194
12345