METHOD AND A SYSTEM TO VERIFY SHARED MEMORY INTEGRITY
First Claim
Patent Images
1. A method for verifying an integrity of a shared memory using inline coding, the shared memory comprising a plurality of memory units, the plurality of memory units being accessed by a plurality of bus masters, the method comprising:
- an active stage step, wherein the active stage step comprises;
writing by each of the plurality of bus masters, a corresponding data to at least one memory unit from the plurality of memory units;
updating status corresponding to the at least one memory unit in a status database to modified state; and
a verification stage step, wherein the verification stage step comprises;
reading back the corresponding data written by each of the plurality of bus masters, from the at least one memory unit;
comparing the data read back by each of the plurality of bus masters, with an expected data written in the at least one memory unit, wherein the expected data written is a substantially similar to the corresponding data; and
updating and/or maintaining the status corresponding to the at least one memory unit in the status database to at least one of;
a verified state, on the event of a match being found between the data read back and the expected data written, by at least one of the plurality of bus masters; and
the modified state, on the event of a mismatch between the data read back and the expected data written by at least one of the plurality of bus masters.
1 Assignment
0 Petitions
Accused Products
Abstract
A method, a system and a computer program product including instructions for verification of the integrity of a shared memory using in line coding is provided. It involves an active step wherein multiple bus masters write a corresponding data to a shared memory. After that it also includes a verification step where data entered in the shared memory by multiple bus masters is verified.
10 Citations
20 Claims
-
1. A method for verifying an integrity of a shared memory using inline coding, the shared memory comprising a plurality of memory units, the plurality of memory units being accessed by a plurality of bus masters, the method comprising:
-
an active stage step, wherein the active stage step comprises; writing by each of the plurality of bus masters, a corresponding data to at least one memory unit from the plurality of memory units; updating status corresponding to the at least one memory unit in a status database to modified state; and a verification stage step, wherein the verification stage step comprises; reading back the corresponding data written by each of the plurality of bus masters, from the at least one memory unit; comparing the data read back by each of the plurality of bus masters, with an expected data written in the at least one memory unit, wherein the expected data written is a substantially similar to the corresponding data; and updating and/or maintaining the status corresponding to the at least one memory unit in the status database to at least one of; a verified state, on the event of a match being found between the data read back and the expected data written, by at least one of the plurality of bus masters; and the modified state, on the event of a mismatch between the data read back and the expected data written by at least one of the plurality of bus masters. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system for verifying an integrity of a shared memory using inline coding, the shared memory comprising a plurality of memory units, the plurality of memory units being accessed by a plurality of bus masters, the system comprising:
-
a write module for writing by each of the plurality of bus masters, a corresponding data to at least one memory unit from the plurality of memory units; a read module for reading back the corresponding data written by each of the plurality of bus masters, from the at least one memory unit; a compare module for matching the data read back by each of the plurality of bus masters, with an expected data written in the at least one memory unit, wherein the expected data written is substantially similar to the corresponding data; and an update module to update and/or maintain status corresponding to the at least one memory unit in a status database, wherein the update module performs at least one of; update the status corresponding to the at least one memory unit in the status database to modified state when the corresponding data is written by each of the plurality of bus masters; update the status database for the at least one memory unit to verified, on the event of a match being found between the data read back and the expected data written, by at least one of the plurality of bus masters; and maintain the status database for the at least one memory unit to the modified state, on the event of a mismatch being found between the data read back and the expected data written, by at least one of the plurality of bus masters - View Dependent Claims (7, 8, 9, 10)
-
-
11. A computer program product comprising computer readable medium, the computer readable medium comprising an inline code used for verifying an integrity of a shared memory, the shared memory comprises a plurality of memory units, the plurality of memory units being accessed by a plurality of bus masters, the computer program product comprising instructions for:
-
an active stage step, wherein the active stage step comprises; writing by each of the plurality of bus masters, a corresponding data to at least one memory unit from the plurality of memory units; updating status corresponding to the at least one memory unit in a status database to modified state; and a verification stage step, wherein the verification stage step comprises; reading back the corresponding data written by each of the plurality of bus masters, from the at least one memory unit; comparing the data read back by each of the plurality of bus masters, with an expected data written in the at least one memory unit, wherein the expected data written is substantially similar to the corresponding data; and updating and/or maintaining the status corresponding to the at least one memory unit in the status database to at least one of; a verified state, on the event of a match being found between the data read back and the corresponding data written, by at least one of the plurality of bus masters; and the modified state, on the event of a mismatch between the data read back and the expected data written by at least one of the plurality of bus masters. - View Dependent Claims (12, 13, 14, 15)
-
-
16. A method for verifying an integrity of a coherent shared memory using inline coding, the coherent shared memory comprising a plurality of memory units, the plurality of memory units being accessed by a plurality of bus masters, the plurality of bus masters comprising corresponding cache memory, the method comprising:
-
an active stage step, wherein the active stage step comprises; writing by each of the plurality of bus masters, a corresponding data to at least one memory unit from the plurality of memory units; updating status corresponding to the at least one memory unit in a status database to modified state; rewriting contents of the corresponding cache memory to the coherent shared memory; and a verification stage step, wherein the verification stage step comprises; reading back the corresponding data written by each of the plurality of bus masters, from the at least one memory unit; comparing the data read back by each of the plurality of bus masters, with an expected data written in the at least one memory unit, wherein the expected data written is a substantially similar to the corresponding data; and updating and/or maintaining the status corresponding to the at least one memory unit in the status database to at least one of; a verified state, on the event of a match being found between the data read back and the expected data written, by at least one of the plurality of bus masters; and the modified state, on the event of a mismatch between the data read back and the expected data written by at least one of the plurality of bus masters. - View Dependent Claims (17, 18, 19, 20)
-
Specification