IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v9y2018i3p1-23.html
   My bibliography  Save this article

A High Performance Model for Task Allocation in Distributed Computing System Using K-Means Clustering Technique

Author

Listed:
  • Harendra Kumar

    (Department of Mathematics and Statistics, Gurukula Kangri University, Haridwar, India)

  • Nutan Kumari Chauhan

    (Department of Mathematics and Statistics, Gurukula Kangri University, Haridwar, India)

  • Pradeep Kumar Yadav

    (Department of Research Planning and Business Development, Central Building Research Institute, Roorkee, India)

Abstract

Tasks allocation is an important step for obtaining high performance in distributed computing system (DCS). This article attempts to develop a mathematical model for allocating the tasks to the processors in order to achieve optimal cost and optimal reliability of the system. The proposed model has been divided into two stages. Stage-I, makes the ‘n' clusters of set of ‘m' tasks by using k-means clustering technique. To use the k-means clustering techniques, the inter-task communication costs have been modified in such a way that highly communicated tasks are clustered together to minimize the communication costs between tasks. Stage-II, allocates the ‘n' clusters of tasks onto ‘n' processors to minimize the system cost. To design the mathematical model, executions costs and inter tasks communication costs have been taken in the form of matrices. To test the performance of the proposed model, many examples are considered from different research papers and results of examples have compared with some existing models.

Suggested Citation

  • Harendra Kumar & Nutan Kumari Chauhan & Pradeep Kumar Yadav, 2018. "A High Performance Model for Task Allocation in Distributed Computing System Using K-Means Clustering Technique," International Journal of Distributed Systems and Technologies (IJDST), IGI Global, vol. 9(3), pages 1-23, July.
    • Handle: RePEc:igg:jdst00:v:9:y:2018:i:3:p:1-23
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJDST.2018070101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jdst00:v:9:y:2018:i:3:p:1-23. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.