The search functionality is under construction.

IEICE TRANSACTIONS on Information

Approximation Algorithms for Multiprocessor Scheduling Problem

Satoshi FUJITA, Masafumi YAMASHITA

  • Full Text Views

    0

  • Cite this

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.

Publication
IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.503-509
Publication Date
2000/03/25
Publicized
Online ISSN
DOI
Type of Manuscript
INVITED SURVEY PAPER
Category
Approximate Algorithms for Combinatorial Problems

Authors

Keyword