Buffer chaining

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 300

Patent

active

040400379

ABSTRACT:
In a data processing system allocation of excessive main/working storage space to sequential input records (input blocks) of indeterminate length frequently results in wasteful fragmentation. This is avoided by the present invention. An input-output channel of conventional construction is modified so that in chaining mode it (the channel) can operate optionally to: (1) transfer sequential input data blocks of unspecified length into contiguous positions in main storage, and (2) without CPU interruption/intervention store delimiting information, in storage locations containing Channel Command Words (CCW's) designating respective transfers, which effectively distinguishes storage boundaries between adjacent blocks. The storage of delimiting information effectively relieves the control and application programs of the central system of responsibility for analyzing the information context of the data in each block for "possibly obscure" delimiting intelligence. The foregoing routing and delimiting operations may be made entirely transparent to the peripheral attachment interface of the channel so that peripheral attachment is not complicated.

REFERENCES:
patent: 3488633 (1970-01-01), King et al.
patent: 3688274 (1972-08-01), Cormier et al.
patent: 3725864 (1973-04-01), Clark et al.
patent: 3728693 (1973-04-01), Macker et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Buffer chaining does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Buffer chaining, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Buffer chaining will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2303408

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.