You are here: Home / RTLWS 1999-2017 / RTLWS Submitted Papers / 
2022-07-05 - 11:22

Dates and Events:

OSADL Articles:

2022-01-13 12:00

Phase #3 of OSADL project on OPC UA PubSub over TSN successfully completed

Another important milestone on the way to interoperable Open Source real-time Ethernet has been reached

2021-02-09 12:00

Open Source OPC UA PubSub over TSN project phase #3 launched

Letter of Intent with call for participation is now available

2016-11-12 12:00

Raspberry Pi and real-time Linux

Let's have a look at the OSADL QA Farm data

2016-09-17 12:00

Preemption latency of real-time Linux systems

How to measure it – and how to fix it, if it's too high?

Real Time Linux Workshops

1999 - 2000 - 2001 - 2002 - 2003 - 2004 - 2005 - 2006 - 2007 - 2008 - 2009 - 2010 - 2011 - 2012 - 2013 - 2014 - 2015

15th Real Time Linux Workshop, October 28 to 31, 2013 at the Dipartimento Tecnologie Innovative, Scuola Universitaria Professionale della Svizzera Italiana in Lugano-Manno, Switzerland

Announcement - Call for participation (ASCII)Hotels - Directions - AgendaPaper Abstracts - Presentations - Registration - Abstract Submission - Sponsors - Gallery

Predictable Coherent Caching with Incoherent Caches

Adam Lackorzynski, TU Dresden, Germany
Benjamin Engel, TU Dresden, Germany
Marcus Völp, TU Dresden, Germany

Caches are a well known mechanism for improving energy consumption and average performance by keeping frequently-used data near processing resources. Yet, at the same time, they form a major hurdle for worst-case execution time analyses, in particular if they are shared between multiple cores. Exploiting that most shared data objects are accessed or at least committed in a mutually exclusive manner, we demonstrate, using an ARM MP-Core multicore system, an explicit write-back synchronization scheme for shared data. We will analyze the performance and overheads it incurs, stressing predictability aspects. To our surprise, neither the local nor the shared caches need to be kept coherent for this scheme to work.