Job scheduling scheme for pure space sharing among rigid jobs

Kento Aida, Hironori Kasahara, Seinosuke Narita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationJob Scheduling Strategies for Parallel Processing - IPPS/SPDP 1998 Workshop, Proceedings
EditorsDror G. Feitelson, Larry Rudolph
PublisherSpringer Verlag
Pages98-121
Number of pages24
ISBN (Print)3540648259, 9783540648253
DOIs
Publication statusPublished - 1998 Jan 1
Event4th Workshop on Job Scheduling Strategies for Parallel Processing held in conjunction with IPPS/SPDP 1998 - Orlando, United States
Duration: 1998 Mar 301998 Mar 30

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1459
ISSN (Print)0302-9743
ISSN (Electronic)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)

Fingerprint Dive into the research topics of 'Job scheduling scheme for pure space sharing among rigid jobs'. Together they form a unique fingerprint.

  • Cite this

    Aida, K., Kasahara, H., & Narita, S. (1998). Job scheduling scheme for pure space sharing among rigid jobs. In D. G. Feitelson, & L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing - IPPS/SPDP 1998 Workshop, Proceedings (pp. 98-121). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1459). Springer Verlag. https://doi.org/10.1007/bfb0053983