Sharing list for multi-node DMA write operations

Details Sharing list for multi-node DMA write operations Sharing list for multi-node DMA write operations

1997-01-31

2002-04-30

Peikari, B. James (Department: 2186)

Electrical computers and digital data processing systems: input/

Input/output data processing

Direct memory accessing

C710S022000

Reexamination Certificate

active

06381657

ABSTRACT:

TECHNICAL FIELD OF THE INVENTION
This invention relates in general to memory accesses in multi-node, multi-processor, cache coherent non-uniform access system and relates in particular to a system and method for performing a write purge operation in such a system.
BACKGROUND OF THE INVENTION
The Scalable Coherent Interface (SCI) Direct Memory Access (DMA) write operations in the standard SCI specification completely over-writes the cache lines. If the DMA devices are only updating some of the bytes in the line, the information contained in the memory for the other bytes are lost in the complete overwrite.
The DMA write operation also relies on software to maintain cache coherency. If two devices are writing the same line, the second device can believe that it has finished purging all caches that contain the old data, even though the lines are being purged because of the first device. This second device can then allow other software to read stale data. The use of stale data by the software will cause program errors.
Other prior art methods for writing partial lines rely on reading the line into a local cache before the specified bytes are updated. This results in other desirable data being swapped out of the cache because of conflicts with the stored read data. In the end, this results in poor performance of other processes that are currently running because of the extra memory operations and the latency associated with refetching affected data.
Therefore, there is a need in the art for a method and system that has a write command that does not allow the use of stale data by the software.
In addition, there is a need in the art for a method and system that does not require reading memory lines into a local cache before the updating memory bytes.
SUMMARY OF THE INVENTION
These and other objects and features are achieved in a system which follows the same general flow as the DMA Write as described in the SCI specification, however, the inventive system and method does not detach the cache sharing list from memory. Instead, it joins the sharing list. This prevents another write purge from another node from believing it has finished its operation while memory lines are still encached. If no sharing list exists, a mask supplied by the command is used to merge the new data into memory. The system and method tracks down stale data in remote caches and merges it into the memory line using a mask instead of discarding it.
One technical advantage of the present invention is to issue a write purge command that joins the new node to the sharing list, while maintaining the connection between the memory and the sharing list.
Another technical advantage of the present invention is to have the new node issue the purging command to each node in the sharing list, while maintaining the connection between the memory and the sharing list.
A further technical advantage of the present invention is to have the new node issue the collapsing command to separate the sharing list from the memory after the purging command has been issued to each node. The collapsing command completes the destruction of the sharing list.
A further technical advantage of the present invention is to use a write mask with the write purge command.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and the specific embodiment disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims.


REFERENCES:
patent: 4975833 (1990-12-01), Jinzaki
patent: 5251303 (1993-10-01), Fogg, Jr. et al.
patent: 5297269 (1994-03-01), Donaldson et al.
patent: 5434976 (1995-07-01), Tan et al.
patent: 5446915 (1995-08-01), Pierce
patent: 5522045 (1996-05-01), Sandberg
patent: 5535116 (1996-07-01), Gupta et al.
patent: 5560027 (1996-09-01), Watson et al.
patent: 5577204 (1996-11-01), Brewer et al.
patent: 5598568 (1997-01-01), Frisch
patent: 5717897 (1998-02-01), McCrory
patent: 5742830 (1998-04-01), Elko et al.
patent: 5802578 (1998-09-01), Lovett
patent: 5845310 (1998-12-01), Brooks
patent: 5875352 (1999-02-01), Gentry et al.
patent: 5887135 (1999-03-01), Dahlen et al.
patent: 5900020 (1999-05-01), Safranek et al.
patent: 5940600 (1999-08-01), Staats et al.
patent: 6002757 (1999-12-01), Williams et al.
patent: 6041376 (2000-03-01), Gilbert et al.
patent: 6097801 (2000-08-01), Williams et al.

Affiliated with

Also associated with

Rating

Sharing list for multi-node DMA write operations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sharing list for multi-node DMA write operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharing list for multi-node DMA write operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2826472