Dynamic activity-creating data-driven computer architecture

Claim 2

In a queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and means for removing data at a plurality of output points from said queue structure upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) at least one backward combinatorial logic circuit and at least one forward combinatorial logic circuit housed within each stage, the backward and forward combinatorial logic circuits being bidirectionally linked to each for data transfer and to said data shifting means; (d) each of said combinatorial logic circuits being connected to at least one other of said stages, said forward logic circuit being linked to at least a forward stage and said backward logic circuit being linked to at least a forward stage, and said backward logic circuit being linked to at least a preceding stage, each logic circuit being so linked by stage-connecting signal paths; and (e) said shifting means including: (1) a plurality of shaft latches within each stage, each latch capable of storing at least one data bit; (2) a plurality of bypass lines within each stage for bypassing said shift latches; and (3) a plurality of data lines connecting said shift latches and bypass lines to adjoining forward and backward other of said stages.

Claim 3

The queue structure of claim 1 wherein the shifting means further includes: a first set of input ports for receiving gating signals from said status means, said gating signals controlling the flow of data through said shifting means, said gating signals determined by said backward and forward combinatorial logic circuits of said status means; and, a second set of input ports for receiving a clocked signal from said status means, so that movement of data bits through said shift latch is synchronized with movement of data through said status means.

Claim 4

In a queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and from which data can be removed at output points upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages, and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) at least one backward combinatorial logic circuit and at least one forward combinatorial logic circuit housed within each stage, the backward and forward combinatorial logic circuits being bidirectionally linked to each other for data transfer and to said data shifting means; (d) each of said combinatorial logic circuits being connected to at least one other of said stages, said forward logic circuit being linked to at least a forward stage, and said backward logic circuit being linked to at least a preceding stage, each logic circuit being so linked by stage-connecting signal paths; and (e) each of the forward and backward combinatorial logic circuits housed within each stage of said plurality of stages comprising: (1) a data latch which stores data and is capable of shifting this data to said forward stage according to the command of a clock signal; (2) input ports for receiving signals indicative of whether adjacent forward stage is available to receive said data; and (3) output ports which indicate to said adjacent preceding stage that the stage, which houses the combinatorial logic circuit, is available to receive new data input signals, whereby data may be stored in said data latch and retained therein until the adjacent forward stage is available to receive said data; and new data is not received from the adjacent preceding stage until the data latch is available to store the new data.

Claim 5

In a queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and from which data can be removed at output points upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages, and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) at least one backward combinatorial logic circuit and at least one forward combinatorial logic circuit housed within each stage, the backward and forward combinatorial logic circuits being bidirectionally linked to each other for data transfer and to said data shifting means; (d) each of said combinatorial logic circuits being connected to at least one other of said stages, said forward logic circuit being linked to at least a forward stage, and said backward logic circuit being linked to at least a preceding stage, each logic circuit being so linked by stage-connecting signal paths; and (e) each of the forward and backward combinatorial logic circuits housed within each stage of said plurality of stages comprising: (1) a data latch which stores data and is capable of shifting this data to said forward stage according to the command of a clock signal; (2) input ports for receiving signals indicative of whether adjacent forward stage is available to receive said data; and (3) output ports which indicate to said adjacent preceding stage that the stage, which houses the combinatorial logic circuit, is available to receive new data input signals, whereby data may be stored in said data latch and retained therein until the adjacent forward stage is available to receive said data; and new data is not received from the adjacent preceding stage until the data latch is available to store the new data.

Claim 6

The queue structure of claim 3 which further includes a means for bypassing data through one stage and around the data latch resident in this stage directly to the adjacent forward stage; whereby data may be rapidly propagated through said plurality of stages, said bypassing means allowing said data to skip any of said plurality of stages having data latches cleared of data.

Claim 7

The queue structure of claim 4 including an input port which provides a control signal to the first stage, said control signal controlling propagation of data into said first stage such that said control signal will insure that data input into said first stage will not bypass said data latch when said control signal equal Logic One.

Claim 8

