• HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
Tuesday, November 17, 2026
BIOENGINEER.ORG
No Result
View All Result
  • Login
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
  • HOME
  • NEWS
  • EXPLORE
    • CAREER
      • Companies
      • Jobs
        • Lecturer
        • PhD Studentship
        • Postdoc
        • Research Assistant
    • EVENTS
    • iGEM
      • News
      • Team
    • PHOTOS
    • VIDEO
    • WIKI
  • BLOG
  • COMMUNITY
    • FACEBOOK
    • INSTAGRAM
    • TWITTER
No Result
View All Result
Bioengineer.org
No Result
View All Result
Home NEWS Science News Technology

Graph Shortest Distance Heuristic Optimizes Cloud Workflow Scheduling and Load Balancing

by
November 17, 2026
in Technology
Reading Time: 3 mins read
0
Graph Shortest Distance Heuristic Optimizes Cloud Workflow Scheduling and Load Balancing

Graph Shortest Distance Heuristic Optimizes Cloud Workflow Scheduling and Load Balancing

Share on FacebookShare on TwitterShare on LinkedinShare on RedditShare on Telegram

A new workflow scheduling approach leveraging graph shortest distance heuristics significantly improves load balancing and reduces execution makespan across cloud platforms, according to a study published in the Journal of Cloud Computing. Researchers Anjali Choudhary, Ranjit Rajak, and Pramod Kumar Soni evaluated the technique across different computational structures, directly addressing fundamental resource allocation challenges in distributed environments. Because modern cloud computing platforms operate under dynamic demand while managing finite computational resources, optimizing the assignment of dependent tasks remains essential for high-performance computing infrastructures tasked with executing complex, large-scale scientific workflows.

In cloud environments, computing demands arrive as user requests that function as distinct tasks, with cumulative tasks representing the system load that directly affects processing capability. Managing resources in these cloud platforms consists of two core components: provisioning appropriate resources to meet user demands and scheduling dependent or independent tasks. Ineffective scheduling frequently causes unequal workload distributions across heterogeneous computing resources, resulting in protracted makespans and inefficient system utilization.

To resolve these operational difficulties, the research team developed a scheduling method grounded in graph shortest distance heuristics. The proposed approach specifically targets two major system objectives: minimizing workflow makespan and balancing workload distribution across available processing nodes. By evaluating the structural shortest distance properties of the directed acyclic graph, the heuristic algorithm guides resource provisioning and task allocation according to user demands.

The researchers assessed their proposed scheduling algorithm using three distinct workflow models: an unstructured random workflow and two standardized scientific benchmarks, designated as Epigenomics and Montage.

Experimental results demonstrated that the proposed method consistently outperformed state-of-the-art scheduling algorithms across every workflow structure tested. When evaluated on the random workflow, the algorithm achieved a makespan reduction ranging from 49 percent to 55 percent compared to existing baseline techniques. For the scientific workflows, the method achieved substantial decreases in overall completion time as well. The Montage workflow exhibited makespan reductions ranging between 39 percent and 59 percent, while the Epigenomics workflow achieved makespan improvements ranging from 19 percent to 49 percent under experimental conditions.

Alongside completion time reductions, the graph shortest distance approach produced measurable improvements in load balancing across heterogeneous resources. The researchers reported load balance improvements ranging from 39 percent to 53 percent for the random workflow, 13 percent to 18 percent for the Montage workflow, and 5 percent to 12 percent for the Epigenomics workflow.

To confirm the reliability and significance of these observed improvements, the investigators conducted formal statistical analysis using analysis of variance. They supplemented this assessment with effect size calculations and Tukey’s honestly significant difference post-hoc tests. The statistical results confirmed that the proposed heuristic achieved significantly lower makespan and improved load balancing compared to existing state-of-the-art algorithms. The authors concluded that their graph-based heuristic framework provides a validated foundation to help researchers explore workflow design, resolve scheduling complexities, and optimize cloud resource provisioning.

Subject of Research: Cloud computing workflow scheduling and load balancing optimization

Article Title: Performance analysis of workflow scheduling for load balancing approach based on QoS parameter in cloud platform

Article References: Choudhary, A., Rajak, R., & Soni, P. K. (2026). Performance analysis of workflow scheduling for load balancing approach based on QoS parameter in cloud platform. Journal of Cloud Computing. https://doi.org/10.1186/s13677-026-00998-z

Image Credits: AI Generated

DOI: 10.1186/s13677-026-00998-z

Keywords: cloud computing, workflow scheduling, load balancing, makespan reduction, graph shortest distance, directed acyclic graph, scientific workflows, Montage workflow, Epigenomics workflow, heterogeneous resources, resource provisioning, quality of service, analysis of variance, Tukey HSD test, task dependencies, high performance computing

News Source: Denise Maddox. (November 17, 2026). Graph Shortest Distance Heuristic Optimizes Cloud Workflow Scheduling and Load Balancing. Scienmag.

Tags: analysis of variancecloud computingdirected acyclic graphEpigenomics workflowgraph shortest distanceheterogeneous resourceshigh-performance computingload balancingmakespan reductionMontage workflowquality of serviceresource provisioningscientific workflowstask dependenciesTukey HSD testworkflow scheduling
Share12Tweet7Share2ShareShareShare1

Related Posts

Physics-Informed AI Optimizes HVAC Energy Efficiency for Saudi Residential Buildings

Physics-Informed AI Optimizes HVAC Energy Efficiency for Saudi Residential Buildings

November 17, 2026
Instanton Condensation Reveals New Instability in BPS Black Holes

Instanton Condensation Reveals New Instability in BPS Black Holes

November 17, 2026

Pound-Drever-Hall Stabilization Yields Kilohertz Linewidth in Electro-Optical Mixer

November 17, 2026

Dual-Roller Die-Less Spinning Optimizes Aluminum Alloy Sheet Metal Forming Processes

November 17, 2026

POPULAR NEWS

  • Review Highlights Multi-Level Factors Influencing Clinical AI Adoption by Healthcare Providers

    Review Highlights Multi-Level Factors Influencing Clinical AI Adoption by Healthcare Providers

    29 shares
    Share 12 Tweet 7
  • Gut Microbiota and Metabolites Influence Immunotherapy Response in Liver Cancer

    29 shares
    Share 12 Tweet 7
  • Nonlinear Sex-Specific Remodeling of the TCRβ Repertoire During Adult Aging

    29 shares
    Share 12 Tweet 7
  • Capped Nanovials Enable Extended Cell Growth and Screening in UCLA Study

    29 shares
    Share 12 Tweet 7

About

We bring you the latest biotechnology news from best research centers and universities around the world. Check our website.

Follow us

Recent News

Fusobacterium nucleatum Extracellular Vesicles Trigger Neuroinflammation and Anxiety-Like Behaviors via IL-1β

Experiential Workshop Expands Mexican Students’ Understanding of Bat Diets and Ecological Roles

Immune Cell Exhaustion May Drive Neurodegeneration in Alzheimer’s and Parkinson’s

Subscribe to Blog via Email

Enter your email address to subscribe to this blog and receive notifications of new posts by email.

Join 88 other subscribers
  • Contact Us

Bioengineer.org © Copyright 2023 All Rights Reserved.

Welcome Back!

Login to your account below

Forgotten Password?

Retrieve your password

Please enter your username or email address to reset your password.

Log In
No Result
View All Result
  • Homepages
    • Home Page 1
    • Home Page 2
  • News
  • National
  • Business
  • Health
  • Lifestyle
  • Science

Bioengineer.org © Copyright 2023 All Rights Reserved.