Execution Time Analysis of Communicating Tasks in Distributed Systems
IEEE Transactions on Computers
A tool for performance estimation of networked embedded end-systems
DAC '98 Proceedings of the 35th annual Design Automation Conference
Real-Time Schedulability Tests for Preemptive Multitasking
WPDRTS Selected papers from the 4th workshop on Parallel and distributed real-time systems
Estimating probabilistic timing performance for real-time embedded systems
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design
Allocating Bandwidth for Bursty Connections
SIAM Journal on Computing
Queueing Systems: Theory and Applications
Codesign of Embedded Systems: Status and Trends
IEEE Design & Test
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
Stochastic Load Balancing and Related Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Real-time queueing network theory
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Time
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Schedulability analysis of applications with stochastic task execution times
ACM Transactions on Embedded Computing Systems (TECS)
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
System-level performance/power analysis for platform-based design of multimedia applications
ACM Transactions on Design Automation of Electronic Systems (TODAES)
ACM Transactions on Embedded Computing Systems (TECS)
RMOT: recursion in model order for task execution time estimation in a software pipeline
Proceedings of the Conference on Design, Automation and Test in Europe
DAGS: distribution agnostic sequential Monte Carlo scheme for task execution time estimation
Proceedings of the Conference on Design, Automation and Test in Europe
Proceedings of the 48th Design Automation Conference
Proceedings of the International Conference on Computer-Aided Design
Embedded Systems Design
| Hi-index | 0.00 |
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distributions. Because of the extreme complexity of the problem, an exact solution is practically impossible to be obtained even for toy examples. Therefore, our methodology is based on approximating the generalized probability distributions of execution times by Coxian distributions of exponentials. Thus, we transform the generalized semi-Markov process, corresponding to the initial problem, into a continuous Markov chain (CTMC) which, however, is extremely large and, hence, most often is impossible to be stored in memory. We have elaborated a solution which allows to generate and analyze the CTMC in an efficient way, such that only a small part has to be stored at a given time. Several experiments investigate the impact of various parameters on complexity, in terms of time and memory, as well as the trade-offs regarding the accuracy of generated results.