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
    ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    出版者Springer Verlag
    ページ98-121
    ページ数24
    1459
    ISBN(印刷物)3540648259, 9783540648253
    出版物ステータス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(印刷物)03029743
    ISSN(電子版)16113349

    Other

    Other4th Workshop on Job Scheduling Strategies for Parallel Processing held in conjunction with IPPS/SPDP 1998
    United States
    Orlando
    期間98/3/3098/3/30

    Fingerprint

    Job Scheduling
    Sharing
    Scheduling
    Evaluate
    Multiprocessor Systems
    Performance Analysis
    Queue
    Experiment
    Simulation
    Experiments

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    これを引用

    Aida, K., Kasahara, H., & Narita, S. (1998). Job scheduling scheme for pure space sharing among rigid jobs. : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (巻 1459, pp. 98-121). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 1459). Springer Verlag.

    Job scheduling scheme for pure space sharing among rigid jobs. / Aida, Kento; Kasahara, Hironori; Narita, Seinosuke.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 巻 1459 Springer Verlag, 1998. p. 98-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 1459).

    研究成果: Conference contribution

    Aida, K, Kasahara, H & Narita, S 1998, Job scheduling scheme for pure space sharing among rigid jobs. : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 巻. 1459, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 1459, Springer Verlag, pp. 98-121, 4th Workshop on Job Scheduling Strategies for Parallel Processing held in conjunction with IPPS/SPDP 1998, Orlando, United States, 98/3/30.
    Aida K, Kasahara H, Narita S. Job scheduling scheme for pure space sharing among rigid jobs. : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 巻 1459. Springer Verlag. 1998. p. 98-121. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Aida, Kento ; Kasahara, Hironori ; Narita, Seinosuke. / Job scheduling scheme for pure space sharing among rigid jobs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 巻 1459 Springer Verlag, 1998. pp. 98-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @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",
    year = "1998",
    language = "English",
    isbn = "3540648259",
    volume = "1459",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "98--121",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - Job scheduling scheme for pure space sharing among rigid jobs

    AU - Aida, Kento

    AU - Kasahara, Hironori

    AU - Narita, Seinosuke

    PY - 1998

    Y1 - 1998

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

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

    UR - http://www.scopus.com/inward/record.url?scp=84948983637&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84948983637&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:84948983637

    SN - 3540648259

    SN - 9783540648253

    VL - 1459

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 98

    EP - 121

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    PB - Springer Verlag

    ER -