公开(公告)号：CA1087755A

公开(公告)日：1980-10-14

申请号：CA277083

申请日：1977-04-25

Applicant: IBM

Inventor： CHEN TIEN C ,  ESWARAN KAPALI P ,  LUM VINCENT Y ,  TUNG CHIN

IPC: G11C11/14 ,  G06F7/24 ,  G11C19/00 ,  G11C19/08 ,  G06F7/36 ,  G06F13/00 ,  G11C11/02

Abstract: AN APPARATUS FOR TRANSPOSITION SORTING OF EQUAL LENGTH RECORDS IN OVERLAP RELATION WITH RECORD LOADING AND EXTRACTION An apparatus for sorting of equal length records with the sorting time maximally overlapped by the time taken for loading and unloading of records. The minimal structure consists of a decision mechanism linked to and associated with a network of ladder structures. The activity within the network is so synchronized that the sorting activity in most ladders occurs while some ladder within the network is still undergoing the loading of input data; and during the unloading phase, the individually sorted data from each ladder are merged concurrently to produce a sequence of sorted records. The overlap between sorting and loading varies from 0 for records requiring no loading/unloading, to 100% for multi-ladder networks with loading/unloading.

公开(公告)号：DE2750400A1

公开(公告)日：1978-06-01

申请号：DE2750400

申请日：1977-11-11

Applicant: IBM

Inventor： CHEN TIEN CHI ,  TUNG CHIN ,  LUM VINCENT Y

IPC: G06F7/22 ,  G06F7/06

公开(公告)号：FR2372470A1

公开(公告)日：1978-06-23

申请号：FR7731534

申请日：1977-10-07

Applicant: IBM

Inventor： CHEN TIEN CHI ,  TUNG CHIN ,  LUM VINCENT Y

IPC: G06F7/22

公开(公告)号：FR2351452A1

公开(公告)日：1977-12-09

申请号：FR7711168

申请日：1977-04-05

Applicant: IBM

Inventor： CHEN TIEN C ,  ESWARAN KAPALI P ,  LUM VINCENT Y ,  TUNG CHIN

IPC: G11C11/14 ,  G06F7/24 ,  G11C19/00 ,  G11C19/08 ,  G06F7/04

Abstract: An apparatus for sorting of equal length records with the sorting time maximally overlapped by the time taken for loading and unloading of records. The minimal structure consists of a decision mechanism linked to and associated with a network of ladder structures. The activity within the network is so synchronized that the sorting activity in most ladders occurs while some ladder within the network is still undergoing the loading of input data; and during the unloading phase, the individually sorted data from each ladder are merged concurrently to produce a sequence of sorted records. The overlap between sorting and loading varies from 0 for records requiring no loading/unloading, to 100% for multi-ladder networks with loading/unloading.