English  |  正體中文  |  简体中文  |  Items with full text/Total items : 89914/105178 (85%)
Visitors : 4595061      Online Users : 670
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/11013


    Title: Resource Allocation on SMP Clusters
    Authors: YI-MIN WANG
    Contributors: Department of Computer Science and Information Management‚ Providence University, Taiwan
    Keywords: cluster of SMPs
    Resource Allocation
    Communication Cost
    Date: 2010-06
    Issue Date: 2010-12-15 10:01:47 (UTC+8)
    Publisher: Asia University
    Abstract: This paper studies the resource allocation of parallel jobs on SMP clusters. Previous parallel job scheduling algorithms‚ such as EASY (Extensible Argonne Scheduling sYstem), a backfilling algorithm‚ focus only on the allocation of CPUs. As communication cost becomes a bottleneck and gradually dominates the performance of program executions on multicomputers, some processor allocation policies suggest that as processors are allocated to a job, the allocated processors must be as continuous as possible. However, some of the mentioned algorithms will lead to another external fragmentation problem. The problem occurs as sufficient processors become available for the requested job; however, these processors are dispersed throughout the system. Thus jobs must wait for some time until there are sufficient contiguous processors. In summary, as adjacent processors are allocated, we
    may improve the run time of jobs, however, this will increase the wait-time of jobs.
    In this paper, we suggest that an effective processor allocation policy should well balance communication cost and waiting delay. The principal is simple. When a network is busy or the communication cost is high‚ the processors must be allocated as continuously as possible. On the other
    hand‚ when the communication cost is light‚ to shorten the waiting time‚ the processors should be allocated as soon as possible.
    Relation: Asian Journal of Arts and Sciences 1(1):129-140
    Appears in Collections:[Asian Journal of Arts and Sciences ] v.1 n.1

    Files in This Item:

    File Description SizeFormat
    9.pdf433KbAdobe PDF588View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback