View in EDS PDF Full Text

Sorting on a Mesh-Connected Parallel Computer.

Saved in:
Bibliographic Details
Title: Sorting on a Mesh-Connected Parallel Computer.
Authors: Thompson, C.D., Kung, H.T., Manacher, G., Graham, S.L.
Source: Communications of the ACM. Apr1977, Vol. 20 Issue 4, p263-271. 9p. 13 Diagrams.
Subjects: Algorithms, Sorting (Electronic computers), Parallel computers
Abstract: Presents the algorithms for sorting the n[sup 2] elements on an n X n mesh-connected processor array requiring O (n) routing and comparison steps. Characteristics of the algorithms; Application of the algorithms for ILLIAC IV-type parallel computers; Development of efficient sorting algorithms for interconnection patterns; Concept of sorting problem.
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5495649
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Sorting on a Mesh-Connected Parallel Computer.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Thompson%2C+C%2ED%2E%22">Thompson, C.D.</searchLink><br /><searchLink fieldCode="AR" term="%22Kung%2C+H%2ET%2E%22">Kung, H.T.</searchLink><br /><searchLink fieldCode="AR" term="%22Manacher%2C+G%2E%22">Manacher, G.</searchLink><br /><searchLink fieldCode="AR" term="%22Graham%2C+S%2EL%2E%22">Graham, S.L.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Apr1977, Vol. 20 Issue 4, p263-271. 9p. 13 Diagrams.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Sorting+%28Electronic+computers%29%22">Sorting (Electronic computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+computers%22">Parallel computers</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Presents the algorithms for sorting the n[sup 2] elements on an n X n mesh-connected processor array requiring O (n) routing and comparison steps. Characteristics of the algorithms; Application of the algorithms for ILLIAC IV-type parallel computers; Development of efficient sorting algorithms for interconnection patterns; Concept of sorting problem.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5495649
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1145/359461.359481
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 9
        StartPage: 263
    Subjects:
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Sorting (Electronic computers)
        Type: general
      – SubjectFull: Parallel computers
        Type: general
    Titles:
      – TitleFull: Sorting on a Mesh-Connected Parallel Computer.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Thompson, C.D.
      – PersonEntity:
          Name:
            NameFull: Kung, H.T.
      – PersonEntity:
          Name:
            NameFull: Manacher, G.
      – PersonEntity:
          Name:
            NameFull: Graham, S.L.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr1977
              Type: published
              Y: 1977
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 20
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1