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 条
  • [21] Coarse-Grained Parallel Algorithms for Multi-Dimensional Wavelet Transforms
    Linda Yang
    Manavendra Misra
    The Journal of Supercomputing, 1998, 12 : 99 - 118
  • [22] Coarse-grained parallel algorithms for multi-dimensional wavelet transforms
    Yang, LH
    Misra, M
    JOURNAL OF SUPERCOMPUTING, 1998, 12 (1-2): : 99 - 118
  • [23] Coarse-grained parallel algorithms for spatial data partition and join processing
    Xiao, JT
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS, 2004, 3214 : 461 - 468
  • [24] Coarse grained parallel Monte Carlo algorithms for solving SLAE using PVM
    Alexandrov, V
    Dehne, F
    Rau-Chaplin, A
    Taft, K
    RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, 1998, 1497 : 323 - 330
  • [25] OPTIMAL-ALGORITHMS FOR PARALLEL GIVENS FACTORIZATION ON A COARSE-GRAINED PRAM
    COSNARD, M
    DAOUDI, EM
    JOURNAL OF THE ACM, 1994, 41 (02) : 399 - 421
  • [26] Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms
    De Stefani, Lorenzo
    PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022, 2022, : 449 - 452
  • [27] Simulating the complexity of the dark matter sheet I: Numerical algorithms
    Stücker J.
    Hahn O.
    Angulo R.E.
    White S.D.M.
    Monthly Notices of the Royal Astronomical Society, 2020, 495 (04): : 4943 - 4964
  • [28] Simulating the complexity of the dark matter sheet I: numerical algorithms
    Stuecker, Jens
    Hahn, Oliver
    Angulo, Raul E.
    White, Simon D. M.
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 2020, 495 (04) : 4943 - 4964
  • [29] I/O-complexity of graph algorithms
    Munagala, K
    Ranade, B
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 687 - 694
  • [30] Simulating the Entropic Collapse of Coarse-Grained Chromosomes
    Shendruk, Tyler N.
    Bertrand, Martin
    de Haan, Hendrick W.
    Harden, James L.
    Slater, Gary W.
    BIOPHYSICAL JOURNAL, 2015, 108 (04) : 810 - 820
12345