• DocumentCode
    3049731
  • Title

    Efficient memory access checking

  • Author

    Wilken, Kent D. ; Kong, Timothy

  • Author_Institution
    Dept. of Electr. & Comput. Eng., California Univ., Davis, CA, USA
  • fYear
    1993
  • fDate
    22-24 June 1993
  • Firstpage
    566
  • Lastpage
    575
  • Abstract
    A new approach provides efficient concurrent checking of memory accesses using a signature embedded into each instance of a data structure, and using a new LOAD/STORE instruction that reads the data structure signature as a side effect. Software memory-access faults are detectable using this approach, including corrupted pointers, uninitialized pointers, stale pointers, and copy overruns. Hardware memory-access faults are also detectable, including faults in the memory access path and the register file. Instruction scheduling minimizes the cost of the side-effect reads, and signatures are checked with little overhead using the hardware monitor previously proposed for signature monitoring. Benchmark results for the MIPS R3000 executing code scheduled by a modified GNU C Compiler show that an average of 53% of the memory accesses are checked, and that access checking causes an average of less than 5% performance overhead.
  • Keywords
    data structures; GNU C Compiler; LOAD/STORE instruction; MIPS R3000; concurrent checking; copy overruns; corrupted pointers; data structure; memory access checking; register file; signature; software memory-access faults; stale pointers; uninitialized pointers; Costs; Data structures; Delay; Error correction codes; Fault detection; Hardware; Monitoring; Processor scheduling; Redundancy; VLIW;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fault-Tolerant Computing, 1993. FTCS-23. Digest of Papers., The Twenty-Third International Symposium on
  • Conference_Location
    Toulouse, France
  • ISSN
    0731-3071
  • Print_ISBN
    0-8186-3680-7
  • Type

    conf

  • DOI
    10.1109/FTCS.1993.627359
  • Filename
    627359