View in EDS

Sticky-ERfair: a task-processor affinity aware proportional fair scheduler.

Saved in:
Bibliographic Details
Title: Sticky-ERfair: a task-processor affinity aware proportional fair scheduler.
Authors: Sarkar, Arnab1 arnab@cse.iitkgp.ernet.in, Ghose, Sujoy1 sujoy@cse.iitkgp.ernet.in, Chakrabarti, P.1 ppchak@cse.iitkgp.ernet.in
Source: Real-Time Systems. Jul2011, Vol. 47 Issue 4, p356-377. 22p.
Subjects: Real-time programming software, Production scheduling, Computer network access control software, Computer scheduling, Algorithms, Computer engineering, Cache memory, Computer input-output equipment, Computer software
Abstract: drawback of current proportional fair schedulers is that they ignore task-to-processor mutual affinities, thereby causing frequent inter-processor task migrations and cache misses. This paper presents the Sticky-ERfair Scheduler, an Early-Release Fair (ERfair) scheduler that attempts to minimize task migrations and preemptions. Given any processor V, Sticky-ERfair allocates to it the most recently executed ready task that previously executed on V (thus restricting migrations and preemptions) in such a way that this allocation does not cause any ERfairness violations in the system at any time during the schedule length. Experimental results reveal that Sticky-ERfair can achieve upto over 40 times reduction both in the number of migrations and preemptions suffered with respect to Basic-ERfair (for a set of 25 to 100 tasks running on 2 to 10 processors) while simultaneously guaranteeing ERfairness at each time slot. [ABSTRACT FROM AUTHOR]
Copyright of Real-Time 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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 61005088
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Sticky-ERfair: a task-processor affinity aware proportional fair scheduler.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Sarkar%2C+Arnab%22">Sarkar, Arnab</searchLink><relatesTo>1</relatesTo><i> arnab@cse.iitkgp.ernet.in</i><br /><searchLink fieldCode="AR" term="%22Ghose%2C+Sujoy%22">Ghose, Sujoy</searchLink><relatesTo>1</relatesTo><i> sujoy@cse.iitkgp.ernet.in</i><br /><searchLink fieldCode="AR" term="%22Chakrabarti%2C+P%2E%22">Chakrabarti, P.</searchLink><relatesTo>1</relatesTo><i> ppchak@cse.iitkgp.ernet.in</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Real-Time+Systems%22">Real-Time Systems</searchLink>. Jul2011, Vol. 47 Issue 4, p356-377. 22p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Real-time+programming+software%22">Real-time programming software</searchLink><br /><searchLink fieldCode="DE" term="%22Production+scheduling%22">Production scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+network+access+control+software%22">Computer network access control software</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+scheduling%22">Computer scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+engineering%22">Computer engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Cache+memory%22">Cache memory</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+input-output+equipment%22">Computer input-output equipment</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: drawback of current proportional fair schedulers is that they ignore task-to-processor mutual affinities, thereby causing frequent inter-processor task migrations and cache misses. This paper presents the Sticky-ERfair Scheduler, an Early-Release Fair (ERfair) scheduler that attempts to minimize task migrations and preemptions. Given any processor V, Sticky-ERfair allocates to it the most recently executed ready task that previously executed on V (thus restricting migrations and preemptions) in such a way that this allocation does not cause any ERfairness violations in the system at any time during the schedule length. Experimental results reveal that Sticky-ERfair can achieve upto over 40 times reduction both in the number of migrations and preemptions suffered with respect to Basic-ERfair (for a set of 25 to 100 tasks running on 2 to 10 processors) while simultaneously guaranteeing ERfairness at each time slot. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Real-Time 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=61005088
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11241-011-9120-2
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 22
        StartPage: 356
    Subjects:
      – SubjectFull: Real-time programming software
        Type: general
      – SubjectFull: Production scheduling
        Type: general
      – SubjectFull: Computer network access control software
        Type: general
      – SubjectFull: Computer scheduling
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Computer engineering
        Type: general
      – SubjectFull: Cache memory
        Type: general
      – SubjectFull: Computer input-output equipment
        Type: general
      – SubjectFull: Computer software
        Type: general
    Titles:
      – TitleFull: Sticky-ERfair: a task-processor affinity aware proportional fair scheduler.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Sarkar, Arnab
      – PersonEntity:
          Name:
            NameFull: Ghose, Sujoy
      – PersonEntity:
          Name:
            NameFull: Chakrabarti, P.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2011
              Type: published
              Y: 2011
          Identifiers:
            – Type: issn-print
              Value: 09226443
          Numbering:
            – Type: volume
              Value: 47
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Real-Time Systems
              Type: main
ResultId 1