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

    Multiprocessor Scheduling
    Flow Time
    Heuristic Search
    Scheduling Problem
    Scheduling
    Scheduling algorithms
    List Scheduling
    Data storage equipment
    Depth-first Search
    Precedence Constraints
    Multiprocessor Systems
    Large-scale Problems
    Processing
    Parallel Processing
    Scheduling Algorithm
    Optimization Algorithm
    Approximate Solution
    NP-complete problem
    Optimization

    ASJC Scopus subject areas

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

    Cite this

    APPLICATION OF DF/IHS TO MINIMUM TOTAL WEIGHTED FLOW TIME MULTIPROCESSOR SCHEDULING PROBLEMS. / Kasahara, Hironori; Kai, Munenori; Narita, Seinosuke; Wada, Hidehiko.

    In: Systems and Computers in Japan, Vol. 19, No. 6, 06.1988, p. 25-34.

    Research output: Contribution to journalArticle

    Kasahara, Hironori ; Kai, Munenori ; Narita, Seinosuke ; Wada, Hidehiko. / APPLICATION OF DF/IHS TO MINIMUM TOTAL WEIGHTED FLOW TIME MULTIPROCESSOR SCHEDULING PROBLEMS. In: Systems and Computers in Japan. 1988 ; Vol. 19, No. 6. pp. 25-34.
    @article{677189ba80f24c019c02012e4906275c,
    title = "APPLICATION OF DF/IHS TO MINIMUM TOTAL WEIGHTED FLOW TIME MULTIPROCESSOR SCHEDULING PROBLEMS.",
    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.",
    author = "Hironori Kasahara and Munenori Kai and Seinosuke Narita and Hidehiko Wada",
    year = "1988",
    month = "6",
    language = "English",
    volume = "19",
    pages = "25--34",
    journal = "Systems and Computers in Japan",
    issn = "0882-1666",
    publisher = "John Wiley and Sons Inc.",
    number = "6",

    }

    TY - JOUR

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

    AU - Kasahara, Hironori

    AU - Kai, Munenori

    AU - Narita, Seinosuke

    AU - Wada, Hidehiko

    PY - 1988/6

    Y1 - 1988/6

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

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

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

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

    M3 - Article

    AN - SCOPUS:0024030438

    VL - 19

    SP - 25

    EP - 34

    JO - Systems and Computers in Japan

    JF - Systems and Computers in Japan

    SN - 0882-1666

    IS - 6

    ER -