Job scheduling scheme for pure space sharing among rigid jobs

Kento Aida, Hironori Kasahara, Seinosuke Narita

研究成果: Conference contribution

20 被引用数 (Scopus)

抄録

This paper evaluates the performance of job scheduling schemes for pure space sharing among rigid jobs. Conventional job scheduling schemes for the pure space sharing among rigid jobs have been achieved by First Come First Served (FCFS). However, FCFS has a drawback such that it can not utilize processors efficiently. This paper evaluates the performance of job scheduling schemes that are proposed to alleviate the drawback of FCFS by simulation, performance analysis and experiments on a real multiprocessor system. The results showed that Fit Processors First Served (FPFS), which searches the job queue and positively dispatches jobs that fit idle processors, was more effective and more practical than others.

本文言語English
ホスト出版物のタイトルJob Scheduling Strategies for Parallel Processing - IPPS/SPDP 1998 Workshop, Proceedings
編集者Dror G. Feitelson, Larry Rudolph
出版社Springer Verlag
ページ98-121
ページ数24
ISBN(印刷版)3540648259, 9783540648253
DOI
出版ステータスPublished - 1998
イベント4th Workshop on Job Scheduling Strategies for Parallel Processing held in conjunction with IPPS/SPDP 1998 - Orlando, United States
継続期間: 1998 3 301998 3 30

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1459
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other4th Workshop on Job Scheduling Strategies for Parallel Processing held in conjunction with IPPS/SPDP 1998
CountryUnited States
CityOrlando
Period98/3/3098/3/30

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Job scheduling scheme for pure space sharing among rigid jobs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル