Search this article in Google Scholar


分類 解説
著者名 (author) Satoshi Fujita,Masafumi Yamashita
英文著者名 (author)
キー (key)
表題 (title) Approximation Algorithms for Multiprocessor Scheduling Problem
表題 (英文)
定期刊行物名 (journal) IEICE Trans. on Information and Systems
定期刊行物名 (英文)
巻数 (volume) E83-D
号数 (number) 3
ページ範囲 (pages) 503-509
刊行月 (month) March
出版年 (year) 2000
付加情報 (note)
注釈 (annote)
内容梗概 (abstract) 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.
論文電子ファイル Not available.


[5-0]  Satoshi Fujita and Masafumi Yamashita, ``Approximation Algorithms for Multiprocessor Scheduling Problem,'' IEICE Trans. on Information and Systems, vol. E83-D, no. 3, pp. 503-509, March 2000.

@article{5_0,
    author = {Satoshi Fujita and Masafumi Yamashita},
    author_e = {},
    title = {Approximation Algorithms for Multiprocessor Scheduling Problem},
    title_e = {},
    journal = {IEICE Trans. on Information and Systems},
    journal_e = {},
    volume = {E83-D},
    number = {3},
    pages = {503-509},
    month = {March},
    year = {2000},
    note = {},
    annote = {}
}

This site is maintained by Distributed System Laboratory.

PMAN 2.5.5 - Paper MANagement system / (C) 2002-2008, Osamu Mizuno / All rights reserved.