|
franka |
  |
Novice
Déconnecté
Niveau : 1
N° de Membre :
6622
Ancienneté : 97%
Participation : 1%
Inscription: 28 Nov 2002
Localisation: la rochelle
Age: 62
Messages: 82
Sujets Lancés : 23
|
mentest
voila la descriptions en anglais
tu na plus qua la traduire :
Individual Test Descriptions
Memtest86 executes a series of numbered test sections to check for errors. These test sections consist of a combination of test algorithm, data pattern and cache setting. The execution order for these tests were arranged so that errors will be detected as rapidly as possible. Tests 8, 9, 10 and 11 are very long running extended tests and are only executed when extended testing is selected. The extended tests have a low probability of finding errors that were missed by the default tests. A description of each of the test sections follows:
Test 0 [Address test, walking ones, no cache]
Tests all address bits in all memory banks by using a walking ones address pattern.
Test 1 [Moving Inv, ones&zeros, cached]
This test uses the moving inversions algorithm with patterns of only ones and zeros. Cache is enabled even though it interferes to some degree with the test algorithm. With cache enabled this test does not take long and should quickly find all "hard" errors and some more subtle errors. This test is only a quick check.
Test 2 [Address test, own address, no cache]
Each address is written with its own address and then is checked for consistency. In theory previous tests should have caught any memory addressing problems. This test should catch any addressing errors that somehow were not previously detected.
Test 3 [Moving inv, 8 bit pat, cached]
This is the same as test one but uses a 8 bit wide pattern of "walking" ones and zeros. This test will better detect subtle errors in "wide" memory chips. A total of 20 data patterns are used.
Test 4 [Moving inv, 32 bit pat, cached]
This is a variation of the moving inversions algorithm that shifts the data pattern left one bit for each successive address. The starting bit position is shifted left for each pass. To use all possible data patterns 32 passes are required. This test is effective in detecting data sensitive errors in "wide" memory chips.
Test 5 [Block move, 64 moves, cached]
This test stresses memory by using block move (movsl) instructions and is based on Robert Redelmeier's burnBX test. Memory is initialized with shifting patterns that are inverted every 8 bytes. Then 4mb blocks of memory are moved around using the movsl instruction. After the moves are completed the data patterns are checked. Because the data is checked only after the memory moves are completed it is not possible to know where the error occurred. The addresses reported are only for where the bad pattern was found. Since the moves are constrained to a 8mb segment of memory the failing address will always be less than 8mb away from the reported address. Errors from this test are not used to calculate BadRAM patterns.
Test 6 [Modulo 20, ones&zeros, cached]
Using the Modulo-X algorithm should uncover errors that are not detected by moving inversions due to cache and buffering interference with the the algorithm. As with test one only ones and zeros are used for data patterns.
Test 7 [Moving inv, ones&zeros, no cache]
This is the same as test one but without cache. With cache off there will be much less interference with the test algorithm. However, the execution time is much, much longer. This test may find very subtle errors missed by previous tests.
Test 8 [Block move, 512 moves, cached]
This is the first extended test. This is the same as test #5 except that we do more memory moves before checking memory. Errors from this test are not used to calculate BadRAM patterns.
Test 9 [Moving inv, 8 bit pat, no cache]
By using an 8 bit pattern with cache off this test should be effective in detecting all types of errors. However, it takes a very long time to execute and there is a low probability that it will detect errors not found by the previous tests.
Test 10 [Modulo 20, 8 bit, cached]
This is the first test to use the Modulo-X algorithm with a data pattern other than ones and zeros. This combination of algorithm and data pattern should be quite effective. However, it's very long execution time relegates it to the extended test section.
Test 11 [Moving inv, 32 bit pat, no cache]
bonne chance:<<
<img src="C:\Documents and Settings\fr\Mes documents\Mes images\zdfbbg.gif"
francka
Signaler ce message à un modérateur | IP: Logguée
Temps en ligne : 1 Jour, 23 Heures, 5 Minutes, 21 Secondes en ligne
|
21-01-2003 14:46
Grande chance que ce soit la mémoire
