Bounded arbitration algorithm for QoS-supported on-chip communication

Time-critical multi-processor systems require guaranteed services in terms of throughput, bandwidth etc. in order to comply to hard real-time constraints. However, guaranteedservice schemes suffer from low resource utilization. To the best of our knowledge, we are presenting the first approach for on-chip communication that provides a high resource utilization under a transaction-specific, flexible (i.e. different classifications on data exchange) communication scheme. It does provide tight time-related guarantees. Hence, we are presenting our bounded arbitration scheme considering lower and upper bounds for each type of transaction level. We demonstrate its advantages by means of a complete MPEG4 decoder case study and achieve under these constraints a bandwidth utilization of up to 100%, on an average 97% with a guaranteed (100%) bandwidth. Categories and Subject Descriptors: C.3[Special-purpose and application-based systems]: Real-time and embedded systems General Terms: Algor...

• Type: Conference
• Year: 2006
• Where: CODES
• Authors: Mohammad Abdullah Al Faruque, Gereon Weiss, Jörg Henkel
• Keywords: CODES 2006, Hardware-Software Codesign, Low Resource Utilization, Resource Utilization, Time-critical Multi-processor Systems