Dynamic iterative method for fast network partitioning

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Citations (Scopus)

    Abstract

    In this paper, we address multiway network partitioning problem of dividing the cells of network into multiple blocks so as to minimize the number of nets interconnecting cells in different blocks while balancing the blocks' sizes. The sequential iterative improvement algorithm for the problem consists of several passes each of which is performed by repeatedly iterating the move operation. Therefore, the whole execution time taken by the algorithm is greatly affected by the number of the move operations and the execution time for each move operation. We present a fast parallel algorithm for solving the multiway network partiotioning problem by reducing both of them. We propose a new dynamic iterative method which reduces the number of move operations executed at each pass dynamically, and hence speed up the whole algorithm sharply. Moreover, we reduced the execution time of each move by its parallelization using the proper cell distribution.

    Original languageEnglish
    Title of host publicationHigh Performance Computing and Networking - 8th International Conference, HPCN Europe 2000, Proceedings
    EditorsMarian Bubak, Hamideh Afsarmanesh, Bob Hertzberger, Roy Williams
    PublisherSpringer Verlag
    Pages81-88
    Number of pages8
    ISBN (Print)9783540675532
    DOIs
    Publication statusPublished - 2000
    Event8th International Conference on High Performance Computing and Networking, HPCNEurope 2000 - Amsterdam, Netherlands
    Duration: 2000 May 82000 May 10

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1823
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other8th International Conference on High Performance Computing and Networking, HPCNEurope 2000
    Country/TerritoryNetherlands
    CityAmsterdam
    Period00/5/800/5/10

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science

    Fingerprint

    Dive into the research topics of 'Dynamic iterative method for fast network partitioning'. Together they form a unique fingerprint.

    Cite this