US4400793A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and arrangement for fast access to CCD-stores
Assignee: International Business Machines Corp
•
Filing: 1982-02-19
•
Granted: 1983-08-23
•
Expires: 2002-02-19
Abstract
Abstract To reduce the mean access time to storage blocks in CCD storage, a block which is most likely to be accessed next is detected after each access. While the accessed block is being processed, a selected block is moved at the high cyclic speed of the CCD storage to a shift position, and the CCD storage is then switched to the low speed. The distance of the shift position from a read/write position is such that it can be covered by the selected block at low speed within the mean time between two accesses to the CCD storage. At the time of the next access, the selected block is very likely to be close to the read/write position. In systems with virtual addressing, the block with the next virtual address would be the selected block. In other layouts, the access sequences to the CCD blocks are stored and are subsequently used to select the block which is most likely to be accessed next.
Inventors
- 👤 Claus Schuenemann
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 01:58
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G11; G11C; G11C19/00; G11C19/28; G11C19/287
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
249 words
The method of transfer of units of data between a random access storage and a slower cyclic storage which operates at a fast cyclic speed when it is accessed for transfer of data and a slow cyclic speed when it is not so accessed and which stores each of a plurality of units of data in a separate one of a plurality of storage locations that move passed the accessing point in series comprising, (a) arranging data units in the cyclic store so that units of data that follow each other in the expected accessing sequence are not in adjacent storage locations but are separated from one another by at least one other storage location containing another unit of data so as to place the unit of data expected to be accessed next where it can be reached at the slower cyclic speed in the mean time between two accesses, (b) recording an actual accessing sequence of the units of data, (c) operating the cyclic memory at the fast cyclic speed between accesses until the unit of data occurring next the recorded actual accessing sequence is moved to a position where it can be reached at the slow cyclic speed in the mean time between two accesses, (d) operating the cyclic memory at the slow cyclic speed after step c and until the next access and (e) operating the memory at the fast cyclic speed while the unit of data requested by said next access approaches the accessing point.
Claim 2
Independent Claim
249 words
The method of transfer of units of data between a random access storage and a slower cyclic storage which operates at a fast cyclic speed when it is accessed for transfer of data and a slow cyclic speed when it is not so accessed and which stores each of a plurality of units of data in a separate one of a plurality of storage locations that move passed the accessing point in series comprising, (a) arranging data units in the cyclic store so that units of data that follow each other in the expected accessing sequence are not in adjacent storage locations but are separated from one another by at least one other storage location containing another unit of data so as to place the unit of data expected to be accessed next where it can be reached at the slower cyclic speed in the mean time between two accesses, (b) recording an actual accessing sequence of the units of data, (c) operating the cyclic memory at the fast cyclic speed between accesses until the unit of data occurring next the recorded actual accessing sequence is moved to a position where it can be reached at the slow cyclic speed in the mean time between two accesses, (d) operating the cyclic memory at the slow cyclic speed after step c and until the next access and (e) operating the memory at the fast cyclic speed while the unit of data requested by said next access approaches the accessing point.
Claim 3
Dependent Claim
18 words
The method of claim 1 wherein said expected accessing sequence is in the ascending order of virtual addresses.
Claim 4
Dependent Claim
47 words
The method of claim 2 where data units are transferred into the cyclic storage from a third bulk storage by a modified least recently used algorithm that replaces that one of a number of least recently used units of data that least disturbs said expected accessing sequence.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1986-08-22 | 1987-02-21 | 1987-08-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-08-22 | 1991-02-21 | 1991-08-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-08-22 | 1995-02-21 | 1995-08-23 | $7700.00 | Window Closed / Lapsed |