Approximation algorithms for multiprocessor scheduling problem

Authors
Fujita, S Yamashita, M
Citation
S. Fujita et M. Yamashita, Approximation algorithms for multiprocessor scheduling problem, IEICE T INF, E83D(3), 2000, pp. 503-509
Citations number
47
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
ISSN journal
09168532 → ACNP
Volume
E83D
Issue
3
Year of publication
2000
Pages
503 - 509
Database
ISI
SICI code
0916-8532(200003)E83D:3<503:AAFMSP>2.0.ZU;2-V
Abstract
In this paper, we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (greater than or equal t o 1) identical processors connected by a complete network. The objective of this survey is to give a panoramic view of theoretical and/or practical ap proaches for solving the problem, that have been extensively conducted duri ng the past three decades.