PCDVD數位科技討論區
(https://www.pcdvd.com.tw/index.php)
- 效能極限
(https://www.pcdvd.com.tw/forumdisplay.php?f=18)
- - 內顯遊戲機首選-AMD A10-7870K開箱測試
(https://www.pcdvd.com.tw/showthread.php?t=1081483)
|
---|
引用:
1.81.1,2017/10/19,支援i八代及Z370: http://download.cpuid.com/cpu-z/cpu-z_1.81-en.zip Intel Coffee Lake processors and Z370 platform Intel Skylake-X HCC processors Intel Xeon Skylake-SP and Xeon W Skylake processors |
引用:
29.3版,2017/9/7: ftp://mersenne.org/gimps/p95v293.win64.zip 1) A new error check for LL testing has been implemented. This error check, called a Jacobi error check, has a 50% chance of detecting hardware error(s) since the last time a Jacobi error check was performed. This error check takes roughly 30 seconds and is scheduled to run twice a day. The program now saves two additional intermediate files that have passed the Jacobi error check. This test requires use of the GMP (GNU multi-precision) library. 2) The GCD step in P-1 and ECM factoring is faster. 29.4版beta2,2017/10/31: ftp://mersenne.org/gimps/p95v294b2.win64.zip 1) GIMPS has a new sub-project -- finding (probable) prime Mersenne cofactors. This sub-project has two parts: 1) Running PRP tests, and 2) Finding additional factors. To support this new sub-project there are three new work preferences: PRP on Mersenne cofactors, PRP double-checking on Mersenne cofactors, ECM on Mersenne cofactors. 2) Like LL tests, PRP tests now support shift counts to aid in running double-checks. Shift counts are only supported for Mersenne numbers and Mersenne cofactors. 3) PRP tests now support a type of low overhead error checking that almost guarantees correct results even on flaky hardware. We call this Gerbicz error-checking after it was proposed by Robert Gerbicz at mersenneforum.org. This error-check only works for base-2 numbers. 4) Because PRP tests are highly reliable, we now offer the option to do PRP tests instead of Lucas-Lehmer primality tests. There are 3 new work preferences similar to LL work preferences: first-time PRP tests, world record PRP tests, PRP tests on 100 million digit numbers, and PRP double-checking. If you are looking for a 100 million digit prime, PRP testing is recommended rather than LL testing. 5) For non-base-2 PRP tests, there is a new option to run each iteration twice and rollback if a mismatch occurs. Useful only on flaky hardware due to the obvious high overhead. |
引用:
5.95,2017/11/27,修正HD、SSD讀寫或休眠時偶爾從監測中消失: http://download.aida64.com/aida64extreme595.zip Microsoft Windows 10 Fall Creators Update support Asus ROG RGB LED keyboard and mouse support Advanced support for AMD Ryzen Threadripper CPU Corsair Commander Pro and EVGA iCX sensor support Improvements for AMD X399, Intel X299 and Intel Z370 chipset based motherboards OpenGL 4.6 and WDDM 2.3 support RAID member enumeration for Intel NVMe RAID arrays GPU details for AMD Radeon Vega Series GPU details for nVIDIA GeForce GTX 1070 Ti, GeForce MX110, GeForce MX130 Preliminary support for nVIDIA Tesla V100 Series |
引用:
1.82.0,2017/12/1,支援64顆CPU: http://download.cpuid.com/cpu-z/cpu-z_1.82-en.zip Intel Xeon Phi Knight Landing preliminary support. Fix BCLK fluctuations on SKL-X. The benchmark does now support systems with more than 64 CPUs. |
引用:
29.4版beta5,2017/11/12: ftp://mersenne.org/gimps/p95v294b5.win64.zip 1) GIMPS has a new sub-project -- finding (probable) prime Mersenne cofactors. This sub-project has two parts: 1) Running PRP tests, and 2) Finding additional factors. To support this new sub-project there are three new work preferences: PRP on Mersenne cofactors, PRP double-checking on Mersenne cofactors, ECM on Mersenne cofactors. 2) Like LL tests, PRP tests now support shift counts to aid in running double-checks. Shift counts are only supported for Mersenne numbers and Mersenne cofactors. 3) PRP tests now support a type of low overhead error checking that almost guarantees correct results even on flaky hardware. We call this Gerbicz error-checking after it was proposed by Robert Gerbicz at mersenneforum.org. This error-check only works for base-2 numbers. 4) Because PRP tests are highly reliable, we now offer the option to do PRP tests instead of Lucas-Lehmer primality tests. There are 3 new work preferences similar to LL work preferences: first-time PRP tests, world record PRP tests, PRP tests on 100 million digit numbers, and PRP double-checking. If you are looking for a 100 million digit prime, PRP testing is recommended rather than LL testing. 5) For non-base-2 PRP tests, there is a new option to run each iteration twice and rollback if a mismatch occurs. Useful only on flaky hardware due to the obvious high overhead. 非AVX數學運算驗證,26.6版,2011/4/8: ftp://mersenne.org/gimps/p95v266.zip |
所有的時間均為GMT +8。 現在的時間是05:20 PM. |
vBulletin Version 3.0.1
powered_by_vbulletin 2024。