Patent US5546600A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5546600A Expired / Lapsed US ⏱️ 0.0 years remaining

Data driven computer producing inhibit signal for inhibiting merging external provided data pieces with internal data pieces when number of processing data exceeds reference value

Assignee: Sharp Corp
•
Filing: 1992-12-14
•
Granted: 1996-08-13
•
Expires: 2012-12-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a data-flow type computer using paired data, the improvement of a data transmission apparatus wherein the difference in the number of data pieces written in a memory and the number of data pieces read out from the memory is determined. If this difference exceeds a predetermined number, a transmission inhibiting signal is generated from an inhibiting signal generating portion to be applied to a merging portion, wherein the merging portion temporarily inhibits the merging of data from an external data memory or external information processing unit and then allows for the merging of data when the difference becomes less than the predetermined number.

Inventors

  • 👤 Futoshi Miyamae
  • 👤 Souichi Miyata

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 19:08
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/448; G06F9/4494

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 184 words
A data driven computer comprising: merging means for merging externally provided data pieces with internal data pieces of the data driven computer to provide merged data; processing means, coupled to said merging means, for processing the merged data pieces; branching means, coupled to said processing means, for branching the processed data pieces to one of first and second data flow paths; and; data transmission control means, coupled to the first data flow path to receive the processed data pieces, for providing the processed data pieces to said merging means as the internal data pieces, said data transmission control means comprising buffer means for storing the processed data pieces, counter means for counting a net number of processed data pieces stored in said buffer means, comparator means for comparing a count of said counter means with a reference value, and inhibit signal means, coupled to said comparator means, for autonomously generating a transmission inhibit signal in accordance with an output of said comparator, said merging means inhibiting merging of the externally provided data pieces into the merged data in accordance with the transmission inhibit signal.
Claim 2
Dependent Claim 184 words
A data driven computer comprising: merging means for merging externally provided data pieces with internal data pieces of the data driven computer to provide merged data; processing means, coupled to said merging means, for processing the merged data pieces; branching means, coupled to said processing means, for branching the processed data pieces to one of first and second data flow paths; and; data transmission control means, coupled to the first data flow path to receive the processed data pieces, for providing the processed data pieces to said merging means as the internal data pieces, said data transmission control means comprising buffer means for storing the processed data pieces, counter means for counting a net number of processed data pieces stored in said buffer means, comparator means for comparing a count of said counter means with a reference value, and inhibit signal means, coupled to said comparator means, for autonomously generating a transmission inhibit signal in accordance with an output of said comparator, said merging means inhibiting merging of the externally provided data pieces into the merged data in accordance with the transmission inhibit signal.
Claim 3
Dependent Claim 32 words
The data driven computer of claim 1, wherein said inhibit signal means autonomously generates the transmission inhibit signal when said comparator means determines that the count is greater than the reference value.
Claim 4
Dependent Claim 56 words
The data driven computer of claim 1, wherein said counter means counts the net number of processed data pieces stored in said buffer means by incrementing the count for each processed data piece provided to said buffer means and decrementing the count for each processed data piece provided from said buffer means to said merging means.
Claim 5
Dependent Claim 15 words
The data driven computer of claim 1, wherein said buffer means comprises an FIFO memory.
Claim 6
Independent Claim 181 words
A method of merging data asynchronously in a data driven computer, the data driven computer including a merging unit for merging externally provided data pieces with internal data pieces of the data driven computer to provide merged data pieces, a processing unit for processing the merged data, a branching unit for branching the processed data pieces to one of first and second data flow paths, and a data transmission controller for receiving the processed data pieces from the first data flow path and providing the processed data pieces to the merging means as the internal data pieces, the method of merging data comprising: a) buffering the processed data pieces received by the data transmission controller in a buffer memory; b) counting a net number of processed data pieces stored in the buffer memory; c) comparing the net number with a reference value; d) generating autonomously a transmission inhibit signal according to a result of said step c) of comparing; and e) inhibiting merging of the externally provided data pieces into the merged data pieces in accordance with the transmission inhibit signal.
Claim 7
Independent Claim 181 words
A method of merging data asynchronously in a data driven computer, the data driven computer including a merging unit for merging externally provided data pieces with internal data pieces of the data driven computer to provide merged data pieces, a processing unit for processing the merged data, a branching unit for branching the processed data pieces to one of first and second data flow paths, and a data transmission controller for receiving the processed data pieces from the first data flow path and providing the processed data pieces to the merging means as the internal data pieces, the method of merging data comprising: a) buffering the processed data pieces received by the data transmission controller in a buffer memory; b) counting a net number of processed data pieces stored in the buffer memory; c) comparing the net number with a reference value; d) generating autonomously a transmission inhibit signal according to a result of said step c) of comparing; and e) inhibiting merging of the externally provided data pieces into the merged data pieces in accordance with the transmission inhibit signal.
Claim 8
Dependent Claim 37 words
The method of merging data of claim 5, wherein said step d) comprises generating autonomously the transmission inhibit signal when it is determined in said step c) that the net number is greater than the reference value.
Claim 9
Dependent Claim 56 words
The method of merging data of claim 5, wherein said step b) comprises incrementing the net number each time a processed data piece received by the data transmission controller is stored in the buffer memory and decrementing the net number each time a processed data piece is provided from the buffer memory to the merging means.
Claim 10
Dependent Claim 22 words
The method of merging data of claim 5, wherein said step a) comprises buffering the processed data pieces in an FIFO memory.
Claim 11
Dependent Claim 216 words
A data driven computer comprising: merging means for merging externally applied data pieces with internal data pieces of the data driven computer and providing merged data pieces; processing means, coupled to said merging means, for processing the merged data pieces; branching means, coupled to said processing means, for branching the processed data pieces to one of first and second data flow paths, said merging means, said processing means and said branching means being connected in an asynchronous data-driven-architecture ring over which data pieces flow asynchronously; storage means, coupled to said branching means, for storing the processed data pieces provided along the first data flow path; detecting means, responsive to a number of processed data pieces written in said storage means and a number of processed data pieces read out from said storage means to said merging means as the internal data pieces, for detecting a number of processed data pieces stored in said storage means exceeding a predetermined number; and transmission inhibiting signal generating means, responsive to said detecting means, for providing autonomously a transmission inhibiting signal to said merging means in accordance with the detected number of processed data pieces, said merging means inhibiting merging of the externally provided data pieces into the merged data pieces in response to receipt of the transmission inhibiting signal.
Claim 12
Dependent Claim 216 words
A data driven computer comprising: merging means for merging externally applied data pieces with internal data pieces of the data driven computer and providing merged data pieces; processing means, coupled to said merging means, for processing the merged data pieces; branching means, coupled to said processing means, for branching the processed data pieces to one of first and second data flow paths, said merging means, said processing means and said branching means being connected in an asynchronous data-driven-architecture ring over which data pieces flow asynchronously; storage means, coupled to said branching means, for storing the processed data pieces provided along the first data flow path; detecting means, responsive to a number of processed data pieces written in said storage means and a number of processed data pieces read out from said storage means to said merging means as the internal data pieces, for detecting a number of processed data pieces stored in said storage means exceeding a predetermined number; and transmission inhibiting signal generating means, responsive to said detecting means, for providing autonomously a transmission inhibiting signal to said merging means in accordance with the detected number of processed data pieces, said merging means inhibiting merging of the externally provided data pieces into the merged data pieces in response to receipt of the transmission inhibiting signal.
Claim 13
Dependent Claim 21 words
The data driven computer of claim 9, wherein said storage means comprises an FIFO memory which buffers the processed data pieces.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-08-13 2000-02-12 2000-08-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-08-13 2004-02-12 2004-08-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-08-13 2008-02-12 2008-08-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag