Zobrazit v EDS

Scheduling trade-off of dynamic multiple parallel workflows on heterogeneous distributed computing systems.

Uloženo v:
Podrobná bibliografie
Název: Scheduling trade-off of dynamic multiple parallel workflows on heterogeneous distributed computing systems.
Autoři: Xie, Guoqi, Liu, Liangjiao, Yang, Liu, Li, Renfa
Zdroj: Concurrency & Computation: Practice & Experience; 1/25/2017, Vol. 29 Issue 2, pn/a-N.PAG, 18p
Témata: COMPUTER scheduling, PARALLEL computers, HETEROGENEOUS computing, DISTRIBUTED computing, ALGORITHMS
Abstrakt: Scheduling multiple parallel workflows, which arrive at different instants on heterogeneous distributed computing systems, is a great challenge because of the different requirements of resource providers and users. Overall scheduling length is the main concern of resource providers, whereas deadlines of workflows are the major requirements of users. Most algorithms use fairness-based strategies to reduce the overall scheduling length. However, these algorithms cause obvious unfairness to longer-makespan workflows or shorter-makespan workflows. Furthermore, the systems cannot meet the deadlines of all workflows, particularly on large-scale resource-constrained computational grids. Gaining a reasonable balance between the overall scheduling length and the deadlines of workflows is a desirable goal. In this study, we first propose a fairness-based scheduling algorithm called fairness-based dynamic multiple heterogeneous selection value to achieve high performance of systems compared with existing works. Then, to meet the deadlines of partial higher-priority workflows, we present a priority-based scheduling algorithm called priority-based dynamic multiple heterogeneous selection value. Finally, combining fairness-based dynamic multiple heterogeneous selection value and priority-based dynamic multiple heterogeneous selection value, we present the tradeoff-based scheduling algorithm to meet the deadlines of more higher-priority workflows while still allowing the lower-priority workflows to be processed actively for better performance of systems. Both example and extensive experimental evaluations demonstrate significant improvement of our proposed algorithms. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell 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.)
Databáze: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=15320626&ISBN=&volume=29&issue=2&date=20170125&spage=n%2Fa&pages=&title=Concurrency & Computation: Practice & Experience&atitle=Scheduling%20trade-off%20of%20dynamic%20multiple%20parallel%20workflows%20on%20heterogeneous%20distributed%20computing%20systems.&aulast=Xie%2C%20Guoqi&id=DOI:10.1002/cpe.3782
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Xie%20G
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 120413288
RelevancyScore: 853
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 853.464294433594
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Scheduling trade-off of dynamic multiple parallel workflows on heterogeneous distributed computing systems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Xie%2C+Guoqi%22">Xie, Guoqi</searchLink><br /><searchLink fieldCode="AR" term="%22Liu%2C+Liangjiao%22">Liu, Liangjiao</searchLink><br /><searchLink fieldCode="AR" term="%22Yang%2C+Liu%22">Yang, Liu</searchLink><br /><searchLink fieldCode="AR" term="%22Li%2C+Renfa%22">Li, Renfa</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Concurrency & Computation: Practice & Experience; 1/25/2017, Vol. 29 Issue 2, pn/a-N.PAG, 18p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22COMPUTER+scheduling%22">COMPUTER scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22PARALLEL+computers%22">PARALLEL computers</searchLink><br /><searchLink fieldCode="DE" term="%22HETEROGENEOUS+computing%22">HETEROGENEOUS computing</searchLink><br /><searchLink fieldCode="DE" term="%22DISTRIBUTED+computing%22">DISTRIBUTED computing</searchLink><br /><searchLink fieldCode="DE" term="%22ALGORITHMS%22">ALGORITHMS</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Scheduling multiple parallel workflows, which arrive at different instants on heterogeneous distributed computing systems, is a great challenge because of the different requirements of resource providers and users. Overall scheduling length is the main concern of resource providers, whereas deadlines of workflows are the major requirements of users. Most algorithms use fairness-based strategies to reduce the overall scheduling length. However, these algorithms cause obvious unfairness to longer-makespan workflows or shorter-makespan workflows. Furthermore, the systems cannot meet the deadlines of all workflows, particularly on large-scale resource-constrained computational grids. Gaining a reasonable balance between the overall scheduling length and the deadlines of workflows is a desirable goal. In this study, we first propose a fairness-based scheduling algorithm called fairness-based dynamic multiple heterogeneous selection value to achieve high performance of systems compared with existing works. Then, to meet the deadlines of partial higher-priority workflows, we present a priority-based scheduling algorithm called priority-based dynamic multiple heterogeneous selection value. Finally, combining fairness-based dynamic multiple heterogeneous selection value and priority-based dynamic multiple heterogeneous selection value, we present the tradeoff-based scheduling algorithm to meet the deadlines of more higher-priority workflows while still allowing the lower-priority workflows to be processed actively for better performance of systems. Both example and extensive experimental evaluations demonstrate significant improvement of our proposed algorithms. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell 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://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=120413288
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/cpe.3782
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: n/a
    Subjects:
      – SubjectFull: COMPUTER scheduling
        Type: general
      – SubjectFull: PARALLEL computers
        Type: general
      – SubjectFull: HETEROGENEOUS computing
        Type: general
      – SubjectFull: DISTRIBUTED computing
        Type: general
      – SubjectFull: ALGORITHMS
        Type: general
    Titles:
      – TitleFull: Scheduling trade-off of dynamic multiple parallel workflows on heterogeneous distributed computing systems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Xie, Guoqi
      – PersonEntity:
          Name:
            NameFull: Liu, Liangjiao
      – PersonEntity:
          Name:
            NameFull: Yang, Liu
      – PersonEntity:
          Name:
            NameFull: Li, Renfa
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 25
              M: 01
              Text: 1/25/2017
              Type: published
              Y: 2017
          Identifiers:
            – Type: issn-print
              Value: 15320626
          Numbering:
            – Type: volume
              Value: 29
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Concurrency & Computation: Practice & Experience
              Type: main
ResultId 1