US4653048A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for interprocessor message accountability
Assignee: AT&T Inc
•
Filing: 1984-05-14
•
Granted: 1987-03-24
•
Expires: 2004-05-14
Abstract
Abstract A method and apparatus are used for accounting for last and out-of-sequence interprocessor messages in a multiprocessor telephone switching system. Each message is assigned a sequence number by the sending processor. Upon reception of messages, the receiving processor analyzes the sequence numbers to ascertain their proper order and if any messages are missing. The identities of missing messages are entered in a table which is periodically updated.
Inventors
- 👤 Lewis G. Anderson
- 👤 Wen Ku
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 04:19
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0407
Claims Analysis
Total Claims: 16
Claim 1
Independent Claim
134 words
A method of accounting for lost and out-of-sequence messages transmitted between processors in a multiprocessor system comprising the steps of appending to each message at the sending processor a sequence number selected from a modulo N series of numbers, where N is a positive integer, computing at the receiving processor a minimum distance between the currently received sequence number and the last received sequence number, ascertaining at the receiving processor whether the currently received sequence number is ahead of or behind the last received sequence number in response to said minimum distance, and recording in a first memory of the receiving processor all sequence numbers that are missing between the last received sequence number and the currently received sequence number when the currently received sequence number is ahead of the last received sequence number.
Claim 2
Independent Claim
134 words
A method of accounting for lost and out-of-sequence messages transmitted between processors in a multiprocessor system comprising the steps of appending to each message at the sending processor a sequence number selected from a modulo N series of numbers, where N is a positive integer, computing at the receiving processor a minimum distance between the currently received sequence number and the last received sequence number, ascertaining at the receiving processor whether the currently received sequence number is ahead of or behind the last received sequence number in response to said minimum distance, and recording in a first memory of the receiving processor all sequence numbers that are missing between the last received sequence number and the currently received sequence number when the currently received sequence number is ahead of the last received sequence number.
Claim 3
Dependent Claim
44 words
The invention set forth in claim 1 further comprising the step of deleting from said first memory the currently received sequence number when the currently received sequence number has been previously recorded in said first memory and is behind the last received sequence number.
Claim 4
Dependent Claim
37 words
The invention set forth in claim 1 or 2 wherein the step of computing the minimum distance comprises the step of summing the currently received sequence number with the N's complement of the last received sequence number.
Claim 5
Dependent Claim
58 words
The invention set forth in claim 3 wherein the step of ascertaining whether the currently received sequence number is ahead of or behind the last received sequence number comprises comparing the sum of the currently received sequence number and the N's complement of the last received sequence number with a constant D, where D is a positive integer.
Claim 6
Dependent Claim
48 words
The invention set forth in claim 4 wherein the step of recording the missing sequence numbers in said first memory is activated when the sum of the currently received sequence number and the N's complement of the last received sequence number is less than the value of D.
Claim 7
Dependent Claim
44 words
The invention set forth in claim 5 wherein the step of deleting sequence numbers from said first memory is actuated when the sum of the currently received sequence number and the N's complement of the last received sequence number exceeds the value of D.
Claim 8
Independent Claim
151 words
A method of accounting for lost and out-of-sequence messages transmitted between processors in a multiprocessor system comprising the steps of appending to each message at the sending processor a sequence number selected from a modulo N series of numbers, where N is a positive integer, computing a minimum distance between two adjacently received sequence numbers at the receiving processor, ascertaining at the receiving processor which of the two adjacently received sequence numbers is ahead in response to said minimum distance, recording in a first memory of the receiving processor all sequence numbers missing between the two sequence numbers when the most recently received sequence number is ahead of the other received sequence number, and deleting from said first memory the most recently received sequence number when the most recently received sequence number has been previously recorded in said first memory and is behind the other of the two received sequence numbers.
Claim 9
Independent Claim
151 words
A method of accounting for lost and out-of-sequence messages transmitted between processors in a multiprocessor system comprising the steps of appending to each message at the sending processor a sequence number selected from a modulo N series of numbers, where N is a positive integer, computing a minimum distance between two adjacently received sequence numbers at the receiving processor, ascertaining at the receiving processor which of the two adjacently received sequence numbers is ahead in response to said minimum distance, recording in a first memory of the receiving processor all sequence numbers missing between the two sequence numbers when the most recently received sequence number is ahead of the other received sequence number, and deleting from said first memory the most recently received sequence number when the most recently received sequence number has been previously recorded in said first memory and is behind the other of the two received sequence numbers.
Claim 10
Dependent Claim
36 words
The invention set forth in claim 7 wherein the step of computing the minimum distance comprises the step of summing the most recently received sequence number with the N's complement of the other received sequence number.
Claim 11
Dependent Claim
55 words
The invention set forth in claim 8 wherein the step of ascertaining which of the two adjacently received sequence numbers is ahead comprises the step of comparing said sum and the N's complement of said sum to a constant D, where D is a positive integer defining the maximum permissible distance between adjacently received messages.
Claim 12
Dependent Claim
24 words
The invention set forth in claim 9 wherein the step of recording all missing messages is activated when said sum is less than D.
Claim 13
Dependent Claim
33 words
The invention set forth in claim 10 wherein the step of deleting from said first memory is activated when said sum and the N's complement of said sum are both less than D.
Claim 14
Dependent Claim
43 words
The invention set forth in claim 11 further comprising the step of blocking the activation of recording all missing messages in said first memory when both said sum and the N's complement of said sum are greater than D and less than N.
Claim 15
Dependent Claim
43 words
The invention set forth in claim 12 wherein the step of blocking comprises the step of entering the most recently received sequence number in a second memory if the most recently received sequence number has not been priorly recorded in said first memory.
Claim 16
Dependent Claim
42 words
The invention set forth in claim 1 or 7 further comprising the step of periodically examining said first memory and deleting from said first memory those entries that have been in said first memory in excess of a prescribed interval of time.
References Cited (Backward Citations)
US4398290A
Cited
US4439859A
Cited
US4564900A
Cited
US4530051A
Cited
US4519068A
Cited
US4551834A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-03-23 | 1990-09-22 | 1991-03-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-03-23 | 1994-09-22 | 1995-03-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-03-23 | 1998-09-22 | 1999-03-24 | $7700.00 | Window Closed / Lapsed |