Architectural support for real-time task scheduling in SMT processors

In Simultaneous Multithreaded (SMT) architectures most hardware resources are shared between threads. This provides a good cost/performance trade-off which renders these architectures suitable for use in embedded systems. However, since threads share many resources, like caches, they also interfere with each other. As a result, execution times of applications become highly unpredictable and highly dependent on the context in which an application is executed. Obviously, this poses problems if an SMT is to be used in a (soft) real time system. In this paper, we propose two novel hardware mechanisms that can be used to reduce this performance variability. In contrast to previous approaches, our proposed mechanisms do not need any information beyond the information already known by traditional job schedulers. Neither do they require extensive profiling of workloads to determine optimal schedules. Our mechanisms are based on dynamic resource partitioning. The OS level job scheduler needs to be slightly adapted in order to provide the hardware resource allocator some information on how this resource partitioning needs to be done. We show that our mechanisms provide high stability for SMT architectures to be used in real time systems: the real time benchmarks we used meet their deadlines in more than 98% of the cases considered while the other thread in the workload still achieves high throughput.Postprint (published version

Enabling SMT for real-time embedded systems

In order to deal with real time constraints, current embedded processors are usually simple in-order processors with no speculation capabilities to ensure that execution times of applications are predictable. However, embedded systems require ever more compute power and the trend is that they will become as complex as current high performance systems. SMTs are viable candidates for future high performance embedded processors, because of their good cost/performance trade-off. However, current SMTs exhibit unpredictable performance. Hence, the SMT hardware needs to be adapted in order to meet real time constraints. This paper is a first step toward the use of high performance SMT processors in future real time systems. We present a novel collaboration between OS and SMT processors that entails that the OS exercises control over how resources are shared inside the processor. We illustrate this collaboration by a mechanism in which the OS cooperates with the SMT hardware to guarantee that a given thread runs at a specific speed, enabling SMT for real-time systems.Peer ReviewedPostprint (published version

Iterative Compilation in a Non-linear Optimisation Space

This paper investigates the applicability of iterative search techniques in program optimisation. Iterative compilation is usually considered too expensive for general purpose computing but is applicable to embedded applications where the cost is easily amortised over the number of embedded systems produced. This paper presents a case study, where an iterative search algorithm is used to investigate a nonlinear transformation space and find the fastest execution time within a fixed number of evaluations. By using execution time as feedback, it searches a large but restricted transformation space and shows performance improvement over existing approaches. We show that in the case of large transformation spaces, we can achieve within 0.3% of the best possible time by visiting less then 0.25% of the space using a simple algorithm and find the minimum after visiting less than 1% of the space

QoS for high-performance SMT processors in embedded systems

Although simultaneous multithreading processors provide a good cost-performance tradeoff, they exhibit unpredictable performance in real-time applications. We present a resource management scheme that eliminates a major cause of performance unpredictability in SMTs, making them suitable for many types of embedded systems.Peer ReviewedPostprint (published version

Data Prefetching and Targeted Loop Optimizations

Résumé disponible dans le fichier attach

The arrhythmogenic cardiomyopathy phenotype associated with PKP2 c.1211dup variant

Background: The arrhythmogenic cardiomyopathy (ACM) phenotype, with life-threatening ventricular arrhythmias and heart failure, varies according to genetic aetiology. We aimed to characterise the phenotype associated with the variant c.1211dup (p.Val406Serfs*4) in the plakophilin‑2 gene (PKP2) and compare it with previously reported Dutch PKP2 founder variants. Methods: Clinical data were collected retrospectively from medical records of 106 PKP2 c.1211dup heterozygous carriers. Using data from the Netherlands ACM Registry, c.1211dup was compared with 3 other truncating PKP2 variants (c.235C &gt; T (p.Arg79*), c.397C &gt; T (p.Gln133*) and c.2489+1G &gt; A (p.?)). Results: Of the 106 carriers, 47 (44%) were diagnosed with ACM, at a mean age of 41 years. By the end of follow-up, 29 (27%) had experienced sustained ventricular arrhythmias and 12 (11%) had developed heart failure, with male carriers showing significantly higher risks than females on these endpoints (p &lt; 0.05). Based on available cardiac magnetic resonance imaging and echocardiographic data, 46% of the carriers showed either right ventricular dilatation and/or dysfunction, whereas a substantial minority (37%) had some form of left ventricular involvement. Both geographical distribution of carriers and haplotype analysis suggested PKP2 c.1211dup to be a founder variant originating from the South-Western coast of the Netherlands. Finally, a Cox proportional hazards model suggested significant differences in ventricular arrhythmia–free survival between 4 PKP2 founder variants, including c.1211dup. Conclusions: The PKP2 c.1211dup variant is a Dutch founder variant associated with a typical right-dominant ACM phenotype, but also left ventricular involvement, and a possibly more severe phenotype than other Dutch PKP2 founder variants.</p

Familial Adenomatous Polyposis-Associated Desmoids Display Significantly More Genetic Changes than Sporadic Desmoids

Desmoid tumours (also called deep or aggressive fibromatoses) are potentially life-threatening fibromatous lesions. Hereditary desmoid tumours arise in individuals affected by either familial adenomatous polyposis (FAP) or hereditary desmoid disease (HDD) carrying germline mutations in APC. Most sporadic desmoids carry somatic mutations in CTNNB1. Previous studies identified losses on 5q and 6q, and gains on 8q and 20q as recurrent genetic changes in desmoids. However, virtually all genetic changes were derived from sporadic tumours. To investigate the somatic alterations in FAP-associated desmoids and to compare them with changes occurring in sporadic tumours, we analysed 17 FAP-associated and 38 sporadic desmoids by array comparative genomic hybridisation and multiple ligation-dependent probe amplification. Overall, the desmoids displayed only a limited number of genetic changes, occurring in 44% of cases. Recurrent gains at 8q (7%) and 20q (5%) were almost exclusively found in sporadic tumours. Recurrent losses were observed for a 700 kb region at 5q22.2, comprising the APC gene (11%), a 2 Mb region at 6p21.2-p21.1 (15%), and a relatively large region at 6q15-q23.3 (20%). The FAP-associated desmoids displayed a significantly higher frequency of copy number abnormalities (59%) than the sporadic tumours (37%). As predicted by the APC germline mutations among these patients, a high percentage (29%) of FAP-associated desmoids showed loss of the APC region at 5q22.2, which was infrequently (3%) seen among sporadic tumours. Our data suggest that loss of region 6q15-q16.2 is an important event in FAP-associated as well as sporadic desmoids, most likely of relevance for desmoid tumour progression