US5218713A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Distributed data management mechanism for handling a data stream
Assignee: International Business Machines Corp
•
Filing: 1991-06-07
•
Granted: 1993-06-08
•
Expires: 2011-06-07
Abstract
Abstract A data management mechanism for a processor system provides for management of data with minimum data transfer between processes executing work requests. Each process has storage areas for storing data associated with work requests. The data is described with descriptor elements in the work requests which indicate the location and length of segments of the data. Data is transferred to a process only if it is required for execution of a work request. Further work requests can be generated by a process executing a work request which reference the data without the process actually receiving the data The segments of data may reside in storage areas of different processors with the descriptor elements of a work request defining a logical data stream.
Inventors
- 👤 William E. Hammer
- 👤 Walter H. Schwane
- 👤 Frederick J. Ziecina
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 17:31
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/544; H; H04; H04L; H04L69/00
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
138 words
Apparatus for handling a fragmented data stream in a loosely coupled distributed multiprocessor system including a plurality of processors, having a plurality of processes distributed about the multiprocessor system for executing work requests, said processors each having a memory containing multiple locations for storage of data, said apparatus for handling a fragmented data stream comprising: means for storing a plurality of pieces of data constituting the fragmented data stream non-contiguously at different locations of memories associated with at least two of the processors; means for generating descriptors for describing the locations and lengths of the pieces of data, said descriptors identifying where to access individual pieces of data; means for combining said descriptors to form a data structure representing said fragmented data stream; and means for transferring said data structure between processes separately from the pieces of data.
Claim 2
Dependent Claim
138 words
Apparatus for handling a fragmented data stream in a loosely coupled distributed multiprocessor system including a plurality of processors, having a plurality of processes distributed about the multiprocessor system for executing work requests, said processors each having a memory containing multiple locations for storage of data, said apparatus for handling a fragmented data stream comprising: means for storing a plurality of pieces of data constituting the fragmented data stream non-contiguously at different locations of memories associated with at least two of the processors; means for generating descriptors for describing the locations and lengths of the pieces of data, said descriptors identifying where to access individual pieces of data; means for combining said descriptors to form a data structure representing said fragmented data stream; and means for transferring said data structure between processes separately from the pieces of data.
Claim 3
Dependent Claim
74 words
The apparatus for handling a fragmented data stream of claim 1, further comprising: means for a process executing on a first one of said processors to selectively access one of said pieces of data using a descriptor identifying where to access said selectively accessed piece of data, said selectively accessed piece of data being stored in a memory contained in a second one of said plurality of processors, without accessing other pieces of data.
Claim 4
Dependent Claim
42 words
The apparatus for handling a fragmented data stream of claim 1, further comprising: means for editing said data structure without accessing said pieces of data, thereby editing the fragmented data stream represented by said data structure without editing said pieces of data.
Claim 5
Dependent Claim
63 words
The apparatus for handling a fragmented data stream of claim 1, further comprising: means for a process executing on a first one of said processors to generate a first work request, said work request comprising a first data structure representing a first fragmented data stream, wherein the descriptors forming said first data structure define all of the data associated with the work request.
Claim 6
Dependent Claim
63 words
The apparatus for handling a fragmented data stream of claim 4, further comprising: means for a process executing said first work request on a second one of said processors to generate a second work request, said second work request comprising a second data structure representing a second fragmented data stream, said second data structure containing a descriptor contained in said first data structure.
Claim 7
Dependent Claim
35 words
The apparatus for handling a fragmented data stream of claim 5, wherein said second processor does not receive the data described by said descriptor contained in said first data structure and said second data structure.
Claim 8
Dependent Claim
98 words
multiprocess computer system, comprising: a plurality of process owned storages; a plurality of pieces of data stored in various locations, said locations being in more than one of said storages; a logical representation of a data stream, said data stream being defined by said logical representation and consisting of said plurality of pieces of data as if concatenated together; and means for processes running on said multi-process computer system to manipulate said logical representation of said data stream without accessing said pieces of data, such that said processes manipulate said data stream without accessing said pieces of data.
Claim 9
Dependent Claim
98 words
multiprocess computer system, comprising: a plurality of process owned storages; a plurality of pieces of data stored in various locations, said locations being in more than one of said storages; a logical representation of a data stream, said data stream being defined by said logical representation and consisting of said plurality of pieces of data as if concatenated together; and means for processes running on said multi-process computer system to manipulate said logical representation of said data stream without accessing said pieces of data, such that said processes manipulate said data stream without accessing said pieces of data.
Claim 10
Dependent Claim
29 words
The multiprocess computer system of claim 7, further comprising: means for transferring said logical representation of a data stream between processes without transferring said plurality of pieces of data.
Claim 11
Dependent Claim
56 words
The multiprocess computer system of claim 7, further comprising: means for a first process running on said multiprocess computer system to selectively access one of said pieces of data, said selectively accessed piece of data being stored in a storage owned by a second process running on said multi-process system, without accessing other pieces of data.
Claim 12
Dependent Claim
29 words
The multiprocess computer system of claim 9, further comprising: means for transferring said logical representation of a data stream between processes without transferring said plurality of pieces of data.
Claim 13
Dependent Claim
47 words
The multiprocess computer system of claim 7, wherein the logical representation comprises a plurality of descriptor elements, each descriptor element further comprising: a storage address indicating a beginning in storage of a piece of data; and a length value, indicating a length of the piece of data.
Claim 14
Dependent Claim
28 words
The multiprocess computer system of claim 11, wherein at least one of the descriptor elements comprises an address which identifies the storage containing a desired piece of data.
References Cited (Backward Citations)
US4330822A
Cited
US3938096A
Cited
US4369494A
Cited
US4285040A
Cited
JPS5660933A
Cited
US4466063A
Cited
US4430699A
Cited
US4432057A
Cited
US4543627A
Cited
US4539637A
Cited
US4543626A
Cited
US4649473A
Cited
US4937737A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-06-07 | 1996-12-07 | 1997-06-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-06-07 | 2000-12-07 | 2001-06-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-06-07 | 2004-12-07 | 2005-06-08 | $7700.00 | Window Closed / Lapsed |