IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i11p1550147717742073.html
   My bibliography  Save this article

A cost- and performance-effective approach for task scheduling based on collaboration between cloud and fog computing

Author

Listed:
  • Xuan-Qui Pham
  • Nguyen Doan Man
  • Nguyen Dao Tan Tri
  • Ngo Quang Thai
  • Eui-Nam Huh

Abstract

The rapid development of Internet of Things applications, along with the limitations of cloud computing due mainly to the far distance between Internet of Thing devices and cloud-based platform, has promoted a newly distributed computing platform based on collaboration between cloud computing and fog computing. Fog computing helps to reduce transmission latency and monetary cost for cloud resources, while cloud computing helps to fulfill the increasing demands of large-scale compute-intensive offloading applications. In this article, we study the tradeoff issue between the makespan and cloud cost when scheduling large-scale applications in such a platform. We propose a scheduling algorithm called Cost-Makespan aware Scheduling heuristic whose major objective is to achieve the balance between the performance of application execution and the mandatory cost for the use of cloud resources. Additionally, an efficient task reassignment strategy based on the critical path of the directed acyclic graph modeling the applications is also proposed to refine the output schedules of the Cost-Makespan aware Scheduling algorithm to satisfy the user-defined deadline constraints or quality of service of the system. We also verify our proposal by extensive simulations, and the experimental results show that our scheduling approach is more cost-effective and achieves better performance compared to others.

Suggested Citation

  • Xuan-Qui Pham & Nguyen Doan Man & Nguyen Dao Tan Tri & Ngo Quang Thai & Eui-Nam Huh, 2017. "A cost- and performance-effective approach for task scheduling based on collaboration between cloud and fog computing," International Journal of Distributed Sensor Networks, , vol. 13(11), pages 15501477177, November.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717742073
    DOI: 10.1177/1550147717742073
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717742073
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717742073?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717742073. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.