Mingxuan Yuan

TL;DR: This paper addresses the problem of mapping a homogeneous synchronous dataflow graph onto a multiprocessor platform with the objective of maximizing system throughput and presents two optimization approaches based on branch-and-bound and SAT-solving to explore the design space of all possible actor-to-processor mappings and static order schedules on each processor.

TL;DR: An efficient technique based on model-checking for exact analysis of minimal buffer requirement of an SDF graph to guarantee deadlock-free execution is presented.

TL;DR: This paper presents an online adaptive optimal control approach using Recursive Least Squares based model estimator plus Linear Quadratic optimal controller, and uses simulation experiments to demonstrate the effectiveness of the controller compared with the MPC-based controller.

TL;DR: This paper addresses the problem of static scheduling and software synthesis for dataflow graphs with the symbolic model-checker NuSMV using a two-step process: first use model-checking to obtain a static schedule, then synthesize efficient code from the static schedule with the objective of minimizing code size and performance overheads due to runtime dynamic decisions.

TL;DR: This work presents an efficient heuristic algorithm based on kernel recognition for the pipelined scheduling problem, a technique borrowed from SW pipelining, to overcome the scalability problem of the SMT-based optimal solution technique.