Sciweavers

Share
RTCSA
2008
IEEE

Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration

8 years 10 months ago
Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration
—The convergence of application domains in new systems-on-chip (SoC) results in systems with many applications with a mix of soft and hard real-time requirements. To reduce cost, resources, such as memories and interconnect, are shared between applications. However, resource sharing introduces interference between the sharing applications, making it difficult to satisfy their real-time requirements. Existing arbiters do not efficiently satisfy the requirements of applications in SoCs, as they either couple rate or allocation granularity to latency, or cannot run at sufficiently high speeds in hardware with a low-cost implementation. The contribution of this paper is an arbiter called CreditControlled Static-Priority (CCSP), consisting of a rate regulator and a static-priority scheduler. The rate regulator isolates applications by regulating the amount of provided service in a way that decouples allocation granularity and latency. The static-priority scheduler decouples latency and...
Benny Akesson, Liesbeth Steffens, Eelke Strooisma,
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where RTCSA
Authors Benny Akesson, Liesbeth Steffens, Eelke Strooisma, Kees G. W. Goossens
Comments (0)
books