Multi-objective and multi constrained task scheduling framework for computational grids
Abstract Grid computing emerged as a powerful computing domain for running large-scale parallel applications. Scheduling computationally intensive parallel applications such as scientific, commercial etc., computational grids is a NP-complete problem. Many researchers have proposed several task sche...
Main Authors: | Sujay N. Hegde, D. B. Srinivas, M. A. Rajan, Sita Rani, Aman Kataria, Hong Min |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2024-03-01
|
Series: | Scientific Reports |
Subjects: | |
Online Access: | https://doi.org/10.1038/s41598-024-56957-8 |
Similar Items
-
An Algorithm for the Numbers of Homomorphisms from Paths to Rectangular Grid Graphs
by: Hatairat Yingtaweesittikul, et al.
Published: (2023-06-01) -
On the 12-Representability of Induced Subgraphs of a Grid Graph
by: Chen Joanna N., et al.
Published: (2022-05-01) -
An efficient ACO-based algorithm for task scheduling in heterogeneous multiprocessing environments
by: Jeffrey Elcock, et al.
Published: (2023-03-01) -
Integrating Knowledge Graphs into Distribution Grid Decision Support Systems
by: Yashar Kor, et al.
Published: (2023-12-01) -
Deadline-constrained workflow scheduling in IaaS clouds with multi-resource packing
by: Zhu, Zhaomeng, et al.
Published: (2021)