Patent US3184320A successfully refreshed from Google Patents.
US3582896A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of control for a data processor
Assignee: AT&T Inc
•
Filing: 1965-01-22
•
Granted: 1971-06-01
•
Expires: 1985-01-22
Abstract
Abstract A stored program data processor is disclosed in which certain subroutines must be executed during predetermined real time intervals. These times are designated by clock controlled interrupt of the normal program processing sequence. A first table is provided in storage in which there are a number of words equal to the number of different real time intervals. Each of these words has a number of bit positions equal to the number of possible subroutines which could be called for in that interval. Each bit is correlated to a word in a second table which word is the address of one of the subroutines. Instructions are provided for operating the data processor to consult the word in the first table appropriate for each time interval and to execute the routines indicated in abbreviated manner by the presence of particular valued bits in the selected bit positions of the first table word.
Inventors
- 👤 Sigmund Silber
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 18:36
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/46; G06F9/48; G06F9/4806; G06F9/4812; G06F9/4825; H; H04; H04Q; H04Q3/00; H04Q3/42; H04Q3/54; H04Q3/545
Claims Analysis
Total Claims: 65
Claim 1
Independent Claim
248 words
A method of controlling the executions of predetermined Program subroutines at predetermined fixed time intervals in a data processing system comprising the steps of: 1. storing in successively addressed locations of a first table the respective transfer addresses of said predetermined program subroutines, 2. storing in a second table a respective word for each of a plurality of fixed time intervals of the same duration, each bit position in each of said words being associated with one of said predetermined program subroutines and containing a bit of predetermined value if the associated subroutine is to be executed in the time interval represented by the respective word, 3. examining the respective word in said second table at the beginning of each of said fixed time intervals, said words being examined in sequence, 4. determining the positions in the examined word containing bits of said predetermined value, 5. sequentially adding the numbers of the positions in said examined word containing bits of said predetermined value to the address of the location in said first table containing the first transfer address to derive the addresses in said first table of the locations containing the transfer addresses of the predetermined subroutines to be executed, and 6. sequentially transferring to the respective transfer addresses contained in said derived location addresses in said first table to control the executions of all of the predetermined program subroutines to be executed in the fixed time interval whose respective word in said second table has been examined.
Claim 2
Independent Claim
248 words
A method of controlling the executions of predetermined Program subroutines at predetermined fixed time intervals in a data processing system comprising the steps of: 1. storing in successively addressed locations of a first table the respective transfer addresses of said predetermined program subroutines, 2. storing in a second table a respective word for each of a plurality of fixed time intervals of the same duration, each bit position in each of said words being associated with one of said predetermined program subroutines and containing a bit of predetermined value if the associated subroutine is to be executed in the time interval represented by the respective word, 3. examining the respective word in said second table at the beginning of each of said fixed time intervals, said words being examined in sequence, 4. determining the positions in the examined word containing bits of said predetermined value, 5. sequentially adding the numbers of the positions in said examined word containing bits of said predetermined value to the address of the location in said first table containing the first transfer address to derive the addresses in said first table of the locations containing the transfer addresses of the predetermined subroutines to be executed, and 6. sequentially transferring to the respective transfer addresses contained in said derived location addresses in said first table to control the executions of all of the predetermined program subroutines to be executed in the fixed time interval whose respective word in said second table has been examined.
Claim 3
Dependent Claim
62 words
storing in a second table a respective word for each of a plurality of fixed time intervals of the same duration, each bit position in each of said words being associated with one of said predetermined program subroutines and containing a bit of predetermined value if the associated subroutine is to be executed in the time interval represented by the respective word,
Claim 4
Dependent Claim
62 words
storing in a second table a respective word for each of a plurality of fixed time intervals of the same duration, each bit position in each of said words being associated with one of said predetermined program subroutines and containing a bit of predetermined value if the associated subroutine is to be executed in the time interval represented by the respective word,
Claim 5
Independent Claim
24 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system comprising the steps of:
Claim 6
Independent Claim
24 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system comprising the steps of:
Claim 7
Dependent Claim
62 words
storing in a second table a respective word for each of a plurality of fixed time intervals of the same duration, each bit position in each of said words being associated with one of said predetermined program subroutines and containing a bit of predetermined value if the associated subroutine is to be executed in the time interval represented by the respective word,
Claim 8
Dependent Claim
62 words
storing in a second table a respective word for each of a plurality of fixed time intervals of the same duration, each bit position in each of said words being associated with one of said predetermined program subroutines and containing a bit of predetermined value if the associated subroutine is to be executed in the time interval represented by the respective word,
Claim 9
Dependent Claim
48 words
examining at the beginning of each of said time intervals all pieces of said data having the respective time interval identity coordinate, and 3 sequentially executing in each time interval the subroutines corresponding to the subroutine identity coordinates of the examined pieces of data having said predetermined value.
Claim 10
Dependent Claim
48 words
examining at the beginning of each of said time intervals all pieces of said data having the respective time interval identity coordinate, and 3 sequentially executing in each time interval the subroutines corresponding to the subroutine identity coordinates of the examined pieces of data having said predetermined value.
Claim 11
Dependent Claim
10 words
sequentially executing successive instructions in accordance with a predesigned program,
Claim 12
Dependent Claim
10 words
sequentially executing successive instructions in accordance with a predesigned program,
Claim 13
Dependent Claim
20 words
placing in a register the respective word in said table at the beginning of each of said fixed time intervals,
Claim 14
Dependent Claim
20 words
placing in a register the respective word in said table at the beginning of each of said fixed time intervals,
Claim 15
Dependent Claim
20 words
examining the respective word at the beginning of each of said fixed time intervals, said words being examined in sequence,
Claim 16
Dependent Claim
20 words
examining the respective word at the beginning of each of said fixed time intervals, said words being examined in sequence,
Claim 17
Dependent Claim
117 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system in accordance with claim 2 wherein the words in said second table are contained in successively addressed locations, and step (3) comprises the substeps of: 3a. maintaining a count of time intervals and incrementing said count during each of said fixed time intervals, 3b. adding the value of the count maintained to the address of the first location in said second table to derive a sum address, and 3c. examining at the beginning of each of said fixed time intervals the word in said second table which is contained in the location having the derived sum address.
Claim 18
Dependent Claim
20 words
interrupting the executions of the instructions in said predesigned program at the beginning of each of said repetitive time intervals,
Claim 19
Dependent Claim
20 words
interrupting the executions of the instructions in said predesigned program at the beginning of each of said repetitive time intervals,
Claim 20
Dependent Claim
13 words
determining the positions in said register containing bits of said predetermined value, and
Claim 21
Dependent Claim
13 words
determining the positions in said register containing bits of said predetermined value, and
Claim 22
Dependent Claim
14 words
determining the positions in the examined word containing bits of said predetermined value, and
Claim 23
Dependent Claim
14 words
determining the positions in the examined word containing bits of said predetermined value, and
Claim 24
Dependent Claim
24 words
examining the respective word in said second table at the beginning of each of said fixed time intervals, said words being examined in sequence,
Claim 25
Dependent Claim
24 words
examining the respective word in said second table at the beginning of each of said fixed time intervals, said words being examined in sequence,
Claim 26
Dependent Claim
24 words
examining the respective word in said second table at the beginning of each of said fixed time intervals, said words being examined in sequence,
Claim 27
Dependent Claim
24 words
examining the respective word in said second table at the beginning of each of said fixed time intervals, said words being examined in sequence,
Claim 28
Dependent Claim
13 words
determining the positions in the examined word containing bits of said predetermined value,
Claim 29
Dependent Claim
13 words
determining the positions in the examined word containing bits of said predetermined value,
Claim 30
Dependent Claim
13 words
determining the positions in the examined word containing bits of said predetermined value,
Claim 31
Dependent Claim
13 words
determining the positions in the examined word containing bits of said predetermined value,
Claim 32
Dependent Claim
14 words
examining the respective stored word at the beginning of each of said time intervals,
Claim 33
Dependent Claim
14 words
examining the respective stored word at the beginning of each of said time intervals,
Claim 34
Dependent Claim
31 words
sequentially executing the predetermined program subroutines in the fixed time interval whose respective word has been examined which correspond to the positions in said word containing bits of said predetermined value.
Claim 35
Dependent Claim
31 words
sequentially executing the predetermined program subroutines in the fixed time interval whose respective word has been examined which correspond to the positions in said word containing bits of said predetermined value.
Claim 36
Dependent Claim
48 words
sequentially executing the subroutines which correspond to the positions in said register containing bits of said predetermined value and erasing from said register said bits of predetermined value as said subroutines are sequentially executed until all of said bits of predetermined value have been erased from said register.
Claim 37
Dependent Claim
48 words
sequentially executing the subroutines which correspond to the positions in said register containing bits of said predetermined value and erasing from said register said bits of predetermined value as said subroutines are sequentially executed until all of said bits of predetermined value have been erased from said register.
Claim 38
Dependent Claim
46 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system in accordance with claim 2 wherein said data processing system normally operates in accordance with the instructions in a predetermined program further comprising the steps of
Claim 39
Independent Claim
24 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system comprising the steps of:
Claim 40
Independent Claim
24 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system comprising the steps of:
Claim 41
Dependent Claim
16 words
determining from the examined word the predetermined subroutines to be executed in the respective time interval,
Claim 42
Dependent Claim
16 words
determining from the examined word the predetermined subroutines to be executed in the respective time interval,
Claim 43
Dependent Claim
24 words
sequentially retrieving the transfer addresses in said first table corresponding to the positions in said examined word containing bits of said predetermined value, and
Claim 44
Dependent Claim
24 words
sequentially retrieving the transfer addresses in said first table corresponding to the positions in said examined word containing bits of said predetermined value, and
Claim 45
Dependent Claim
55 words
sequentially adding the numbers of the positions in said examined word containing bits of said predetermined value to the address of the location in said first table containing the first transfer address to derive the addresses in said first table of the locations containing the transfer addresses of the predetermined subroutines to be executed, and
Claim 46
Dependent Claim
55 words
sequentially adding the numbers of the positions in said examined word containing bits of said predetermined value to the address of the location in said first table containing the first transfer address to derive the addresses in said first table of the locations containing the transfer addresses of the predetermined subroutines to be executed, and
Claim 47
Dependent Claim
46 words
sequentially transferring to the respective transfer addresses contained in said derived location addresses in said first table to control the executions of all of the predetermined program subroutines to be executed in the fixed time interval whose respective word in said second table has been examined.
Claim 48
Dependent Claim
46 words
sequentially transferring to the respective transfer addresses contained in said derived location addresses in said first table to control the executions of all of the predetermined program subroutines to be executed in the fixed time interval whose respective word in said second table has been examined.
Claim 49
Dependent Claim
35 words
sequentially transferring to said retrieved transfer addresses to control the executions of all the predetermined program subroutines to be executed in the fixed time interval whose respective word in said second table has been examined.
Claim 50
Dependent Claim
35 words
sequentially transferring to said retrieved transfer addresses to control the executions of all the predetermined program subroutines to be executed in the fixed time interval whose respective word in said second table has been examined.
Claim 51
Dependent Claim
17 words
sequentially executing in each time interval the predetermined program subroutines identified by the respective examined word, and
Claim 52
Dependent Claim
17 words
sequentially executing in each time interval the predetermined program subroutines identified by the respective examined word, and
Claim 53
Dependent Claim
92 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system in accordance with claim 5 wherein the system includes a list of transfer addresses, each address identifying a particular one of said subroutines, and step (4) comprises the substeps of: 4a. selecting the transfer addresses in said list whose associated subroutines correspond to the positions in said examined word containing bits of said predetermined value, and 4b. successively transferring to the selected transfer addresses to control the executions of the respective subroutines.
Claim 54
Independent Claim
24 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system comprising the steps of:
Claim 55
Independent Claim
24 words
A method of controlling the executions of predetermined program subroutines at predetermined fixed time intervals in a data processing system comprising the steps of:
Claim 56
Dependent Claim
24 words
temporarily storing the identity of the instruction in said predetermined program which would otherwise be executed but for the performance of steps (3)-(6), and
Claim 57
Dependent Claim
24 words
temporarily storing the identity of the instruction in said predetermined program which would otherwise be executed but for the performance of steps (3)-(6), and
Claim 58
Dependent Claim
25 words
resuming the executions of the instructions in said predesigned program in each of said time intervals after the respective predetermined program subroutines have been executed.
Claim 59
Dependent Claim
25 words
resuming the executions of the instructions in said predesigned program in each of said time intervals after the respective predetermined program subroutines have been executed.
Claim 60
Independent Claim
14 words
A method of controlling the operation of a data processor comprising the steps of:
Claim 61
Independent Claim
14 words
A method of controlling the operation of a data processor comprising the steps of:
Claim 62
Dependent Claim
11 words
executing said temporarily stored instruction after steps (3)-(6) have been performed.
Claim 63
Dependent Claim
11 words
executing said temporarily stored instruction after steps (3)-(6) have been performed.
Claim 64
Independent Claim
23 words
A method of controlling the executions of predetermined program subroutines during repetitive time intervals in a data processing system comprising the steps of:
Claim 65
Independent Claim
23 words
A method of controlling the executions of predetermined program subroutines during repetitive time intervals in a data processing system comprising the steps of:
References Cited (Backward Citations)
US3223785A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1974-05-31 | 1974-11-30 | 1975-06-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1978-05-31 | 1978-11-30 | 1979-06-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1982-05-31 | 1982-11-30 | 1983-06-01 | $7700.00 | Window Closed / Lapsed |