APPLICATION OF DF/IHS TO MINIMUM TOTAL WEIGHTED FLOW TIME MULTIPROCESSOR SCHEDULING PROBLEMS.

Hironori Kasahara, Munenori Kai, Seinosuke Narita, Hidehiko Wada

    Research output: Contribution to journalArticle

    Abstract

    In most cases, the scheduling problem for the multiprocessor system is NP- or strong NP-hard. For this problem, we have already proposed a practical optimization algorithm DF/IHS (Depth First/Implicit Heuristic Search), which combines the list-scheduling algorithm and the depth-first search, for the minimum parallel processing time multiprocessors scheduling problems. This paper presents a result of application of DF/IHS to the minimum total weighted flow time problem, which is used in the optimization of memory utilization. The problem of allocating tasks to m processors is considered with or without precedence constraints among the tasks. It was verified that the DF/IHS can be applied to this kind of problem effectively, where the optimal or highly accurate approximate solution is obtained for the large-scale problem with several hundreds of tasks.

    Original languageEnglish
    Pages (from-to)25-34
    Number of pages10
    JournalSystems and Computers in Japan
    Volume19
    Issue number6
    Publication statusPublished - 1988 Jun

      Fingerprint

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Hardware and Architecture
    • Information Systems
    • Theoretical Computer Science

    Cite this