Abstract
SUMMARY In this paper we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (> 1) identical processors connected by a complete network. The objective of this survey is to give a panoramic view of theoretical and/or practical approaches for solving the problem that have been extensively conducted during the past three decades.
| Original language | English |
|---|---|
| Pages (from-to) | 503-509 |
| Number of pages | 7 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E83-D |
| Issue number | 3 |
| Publication status | Published - Jan 1 2000 |
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence