GA-based QOS-aware workflow scheduling of deadline tasks in grid computing.

Saved in:
Bibliographic Details
Title: GA-based QOS-aware workflow scheduling of deadline tasks in grid computing.
Authors: Girgis, Moheb R.1 (AUTHOR), Mahmoud, Tarek M.2 (AUTHOR), Azzam, Hagar M.1 (AUTHOR) hagar126@mu.edu.eg
Source: Knowledge & Information Systems. May2024, Vol. 66 Issue 5, p2859-2884. 26p.
Subjects: Grid computing, Workflow, Deadlines, Scheduling, Quality of service
Abstract: Grid computing is the aggregation of the power of heterogeneous, geographically distributed computing resources to provide high-performance computing. To benefit from the grid computing capabilities, effectual scheduling algorithms are primarily essential. This paper presents a GA-based approach, called Grid Workflow Tasks Scheduling Algorithm (GWTSA), for scheduling workflow tasks on grid services based on users' QoS (quality of service) constraints in terms of cost and time. For a given set of inter-dependent workflow tasks, it generates an optimal schedule, which minimizes the execution time and cost, such that the optimized time be within the time constraints (deadline) imposed by the user. In GWTSA, the workflow tasks are modeled as a DAG, which is divided, then the optimal sub-schedules of all task divisions are computed and used to obtain the execution schedule of the entire workflow. A GA-based technique is employed in GWTSA to compute the optimal execution sub-schedule for each branch division that consists of a set of sequential tasks. In this technique, the chromosome represents a branch division, where each gene holds the id of the service provider chosen to execute the corresponding task in the branch; and the fitness function is formulated as a multi-objective function of time and cost, this gives users the ability to determine their requirements if speed against cost or vice versa, by changing the weighting coefficients in the fitness function. The paper also exhibits the experimental results of assessing the performance of GWTSA with workflow samples of different sizes. [ABSTRACT FROM AUTHOR]
Copyright of Knowledge & Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 177003778
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: GA-based QOS-aware workflow scheduling of deadline tasks in grid computing.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Girgis%2C+Moheb+R%2E%22">Girgis, Moheb R.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Mahmoud%2C+Tarek+M%2E%22">Mahmoud, Tarek M.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Azzam%2C+Hagar+M%2E%22">Azzam, Hagar M.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> hagar126@mu.edu.eg</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Knowledge+%26+Information+Systems%22">Knowledge & Information Systems</searchLink>. May2024, Vol. 66 Issue 5, p2859-2884. 26p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Grid+computing%22">Grid computing</searchLink><br /><searchLink fieldCode="DE" term="%22Workflow%22">Workflow</searchLink><br /><searchLink fieldCode="DE" term="%22Deadlines%22">Deadlines</searchLink><br /><searchLink fieldCode="DE" term="%22Scheduling%22">Scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Quality+of+service%22">Quality of service</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Grid computing is the aggregation of the power of heterogeneous, geographically distributed computing resources to provide high-performance computing. To benefit from the grid computing capabilities, effectual scheduling algorithms are primarily essential. This paper presents a GA-based approach, called Grid Workflow Tasks Scheduling Algorithm (GWTSA), for scheduling workflow tasks on grid services based on users' QoS (quality of service) constraints in terms of cost and time. For a given set of inter-dependent workflow tasks, it generates an optimal schedule, which minimizes the execution time and cost, such that the optimized time be within the time constraints (deadline) imposed by the user. In GWTSA, the workflow tasks are modeled as a DAG, which is divided, then the optimal sub-schedules of all task divisions are computed and used to obtain the execution schedule of the entire workflow. A GA-based technique is employed in GWTSA to compute the optimal execution sub-schedule for each branch division that consists of a set of sequential tasks. In this technique, the chromosome represents a branch division, where each gene holds the id of the service provider chosen to execute the corresponding task in the branch; and the fitness function is formulated as a multi-objective function of time and cost, this gives users the ability to determine their requirements if speed against cost or vice versa, by changing the weighting coefficients in the fitness function. The paper also exhibits the experimental results of assessing the performance of GWTSA with workflow samples of different sizes. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Knowledge & Information Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=177003778
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10115-023-02048-5
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 26
        StartPage: 2859
    Subjects:
      – SubjectFull: Grid computing
        Type: general
      – SubjectFull: Workflow
        Type: general
      – SubjectFull: Deadlines
        Type: general
      – SubjectFull: Scheduling
        Type: general
      – SubjectFull: Quality of service
        Type: general
    Titles:
      – TitleFull: GA-based QOS-aware workflow scheduling of deadline tasks in grid computing.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Girgis, Moheb R.
      – PersonEntity:
          Name:
            NameFull: Mahmoud, Tarek M.
      – PersonEntity:
          Name:
            NameFull: Azzam, Hagar M.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2024
              Type: published
              Y: 2024
          Identifiers:
            – Type: issn-print
              Value: 02191377
          Numbering:
            – Type: volume
              Value: 66
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Knowledge & Information Systems
              Type: main
ResultId 1