← Back to Patent Explorer
US3623019A Expired / Lapsed US ⏱️ 0.0 years remaining

Programmed time-out monitoring arrangement using map timing

Assignee: AT&T Inc
•
Filing: 1969-11-26
•
Granted: 1971-11-23
•
Expires: 1989-11-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Multiple, multistation, data lines are independently operable when polling the stations on each line to determine their readiness for communication. Each polling interrogation signal applied to a line causes the storage of a line-timing status bit in one of two duplicate memories in a supervising office. Each such memory contains one bit location per data communication line. Upon the occurrence of a station response to the interrogation, the timing status bit for the corresponding line is erased from memory. The two memories are alternately utilized for receiving timing bits during recurrent periods which are equal to a minimum allowable timeout interval for a station. Prior to each such use, a memory is scanned to detect any timing bits persisting therein and thereby indicating a timeout condition on the corresponding line. Such a condition further indicates a need for a special control routine for the timed out station. Both apparatus and program embodiments of the invention are disclosed.

Inventors

  • 👤 George S Groth

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-22 18:00
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/42; H04Q3/54; H04Q3/545; H04Q3/54575; H04Q3/54591; G; G06; G06F; G06F13/00; G06F13/14; G06F13/20; G06F13/22; H04L; H04L12/00; H04L12/50

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 142 words
A method for monitoring circuits for timeout of a predetermined interval after a first signal event and without occurrence of a second signal event, said method comprising the steps of initiating a request for a timing operation at the time of each said first event, storing a timing request indication as an information bit in a first of at least two memory sectors on the occurrence of said first signal event, erasing said indication on the occurrence of said second signal event before timeout, cyclically steering timing requests to a different one of said sectors at the end of each time period of duration equal to said interval, and in conjunction with each steering of said requests to a new sector, examining such sector to identify with one of said circuits, and to erase, any timing request indication remaining in such sector.
Claim 2
Independent Claim 142 words
A method for monitoring circuits for timeout of a predetermined interval after a first signal event and without occurrence of a second signal event, said method comprising the steps of initiating a request for a timing operation at the time of each said first event, storing a timing request indication as an information bit in a first of at least two memory sectors on the occurrence of said first signal event, erasing said indication on the occurrence of said second signal event before timeout, cyclically steering timing requests to a different one of said sectors at the end of each time period of duration equal to said interval, and in conjunction with each steering of said requests to a new sector, examining such sector to identify with one of said circuits, and to erase, any timing request indication remaining in such sector.
Claim 3
Dependent Claim 103 words
The method in accordance with claim 1 in which said indication-erasing step comprises the substeps of translating an identification number for a circuit, upon which said second signal event has occurred, into a corresponding word and bit location in said memory sectors, fetching information stored at said word location in said first sector, providing a mask with only a single bit of a predetermined bit type, performing a logical AND operation with said mask and said information, replacing said information in aid first sector, and repeating said fetching, mask-providing, and AND-performing substeps for information stored in each other one of said memory sectors.
Claim 4
Dependent Claim 93 words
The method in accordance with claim 1 in which said request indicating step comprises the substeps of translating an identification number for a circuit to be monitored into a corresponding word and bit location in said memory sectors, fetching information stored at said word location in said first sector, providing a mask with only a single bit of a predetermined bit type in said bit location, and insertion-masking said information into said first sector using said mask to set said bit type in said bit location without disturbing the remainder of said information.
Claim 5
Dependent Claim 89 words
The method in accordance with claim 1 in which said steering step comprises the substeps of providing a program pointer for indicating to which of said sectors timing requests are to be steered, cyclically changing said pointer to indicate different ones of said sectors in a predetermined sequence of sectors, fetching from a sector indicated by said pointer all information stored therein in a predetermined sequence of memory words, and for each of said words, identifying the position therein of any bits indicating the presence of a timing request.
Claim 6
Independent Claim 87 words
A method for using memory for monitoring timeout of a plurality of functions to determine whether or not each function is completed within at least a predetermined minimum timeout period, said method comprising the steps of establishing plural sectors in memory for storing indications that any of said functions have been started, and switching said sectors in recurring sequence to receive said indications for a predetermined period for each sector, said period being of substantially the same duration as said predetermined minimum timeout period for said functions.
Claim 7
Independent Claim 87 words
A method for using memory for monitoring timeout of a plurality of functions to determine whether or not each function is completed within at least a predetermined minimum timeout period, said method comprising the steps of establishing plural sectors in memory for storing indications that any of said functions have been started, and switching said sectors in recurring sequence to receive said indications for a predetermined period for each sector, said period being of substantially the same duration as said predetermined minimum timeout period for said functions.
Claim 8
Dependent Claim 89 words
In combination, a pair of memory means for receiving timing status indications for determining whether or not a predetermined function is completed within at least a predetermined minimum timeout period, and means switching the memory means of said pair to receive, in an alternating sequence, said status indications, said switching means including timing means for actuating said switching means so that each memory means receives said indications in each of its status-indication-receiving parts of said sequence for an interval of duration which is substantially the same as said perIod.
Claim 9
Dependent Claim 89 words
In combination, a pair of memory means for receiving timing status indications for determining whether or not a predetermined function is completed within at least a predetermined minimum timeout period, and means switching the memory means of said pair to receive, in an alternating sequence, said status indications, said switching means including timing means for actuating said switching means so that each memory means receives said indications in each of its status-indication-receiving parts of said sequence for an interval of duration which is substantially the same as said perIod.
Claim 10
Dependent Claim 247 words
In combination, a plurality of communication lines, for each of which lines there is to be independently indicated following the occurrence of a first signal a timeout of at least a predetermined minimum duration in the absence of the occurrence of a second signal, memory means having plural sectors each including a different bit storage location corresponding to each one of said lines for storing a binary coded signal bit indication of predetermined status information about such line, means switching said sectors in recurring sequence to receive said status information from said lines, the period between such switching operations being equal to said minimum duration, means responsive to said first signal on one of said lines for causing the corresponding bit location for such line in a receiving one of said sectors to be set to a first binary code state, means thereafter responsive to occurrence of said second signal on said one line, before timeout and before the next subsequent sector switching in said sequence, resetting to a second binary state said corresponding bit for such line, and means actuatable at the end of each said period for scanning the next one of said sectors in said recurring sequence to detect every one of the bit locations of such sector which is still in said first state, and said scanning means including means for resetting all of the last-mentioned detected bit locations prior to reception of said status information in said next one of said sectors.
Claim 11
Dependent Claim 247 words
In combination, a plurality of communication lines, for each of which lines there is to be independently indicated following the occurrence of a first signal a timeout of at least a predetermined minimum duration in the absence of the occurrence of a second signal, memory means having plural sectors each including a different bit storage location corresponding to each one of said lines for storing a binary coded signal bit indication of predetermined status information about such line, means switching said sectors in recurring sequence to receive said status information from said lines, the period between such switching operations being equal to said minimum duration, means responsive to said first signal on one of said lines for causing the corresponding bit location for such line in a receiving one of said sectors to be set to a first binary code state, means thereafter responsive to occurrence of said second signal on said one line, before timeout and before the next subsequent sector switching in said sequence, resetting to a second binary state said corresponding bit for such line, and means actuatable at the end of each said period for scanning the next one of said sectors in said recurring sequence to detect every one of the bit locations of such sector which is still in said first state, and said scanning means including means for resetting all of the last-mentioned detected bit locations prior to reception of said status information in said next one of said sectors.
Claim 12
Dependent Claim 32 words
The combination in accordance with claim 7 in which said scanning means includes means initiating a communication-line service function for a line corresponding to a bit location reset by said scanning means.
Claim 13
Dependent Claim 35 words
The combination in accordance with claim 7 in which said memory means includes two of said memory sectors, and said switching means includes means switching said two sectors in alternation to receive said status information.
Claim 14
Dependent Claim 98 words
The combination in accordance with claim 7 in which said communication lines are data-transmission lines each having a plurality of data stations coupled thereto, a data control station is provided for supervising communication among said stations on any one of said lines and among said lines, and said control station includes, means interrogating said stations individually, as to the readiness of such station to communicate, by applying said first signal to such line, and each of said stations including means normally responsive within only a part of said timeout duration for applying said second signal to such line.
Claim 15
Dependent Claim 33 words
The combination in accordance with claim 7 in which said bit-resetting means comprises means resetting to said second state such bit location in said receiving sector and in all other of said sectors.

References Cited (Backward Citations)

US3027550A Cited
US3063036A Cited
US3333252A Cited
US3399387A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1974-11-22 1975-05-24 1975-11-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1978-11-22 1979-05-24 1979-11-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1982-11-22 1983-05-24 1983-11-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag