**作者：**Jong-Chuang Tsay ; Yeh-Chin Ho**中文摘要：**A shared-bus system consists of multiple buses shared by multiple functional units. Two important problems involved in the high-level synthesis of such a system are: the scheduling problem and the resource allocation problem for a given data-flow graph (DFG). This paper proposes methods to optimally solve these two problems. The proposed methods are applicable to both non-iterative DFGs and iterative DFGs with non-unitary communication and computation times. To solve the scheduling problem, we introduce the extended DFG so that both computations and communications can be scheduled simultaneously to functional units and interconnection buses in a single integer linear programming formulation. To solve the resource allocation problem, we apply techniques of integer linear programming, circular-arc coloring, and channel assignment.**英文摘要：**--**中文關鍵字：**data-flow graphs, high-level synthesis, integer linear programming, resource allocation, scheduling, unfolding**英文關鍵字：**--