An Abstract Interpretation-Based Framework for WCET Analysis of Parallel Programs

Estimating the Worst-Case Execution Time (WCET) of programs in an embedded multi-core environment is fundamental for schedulability analysis. In this paper, we propose a framework for calculating the WCET of programs originally designed for single-core systems when migrated to and executed in parallel on multi-core environments. First, we decompose single-core tasks and convert them into parallel programs using OpenMP. Our approach extends the task dependency graph to describe relevant information for parallel tasks (such as execution time estimation, core allocation, and inter-task dependencies). Finally, we present an iterative algorithm based on abstract interpretation. This algorithm takes the parallel task dependency graph as input and uses fixed-point analysis to determine the WCET of parallel programs. We conducted experiments on a physical machine to verify the feasibility of our solution.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icnsc62968.2024.10759926
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Abstract Interpretation-Based Framework for WCET Analysis of Parallel Programs

Kaiwen Zhang, Bin Gu, Guanjun Liu, Xiaofeng Li et al.
Parallel Computing and Optimization Techniques
article

An Abstract Interpretation-Based Framework for WCET Analysis of Parallel Programs

Kaiwen Zhang, Bin Gu, Guanjun Liu, Xiaofeng Li, Jian Guan, Xinbang Hu
article en

Abstract

Estimating the Worst-Case Execution Time (WCET) of programs in an embedded multi-core environment is fundamental for schedulability analysis. In this paper, we propose a framework for calculating the WCET of programs originally designed for single-core systems when migrated to and executed in parallel on multi-core environments. First, we decompose single-core tasks and convert them into parallel programs using OpenMP. Our approach extends the task dependency graph to describe relevant information for parallel tasks (such as execution time estimation, core allocation, and inter-task dependencies). Finally, we present an iterative algorithm based on abstract interpretation. This algorithm takes the parallel task dependency graph as input and uses fixed-point analysis to determine the WCET of parallel programs. We conducted experiments on a physical machine to verify the feasibility of our solution.

Tongji University (CN)
National Natural Science Foundation of China, Science and Technology Commission of Shanghai Municipality
Openalex Percentile: Top 77%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Abstract Interpretation-Based Framework for WCET Analysis of Parallel Programs — Kaiwen Zhang, Bin Gu, et al. · (2024) | TGRS Research Map | TGRS