View in EDS PDF Full Text

Amortized Efficiency of List Update and Paging Rules.

Saved in:
Bibliographic Details
Title: Amortized Efficiency of List Update and Paging Rules.
Authors: Sleator, Daniel D., Tarjan, Robert E., Horowitz, Ellis
Source: Communications of the ACM. Feb1985, Vol. 28 Issue 2, p202-208. 7p. 2 Diagrams.
Subjects: Paging (Computer science), Online algorithms
Abstract: Examines the amortized efficiency of list update and paging rules in system software. Efficiency of move-to-front rule; Properties of the transpose and frequency count rules; Complexity of the least recently used (LRU) replacement rule; Advantages of move-to-front rule over other online paging algorithm.
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5225485
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Amortized Efficiency of List Update and Paging Rules.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Sleator%2C+Daniel+D%2E%22">Sleator, Daniel D.</searchLink><br /><searchLink fieldCode="AR" term="%22Tarjan%2C+Robert+E%2E%22">Tarjan, Robert E.</searchLink><br /><searchLink fieldCode="AR" term="%22Horowitz%2C+Ellis%22">Horowitz, Ellis</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Feb1985, Vol. 28 Issue 2, p202-208. 7p. 2 Diagrams.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Paging+%28Computer+science%29%22">Paging (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Online+algorithms%22">Online algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Examines the amortized efficiency of list update and paging rules in system software. Efficiency of move-to-front rule; Properties of the transpose and frequency count rules; Complexity of the least recently used (LRU) replacement rule; Advantages of move-to-front rule over other online paging algorithm.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5225485
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/2786.2793
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 7
        StartPage: 202
    Subjects:
      – SubjectFull: Paging (Computer science)
        Type: general
      – SubjectFull: Online algorithms
        Type: general
    Titles:
      – TitleFull: Amortized Efficiency of List Update and Paging Rules.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Sleator, Daniel D.
      – PersonEntity:
          Name:
            NameFull: Tarjan, Robert E.
      – PersonEntity:
          Name:
            NameFull: Horowitz, Ellis
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb1985
              Type: published
              Y: 1985
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 28
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1