### 抜粋

This paper proposes a parallel optimization algorithm PDF/IHS for the minimum execution‐time multiprocessor scheduling problem which is a strong NP‐hard optimization problem. PDF/IHS is a parallelization and efficient implementation of the only practical optimization algorithm DF/IHS among those which have been proposed for this scheduling problem. In PDF/IHS, processors perform depth‐first search in parallel on a heuristically generated search tree in such a way that it is searched hierarchically from the left‐ and right‐hand sides. The effectiveness of PDF/IHS has been verified by simulation and practical parallel processing on Alliant FX4. As a result, it has been recognized that most of the problems which required a long time by DF/IHS can be solved approximately in time 1/m by PDF/IHS using m processors. Moreover, even for a problem which required a very long time or could not be solved in a practical time by DF/IHS, it has been verified that PDF/IHS can give solutions in time less than 1/m.

元の言語 | English |
---|---|

ページ（範囲） | 54-65 |

ページ数 | 12 |

ジャーナル | Systems and Computers in Japan |

巻 | 23 |

発行部数 | 13 |

DOI | |

出版物ステータス | Published - 1992 |

### ASJC Scopus subject areas

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

## フィンガープリント A parallel optimization algorithm for minimum execution‐time multiprocessor scheduling problem' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Systems and Computers in Japan*,

*23*(13), 54-65. https://doi.org/10.1002/scj.4690231305