TWO-DIMENSIONAL PLACEMENT ALGORITHM FOR THE MASTER SLICE LSI LAYOUT PROBLEM.

Satoshi Goto

    研究成果: Chapter

    7 被引用数 (Scopus)

    抄録

    This paper deals with the optimum placement of blocks on a two-dimensional cell-array, which minimizes the total routing length of signal sets. A new heuristic procedure, based on iterative improvement, is proposed. The procedure repeats random generation of an initial solution and its improvement by a sequence of local transformations. The best among the local optimum solutions is taken as a final solution. The iterative improvement method proposed is different from previous ones in the sense that it considers interchanging more than two blocks at the same time and examines only a small portion of feasible solution which has high probability of being better. Experimental results show that this procedure gives better solutions than the best one up to now. The computation time for each local optimum solution grows almost linearly with regard to the number of blocks.

    本文言語English
    ホスト出版物のタイトルUnknown Host Publication Title
    Place of PublicationNew York, NY
    出版社IEEE
    ページ11-17
    ページ数7
    出版ステータスPublished - 1979
    イベントDes Autom Conf, 16th Annu, Proc - San Diego, CA, USA
    継続期間: 1979 6 251979 6 27

    Other

    OtherDes Autom Conf, 16th Annu, Proc
    CitySan Diego, CA, USA
    Period79/6/2579/6/27

    ASJC Scopus subject areas

    • Engineering(all)

    引用スタイル