Processor allocation in the mesh multiprocessors using the leapfrog method

被引：0
|
作者：
Wu, F [1 ]
Hsu, CC [1 ]
机构：
[1] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan
来源：
INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS | 1998年
关键词：
allocation mesh; first-fit; Marcov chain; random walk;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A statistical data structure-the R-array is proposed to represent the mesh at first. With the statistical data, the allocation process can skip (or leapfrog) the impossible processors when finding the free base. A method based on the theory of stochastic process is devised to analyze the behavior of the allocation process The leapfrog scheme is the first one whose execution costs can be precisely calculated Simulations are carried out. The experimental results show that the leapfrog scheme is the fastest one in the allocation time in comparison with most of the famous schemes.
引用
收藏
页码：1020 / 1027
页数：8
相关论文
共 29 条
  • [1] Processor allocation in the mesh multiprocessors using the leapfrog method
    Wu, F
    Hsu, CC
    Chou, LP
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (03) : 276 - 289
  • [2] Processor allocation in the star graph using Sg-lattice model
    Wu, F
    Hsu, CC
    THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS, PROCEEDINGS (I-SPAN '97), 1997, : 310 - 316
  • [3] Efficient processor management schemes for mesh-connected multicomputers
    Yoo, BS
    Das, CR
    PARALLEL COMPUTING, 2001, 27 (08) : 1057 - 1078
  • [4] A generalized processor allocation scheme for recursively decomposable interconnection networks
    Wu, F
    Hsu, CC
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002, E85D (04) : 694 - 713
  • [5] Sg-lattice: A model for processor allocation for the star graph
    Wu, F
    Hsu, CC
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1999, E82D (03) : 637 - 644
  • [6] H-lattice: A geometric model for processor allocation in hypercubes
    Wu, F
    Hsu, CC
    1996 IEEE SECOND INTERNATIONAL CONFERENCE ON ALGORITHMS & ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP'96, PROCEEDINGS OF, 1996, : 53 - 60
  • [7] A mesh free floating random walk method for solving, diffusion imaging problems
    Sabelfeld, Karl K.
    STATISTICS & PROBABILITY LETTERS, 2017, 121 : 6 - 11
  • [8] MALH: An efficient approach to faster memory allocation using linked hashing
    Rathod, RN
    Narayanan, MK
    SERVICE SYSTEMS AND SERVICE MANAGEMENT - PROCEEDINGS OF ICSSSM '04, VOLS 1 AND 2, 2004, : 403 - 407
  • [9] Multi-Objective Resources Allocation Using Improved Genetic Algorithm at Cloud Data Center
    Sharma, Neeraj Kumar
    Guddeti, Ram Mohana Reddy
    2016 IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING IN EMERGING MARKETS (CCEM), 2016, : 73 - 77
  • [10] Salient object detection method using random graph
    Nouri, Fatemeh
    Kazemi, Kamran
    Danyali, Habibollah
    MULTIMEDIA TOOLS AND APPLICATIONS, 2018, 77 (19) : 24681 - 24699
123