Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration
Authors:
- Benny AkessonBABenny Akesson
- Liesbeth SteffensLSLiesbeth Steffens
- Eelke StrooismaESEelke Strooisma
- Kees GoossensKGKees Goossens
- 1 August 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (23251271) , 3-14
Abstract
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 high speeds in hardware with a low-cost implementation. The contribution of this paper is an arbiter called credit- controlled 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 rate, such that low latency can be provided to any application, regardless of the allocated rate. We show that CCSP belongs to the class of latency-rate servers and guarantees the allocated rate within a maximum latency, as required by hard real-time applications. We present a hardware implementation of the arbiter in the context of a DDR2 SDRAM controller. An instance with six ports running at 200 MHz requires an area of 0.0223 mm2 in a 90 nm CMOS process.Keywords
This publication has 21 references indexed in Scilit:
- Æthereal Network on Chip:Concepts, Architectures, and ImplementationsIEEE Design & Test of Computers, 2005
- Resource Reservation in Dynamic Real-Time SystemsReal-Time Systems, 2004
- Latency-rate servers: a general model for analysis of traffic scheduling algorithmsIEEE/ACM Transactions on Networking, 1998
- Carry-over round robin: a simple cell scheduling mechanism for ATM networksIEEE/ACM Transactions on Networking, 1998
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996
- Service disciplines for guaranteed performance service in packet-switching networksProceedings of the IEEE, 1995
- A simple and efficient bus management scheme that supports continuous streamsACM Transactions on Computer Systems, 1995
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Weighted round-robin cell multiplexing in a general-purpose ATM switch chipIEEE Journal on Selected Areas in Communications, 1991
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989