Abstract—SDRAM is a popular off-chip memory that provides large data storage, high data rates, and is in general significantly cheaper than SRAM. There is a growing interest in using SDRAMs in safety critical application domains like aerospace, automotive and industrial automation. Some of these applications have hard real-time requirements where missing a deadline can have devastating consequence. Before integrating any hardware or software in this type of system it needs to be proven that deadlines will always be met. In practice, this is done by analyzing application’s timing behavior and calculating its Worst Case Execution Time (WCET). SDRAMs have variable access latencies depending on the refresh operation and the previous accesses. T...
Shared memory arbiters play a major role in determining the Worst Case Execution Time (Wcet) of appl...
In recent years, multicore processors have been receiving a significant amount of attention from avi...
[[abstract]]This paper describes an efficient algorithm which gives a bound on the worst-case execut...
This report introduces a shared resource arbitration scheme“DPQ- Dynamic Priority Queue”which provid...
Abstract—The transition towards multi-processor systems with shared resources is challenging for rea...
While the computing industry has shifted from single-core to multi-core processors for performance g...
Bounding the worst-case DRAM performance for a real-time application is a challenging problem that i...
Real-time safety-critical systems should provide hard bounds on an applications’ performance. SDRAM ...
A modern real-time embedded system must support multiple concurrently running applications. To reduc...
The use of multicores is becoming widespread inthe field of embedded systems, many of which have rea...
The usage of COTS-based multicores is becoming widespread in the field of embedded systems. Providin...
International audienceIn parallel applications, concurrently running tasks cause contention when acc...
MPSoCs are gaining popularity because of its potential to solve computationally expensive applicatio...
Multicore technology has the potential for drastically increasing productivity of embedded real-time...
Abstract—In modern non-customized multicore architectures, computing cores commonly share large part...
Shared memory arbiters play a major role in determining the Worst Case Execution Time (Wcet) of appl...
In recent years, multicore processors have been receiving a significant amount of attention from avi...
[[abstract]]This paper describes an efficient algorithm which gives a bound on the worst-case execut...
This report introduces a shared resource arbitration scheme“DPQ- Dynamic Priority Queue”which provid...
Abstract—The transition towards multi-processor systems with shared resources is challenging for rea...
While the computing industry has shifted from single-core to multi-core processors for performance g...
Bounding the worst-case DRAM performance for a real-time application is a challenging problem that i...
Real-time safety-critical systems should provide hard bounds on an applications’ performance. SDRAM ...
A modern real-time embedded system must support multiple concurrently running applications. To reduc...
The use of multicores is becoming widespread inthe field of embedded systems, many of which have rea...
The usage of COTS-based multicores is becoming widespread in the field of embedded systems. Providin...
International audienceIn parallel applications, concurrently running tasks cause contention when acc...
MPSoCs are gaining popularity because of its potential to solve computationally expensive applicatio...
Multicore technology has the potential for drastically increasing productivity of embedded real-time...
Abstract—In modern non-customized multicore architectures, computing cores commonly share large part...
Shared memory arbiters play a major role in determining the Worst Case Execution Time (Wcet) of appl...
In recent years, multicore processors have been receiving a significant amount of attention from avi...
[[abstract]]This paper describes an efficient algorithm which gives a bound on the worst-case execut...