Distributed computing environment using real-time scheduling...

Electrical computers and digital processing systems: multicomput – Multicomputer synchronizing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S345000

Reexamination Certificate

active

06748451

ABSTRACT:

FIELD OF THE INVENTION
This invention is directed to the field of data processing control systems, particularly to integrated systems where a plurality of computers execute their logic in a coordinated manner within a network.
BACKGROUND OF THE INVENTION
The primary application of the system described in this specification is for computerized control of machines deployed on a large physical scale (e.g. a chemical manufacturing facility), although benefits to endeavors related to plural computer processors, parallel computer processors, and networked computer processors are also enabled.
When computational demands or geographical constraints require the physical distribution of computing facilities (e.g. such as for process control in a large, geographically dispersed chemical plant), implementation factors (such as product quality) may benefit from centralized coordination of the computing tasks. This invention describes a system and method for enabling a plurality of geographically dispersed computers to be networked for enabling time coordinated inter-activity. This resultant network enables task coordination and facilitates the implementation of other qualities beneficial to the task being performed by the system—qualities such as redundancy, security, and high throughput.
One embodiment of a system showing such substantive real-time networking to a set of physically distributed remote field units for use in a process control system is described the U.S. Pat. No. 5,428,769 issued on Jun. 27, 1995 and entitled “Process control interface system having triply redundant remote field units” to Glaser, Robert S.; Hoy, Robert S.; Fernandez, G. Paul; and Grai, Timothy J. While the system is adequate for many process control situations, the networking methodology effectively addresses each system in each time period on the presumption that there is a need to do so; however, many of these addressing cycles are unnecessary if all variables for exchange are stable—a more elegant scenario from the standpoint of network efficiency would provide for communications only when the status of either the inputs or the outputs require change.
Physical distribution of computing facilities combined with centralized coordination of the computing tasks is also a driving concept in high performance processors characterized by parallelism. Vector processors, as discussed in sections 7.1 and 7.2 (“Vector Processors”) of Computer Architecture A Quantitative Approach by John L. Hennessy and David A Patterson (Morgan Kaufmann; San Mateo, Calif.; 1990; pages 351-363) are one manifestation of such systems, and processor-memory pair approaches such as the Cm★ design discussed from pages 11 to 18 of “Parallel Processing—The Cm★ Experience” by E. F. Gehringer, D. P. Siewiorek, and Z. Segall (Digital Press via Editorial Inc.; Rockport, Mass.; 1987) provide a second example of these types of approaches.
Centralized coordination of computing tasks in a scheduled context for the future also draws on concepts from traditional project scheduling such as is discussed from pages 569 to 584 of the text Productions and Operations Management by J. William Gavett (Harcort, Brace, and World; New York; 1968).
Process control systems development is characterized by an ever-increasing incorporation and management of issues at large in the system being controlled, requiring that a comparably larger amount of logic on a comparably larger amount of data be executed in a time frame which is not permitted to expand. This can be achieved to some degree by hardware which processes logic more quickly and holds more data in an addressed physical store, but there are substantial costs in pursuing this solution. What is needed to resolve the ability of future systems to effectively expand their comprehensive treatment of the control situation is to truly provide a solution path for enabling a very large number of distributed computers to execute massive amounts of logic in a mutual manner which is time-synchronous across an entire network. The present invention provides such a method and system.
SUMMARY OF THE INVENTION
To achieve the above objects, the present invention provides a computer implemented method for enabling a plurality of computer nodes in mutual data communication to execute logic in a coordinated manner by
aligning real-time time between the plurality of computer nodes so that each computer node has essentially the same real-time time;
defining a schedule of communications for each computer node, with the schedule having a different time in the future defined for initiating each respective communication;
communicating each schedule to its respective computer node; and
initiating each communication from each node at the time defined in its schedule.
Additional features and advantages of the present invention will become more fully apparent from a reading of the detailed description of the preferred embodiment and the accompanying drawings.


REFERENCES:
patent: 3798650 (1974-03-01), McComas et al.
patent: 3824548 (1974-07-01), Sullivan et al.
patent: 3876983 (1975-04-01), Zafiropulo et al.
patent: 3921149 (1975-11-01), Kreis et al.
patent: 4005266 (1977-01-01), Lehr et al.
patent: 4151590 (1979-04-01), Azegami
patent: 4234958 (1980-11-01), Pipes et al.
patent: 4287597 (1981-09-01), Paynter et al.
patent: 4304001 (1981-12-01), Cope
patent: 4352180 (1982-09-01), Schulze
patent: 4354267 (1982-10-01), Mori et al.
patent: 4410983 (1983-10-01), Cope
patent: 4417334 (1983-11-01), Gunderson et al.
patent: 4438494 (1984-03-01), Budde et al.
patent: 4454508 (1984-06-01), Grow
patent: 4500951 (1985-02-01), Sugimoto et al.
patent: 4538026 (1985-08-01), Yasue
patent: 4554673 (1985-11-01), Stevens
patent: 4573044 (1986-02-01), McConachie et al.
patent: 4582434 (1986-04-01), Plangger et al.
patent: 4607256 (1986-08-01), Henzel
patent: 4607257 (1986-08-01), Noguchi
patent: 4625314 (1986-11-01), Witte
patent: 4630265 (1986-12-01), Sexton
patent: 4663704 (1987-05-01), Jones et al.
patent: 4689736 (1987-08-01), Glaudel et al.
patent: 4690491 (1987-09-01), Stein et al.
patent: 4697263 (1987-09-01), Beaufoy
patent: 4701756 (1987-10-01), Burr
patent: 4715033 (1987-12-01), Saburi
patent: 4727592 (1988-02-01), Okada et al.
patent: 4731784 (1988-03-01), Keller et al.
patent: 4747100 (1988-05-01), Roach et al.
patent: 4761799 (1988-08-01), Arragon
patent: 4769807 (1988-09-01), Niwa et al.
patent: 4777487 (1988-10-01), Boulton et al.
patent: 4791547 (1988-12-01), Petroff
patent: 4800561 (1989-01-01), Ishi
patent: 4813012 (1989-03-01), Valeri et al.
patent: 4815110 (1989-03-01), Benson et al.
patent: 4816989 (1989-03-01), Finn et al.
patent: 4831582 (1989-05-01), Miller et al.
patent: 4837856 (1989-06-01), Glista, Jr.
patent: 4855903 (1989-08-01), Carleton et al.
patent: 4855906 (1989-08-01), Burke
patent: 4890279 (1989-12-01), Lubarsky
patent: 4890303 (1989-12-01), Bader
patent: 4894846 (1990-01-01), Fine
patent: 4897874 (1990-01-01), Lidinsky et al.
patent: 4899383 (1990-02-01), Einolf, Jr. et al.
patent: 4901218 (1990-02-01), Cornwell
patent: 4907232 (1990-03-01), Harper et al.
patent: 4918652 (1990-04-01), Bennington et al.
patent: 4926418 (1990-05-01), Cidon et al.
patent: 4930124 (1990-05-01), de Boisseron et al.
patent: 4933833 (1990-06-01), Petroff
patent: 4933936 (1990-06-01), Rasmussen et al.
patent: 4935886 (1990-06-01), Choka
patent: 4939753 (1990-07-01), Olson
patent: 4951280 (1990-08-01), McCool et al.
patent: 4970717 (1990-11-01), Haas
patent: 4982400 (1991-01-01), Ebersole
patent: 4992926 (1991-02-01), Janke et al.
patent: 4995040 (1991-02-01), Best et al.
patent: 4999832 (1991-03-01), Chen et al.
patent: 5003531 (1991-03-01), Farinholt et al.
patent: 5151866 (1992-09-01), Glaser et al.
patent: 5408603 (1995-04-01), Van de Lavoir et al.
patent: 5428745 (1995-06-01), de Bruijn et al.
patent: 5428769 (1995-06-01), Glaser et al.
patent: 5446878 (1995-08-01), Royal
patent: 5491625 (1996-02-01), Pressnall et al.
patent: 5519603 (1996-05-01), Allbery, Jr. et al.
patent: 5555424 (1996-09-01), Sederlund et al.
patent: 5561770 (

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Distributed computing environment using real-time scheduling... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Distributed computing environment using real-time scheduling..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed computing environment using real-time scheduling... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3340774

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.