论文信息 - Optimization problems in system-level synthesis∗

Optimization problems in system-level synthesis∗

System-level synthesis aims at partially automating the design and synthesis process of complex systems that consist of both hardware and software. This involves the usage of formal methods such as graph theory, as well as the formulation of some design steps explicitly as optimization problems. This paper describes such a graph-theoretic model, and presents three important optimization problems: scheduling, allocation, and partitioning. All of these turn out be NP-hard. However, some important sub-cases can be efficiently solved.

Z. Mann

[1] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[2] Ronald L. Graham. Combinatorial Scheduling Theory , 1978 .

[3] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[4] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[5] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .

[6] Béla Bollobás,et al. The chromatic number of random graphs , 1988, Comb..

[7] 李幼升,et al. Ph , 1989 .

[8] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .

[9] Christos H. Papadimitriou,et al. Computational complexity , 1993 .

[10] Ahmed Amine Jerraya,et al. Languages for System-Level Specification and Design , 1997 .

[11] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[12] Péter Arató,et al. High Level Synthesis of Pipelined Datapaths , 2001 .

[13] Zoltán Ádám Mann,et al. Integrating formal, soft and diagrammatic approaches in high-level synthesis and hardware-software co-design , 2001, GI Jahrestagung.

[14] Probabilistic Combinatorics , 2013 .