View in EDS PDF Full Text

A Processor Allocation Method for Time-Sharing.

Saved in:
Bibliographic Details
Title: A Processor Allocation Method for Time-Sharing.
Authors: Randell, B., Mullery, A. P.1, Driscoll, G. C.1
Source: Communications of the ACM. Jan1970, Vol. 13 Issue 1, p10-14. 5p. 3 Diagrams, 1 Chart.
Subjects: Time-sharing computer systems, Macro processors, Algorithms, Algebra, Resource allocation, Dynamic programming
Abstract: A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce over-head. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for efficiently handling dynamically changing segmented lists. [ABSTRACT FROM AUTHOR]
Copyright of Communications of the ACM is the property of Association for Computing Machinery 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 Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5377567
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Processor Allocation Method for Time-Sharing.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Randell%2C+B%2E%22">Randell, B.</searchLink><br /><searchLink fieldCode="AR" term="%22Mullery%2C+A%2E+P%2E%22">Mullery, A. P.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Driscoll%2C+G%2E+C%2E%22">Driscoll, G. C.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Jan1970, Vol. 13 Issue 1, p10-14. 5p. 3 Diagrams, 1 Chart.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Time-sharing+computer+systems%22">Time-sharing computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Macro+processors%22">Macro processors</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Algebra%22">Algebra</searchLink><br /><searchLink fieldCode="DE" term="%22Resource+allocation%22">Resource allocation</searchLink><br /><searchLink fieldCode="DE" term="%22Dynamic+programming%22">Dynamic programming</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce over-head. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for efficiently handling dynamically changing segmented lists. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery 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=5377567
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 5
        StartPage: 10
    Subjects:
      – SubjectFull: Time-sharing computer systems
        Type: general
      – SubjectFull: Macro processors
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Algebra
        Type: general
      – SubjectFull: Resource allocation
        Type: general
      – SubjectFull: Dynamic programming
        Type: general
    Titles:
      – TitleFull: A Processor Allocation Method for Time-Sharing.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Randell, B.
      – PersonEntity:
          Name:
            NameFull: Mullery, A. P.
      – PersonEntity:
          Name:
            NameFull: Driscoll, G. C.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan1970
              Type: published
              Y: 1970
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 13
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1