US5036453A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Master/slave sequencing processor
Assignee: Texas Instruments Inc
•
Filing: 1989-08-02
•
Granted: 1991-07-30
•
Expires: 2009-08-02
Abstract
Abstract An array processor includes a master array controller and sequencer (12) and a plurality of slave processors (20a)-(20n). The master generates sequencing commands for sequencing instruction flow in each of the slave processors. The slave processors generate addresses for associated memories (34a)-(34n). The data outputs of the memories are interfaced through a cross point switch (22) to a slave data processor (24). The master (12) is operable to initialize all of the slave devices to a starting address for an internal routine and sequence the instruction flow therein in a synchronous and parallel manner to execute a particular task.
Inventors
- 👤 Karl Renner
- 👤 John P. Shanklin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 10:01
CPC Classifications
G; G06; G06F; G06F15/00; G06F15/76; G06F15/80; G06F15/8007; G06F15/8015
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
220 words
A method for controlling instruction flow in a processor, comprising: storing sequences of instructions in a plurality of slave nodes; generating sequence commands in a master node during execution of each of a plurality of instructions contained therein; receiving the sequence commands at the slave nodes during execution of the instructions by the slave nodes an d executing the instructions at each of the slave nodes in response to the sequence commands to generate addresses and control signals at one or more of the slave nodes; receiving the addresses and control signals at a data memory in each of the slave nodes; selectively storing and retrieving data from each data memory through a memory data port in response to the generation of the addresses and control signals at an associated slave node; selectively interconnecting the memory data port of each data memory to a slave node for input of data thereto and output of results therefrom; and receiving select ones of the sequence commands at a slave node and processing input data in accordance with one of a plurality of internal data processing functions in response to the sequence commands received from the master node; wherein the execution of instructions at a slave node is sequenced synchronously and performed in parallel with the execution of instructions at other slave nodes.
Claim 2
Independent Claim
220 words
A method for controlling instruction flow in a processor, comprising: storing sequences of instructions in a plurality of slave nodes; generating sequence commands in a master node during execution of each of a plurality of instructions contained therein; receiving the sequence commands at the slave nodes during execution of the instructions by the slave nodes an d executing the instructions at each of the slave nodes in response to the sequence commands to generate addresses and control signals at one or more of the slave nodes; receiving the addresses and control signals at a data memory in each of the slave nodes; selectively storing and retrieving data from each data memory through a memory data port in response to the generation of the addresses and control signals at an associated slave node; selectively interconnecting the memory data port of each data memory to a slave node for input of data thereto and output of results therefrom; and receiving select ones of the sequence commands at a slave node and processing input data in accordance with one of a plurality of internal data processing functions in response to the sequence commands received from the master node; wherein the execution of instructions at a slave node is sequenced synchronously and performed in parallel with the execution of instructions at other slave nodes.
Claim 3
Dependent Claim
29 words
The method of claim 1 further comprising generating parameters at the master node and inputting the parameters to the slave nodes for use in executing the instruction sequences therein.
Claim 4
Dependent Claim
122 words
The method of claim 1 further comprising: storing program data and instructions, received from an external location, in a program memory at an interface node; storing data in the program memory for output to the external location; generating addresses and control signals for inputting data to or outputting data from the program memory in response to sequence commands generated at the master node; controlling and buffering data flow from the program memory to the external location and from the external location to the program memory in response to addresses generated at the interface node; and interfacing the program memory with the data memories at the slave nodes for transmitting data therebetween in response to the sequence commands generated at the master node.
Claim 5
Dependent Claim
195 words
An array data processor, comprising: a control processor for executing a sequence of instructions in step with a system clock, wherein said control processor generates control commands when each instruction is executed; a plurality of slave processors coupled to said control processor, wherein each of said slave processors executes an instruction in step with the system clock, wherein each slave processor contains its own set of instructions, and wherein execution of all instructions in each slave processor is individually sequenced in response to control commands generated by the control processor during execution of the instructions in the slave processor, such that a sequence by which the instructions are executed is controlled by the control processor; a plurality of data memories coupled to respective ones of said slave processors; a switch coupled to said data memories at memory data output ports thereof, to said slave processors, and to said control processor, wherein the memory data output ports are coupled to said control processor and to said slave processors according to a configuration pattern stored in said switch; and wherein the configuration pattern stored in said switch is selected by the control commands from the control processor.
Claim 6
Dependent Claim
195 words
An array data processor, comprising: a control processor for executing a sequence of instructions in step with a system clock, wherein said control processor generates control commands when each instruction is executed; a plurality of slave processors coupled to said control processor, wherein each of said slave processors executes an instruction in step with the system clock, wherein each slave processor contains its own set of instructions, and wherein execution of all instructions in each slave processor is individually sequenced in response to control commands generated by the control processor during execution of the instructions in the slave processor, such that a sequence by which the instructions are executed is controlled by the control processor; a plurality of data memories coupled to respective ones of said slave processors; a switch coupled to said data memories at memory data output ports thereof, to said slave processors, and to said control processor, wherein the memory data output ports are coupled to said control processor and to said slave processors according to a configuration pattern stored in said switch; and wherein the configuration pattern stored in said switch is selected by the control commands from the control processor.
Claim 7
Dependent Claim
43 words
The array data processor of claim 4, further comprising an additional slave data processor coupled to said control processor, to said slave processors, and to said switch, wherein the configuration pattern selectively said additionally slave data processor to the memory data output ports.
Claim 8
Dependent Claim
43 words
The array data processor of claim 5, wherein the memory data output ports are bidirectional input/output ports, and wherein said additional slave data processor writes into said data memories through the bidirectional input/output ports according to the configuration pattern stored in said switch.
Claim 9
Dependent Claim
44 words
The array data processor of claim 4, wherein each of said slave processors has groups within its set of instructions, and wherein one of the control commands causes a slave processor to branch to one of the group of instructions within that slave processor.
Claim 10
Dependent Claim
45 words
The array data processor of claim 4 wherein said control processor generates branching control commands to one or more of said slave processors response to which the slave processors receiving a branching control command sequentially execute instructions in said set starting at a specified address.
Claim 11
Dependent Claim
16 words
The array data processor of claim 8 wherein said branching control commands are conditional or unconditional.
Claim 12
Dependent Claim
39 words
The array data processor of claim 4 wherein said control processor generates repeat control commands to one or more of said slave processors responsive to which the slave processors receiving a repeat control command reexecute a last executed instruction.
Claim 13
Dependent Claim
35 words
The array data processor of claim 4 wherein said control processor generates no operation commands responsive to which a slave processor receiving the no operation command do not execute an instruction for one clock cycle.
References Cited (Backward Citations)
US3537074A
Cited
US3544973A
Cited
US3634830A
Cited
US3812470A
Cited
US3962685A
Cited
US4065808A
Cited
US4051551A
Cited
US4128880A
Cited
US4101960A
Cited
US4541048A
Cited
US4376973A
Cited
US4542455A
Cited
US4306286A
Cited
US4302818A
Cited
US4412303A
Cited
US4365292A
Cited
US4435758A
Cited
US4344134A
Cited
US4414624A
Cited
US4435765A
Cited
US4574394A
Cited
US4617625A
Cited
US4523273A
Cited
US4589067A
Cited
US4574348A
Cited
US4641238A
Cited
US4855903A
Cited
US4745544A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1994-07-29 | 1995-01-28 | 1995-07-30 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-07-29 | 1999-01-28 | 1999-07-30 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-07-29 | 2003-01-28 | 2003-07-30 | $7700.00 | Window Closed / Lapsed |