Fast processor allocation and dynamic scheduling for mesh multiprocessors

    Authors

    Y. H. Zhu

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Comput. Syst. Sci. Eng.

    Keywords

    area tree; fragmentation; mesh-connected multiprocessor; processor; allocation; submesh; task scheduling; SYSTEMS; Computer Science, Hardware & Architecture; Computer Science, Theory &; Methods

    Abstract

    Processor allocation and task scheduling are two important aspects of partitionable multiprocessor systems. In earlier work, we studied the first-fit and the best-fit processor allocation strategies for mesh-connected systems and pointed out that the First-Come-First-Serve (FCFS) scheduling discipline is inefficient. In this study, we first develop a new first-fit allocation strategy, called the Area Tree (AT) strategy. It is implemented through a hierarchical data structure used in image processing. Compared with the earlier strategies, the AT strategy runs faster while maintaining performance. Then we investigate the issue of dynamic task scheduling: for mesh systems and present scheduling disciplines for reducing the system response time and increasing the system utilization. Extensive simulation runs have been conducted to compare the performance of the different allocation strategies and various scheduling disciplines.

    Journal Title

    Computer Systems Science and Engineering

    Volume

    11

    Issue/Number

    2

    Publication Date

    1-1-1996

    Document Type

    Article

    Language

    English

    First Page

    99

    Last Page

    107

    WOS Identifier

    WOS:A1996UB84500003

    ISSN

    0267-6192

    Share

    COinS