Re: Testing RAM

Tech-Archive recommends: Repair Windows Errors & Optimize Windows Performance

Sorry, I cant speak to the "MemTest86+ Modulo 20 algorithm". Is there something that the test does on that particular motherboard AND memory stick combo? If the "problem" only shows up when those "3" items align, and nowhere else, then it's not a issue.

BTW, please don't use "sig seperators" unless you bottom post.

jaypeecee wrote:

Bob,

It's a question of what you mean by "Does the PC work properly with both sticks?" Under normal day-to-day use, the answer is "yes". However, if you subject the PC to specific memory tests, the answer has to be "no". If I use two sticks in any combination of the three available slots, then errors will arise during the MemTest86+ Modulo 20 algorithm. Both 512MB sticks I am using are identical - Crucial CT6464Z335 and this arrangement is a guaranteed compatible combination according to Crucial for my Asus P4S333 mobo.

.

Relevant Pages

  • Re: Turing Machines and Physical Computation
    ... rather than adumbrated in that 1936 Turing paper On Computable ... ... any actual computer has finite memory, ... computer will run out of memory for some huge calculation. ... It is generally assumed that an algorithm must satisfy the following ...
    (comp.theory)
  • Re: Turing Machines and Physical Computation
    ... rather than adumbrated in that 1936 Turing paper On Computable ... ... any actual computer has finite memory, ... computer will run out of memory for some huge calculation. ... It is generally assumed that an algorithm must satisfy the following ...
    (sci.math)
  • [Meta] for the record - please ignore (was Re: how to transpose large matrix?)
    ... Isn't it a bit pointless to include that attribution line then? ... asked for a solution that would save memory, ... going to compare an Oalgorithm to an Oalgorithm. ... computational complexity of storing the entire matrix in memory. ...
    (comp.unix.shell)
  • Solving the memory issue of lock-free algorithms
    ... I read a lot about lock-free algorithm and tried to find an "elegant" ... solution to the memory problem that the algorithms poses. ... LFStackNode *Next; ... xor eax, eax ...
    (comp.programming.threads)
  • Re: Version after Version
    ... MMX, by doing 50 times two additions at a time. ... Many compilers & memory managers have at least the option to align data on ... > - compression and decompression works at the Bit level ... > LZW is the until recently proprietory algorithm of Uinisys ...
    (alt.comp.lang.borland-delphi)