Electrical computers and digital processing systems: memory – Storage accessing and control – Control technique
Reexamination Certificate
1998-01-07
2001-04-03
Harrell, Robert B. (Department: 2756)
Electrical computers and digital processing systems: memory
Storage accessing and control
Control technique
C711S100000, C711S144000, C711S152000, C709S213000, C709S229000, C710S200000, C710S240000
Reexamination Certificate
active
06212610
ABSTRACT:
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates generally to computer communication protocols, and more specifically to a message passing protocol which is integrated with a cache coherence protocol in a multiprocessing computer system.
2. Discussion of Background Art
Multiprocessor data computer systems consist of a plurality of processor nodes communicating over a high-speed interconnection network. Each processor node typically includes a processor and local Random Access Memory (RAM). A computational problem is divided among processor nodes so that the utilization of particular resources available at different processor nodes is maximized. Dividing the problem among processor nodes also reduces the time needed to produce a result and thereby expedites the computation. However, this division of labor necessarily implies that a process running on one processor node may depend on the results of computations being performed at another processor node. The various processes then must communicate over the interconnection network to exchange information relevant to their particular problems, and must also synchronize the processes.
The performance level of a multiprocessor system depends on the speed with which processors can communicate with one another. In the sharedmemory paradigm, communication is very fast because each processor can simply read what the other processors have written. However, this model does not offer communicating processes any protection from interfering with one another by inadvertently overwriting each other's critical memory areas. In the message-passing model, on the other hand, each processor can only access its own memory and can only communicate with other processors by explicitly building up a message and sending it to the other processor. This model offers the communicating processors protection from one another, because they cannot write to each other's memory. However, this model is also inefficient because typically the operating system must be invoked on both sides of the transfer (sender and receiver). These operating system calls slow communication between the processors. It is thus desirable to allow communicating processes access to designated areas in each other's memory directly but at the same time protecting against inadvertent accesses to other areas of memory, all without the need for operating system intervention on the receiving side.
A mechanism that allows one processor to protect itself from having another processor corrupt its memory inadvertently due to a hardware or software fault is disclosed in U.S. Pat. No. 5,448,698, issued Sep. 5, 1995 to Wilkes. The Wilkes protection-check mechanism uses a protection table at the target that specifies a key for a number of memory areas. The mechanism disclosed in the Wilkes patent has the disadvantage that a table must be built into the hardware and requires storage space that inherently contains only a limited number of entries.
SUMMARY OF THE INVENTION
The present invention resides in a computer system having a plurality of processor nodes and an interconnection. Each processor node is connected to the interconnection and has a memory and a memory bus connected to the memory. Each processor node has a plurality of processors and each processor has a cache. The computer system has a mesh coherence unit for controlling messages and memory access requests between the memory bus and the interconnection. The computer system has a lock and key mechanism wherein a processor node having its memory accessed retains a lock value to compute, by a function from a memory address, a key value and a temp value, and a processor node requesting a memory access is permitted memory access when the temp value matches the key value.
One object of the present invention is to provide a message passing system where operating system calls are not required on the target side.
Another object is to provide protection for processes running at different processor nodes to protect each process from damage.
Still another object is to avoid the use of a table that requires additional hardware and storage space, and which inherently can contain only a limited number of tabular entries.
REFERENCES:
patent: 5197141 (1993-03-01), Ito
patent: 5432929 (1995-07-01), Escola et al.
patent: 5448698 (1995-09-01), Wilkes
patent: 5450563 (1995-09-01), Gregor
patent: 5590309 (1996-12-01), Chencinski et al.
patent: 5724551 (1998-03-01), Greenstein et al.
patent: 5809546 (1998-09-01), Greenstein et al.
patent: 6009427 (1999-12-01), Wolff
patent: 0489583 (1992-06-01), None
patent: 0801349 (1997-10-01), None
Kohli Jaspal
Weber Wolf-Dietrich
Carr & Ferrell LLP
Fujitsu Limited
Harrell Robert B.
Willett Stephan
LandOfFree
Memory protection mechanism for a distributed shared memory... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Memory protection mechanism for a distributed shared memory..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory protection mechanism for a distributed shared memory... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2502116