Approximation algorithms for multiprocessor scheduling problem

Satoshi Fujita, Masafumi Yamashita

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

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 languageEnglish
Pages (from-to)503-509
Number of pages7
JournalIEICE Transactions on Information and Systems
VolumeE83-D
Issue number3
Publication statusPublished - Jan 1 2000

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Approximation algorithms for multiprocessor scheduling problem'. Together they form a unique fingerprint.

Cite this