@inproceedings{ec9879afd81848bf94ae4db54a3e650b,
title = "Job scheduling scheme for pure space sharing among rigid jobs",
abstract = "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.",
author = "Kento Aida and Hironori Kasahara and Seinosuke Narita",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 4th Workshop on Job Scheduling Strategies for Parallel Processing held in conjunction with IPPS/SPDP 1998 ; Conference date: 30-03-1998 Through 30-03-1998",
year = "1998",
doi = "10.1007/bfb0053983",
language = "English",
isbn = "3540648259",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "98--121",
editor = "Feitelson, {Dror G.} and Larry Rudolph",
booktitle = "Job Scheduling Strategies for Parallel Processing - IPPS/SPDP 1998 Workshop, Proceedings",
}