Embedded Multiprocessors: Scheduling and Synchronization
Embedded Multiprocessors: Scheduling and Synchronization
Resource Partition for Real-Time Systems
RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Periodic Resource Model for Compositional Real-Time Guarantees
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Scheduling within temporal partitions: response-time analysis and server design
Proceedings of the 4th ACM international conference on Embedded software
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
TDMA Time Slot and Turn Optimization with Evolutionary Search Techniques
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Optimal TDMA time slot and cycle length allocation for hard real-time systems
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Modelling run-time arbitration by latency-rate servers in dataflow graphs
SCOPES '07 Proceedingsof the 10th international workshop on Software & compilers for embedded systems
Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Dataflow models for shared memory access latency analysis
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Reduction techniques for synchronous dataflow graphs
Proceedings of the 46th Annual Design Automation Conference
Buffer Sizing for Rate-Optimal Single-Rate Data-Flow Scheduling Revisited
IEEE Transactions on Computers
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
IEEE Transactions on Signal Processing
Parameterized dataflow modeling for DSP systems
IEEE Transactions on Signal Processing
Dataflow analysis for multiprocessor systems with non-starvation-free schedulers
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
| Hi-index | 0.00 |
This paper proposes a new data ow model for analyzing the worst-case temporal behavior of resource arbitration through Time Division Multiplexing (TDM). TDM arbitration allows resource sharing amongst the tasks of concurrent applications, where each application may have its own end-to-end hard real time requirements, such as minimum throughput and maximum latency. Current data flow modeling techniques for the temporal analysis of TDM arbitration over-estimate the worst-case temporal behavior of tasks. This causes unnecessary over-reservation of resources to the application, leading to under-utilization of system re- sources and unnecessary rejection of additional applications. We propose a conservative data ow model that accurately estimates the worst-case temporal behavior of TDM arbitration. Unlike existing models, we do not make restrictive assumptions on the characteristics of TDM, nor on the amount of resources reserved. This enables optimized resource allocation for TDM arbitration. We present a new model that closely mimicks the worst-case temporal behavior of TDM arbitration. We formally prove that this model is conservative with respect to the worst-case behavior of TDM arbitration, and we prove that it is strictly more accurate than the state-of-the-art. Quantitatively, we show that our new model leads to a 20% improvement of resource allocation, in a case study of a wireless LAN radio down-link.