Author:
Mitra Tulika,Roychoudhury Abhik
Reference86 articles.
1. P. Altenbernd. 1996. On the false path problem in hard real-time programs. InProceedings of the Eighth Euromicro Workshop on Real-Time Systems (ECRTS), 102-07.
2. A. Anantaraman, K. Seth, K. Patil, E. Rotenberg, and F. Mueller. 2003. Virtual simple architecture (VISA): Exceeding the complexity limit in safe real-time systems. InProceedings of the 30th IEEE/ACM International Symposium on Computer Architecture (ISCA), 350-61.
3. R. Arnold, F. Mueller, D. B. Whalley, and M. G. Harmon. 1994. Bounding worst-case instruction cache performance. InProceedings of the 15th IEEE Real-Time Systems Symposium (RTSS), 172-81.
4. I. Bate and R. Reutemann. 2004. Worst-case execution time analysis for dynamic branch predictors. InProceedings of the 16th Euromicro Conference on Real-Time Systems (ECRTS), 215-22.
5. G. Bernat, A. Colin, and S. M. Petters. 2002. WCET analysis of probabilistic hard real-time systems. InProceedings of the 23rd IEEE Real-Time Systems Symposium (RTSS), 279-88.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scratchpad allocation for concurrent embedded software;ACM Transactions on Programming Languages and Systems;2010-04