A Global Compaction of Microprograms Using Triangular Matrices and Junctiuon Blocks

삼각행렬과 접합블럭을 이용한 마이크로프로그램의 광역적 최적화

To represent the relations of the data dependency and resource conflict among micro-operations(MOP's) in the compaction process of microprograms, we propose a DDM (data dependent matrix) representation method instead of the DAG (conventional directed acyclic graph). Also, we propose a global compaction algorithm of microprograms to prevent a kind of block copying by cutting the trace at a junction block. The DDM method and compaction algoristhm have been applied to the Lah's example. The results shows that the proposed algorithm is more efficient than the conventional algorithms in reducing in reducing the total execution time and control memory space.