Thomas Piquet

dblp:81/1791 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 61% Embedded and real-time systems · 39%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › cache management › cache insertion policy
cache bypassing
0.112009
Using Bypass to Tighten WCET Estimates for Multi-Core Processors with Shared Instruction Caches · RTSS 2009
Memory systems › cache management
cache interference
0.112009
Using Bypass to Tighten WCET Estimates for Multi-Core Processors with Shared Instruction Caches · RTSS 2009
Embedded and real-time systems
worst-case execution time analysis
0.112009
Using Bypass to Tighten WCET Estimates for Multi-Core Processors with Shared Instruction Caches · RTSS 2009
Embedded and real-time systems
multicore real-time systems
0.012009
Using Bypass to Tighten WCET Estimates for Multi-Core Processors with Shared Instruction Caches · RTSS 2009

Methods — techniques the papers use, named apart from their topics

static analysis · 0.1compile-time cache partitioning · 0.1
YearPublicationVenuePosition
2009 Zero-content augmented caches
abstract
It has been observed that some applications manipulate large amounts of null data. Moreover these zero data often exhibit high spatial locality. On some applications more than 20% of the data accesses concern null data blocks. Representing a null block in a cache on a standard cache line appears as a waste of resources.
Julien Dusser, Thomas Piquet, André Seznec
ICS2
2009 Using Bypass to Tighten WCET Estimates for Multi-Core Processors with Shared Instruction Caches
abstract
Multi-core chips have been increasingly adopted by the microprocessor industry. For real-time systems to exploit multi-core architectures, it is required to obtain both tight and safe estimates of worst-case execution times (WCETs). Estimating WCETs for multi-core platforms is very challenging because of the possible interferences between cores due to shared hardware resources such as shared caches, memory bus, etc. This paper proposes a compile-time approach to reduce shared instruction cache interferences between cores to tighten WCET estimations. Unlike, which accounts for all possible conflicts caused by tasks running on the other cores when estimating the WCET of a task, our approach drastically reduces the amount of inter-core interferences. This is done by controlling the contents of the shared instruction cache(s), by caching only blocks statically known as reused. Experimental results demonstrate the practicality of our approach.
Damien Hardy, Thomas Piquet, Isabelle Puaut
RTSS2