US5960178A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Queue system and method for point-to-point message passing having a separate table for storing message state and identifier of processor assigned to process the message
Assignee: Hanger Solutions LLC
•
Filing: 1997-08-08
•
Granted: 1999-09-28
•
Expires: 2017-08-08
Abstract
Abstract A queuing system and method to provide efficient and effective message communication between computers, processing devices, or network elements. The queue includes three tables. A message data table includes the message data. A message state table identifies several parameters about a message including a message time-stamp, state, and partition. The partition associates the message with a predetermined one of several message processors used to send and receive messages. Each message processor selects and sends only messages having a corresponding partition. The queue further includes a queued message table that lists all messages destined for a computer or other processing device that cannot receive messages. In this manner, failed messages in the queued table are taken out of a processing queue until the off-line computer or other processing device comes back on line.
Inventors
- 👤 Munir Cochinwala
- 👤 Kuo-Chu Lee
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 07:31
CPC Classifications
H; H04; H04M; H04M3/00; H04M3/42; H04M3/50; H04M3/53; H04M3/533
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
74 words
In a computer connected to one or more other computers and including one or more message processors for communicating with said one or more devices, a message queue, comprising: a first table to store message data; a second table to store information about each message, including a message state and a message partition, said message partition being an identifier to associate a message with a particular one of said one or more message processors.
Claim 2
Dependent Claim
74 words
In a computer connected to one or more other computers and including one or more message processors for communicating with said one or more devices, a message queue, comprising: a first table to store message data; a second table to store information about each message, including a message state and a message partition, said message partition being an identifier to associate a message with a particular one of said one or more message processors.
Claim 3
Dependent Claim
33 words
A message queue according to claim 1, further comprising a third table to store messages destined for said one or more other computers when communication fails with said one or more other computers.
Claim 4
Dependent Claim
85 words
A computer for communicating with one or more other computers, comprising: a plurality of message processors for sending and receiving messages to and from said one or more other computers; a first table to store message data; a second table to store information about each message, including a message state and a message partition, said message partition being an identifier to associate a message with a particular one of said one or more message processors; and a queue controller for assigning partitions to each message.
Claim 5
Dependent Claim
85 words
A computer for communicating with one or more other computers, comprising: a plurality of message processors for sending and receiving messages to and from said one or more other computers; a first table to store message data; a second table to store information about each message, including a message state and a message partition, said message partition being an identifier to associate a message with a particular one of said one or more message processors; and a queue controller for assigning partitions to each message.
Claim 6
Dependent Claim
32 words
A computer according to claim 3, further comprising a third table to store messages destined for said one or more other computers when communications fail with said one or more other computers.
Claim 7
Dependent Claim
60 words
In a computer, a method of processing messages to be sent to a destination computer, comprising the steps of: assigning a partition to a message; assigning said message to a first message table; creating an entry for said message in a second table, said entry including said partition and a state; selecting said message for transmission based on said partition.
Claim 8
Dependent Claim
60 words
In a computer, a method of processing messages to be sent to a destination computer, comprising the steps of: assigning a partition to a message; assigning said message to a first message table; creating an entry for said message in a second table, said entry including said partition and a state; selecting said message for transmission based on said partition.
Claim 9
Dependent Claim
45 words
A method according to claim 5, further comprising the steps of: building an entry for a third table when said message is destined for a computer that cannot receive messages; and setting the state for said message to a queued state in said second table.
Claim 10
Dependent Claim
94 words
In a computer having a plurality of message processors for communicating with other computers, a method, executed by each message processor, of processing messages to be sent to another computer, comprising the steps of: selecting only messages having a partition corresponding to said message processor, said partition being an identifier to associate each message to one of said plurality of message processors; transmitting said message to a destination computer; and assigning a message to a table if said destination computer cannot receive said message, said table identifying all messages that could not be sent.
Claim 11
Dependent Claim
94 words
In a computer having a plurality of message processors for communicating with other computers, a method, executed by each message processor, of processing messages to be sent to another computer, comprising the steps of: selecting only messages having a partition corresponding to said message processor, said partition being an identifier to associate each message to one of said plurality of message processors; transmitting said message to a destination computer; and assigning a message to a table if said destination computer cannot receive said message, said table identifying all messages that could not be sent.
References Cited (Backward Citations)
US5428781A
Cited
US5507032A
Cited
US5592672A
Cited
US5696809A
Cited
US5644575A
Cited
US5692033A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-09-27 | 2003-03-29 | 2003-09-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-09-27 | 2007-03-29 | 2007-09-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-09-27 | 2011-03-29 | 2011-09-28 | $7700.00 | Window Closed / Lapsed |