Demo Data from VLDB 2026 / reviewers in the wild / expert
Haowei Qiu
dblp:439/4270
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
code generation |
1.0 | 1 | 2026 | MFrodo: Efficient and Memory-Sensitive Simulink Code Generation via Redundancy Elimination · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Compilers and program optimization › compiler optimization
redundancy elimination |
1.0 | 1 | 2026 | MFrodo: Efficient and Memory-Sensitive Simulink Code Generation via Redundancy Elimination · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Embedded and real-time systems › embedded software engineering
embedded software development |
0.3 | 1 | 2026 | MFrodo: Efficient and Memory-Sensitive Simulink Code Generation via Redundancy Elimination · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2026 |
Methods — techniques the papers use, named apart from their topics
expression folding · 2.0dataflow analysis · 1.0data flow analysis · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | MFrodo: Efficient and Memory-Sensitive Simulink Code Generation via Redundancy EliminationabstractSimulink has emerged as the fundamental infrastructure that supports modeling, simulation, verification, and code generation for embedded software development. To improve the performance of the code generated from Simulink models, state-of-the-art code generators employ various optimization techniques, such as expression folding, variable reuse, and parallelism. However, they overlook the presence of redundant calculations within data-intensive models widely used to perform substantial data processing in embedded scenarios, which can significantly degrade the performance and introduce additional memory usage. This paper proposes MFRODO, an efficient and memory-sensitive code generator for data-intensive Simulink models through redundancy elimination. MFRODO begins by conducting model analysis to construct the dataflow graph and derive the I/O mapping of each block. Then, for each block within the dataflow graph, MFRODO recursively determines its calculation range by leveraging the I/O mapping of its subsequent blocks and marks optimization blocks whose calculation range is eliminated. For optimizable blocks, MFRODO eliminates the redundant calculations and reduces the memory space associated with these calculations. Finally, MFRODO rebuilds the I/O mappings of these optimizable blocks to ensure code correctness and synthesizes the embedded code for deployment. We implemented and evaluated MFRODO on benchmark Simulink models, in terms of execution duration, memory usage, and code generation overhead across different compilers and architectures. The results show that, compared with the Simulink Embedded Coder, DFSynth, and HCG, MFRODO achieves performance improvements ranging from 1.17× - 8.55×, while reducing BSS segment usage by 12.00% - 52.71%. Besides, MFRODO reduces compile time by 91.8% - 98.7% and code synthesis time by 94.3% - 99.6% compared with Simulink Embedded Coder, while incurring comparable overhead to DFSynth and HCG. Zehong Yu, Yixiao Yang, Zhuo Su 0005, Haowei Qiu, Rui Wang 0024, Aiguo Cui, Yu Jiang 0001 |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 4 |