A New Worst-Case Execution Time Estimation Algorithm of Embedded Hard Real-Time Programs

摘要

It is necessary to compute the execution time upper bound of embedded hard real-time program under the worst condition in embedded system design, which decides how hardware and software to partition and how to schedule process. Modern microprocessor which use cache memory system and instruction pre-fetching increase the difficulty to compute the upper bound accurately. A new estimation method of embedded software performance based on instruction cache and pre-fetching model is proposed, which use control flow graph and cache conflict graph and combine instruction pre-fetching into cache analysis, it makes the execution time upper bound more accurate. This paper propose an improved TCP pacing end-to-end congestion control algorithm to solve existing issues.