Multinode distributed data processing system for use in a surface vehicle

• US 5,652,911 A
• Filed: 02/10/1995
• Issued: 07/29/1997
• Est. Priority Date: 05/22/1991
• Status: Expired due to Term

• Current Assignee: Mannesmann VDO AG (Continental AG)
• Original Assignee: US Philips Corporation (Koninklijke Philips N.V.)
• Inventors: Van Tooren, Petrus M. A., Van Venrooy, Roland T. H.
• Primary Examiner(s): Donaghue, Larry D.
• Assistant Examiner(s): FOLLANSBEE, JOHN A
• Application Number:
  US08/386,605
• Time in Patent Office: 900 Days
• Field of Search: 395/800, 395/200, 395/80, 395/84, 395/800.28, 395/200.01, 364/443, 364/424.01, 364/424.03, 364/424.02
• US Class Current: 701/1
• CPC Class Codes: G01C 21/26 specially adapted for navigation in a road network
• CPC Class Codes: G06F 9/46 Multiprogramming arrangements

Abstract

A distributed data processing system in a surface vehicle comprises sensors, user I/O, data processing and mass storage of geographical data. Using a restricted library of system calls or primitives that can only be processed as unitary entities after deterministic transport control while keeping the transfer stateless, the distributed real-time operating system allows coexistent running of a plurality of processes that share localized processing power and/or a device, a sensor, I/O and/or file data.

Claims

1. A multinode distributed data processing system in a surface vehicle comprising:

a1. sensing means for sensing physical quantities relating to said vehicle;

a2. storage node means for storing physically partitioned and fixed geographical data elements;

a3. data processing node means for processing said physical quantities and said geographical data to generate user policy data;

a4. user I/O node means for

receiving request data for forwarding to said data processing node means to control said processing and

controlled forwarding, to a user, of said user policy data;

a5. user input/output means interfacing said user I/O node means to user signals; and

a6. a network interconnecting at least some of said node means, said network including bus interconnections at least between

said sensing means and said data processing node means;

said storage node means and said data processing node means;

said user I/O node means and said user input/output means; and

said user I/O node means and said data processing node means;

wherein the above recited elements cooperate via a common message protocol to achieve the following functions in a distributed manner;

b1. maintaining a library of messageable system calls or primitives, comprising;

open, close, read, write, seek, getstat, setstat, signal, and create;

b2. maintaining a deterministic network control subsystem for effecting any network transport of a primitive within a prespecified maximum time interval;

b3. within each of the storage node means, the data processing node means, and the user i/o node means, processing each message only upon complete transfer thereof as a unitary entity;

b4. within each of the storage node means, the data processing node means, and the user i/o node means, with respect to each message, maintaining statelessness until completion of transfer of that message; and

b5. maintaining a distributed real-time operating system for running a plurality of processes in parallel, which processes share at least two of the following;

localized processing power, a device, a sensor, i/o, and file data.

2. A data processing system as claimed in claim 1, allowing furthermore interprocess communication on the basis of signals.

3. A data processing system as claimed in claim 1, wherein said storage node is coupled to a mass storage medium to allow reversible coupling with the mass storage medium.

4. A data processing system as claimed in claim 1, and organized as a plural-bus system in that at least one node interfaces to at least two buses of respective different protocols.

5. A data processing system as claimed in claim 1, and having queue management with respect to any server process allowing prespecifying of maximum access depth in that server process'"'"' queue.

6. A data processing system as claimed in claims 1 and having a server allocation mechanism for automatically detecting a need for creating a new server process.

7. A data processing system as claimed in claim 6 wherein said allocation mechanism is responsive to a locally received request for a particular resource from a user process that did not previously maintain an environment with respect to said particular resource.

8. A data processing system as claimed in claim 1, wherein said storage node means comprises

a first memory node

a second memory node, distinct from said first memory node and

mapping means for locally mapping at the second node at least a fraction of the contents of the memory at said first memory node.

9. A method of operating a navigation system in a surface vehicle comprising the steps of

maintaining stored geographical data in a memory under control of a storage node;

sensing physical quantities relating to said vehicle using at least one sensor;

receiving user inputs from within the vehicle via a user I/O device under control of a user I/O node;

processing, in a data processing node, the physical quantities and the geographical data to yield user policy data;

the user I/O node, the storage node, and the data processing node being referred to collectively herein as "the nodes";

the nodes, the sensor, the memory, the user I/O device, and all connections therebetween being referred to collectively herein as "the network";

supplying the user policy data to the user via the user I/O device under control of the user I/O node;

by cooperation of the nodes, providing a single shared operating system throughout the network, said providing including the following steps;

maintaining a library of messageable system calls or primitives, comprising;

open, close, read, write, seek, getstat, setstat, signal, and create;

maintaining a deterministic network control subsystem for effecting any network transport of a primitive within a prespecified maximum time interval;

within each of the nodes, processing any message only upon complete transfer thereof as a unitary entity;

within each of the nodes, with respect to each message, maintaining statelessness until completion of transfer of that message; and

running a plurality of processes in parallel, the processes sharing at least two elements of the network other than connections.

10. The method of claim 9, wherein the operating system has a logical structure which is independent of a physical structure of the network.

11. The method of claim 9, further comprising the step of communicating between at least two of the plurality of processes on the basis of signals.

12. The method of claim 9, wherein the memory is a mass storage medium and further comprising the step of reversibly coupling the mass storage medium to the storage node.

13. The method of claim 9, wherein the network comprises a plurality of buses, each bus having a respective protocol, at least one of the nodes interfacing to at least two buses of respective different protocols.

14. The method of claim 9, wherein at least one of the processes is a server process, and further comprising, within the shared operating system, managing at least one queue with respect to the server process so as to allow a prespecified maximum access depth to the server process.

15. The method of claim 9 wherein providing further comprises the following steps:

detecting a need for creating a new server process; and

allocating a server in response to such detection.

16. The method of claim 15 wherein the detecting step comprises receiving a request for a particular resource from a process that did not previously maintain an environment with respect to said particular resource.

17. The method of claim 9 wherein maintaining stored geographical data comprises locally mapping at a second memory node that is different from a first memory node, at least a fraction of geographical data stored under control of the first memory node, the first and second memory nodes being included in "the nodes" as defined.