List Processing in Real Time on a Serial Computer.

Saved in:
Bibliographic Details
Title: List Processing in Real Time on a Serial Computer.
Authors: Baker, Jr., Henry G.1
Source: Communications of the ACM. Apr1978, Vol. 21 Issue 4, p280-294. 15p.
Subjects: List processing (Electronic computers), Electronic data processing, Computer programming, Electronic file management, Database management, Real-time programming
Abstract: This article focuses on problems related to classical list processing techniques. Using the method given in the article, a computer could have list processing primitives built in as machine instructions and the programmer would still be assured that each instruction would finish in a reasonable amount of time. A real-time list processing system has the property that the time required by each of the elementary operations is bounded by a constant independent of the number of cells in use. This property does not guarantee that the constant will be small enough for a particular application on a particular computer, and hence has been called "pseudo-real-time" by some. In all but the most demanding applications, the proper choice of hardware can reduce the constants to acceptable values. The model described in the article consists of a memory, that is, a one-dimensional array of words, each of which is large enough to hold the representation of a non-negative integer which is an index into that array; and a central processing unit, which has a small fixed number of registers the size of a word.
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5243674
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: List Processing in Real Time on a Serial Computer.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Baker%2C+Jr%2E%2C+Henry+G%2E%22">Baker, Jr., Henry G.</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>. Apr1978, Vol. 21 Issue 4, p280-294. 15p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22List+processing+%28Electronic+computers%29%22">List processing (Electronic computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+file+management%22">Electronic file management</searchLink><br /><searchLink fieldCode="DE" term="%22Database+management%22">Database management</searchLink><br /><searchLink fieldCode="DE" term="%22Real-time+programming%22">Real-time programming</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This article focuses on problems related to classical list processing techniques. Using the method given in the article, a computer could have list processing primitives built in as machine instructions and the programmer would still be assured that each instruction would finish in a reasonable amount of time. A real-time list processing system has the property that the time required by each of the elementary operations is bounded by a constant independent of the number of cells in use. This property does not guarantee that the constant will be small enough for a particular application on a particular computer, and hence has been called "pseudo-real-time" by some. In all but the most demanding applications, the proper choice of hardware can reduce the constants to acceptable values. The model described in the article consists of a memory, that is, a one-dimensional array of words, each of which is large enough to hold the representation of a non-negative integer which is an index into that array; and a central processing unit, which has a small fixed number of registers the size of a word.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5243674
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/359460.359470
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 280
    Subjects:
      – SubjectFull: List processing (Electronic computers)
        Type: general
      – SubjectFull: Electronic data processing
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Electronic file management
        Type: general
      – SubjectFull: Database management
        Type: general
      – SubjectFull: Real-time programming
        Type: general
    Titles:
      – TitleFull: List Processing in Real Time on a Serial Computer.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Baker, Jr., Henry G.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr1978
              Type: published
              Y: 1978
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 21
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1