IDEAS home Printed from https://ideas.repec.org/a/igg/jfsa00/v9y2020i4p105-133.html
   My bibliography  Save this article

Task Allocation Model Based on Hierarchical Clustering and Impact of Different Distance Measures on the Performance

Author

Listed:
  • Harendra Kumar

    (Gurukula Kangri Vishwavidyalaya, Haridwar, India)

  • Isha Tyagi

    (Gurukula Kangri Vishwavidyalaya, Haridwar, India)

Abstract

This article observed a new strategy to the problem of tasks clustering and allocation for very large distributed real-time problems, in which software is consolidated hierarchically and hardware potentially spans various shared or dedicated links. Here, execution and communication times have been considered as a number. Existing strategies for tasks clustering and allocation are based on either executability or communication. This study's analytical model is a recurrence conjuration of two stages: formation of clusters and clusters allocation. A modified hierarchical clustering (MHC) algorithm is derived to cluster high communicated tasks and also an algorithm is developed for proper allocation of task clusters onto suitable processors in order to achieve optimal fuzzy response time and fuzzy system. Yang's and Hamming's distances are taken to demonstrate the impact of distance measures on the performance of the proposed model.

Suggested Citation

  • Harendra Kumar & Isha Tyagi, 2020. "Task Allocation Model Based on Hierarchical Clustering and Impact of Different Distance Measures on the Performance," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(4), pages 105-133, October.
    • Handle: RePEc:igg:jfsa00:v:9:y:2020:i:4:p:105-133
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJFSA.2020100105
    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:jfsa00:v:9:y:2020:i:4:p:105-133. 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.