View in EDS HTML Full Text PDF Full Text

Scheduling of frequently communicating tasks.

Saved in:
Bibliographic Details
Title: Scheduling of frequently communicating tasks.
Authors: Papazachos, Zafeirios C.1 (AUTHOR) zpapazac@csd.auth.gr, Karatza, Helen D.1 (AUTHOR)
Source: International Journal of Communication Systems. Feb2012, Vol. 25 Issue 2, p146-157. 12p. 3 Diagrams, 1 Chart, 5 Graphs.
Subjects: Sequential scheduling, Wireless communications, Distribution (Probability theory), Algorithms, Simulation methods & models, Performance evaluation, Information technology
Abstract: SUMMARY Gang scheduling is an efficient resource management scheme for distributed systems which combines elements of time sharing and space sharing. It is a suitable technique particularly in the case when parallel tasks have to be running concurrently to make progress in communication. This paper studies the impact on scheduling performance when dynamically generated sequential gangs exist in the workload. In the case of sequential gangs, a subsequent gang can be dynamically generated after the execution of the initial gang based on affinity information which resides on the caches of the previously seized processors. The performance of different gang-scheduling algorithms is examined for various cases of workload compositions which range from cases with a low demand for dynamically generated gangs to cases with a high ratio of sequential gangs to solitary gangs. A simulation model is implemented to address associated performance issues. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Communication Systems 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.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 70600935
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Scheduling of frequently communicating tasks.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Papazachos%2C+Zafeirios+C%2E%22">Papazachos, Zafeirios C.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> zpapazac@csd.auth.gr</i><br /><searchLink fieldCode="AR" term="%22Karatza%2C+Helen+D%2E%22">Karatza, Helen D.</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Communication+Systems%22">International Journal of Communication Systems</searchLink>. Feb2012, Vol. 25 Issue 2, p146-157. 12p. 3 Diagrams, 1 Chart, 5 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Sequential+scheduling%22">Sequential scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Wireless+communications%22">Wireless communications</searchLink><br /><searchLink fieldCode="DE" term="%22Distribution+%28Probability+theory%29%22">Distribution (Probability theory)</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Simulation+methods+%26+models%22">Simulation methods & models</searchLink><br /><searchLink fieldCode="DE" term="%22Performance+evaluation%22">Performance evaluation</searchLink><br /><searchLink fieldCode="DE" term="%22Information+technology%22">Information technology</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: SUMMARY Gang scheduling is an efficient resource management scheme for distributed systems which combines elements of time sharing and space sharing. It is a suitable technique particularly in the case when parallel tasks have to be running concurrently to make progress in communication. This paper studies the impact on scheduling performance when dynamically generated sequential gangs exist in the workload. In the case of sequential gangs, a subsequent gang can be dynamically generated after the execution of the initial gang based on affinity information which resides on the caches of the previously seized processors. The performance of different gang-scheduling algorithms is examined for various cases of workload compositions which range from cases with a low demand for dynamically generated gangs to cases with a high ratio of sequential gangs to solitary gangs. A simulation model is implemented to address associated performance issues. Copyright © 2011 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Communication Systems 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://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=70600935
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/dac.1260
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 146
    Subjects:
      – SubjectFull: Sequential scheduling
        Type: general
      – SubjectFull: Wireless communications
        Type: general
      – SubjectFull: Distribution (Probability theory)
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Simulation methods & models
        Type: general
      – SubjectFull: Performance evaluation
        Type: general
      – SubjectFull: Information technology
        Type: general
    Titles:
      – TitleFull: Scheduling of frequently communicating tasks.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Papazachos, Zafeirios C.
      – PersonEntity:
          Name:
            NameFull: Karatza, Helen D.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2012
              Type: published
              Y: 2012
          Identifiers:
            – Type: issn-print
              Value: 10745351
          Numbering:
            – Type: volume
              Value: 25
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: International Journal of Communication Systems
              Type: main
ResultId 1