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

Satoshi Goto

    Research output: Chapter in Book/Report/Conference proceedingChapter

    7 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationUnknown Host Publication Title
    Place of PublicationNew York, NY
    PublisherIEEE
    Pages11-17
    Number of pages7
    Publication statusPublished - 1979
    EventDes Autom Conf, 16th Annu, Proc - San Diego, CA, USA
    Duration: 1979 Jun 251979 Jun 27

    Other

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

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Goto, S. (1979). TWO-DIMENSIONAL PLACEMENT ALGORITHM FOR THE MASTER SLICE LSI LAYOUT PROBLEM. In Unknown Host Publication Title (pp. 11-17). New York, NY: IEEE.

    TWO-DIMENSIONAL PLACEMENT ALGORITHM FOR THE MASTER SLICE LSI LAYOUT PROBLEM. / Goto, Satoshi.

    Unknown Host Publication Title. New York, NY : IEEE, 1979. p. 11-17.

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Goto, S 1979, TWO-DIMENSIONAL PLACEMENT ALGORITHM FOR THE MASTER SLICE LSI LAYOUT PROBLEM. in Unknown Host Publication Title. IEEE, New York, NY, pp. 11-17, Des Autom Conf, 16th Annu, Proc, San Diego, CA, USA, 79/6/25.
    Goto S. TWO-DIMENSIONAL PLACEMENT ALGORITHM FOR THE MASTER SLICE LSI LAYOUT PROBLEM. In Unknown Host Publication Title. New York, NY: IEEE. 1979. p. 11-17
    Goto, Satoshi. / TWO-DIMENSIONAL PLACEMENT ALGORITHM FOR THE MASTER SLICE LSI LAYOUT PROBLEM. Unknown Host Publication Title. New York, NY : IEEE, 1979. pp. 11-17
    @inbook{56ba83d67f044db7a831f2193d7faf74,
    title = "TWO-DIMENSIONAL PLACEMENT ALGORITHM FOR THE MASTER SLICE LSI LAYOUT PROBLEM.",
    abstract = "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.",
    author = "Satoshi Goto",
    year = "1979",
    language = "English",
    pages = "11--17",
    booktitle = "Unknown Host Publication Title",
    publisher = "IEEE",

    }

    TY - CHAP

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

    AU - Goto, Satoshi

    PY - 1979

    Y1 - 1979

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=0018310104&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0018310104&partnerID=8YFLogxK

    M3 - Chapter

    SP - 11

    EP - 17

    BT - Unknown Host Publication Title

    PB - IEEE

    CY - New York, NY

    ER -