kingtous,Kingtous,github

Hi, I'm Kingtous👋

My Intro

Hi, Greetings from Kingtous! I'm Kingtous, a master student majoring in computer science and technology of Huazhong University of science and technology(HUST).

Studied in Northeastern University as an undergraduate and is now exempted from studying in Huazhong University of science and technology for a master's degree. Lets Fighting for the Top A!

For more details, see My CV, email me to get the access token.

My Strength

Researcher in Computer Science for Topic "Cyber Physical System (CPS)".
Contributor & Developer of one of the most famous and popular open-source remote desktop software rustdesk.
Developer for Android / Flutter / Serverless Full Stack Apps. Also half of fronted developer using React. Beginner of Rust Development.

My Career

[2021.9-now] M.E. in Huazhong University of Science and Technology (HUST).
- Supervisor: Quan Zhou
[2020.11-2021.4] Android MicroApp Framework Developer at ByteDance Corp. Also responsible for Android client of real-time audio translation project(Huo Shan Translation Engine) on Android.
[2017.9-2021.6] B.E. in NorthEastern University at Qinhuangdao (NEUQ).
- Supervisor: YanXia Lu

My Paper

Jinghao Sun, Tao Jin et.al:《ompTG: From OpenMP Programs to Task Graphs》 (the second and also the corresponding author)
- 《Journal of System Architecture》,CCF B, doi: 10.1016/j.sysarc.2022.102470
- ompTG: open source tool for OpenMP programs to task graphs.
- ompTG online for Docker
- Github: BOTS Benchmark Result

Abstract

Real-time systems are shifting them from single-core to multi-core processors. Software must be parallelized to fully utilize the computation power of multi-core architectures. OpenMP is a promising framework to develop parallel real-time software on multi-cores. OpenMP programs keep certain similarity to real-time task graph models, and this motivates much recent work done on real-time scheduling of OpenMP tasks. However, these studies conduct evaluations with randomly generated task graphs, which cannot well capture the structure features of realistic OpenMP programs. To fill the gap between theoretical real-time scheduling research and the OpenMP software reality, we develop an ompTG tool for transforming OpenMP programs into parallel task graphs. ompTG prepares a way to exhibit OpenMP such that the researchers in real-time community can easily understand: An OpenMP system consists of a set of tasks. There are interdependencies among tasks, and each task has an intra structure of the control-flow graph. Besides the topology of OpenMP tasks, we also provide a safe WCET for each vertex of OpenMP task graphs by using static WCET analysis techniques. Moreover, we derive the flow facts, e.g, infeasible path and loop bounds for the task graph, which is necessary information for real-time scheduling and analysis. As a case study, we collect 12 OpenMP programs from the BOTS benchmark, and transform them into task graphs, demonstrating the usage of ompTG.