Fast Concurrent Access to Parallel Disks

被引:0
|
作者
机构
[1] Max-Planck-Institute for Computer Science,
[2] Im Stadtwald,undefined
[3] 66123 Saarbrücken,undefined
[4] Germany. sanders@mpi-sb.mpg.de.,undefined
[5] Philips Research Laboratories,undefined
[6] Prof. Holstlaan 4,undefined
[7] 5656 AA Eindhoven,undefined
[8] The Netherlands. egnernatlab.research.philips.com,undefined
[9] korst@natlab.research.philips.com.,undefined
来源
Algorithmica | 2003年 / 35卷
关键词
Key words. Randomized algorithm, Scheduling, Load balancing, External memory.;
D O I
暂无
中图分类号
学科分类号
摘要
Abstract. High performance applications involving large data sets require the efficient and flexible use of multiple disks. In an external memory machine with D parallel, independent disks, only one block can be accessed on each disk in one I/ O step. This restriction leads to a load balancing problem that is perhaps the main inhibitor for the efficient adaptation of single-disk external memory algorithms to multiple disks. We solve this problem for arbitrary access patterns by randomly mapping blocks of a logical address space to the disks.
引用
收藏
页码:21 / 55
页数:34
相关论文
共 50 条
  • [1] Fast concurrent access to parallel disks
    Sanders, P
    Egner, S
    Korst, J
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 849 - 858
  • [2] Fast concurrent access to parallel disks
    Sanders, P
    Egner, S
    Korst, J
    ALGORITHMICA, 2003, 35 (01) : 21 - 55
  • [3] Fast Reconfiguration of Data Placement in Parallel Disks
    Kashyap, Srinivas
    Khuller, Samir
    Wan, Yung-Chun
    Golubchik, Leana
    PROCEEDINGS OF THE EIGHTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE THIRD WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2006, : 95 - +
  • [4] Randomized priority queues for fast parallel access
    Sanders, P
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 49 (01) : 86 - 97
  • [5] Traffic Splitting Policies in Parallel Queues with Concurrent Access: a Comparison
    Hoekstra, G. J.
    van der Mei, R. D.
    Bosman, J. W.
    2014 26TH INTERNATIONAL TELETRAFFIC CONGRESS (ITC), 2014,
  • [6] Providing Safe, User Space Access to Fast, Solid State Disks
    Caulfield, Adrian M.
    Mollov, Todor I.
    Eisner, Louis Alex
    De, Arup
    Coburn, Joel
    Swanson, Steven
    ASPLOS XVII: SEVENTEENTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS, 2012, : 387 - 399
  • [7] Providing Safe, User Space Access to Fast, Solid State Disks
    Caulfield, Adrian M.
    Mollov, Todor I.
    Eisner, Louis Alex
    De, Arup
    Coburn, Joel
    Swanson, Steven
    ACM SIGPLAN NOTICES, 2012, 47 (04) : 387 - 399
  • [8] Fast fault-tolerant concurrent access to shared objects
    Plaxton, CG
    Rajaraman, R
    37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 570 - 579
  • [9] Delegation Sketch: a Parallel Design with Support for Fast and Accurate Concurrent Operations
    Stylianopoulos, Charalampos
    Walulya, Ivan
    Almgren, Magnus
    Landsiedel, Olaf
    Papatriantafilou, Marina
    PROCEEDINGS OF THE FIFTEENTH EUROPEAN CONFERENCE ON COMPUTER SYSTEMS (EUROSYS'20), 2020,
  • [10] Investigations of Fast Vacuum Pump-Down Processes Between Parallel Isothermal Disks
    Yu, Dongchi
    Ma, Yuan
    IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 2022, 35 (03) : 556 - 568