Concerning the Length of Time Slots for Efficient Gang Scheduling(Special Issue on Parallel and Distributed Computing, Applications and technologies)

スポンサーリンク

概要

• 論文の詳細を見る

• Applying gang scheduling can alleviate the blockade problem caused by exclusively used space-sharing strategies for parallel processing. However, the original form of gang scheduling is not practical as there are several fundamental problems associated with it. Recently many researchers have developed new strategies to alleviate some of these problems. Unfortunately, one important problem has not been so far seriously addressed, that is, how to set the length of time slots to obtain a good performance of gang scheduling. In this paper we present a strategy to deal with this important issue for efficient gang scheduling.

• 社団法人電子情報通信学会の論文
• 2003-09-01

著者

• Zhou Bing

  The School Of Information Technology Deakin University

• GOSCINSKI Andrzej

  the School of Information Technology, Deakin University

• BRENT Richard

  Oxford University Computing Laboratory

• Goscinski Andrzej

  The School Of Information Technology Deakin University

関連論文

• Concerning the Length of Time Slots for Efficient Gang Scheduling(Special Issue on Parallel and Distributed Computing, Applications and technologies)

スポンサーリンク