IDEAS home Printed from https://ideas.repec.org/a/ids/ijitma/v25y2026i1p30-45.html

A balanced scheduling method for multi-threaded tasks based on two-level parallelism between clusters and big data clustering

Author

Listed:
  • Xian Yang
  • Jue Huang
  • Yun Zhao
  • Hui Tong
  • Shibing Chen
  • Yuxin Lu
  • Wei Cao

Abstract

To improve the efficiency of task scheduling and enhance the negative load-balancing effect of tasks, this paper proposes a multi-threaded task-balancing scheduling method based on two-level parallelism between clusters and big data clustering. Firstly, use fuzzy C-means clustering to group task data into multiple clusters based on feature similarity. Then, build a multi-threaded task model that allows tasks to be executed in parallel on multiple threads, achieving two-level parallel processing between and within clusters. Finally, by determining task priority and hierarchical sorting, a task scheduling manager is designed to achieve balanced task scheduling. The experiment shows that the maximum standard deviation of the load in this method is 0.05, and the maximum over-time task ratio is 0.015, indicating that this method has strong load-balancing ability and can achieve real-time processing of tasks.

Suggested Citation

  • Xian Yang & Jue Huang & Yun Zhao & Hui Tong & Shibing Chen & Yuxin Lu & Wei Cao, 2026. "A balanced scheduling method for multi-threaded tasks based on two-level parallelism between clusters and big data clustering," International Journal of Information Technology and Management, Inderscience Enterprises Ltd, vol. 25(1), pages 30-45.
  • Handle: RePEc:ids:ijitma:v:25:y:2026:i:1:p:30-45
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=152448
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:ids:ijitma:v:25:y:2026:i:1:p:30-45. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=18 .

    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.