• Login
    View Item 
    •   Home
    • Research Publications
    • Engineering & Technology
    • Department of Electronics, Computing & Maths
    • View Item
    •   Home
    • Research Publications
    • Engineering & Technology
    • Department of Electronics, Computing & Maths
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UDORACommunitiesTitleAuthorsIssue DateSubmit DateSubjectsThis CollectionTitleAuthorsIssue DateSubmit DateSubjects

    My Account

    LoginRegister

    About and further information

    AboutOpen Access WebpagesOpen Access PolicyTake Down Policy University Privacy NoticeUniversity NewsTools for ResearchersLibraryUDo

    Statistics

    Display statistics

    Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Publisher version
    View Source
    Access full-text PDFOpen Access
    View Source
    Check access options
    Check access options
    Thumbnail
    Name:
    15 copy.pdf
    Size:
    1.780Mb
    Format:
    PDF
    Download
    Authors
    Huang, Ye
    Bessis, Nik cc
    Norrington, Peter
    Kuonen, Pierre
    Hirsbrunner, Beat
    Affiliation
    University of Fribourg
    University of Bedfordshire
    University of Derby
    University of Applied Sciences of Western Switzerland
    Issue Date
    2013
    
    Metadata
    Show full item record
    Abstract
    Job scheduling strategies have been studied for decades in a variety of scenarios. Due to the new characteristics of the emerging computational systems, such as the grid and cloud, metascheduling turns out to be an important scheduling pattern because it is responsible for orchestrating resources managed by independent local schedulers and bridges the gap between participating nodes. Equally, to overcome issues such as bottleneck, single point failure, and impractical unique administrative management, which are normally led by conventional centralized or hierarchical schemes, the decentralized scheduling scheme is emerging as a promising approach because of its capability with regards to scalability and flexibility. In this work, we introduce a decentralized dynamic scheduling approach entitled the community- aware scheduling algorithm (CASA). The CASA is a two-phase scheduling solution comprised of a set of heuristic sub-algorithms to achieve optimized scheduling performance over the scope of overall grid or cloud, instead of individual participating nodes. The extensive experimental evaluation with a real grid workload trace dataset shows that, when compared to the centralized scheduling scheme with BestFit as the metascheduling policy, the use of CASA can lead to a 30%–61% better average job slowdown, and a 68%–86% shorter average job waiting time in a decentralized scheduling manner without requiring detailed real-time processing information from participating nodes.
    Citation
    Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm 2013, 29 (1):402 Future Generation Computer Systems
    Journal
    Future Generation Computer Systems
    DOI
    10.1016/j.future.2011.05.006
    Additional Links
    http://linkinghub.elsevier.com/retrieve/pii/S0167739X11000872
    Type
    Other
    Language
    en
    ISSN
    0167739X
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.future.2011.05.006
    Scopus Count
    Collections
    Department of Electronics, Computing & Maths

    entitlement

     
    DSpace software (copyright © 2002 - 2021)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.