This paper deals with the consensus problem for multi-agent linear dynamic systems with directed communication topology. All the agents are identical high-order linear systems and their state information is exchanged through a communication network with directed graph. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems. Examples are presented to show the effectiveness of the proposed method.