Approximation Algorithms for Multiprocessor Scheduling Problem(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2000-03-25

著者

• Fujita S

  Hiroshima Univ. Higashi‐hiroshima Jpn

• FUJITA Satoshi

  The Faculty of Engineering, Hiroshima University

• YAMASHITA Masafumi

  The Graduate School of Information Science and Electrical Engineering, Kyushu University

• Fujita Satoshi

  The Faculty Of Engineering Hiroshima University

• Yamashita Masafumi

  The Graduate School Of Information Science And Electrical Engineering Kyushu University

関連論文

• Approximation Algorithms for Multiprocessor Scheduling Problem(Special Issue on Algorithm Engineering : Surveys)

スポンサーリンク