By Henry, on September 6th, 2015 New in the Cyclone V and Stratix V families, there seems to be carry lookahead at the LAB level (10 ALMs or 20 bits of addition), which can be seen by looking at the timing path through a big adder. But if there are two unrelated adders in a circuit, the carry lookahead is disabled if the length difference is near a multiple of 10, causing 70% higher delay for long adders. Bug? . . . → Read More: Cyclone/Stratix V Carry-Lookahead…bug?
By Henry, on August 11th, 2015 Yay, another security vulnerability in old software, this time in many versions of BIND. Here’s an RPM for Mandriva 2010.2 that upgrades BIND to 9.9.7 P2 (from 9.7.6). . . . → Read More: BIND patch for Mandriva 2010.2
By Henry, on August 10th, 2015 Processors that support paging use TLBs to cache translations. On x86, translation caches are not coherent and requires software to explicitly invalidate a TLB entry after updating a page table entry. Similarly, pagewalks are not guaranteed to be coherent, so modifying a page table entry must be followed by an invalidation even if the page table entry is not cached in the TLB.
Real processor implementations do not provide TLB coherence, but it turns out many (but not all) processors actually do provide pagewalk coherence. Most provide pagewalk coherence by detecting when page table entry update conflicts with a pagewalk’s memory accesses, but some provide coherence by disallowing speculative pagewalks, at some performance cost. I show a microbenchmark that can test for TLB and pagewalk coherence and whether speculative pagewalks are used.
. . . → Read More: TLB and Pagewalk Coherence in x86 Processors
By Henry, on August 10th, 2015 In processor architectures that support paging, there are usually one or more TLBs or pagewalk caches to cache address translations. On x86, these translation caches are not coherent with memory accesses that modify the page tables, and need invalidating after a page table entry is modified.
The Windows 9x kernel contains code that modifies a page table entry, then immediately uses it without an invalidation. This causes crashes if the processor strictly follows the instruction set specification and does not provide pagewalk coherence.
. . . → Read More: Windows 9x TLB Invalidation Bug
By Henry, on January 20th, 2015 The ASRock H81M-ITX does support adjusting multiplier ratios for K series Haswell processors. Oddly, this works in BIOS version 1.90, but not version 2.00. My boards came with version 2.00, and I had to downgrade to 1.90.
The four-phase VRM does make a small amount of noise and gets rather hot. There are no heatsinks . . . → Read More: ASRock H81M-ITX Overclocking
By Henry, on September 26th, 2014 Bash has bugs. Unfortunately, the bash parser was exposed through environment function importing, which had the potential for remotely exploiting the parser bugs. There’s been a series of patches for these issues. I’ve compiled packages of bash 4.3 for older versions of Mandriva Linux. . . . → Read More: Bash bug patch for older Mandriva distros
By Henry, on April 21st, 2014 Hardware: TP-Link TL-WN823N v1.1
Status: As of kernel 3.13.10, the in-tree rtl8192cu driver (in drivers/net/wireless/rtlwifi) is still broken. It will work and connect, but will silently disconnect after some time (and light traffic?). There is also some packet loss (around 1%). The driver provided by Realtek (8192cu) works much better. . . . → Read More: RTL8192CU and Linux 3.13.10
By Henry, on January 9th, 2014 In pipelined processors, instruction are executed speculatively and are not permitted to modify system state until instruction commit. For stores to memory, speculative stores write into a store queue at execution time and only write into cache after the store instructions have committed. Out of order memory execution requires hardware that learns dependencies between stores and loads, and also the ability to forward stored values from the store queue to loads that depend on them. I describe two variations of a microbenchmark that can measure some aspects of store-to-load forwarding and the memory execution hardware. These showed that AMD’s Bulldozer and Piledriver processors likely do not use a dynamic memory dependence predictor. They were also used to generate interesting 2D charts that can reveal some details about how the memory execution hardware might be designed. . . . → Read More: Store-to-Load Forwarding and Memory Disambiguation in x86 Processors
By Henry, on January 6th, 2014 Ever since Intel’s Hyper-Threading and AMD’s Bulldozer modules, there has been much debate on what qualifies as a real CPU “core”. Unfortunately, I don’t think “core” is easy to define, so marketing tends to name things for their own benefit. In the end, it’s the performance that matters, not the name. Two-way Hyper-Threading gives around 23% improvement over one thread, while two-way multithreading in a “module” gives 54%. This is still quite far from >90% that replicating the entire CPU core would achieve . . . → Read More: AMD Bulldozer/Piledriver Modules and Hyper-Threading
By Henry, on January 5th, 2014 After having built small cardboard cases for single computers, I tried building single cases for multiple machines. The idea is to share the power supply between four systems to reduce cost and increase packing density. Here are some pictures of two such systems I built . . . → Read More: More Cardboard Boxes
|
|