A Novel Analytical Technique for Timing Analysis of FMTV 2016 Verification Challenge Benchmark
Posted: Fri Jul 01, 2016
Title: A Novel Analytical Technique for Timing Analysis of FMTV 2016 Verification Challenge Benchmark
Authors:
Junchul Choi, Donghyun Kang, and Soonhoi Ha (Department of Computer Science and Engineering, Seoul National University, Korea)
Abstract: In this paper, we present solutions to FMTV 2016 verification challenges, combining the response time analysis and schedule time bound analysis. The worst case response time of a task is computed by the conventional response time analysis while the end-to-end latency of a cause-effect chain is conservatively estimated by considering the schedule time bounds of associated runnables. Three separate challenges are discussed in order. The proposed technique is first explained to address the first challenge that ignores the memory latency. For the second challenge, we estimate the memory access latency by computing the maximum possible arbitration delay with arrival curve analysis. Finally, we propose a heuristic algorithm that determines the mapping of data labels to optimize the end-to-end latency.
Attached paper:
Authors:
Junchul Choi, Donghyun Kang, and Soonhoi Ha (Department of Computer Science and Engineering, Seoul National University, Korea)
Abstract: In this paper, we present solutions to FMTV 2016 verification challenges, combining the response time analysis and schedule time bound analysis. The worst case response time of a task is computed by the conventional response time analysis while the end-to-end latency of a cause-effect chain is conservatively estimated by considering the schedule time bounds of associated runnables. Three separate challenges are discussed in order. The proposed technique is first explained to address the first challenge that ignores the memory latency. For the second challenge, we estimate the memory access latency by computing the maximum possible arbitration delay with arrival curve analysis. Finally, we propose a heuristic algorithm that determines the mapping of data labels to optimize the end-to-end latency.
Attached paper: