Audials Tunebite 歷史版本列表
更新時間：2019-08-19
更新細節：
更新時間：2019-08-19
更新細節：
更新時間：2019-08-19
更新細節：
更新時間：2019-07-22
更新細節：
更新時間：2019-07-01
更新細節：
更新時間：2019-06-24
更新細節：
更新時間：2019-06-06
更新細節：
更新時間：2019-05-19
更新細節：
更新時間：2019-05-02
更新細節：
What's new in this version:
- The KiCad project is proud to announce the latest series 5 stable release of KiCad. The 5.1.2 stable version contains critical bug fixes and other minor improvements since the 5.1.0 release. It also includes improved footprint, symbol, and 3D model libraries, translations, and documentation. A list of all of the fixed bugs since the 5.1.0 release can be found on the KiCad 5.1.2 milestone page. This release contains several critical bug fixes so please consider upgrading as soon as possible
- If you are wondering why there was no "official" 5.1.1 release, there was a serious issue after 5.1.1 was tagged and some users had downloaded the unreleased 5.1.1 builds from the KiCad build server. The only way to prevent install conflicts was to create a new 5.1.2 tag with the bug fix and spin new builds. The KiCad project would like to apologize for any inconvenience this may have caused
- Version 5.1.2 is made from the lp:kicad/5.1 branch with some cherry picked changes from the development branch
- Packages for Windows, MacOS, and Linux are available or will be in the very near future. See the KiCad download page for guidance
更新時間：2019-04-23
更新細節：
What's new in this version:
- Since GPUs are so much better at trial factoring than CPUs, benchmarking no longer times prime95's trial factoring by default. Two new benchmarking options are available: OnlyBenchThroughput and OnlyBenchMaxCPUs. See undoc.txt for details.
- Slightly reduced the memory bandwidth requirements for several large FFTs. May lead to a very small speed increase for users testing 100 million digit numbers.
- If running more than worker, prime95 looks for any sin/cos data that it can share among the workers. Depending on the FFT sizes you are running, this could lead to a very slight reduction in needed memory bandwidth.
- Method for choosing the best FFT implementation changed. In previous versions, the FFT implementation that resulted in the fastest single worker timing was used. In this version the FFT implementation that had the best throughput was selected. For FMA3 FFTs I used a 4-core Skylake to measure best throughput. For AVX FFTs I used a 4-core Sandy Bridge to measure best throughput. Not many FFTs were affected, but you may see a few percent variation in throughput with this version.
- Improved AVX2 trial factoring in 64-bit executable. Trial factoring should still be done on a GPU. A GPU is on the order of 100 times more efficient at trial factoring than a CPU!!!
- Trial factoring now defines one "iteration" as processing 128KB of sieve, or 1M possible factors. In previous versions an iteration was defined as 16KB of sieve in 32-bit executables and 48KB in 64-bit executables. The trial factoring benchmark still times processing 16KB of sieve.
- Trial factoring in 64-bit executables is now multi-threaded.
- On initial install, the default settings for number of worker windows will be set to the number of cores / 4 with multithreading turned on.
- The worker windows dialog box now enforces a minimum number of multi-threaded cores for some work types to ensure timely completion of assignments. Also, the worker windows menu choice no longer allows assigning work to hyperthreads (they are rarely beneficial in prime95).
- This behavior can be overridden with the ConfigureHyperthreads undoc.txt feature.