In a queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and from which data can be removed at output points upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) at least one backward combinatorial logic circuit and at least one forward combinatorial logic circuit housed within each stage, the backward and forward combinatorial logic circuits being bidirectionally linked to each other for data transfer and to said data shifting means; (d) each of said combinatorial logic circuits being connected to at least one other of said stages, said forward logic circuit being linked to at least a forward stage, and said backward logic circuit being linked to at least a preceding stage, each logic circuit being so linked by stage-connecting signal paths; and (e) the plurality of stages being linked to one another in a manner such that, for a plurality of N stages, a first stage is linked to a second stage, the second stage linked to a next adjacent forward stage, until an Nth stage is reached, wherein the output of the Nth stage is linked back to the input of the first stage, forming a circular queue structure, where data may be passed stage to stage around the queue structure, and back to the first stage; so that, data may dynamically circulate within the queue structure.

Claim 9

In a queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and from which data can be removed at output points upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) at least one backward combinatorial logic circuit and at least one forward combinatorial logic circuit housed within each stage, the backward and forward combinatorial logic circuits being bidirectionally linked to each other for data transfer and to said data shifting means; (d) each of said combinatorial logic circuits being connected to at least one other of said stages, said forward logic circuit being linked to at least a forward stage, and said backward logic circuit being linked to at least a preceding stage, each logic circuit being so linked by stage-connecting signal paths; and (e) the plurality of stages being linked to one another in a manner such that, for a plurality of N stages, a first stage is linked to a second stage, the second stage linked to a next adjacent forward stage, until an Nth stage is reached, wherein the output of the Nth stage is linked back to the input of the first stage, forming a circular queue structure, where data may be passed stage to stage around the queue structure, and back to the first stage; so that, data may dynamically circulate within the queue structure.

Claim 10

The queue structure of claim 6, which further includes means to access said circular queue structure, said access means being linked to circuitry outside the circular queue structure and said queue structure, so that data which circulates in said queue structure may be accessed and transmitted to said circuitry outside the stages of the circular queue structure.

Claim 11

In a queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and from which data can be removed at output points upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages, and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) at least one backward combinatorial logic circuit and at least one forward combinatorial logic circuit housed within each stage, the backward and forward combinatorial logic circuits being bidirectionally linked to each other for data transfer and to said data shifting means; (d) each of said combinatorial logic circuits being connected to at least one other of said stages, said forward logic circuit being linked to at least a forward stage, and said backward logic circuit being linked to at least a preceding stage, each logic circuit being so linked by stage-connecting signal paths; and (e) supplemental bus means interconnecting the stages for significantly reducing delays in transmitting information from stage to stage, said supplemental bus means including means for indicating when data is being removed from the queue structure.

Claim 12

In a queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and from which data can be removed at output points upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages, and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) at least one backward combinatorial logic circuit and at least one forward combinatorial logic circuit housed within each stage, the backward and forward combinatorial logic circuits being bidirectionally linked to each other for data transfer and to said data shifting means; (d) each of said combinatorial logic circuits being connected to at least one other of said stages, said forward logic circuit being linked to at least a forward stage, and said backward logic circuit being linked to at least a preceding stage, each logic circuit being so linked by stage-connecting signal paths; and (e) supplemental bus means interconnecting the stages for significantly reducing delays in transmitting information from stage to stage, said supplemental bus means including means for indicating when data is being removed from the queue structure.

Claim 13

In a circular queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and from which data can be removed at output points upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) said stages being connected to form a continuous circular queue with the output of each stage being coupled to the input of another stage; (d) means for tagging data circulating in said queue to uniquely identify the data with preselected tags; and (e) means for selectively outputting, from said queue, data uniquely identified with said preselected tags.

Claim 14

In a circular queue structure having FIFO organization comprising a plurality of stages into which data can be placed at input points and from which data can be removed at output points upon the occurrence of respective clock pulses of a clock line to which it is synchronized and by which it is driven, the improvement comprising: (a) status means for indicating the presence of data in said stages and interconnecting the stages for passing the status of each stage in the queue to the stage in front of it and behind it between the clock pulses; (b) shifting means within each stage interconnecting the stages for shifting data between stages toward the output points over unused stages between clock pulses using combinatorial logic whereby the availability of data at the output points during the clock pulses is increased; (c) said stages being connected to form a continuous circular queue with the output of each stage being coupled to the input of another stage; (d) means for tagging data circulating in said queue to uniquely identify the data with preselected tags; and (e) means for selectively outputting, from said queue, data uniquely identified with said preselected tags.

Claim 15

A queue structure as defined in claim 9 including a plurality of input points and a plurality of output points from said queue.