淡江大學機構典藏:Item 987654321/104264
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62822/95882 (66%)
Visitors : 4029106      Online Users : 572
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/104264


    Title: A Malicious-Resilient Protocol for Consistent Scheduling Problem in the Cloud Computing Environment
    Authors: Cheng, Chien-Fu;Liao, Hsien-Chun
    Keywords: interactive consistency problem;Cutoff-test;consistent schedule
    Date: 2015
    Issue Date: 2016-01-06 10:53:25 (UTC+8)
    Abstract: In the cloud computing environment, resources are distributed among processors of a computing cluster. When performing a task, processors have to request needed resources that do not exist in them from other processors in the network. If the requested resource is currently used by another processor, they have to wait until the resource is released. If the resource is not released, a deadlock may occur. Deadlocks can be avoided if the order of jobs is properly arranged in advance. However, there may exist malicious faulty components in the cloud computing environment. Malicious faulty components may disturb job scheduling of fault-free servers, causing them to generate inconsistent schedules. In this paper, we investigate the Interactive Consistency (IC) problem in the cloud computing environment to develop a protocol that can exclude influences from malicious faulty components to help servers achieve consistent job scheduling. The proposed IC protocol is called Efficient Interactive Consistency Protocol with Weight Consideration (EICPweight). In this problem, each server will collect job requests from end-users first, then give a weighted value to each job according to its amount, and finally generate a consistent schedule of jobs based on their weighted values. Moreover, we also propose a new Cutoff-test mechanism to enhance the performance of the proposed protocol.
    Relation: The Computer Journal 58(2), pp.315-330
    DOI: 10.1093/comjnl/bxu028
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    A Malicious-Resilient Protocol for Consistent Scheduling Problem in the Cloud Computing Environment.pdf1781KbAdobe PDF2View/Open
    index.html0KbHTML313View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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