Patent US4410632A successfully refreshed from Google Patents.
US5339418A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Message passing method
Assignee: Hewlett Packard Development Co LP
•
Filing: 1993-12-16
•
Granted: 1994-08-16
•
Expires: 2013-12-16
Abstract
Abstract An apparatus is provided for passing respective messages from at least one writer process to multiple respective readers processes comprising: a storage buffer for storing a sequence of respective messages; and an access mechanism for providing respective multiple points of access for the respective reader processes to the sequence of respective messages; wherein for each of the multiple points of access, the access mechanism sequentially provides access to the respective messages of the sequence.
Inventors
- 👤 Jeffrey A. East
- 👤 Marilyn E. Fries
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 06:48
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/54; G06F9/542; G06F9/546
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
289 words
A method of storing and distributing messages in a data processing system, the steps of the method performed by said data processing system, comprising: establishing a message queue that stores messages in a computer memory in an order sequence, said message queue having a beginning and an end; providing a multiplicity of reader interfaces to said message queue, each reader interface accessing all the messages stored in said message queue in sequence starting at the beginning of said message queue, such that each message stored in said message queue is accessed only once by each reader interface, running at least one writer process, said at least one writer process generating messages; storing each message generated by said at least one writer process at the end of said message queue; running a multiplicity of reader processes; coupling each reader process to one of said multiplicity of reader interfaces such that each reader interface is coupled to at least one of said reader processes; each reader process prompting the reader interface coupled thereto to access a next one of said messages in said message queue and to pass a copy thereof to said reader process; and each reader interface, in response to said prompting by said at least one reader process coupled thereto, passing a copy of a next one of said messages stored in said message queue to a reader process coupled to said reader interface that first prompts said reader interface, and then preventing access to said next one of said messages by any other reader processes coupled to said reader interface, such that each message stored in said message queue is accessed by exactly one of said at least one reader processes coupled to each said reader interface.
Claim 2
Independent Claim
289 words
A method of storing and distributing messages in a data processing system, the steps of the method performed by said data processing system, comprising: establishing a message queue that stores messages in a computer memory in an order sequence, said message queue having a beginning and an end; providing a multiplicity of reader interfaces to said message queue, each reader interface accessing all the messages stored in said message queue in sequence starting at the beginning of said message queue, such that each message stored in said message queue is accessed only once by each reader interface, running at least one writer process, said at least one writer process generating messages; storing each message generated by said at least one writer process at the end of said message queue; running a multiplicity of reader processes; coupling each reader process to one of said multiplicity of reader interfaces such that each reader interface is coupled to at least one of said reader processes; each reader process prompting the reader interface coupled thereto to access a next one of said messages in said message queue and to pass a copy thereof to said reader process; and each reader interface, in response to said prompting by said at least one reader process coupled thereto, passing a copy of a next one of said messages stored in said message queue to a reader process coupled to said reader interface that first prompts said reader interface, and then preventing access to said next one of said messages by any other reader processes coupled to said reader interface, such that each message stored in said message queue is accessed by exactly one of said at least one reader processes coupled to each said reader interface.
Claim 3
Dependent Claim
83 words
The method of claim 1, further characterized by said data processing system performing the steps of: storing in said computer memory data representing the total number of said multiplicity of reader interfaces; recording in said computer memory data corresponding to the number of accesses to each message of said message queue; deleting a first message at the beginning of said message queue when said first message has been accessed a number of times equal to the number of said multiplicity of reader interfaces.
Claim 4
Dependent Claim
132 words
The method of claim 2, further characterized by said data processing system performing the steps of: storing in said computer memory a respective message type identifier for each respective message stored in said message queue; storing in said computer memory, for at least one said reader interface, a respective filter definition denoting one or more of said message type identifiers; screening each one of said messages in said message queue accessed by said at least one reader interface having a respective stored filter definition to determine whether said message type identifier matches said stored filter definition; and passing a copy of said one accessed message to said at least one reader process coupled thereto only when said one accessed message has a stored message type identifier matching said respective stored filter definition.
Claim 5
Dependent Claim
123 words
The method of claim 1, further characterized by said data processing system performing the steps of: storing a respective message type identifier for each respective message stored in said message queue; storing, for at least one said reader interface, a respective filter definition denoting one or more of said message type identifiers; screening each one of said messages in said message queue accessed by said at least one reader interface having a respective stored filter definition to determine whether said message type identifier matches said stored filter definition; passing a copy of said one accessed message to said at least one reader process coupled thereto only when said one accessed message has a stored message type identifier matching said respective stored filter definition.
Claim 6
Dependent Claim
105 words
The method of claim 4, further characterized by said data processing system performing the steps of: storing in said computer memory a count value for each respective message stored in said message queue, said stored count value indicating a maximum number of times that said respective message can be accessed; whenever any one of said multiplicity of reader interfaces accesses one of said messages stored in said message queue, decrementing said count value stored for said one accessed message; and deleting each respective message stored in said message queue when said count value stored for said respective message is decremented to a value of zero.
Claim 7
Dependent Claim
105 words
The method of claim 1, further characterized by said data processing system performing the steps of: storing in said computer memory a count value for each respective message stored in said message queue, said stored count value indicating a maximum number of times that said respective message can be accessed; whenever any one of said multiplicity of reader interfaces accesses one of said messages stored in said message queue, decrementing said count value stored for said one accessed message; and deleting each respective message stored in said message queue when said count value stored for said respective message is decremented to a value of zero.
Claim 8
Dependent Claim
23 words
The method of claim 1, wherein said coupling step includes coupling a plurality of said reader processes to one of said reader interfaces.
Claim 9
Dependent Claim
23 words
The method of claim 3, wherein said coupling step includes coupling a plurality of said reader processes to one of said reader interfaces.
Claim 10
Dependent Claim
23 words
The method of claim 5, wherein said coupling step includes coupling a plurality of said reader processes to one of said reader interfaces.
References Cited (Backward Citations)
US4369494A
Cited
US4320455A
Cited
US4412285A
Cited
US4486853A
Cited
US4482956A
Cited
US4590554A
Cited
US4615002A
Cited
US4630196A
Cited
US4769771A
Cited
US4615001A
Cited
US4713758A
Cited
US4694396A
Cited
US4660144A
Cited
US4649473A
Cited
US4905138A
Cited
US5060150A
Cited
US5051891A
Cited
US5047977A
Cited
US5023772A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-08-15 | 1998-02-14 | 1998-08-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-08-15 | 2002-02-14 | 2002-08-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-08-15 | 2006-02-14 | 2006-08-16 | $7700.00 | Window Closed / Lapsed |