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

High performance memory imaging network for a real time process control system

Assignee: Emerson Process Management Power and Water Solutions Inc
•
Filing: 1988-06-10
•
Granted: 1992-08-25
•
Expires: 2008-06-10
📄 Original PDF 🌐 Google Patents

Abstract

Abstract A data communications arrangement for a distributed processor control system having a number of stations which can send and receive control data, includes a communications processor at each station effective for controlling the flow of control data over a serial communications bus. The communications processor is coupled to a dual ported memory device along with a functional processor which is effective for carrying out the actual operations of the process. The communications control processor is further effective for assembling frames of control data according to a predetermined arrangement which gives a timing preference to a first category of data over a second category of data. The assembled frame of control data will then include all of the first category of data and, with time remaining from a timing goal, will include a portion of the second category of data.

Inventors

  • 👤 Carl J. Staab
  • 👤 Robert W. Boehmer
  • 👤 Kirk D. Houser
  • 👤 Donald J. Jones
  • 👤 Robert T. Ihrman
  • 👤 Donald A. Poepsel
  • 👤 Warren A. Edblad

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 21:13
CPC Classifications
G; G06; G06F; G06F13/00; G06F13/14; G06F13/36; G06F13/368; G06F13/37

Claims Analysis

Total Claims: 17
Claim 1
Independent Claim 257 words
A method of efficiently communicating data between a plurality of stations in a distributed process control system comprising the steps of: separating data at each station into at least a first and second category of data; designating said first category of data as fast data; preselecting a timing goal by which all of such fast data must be refreshed to at least a portion of the plurality of stations; constructing a frame of data to be refreshed during such timing goal, said frame of data being constructed at initiation of system operation according to the steps of a. calculating an actual time by which all of such fast date will be refreshed among said plurality of stations; b. determining a time difference between such timing goal and such actual time; c. calculating a remainder amount of such second category of data that can be transmitted during such time difference; d. assembling said frame of data to be transmitted to the plurality of stations by adding such remainder amount of said second category of data to all such fast data to be transmitted during such preselected timing goal; designating data originating from any one of the plurality of stations as stale data if a node in service flag associated with any one of the plurality of stations is set to indicate that a counter at said any one of the plurality of stations has been decremented to a zero count without having refreshed the data originating therefrom; and transmitting said assembled frame of data without station address information.
Claim 2
Independent Claim 257 words
A method of efficiently communicating data between a plurality of stations in a distributed process control system comprising the steps of: separating data at each station into at least a first and second category of data; designating said first category of data as fast data; preselecting a timing goal by which all of such fast data must be refreshed to at least a portion of the plurality of stations; constructing a frame of data to be refreshed during such timing goal, said frame of data being constructed at initiation of system operation according to the steps of a. calculating an actual time by which all of such fast date will be refreshed among said plurality of stations; b. determining a time difference between such timing goal and such actual time; c. calculating a remainder amount of such second category of data that can be transmitted during such time difference; d. assembling said frame of data to be transmitted to the plurality of stations by adding such remainder amount of said second category of data to all such fast data to be transmitted during such preselected timing goal; designating data originating from any one of the plurality of stations as stale data if a node in service flag associated with any one of the plurality of stations is set to indicate that a counter at said any one of the plurality of stations has been decremented to a zero count without having refreshed the data originating therefrom; and transmitting said assembled frame of data without station address information.
Claim 3
Dependent Claim 48 words
A data communication method as set forth in claim 1 wherein said data is separated between said first category of data and said second category of data as a function of a predetermined priority designation of all of the data present at each of the plurality of stations.
Claim 4
Dependent Claim 53 words
A data communication method as set forth in claim 1 further comprising the step of assigning a bus mastership to one of the plurality of stations for the transmission of one frame of data and, following such transmission, passing such bus mastership onto a next station as determined from a bus allocation list.
Claim 5
Dependent Claim 90 words
A data communication method as set forth in claim 1 further comprising the step of assigning a distinct timeout period to at least a first and a second station among the plurality of stations, the first and second station being determined by a reading of an order of the plurality of stations as set out in a bus allocation list, the distinct timeout period corresponding to a time after which, if there has been an absence of activity of a communication bus, a restart of transmissions of data will occur.
Claim 6
Dependent Claim 55 words
A data communications method as set forth in claim 1 wherein said counter originates with a count of three and is decremented one count each time a data transmission of the data for all of the plurality of stations is completed without new data being originated from said any one of the plurality of stations.
Claim 7
Dependent Claim 53 words
A data communication method as set forth in claim 5 further comprising the step of assigning a bus mastership to one of the plurality of stations for the transmission of one frame of data and, following such transmission, passing such bus mastership onto a next station as determined from a bus allocation list.
Claim 8
Dependent Claim 90 words
A data communication method as set forth in claim 6 further comprising the step of assigning a distinct timeout period to at least a first and a second station among the plurality of stations, the first and second station being determined by a reading of an order of the plurality of stations as set out in a bus allocation list, the distinct timeout period corresponding to a time after which, if there has been an absence of activity of a communication bus, a restart of transmissions of data will occur.
Claim 9
Dependent Claim 338 words
An arrangement for communicating data which has been separated into at least into at least a first and second category of data as a function of a predetermined timing priority for refreshing such data among a plurality of processor controlled stations of a distributed process control system, said communication arrangement comprising: a communications processor at each of the plurality of stations which is in signal communication with a communication bus on which the plurality of stations are disposed; a dual port memory element at each of the plurality of stations and coupled on one port to said communications processor; a control processor in signal communication with a second port of said dual port memory element and effective such that the process of the distributed process control system is carried out thereby; said communications processor including means for assembling a frame of in which the first category of data is assigned a timing preference over said second category of data, said assembled frame of data including a preassigned arrangement of said first and second categories of data whereby all of said first category of data is transmitted before said second category of data, said preassigned arrangement of data being selected at initiation of system operation according to a preselected timing goal; means for calculating an actual time for transmitting all of the first category of data and subtracting such actual time from said preselected timing goal to determine a timing difference; means for determining a remainder amount of the second category of data as can be transmitted in the timing difference and adding such remainder amount to the first category of data to be transmitted therewith; and means for designating data originating from any one of the plurality of stations as stale data if a node in service flag associated with said any one of the plurality of stations is set to indicate that a counter at said any one of the plurality of stations has been decremented to a zero count without having refreshed the data originating therefrom.
Claim 10
Dependent Claim 338 words
An arrangement for communicating data which has been separated into at least into at least a first and second category of data as a function of a predetermined timing priority for refreshing such data among a plurality of processor controlled stations of a distributed process control system, said communication arrangement comprising: a communications processor at each of the plurality of stations which is in signal communication with a communication bus on which the plurality of stations are disposed; a dual port memory element at each of the plurality of stations and coupled on one port to said communications processor; a control processor in signal communication with a second port of said dual port memory element and effective such that the process of the distributed process control system is carried out thereby; said communications processor including means for assembling a frame of in which the first category of data is assigned a timing preference over said second category of data, said assembled frame of data including a preassigned arrangement of said first and second categories of data whereby all of said first category of data is transmitted before said second category of data, said preassigned arrangement of data being selected at initiation of system operation according to a preselected timing goal; means for calculating an actual time for transmitting all of the first category of data and subtracting such actual time from said preselected timing goal to determine a timing difference; means for determining a remainder amount of the second category of data as can be transmitted in the timing difference and adding such remainder amount to the first category of data to be transmitted therewith; and means for designating data originating from any one of the plurality of stations as stale data if a node in service flag associated with said any one of the plurality of stations is set to indicate that a counter at said any one of the plurality of stations has been decremented to a zero count without having refreshed the data originating therefrom.
Claim 11
Dependent Claim 48 words
A data communicating arrangement as set forth in claim 8 wherein said data is separated between said first category of data and said second category of data as a function of a predetermined priority designation of all of the data present at each of the plurality of stations.
Claim 12
Dependent Claim 51 words
A data communications arrangement as set forth in claim 8 further comprising means for assigning bus mastership to one of the plurality of stations for the transmission of one frame of data and, following such transmission, passing such bus mastership onto a next station as determined from a bus allocation list.
Claim 13
Dependent Claim 89 words
A data communication arrangement as set forth in claim 8 further comprising means for assigning a distinct timeout period to at least a first and a second station among the plurality of stations, the first and second station being determined by a reading of an order of the plurality of stations as set out in a bus allocation list, the distinct timeout period corresponding to a time after which, if there has been an absence of activity of a communication bus, a restart of transmissions of data will occur.
Claim 14
Dependent Claim 55 words
A data communications arrangement as set forth in claim 8 wherein said counter originates with a count of three and is decremented one count each time a data transmission of the data for all of the plurality of stations is completed without new data being originated from said any one of the plurality of stations.
Claim 15
Dependent Claim 51 words
A data communications arrangement as set forth in claim 12 further comprising means for assigning bus mastership to one of the plurality of stations for the transmission of one frame of data and, following such transmission, passing such bus mastership onto a next station as determined from a bus allocation list.
Claim 16
Dependent Claim 89 words
A data communication arrangement as set forth in claim 13 further comprising means for assigning a distinct timeout period to at least a first and a second station among the plurality of stations, the first and second station being determined by a reading of an order of the plurality of stations as set out in a bus allocation list, the distinct timeout period corresponding to a time after which, if there has been an absence of activity of a communication bus, a restart of transmissions of data will occur.
Claim 17
Dependent Claim 32 words
A data communications arrangement as set forth in claim 8 wherein said assembled frame of data is transmitted to at least a portion of the plurality of stations without station address information.

USPTO Annuity & Maintenance Windows

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

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag