CPTF–a new heuristic based branch and bound algorithm for workflow scheduling in heterogeneous distributed computing systems

D. Sirisha; S. Sambhu Prasad

doi:10.1007/s42514-024-00192-0

ScienceGate Book Chapters

JOURNAL ARTICLE

CPTF–a new heuristic based branch and bound algorithm for workflow scheduling in heterogeneous distributed computing systems

D. Sirisha S. Sambhu Prasad

Year: 2024 Journal: CCF Transactions on High Performance Computing Vol: 6 (5)Pages: 472-487 Publisher: Springer Science+Business Media

DOI: 10.1007/s42514-024-00192-0

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Workflow Branch and bound Distributed computing Scheduling (production processes) Parallel computing Heuristic Algorithm Mathematical optimization Mathematics Artificial intelligence Database

Metrics

Cited By

2.51

FWCI (Field Weighted Citation Impact)

Refs

0.79

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Distributed and Parallel Computing Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Cloud Computing and Resource Management

Physical Sciences → Computer Science → Information Systems

Parallel Computing and Optimization Techniques

Physical Sciences → Computer Science → Hardware and Architecture

CPTF–a new heuristic based branch and bound algorithm for workflow scheduling in heterogeneous distributed computing systems

Metrics

Citation History

Topics

Related Documents

A hybrid meta-heuristic algorithm for scientific workflow scheduling in heterogeneous distributed computing systems

Path-Based Heuristic Task Scheduling Algorithm for Heterogeneous Distributed Computing Systems

A Heuristic Algorithm for Workflow-Based Job Scheduling in Decentralized Distributed Systems with Heterogeneous Resources

A List-based Heuristic Algorithm for Static Task Scheduling in Heterogeneous Distributed Computing Systems

A BRANCH AND BOUND ALGORITHM FOR WORKFLOW SCHEDULING