Skip to main content

Processor Scheduling in High-Performance Computing Environment Using MPI

  • Conference paper
  • First Online:
Innovations in Soft Computing and Information Technology

Abstract

Processor scheduling is the allocation of computer resources to tasks that can schedule on a processor system, so that restrict scheduling time and minimize completion time. Processor scheduling problems are NP-hard problems. To find the optimal near-optimal solutions for processor scheduling problems is most challenging tasks. There several conventional techniques for the processor scheduling namely—First-Come First-Serve (FCFS), Shortest Job-First (SJF), Round-Robin (RR), and priority based. In this paper, we implement FCFS technique on high-performance computing systems (HPCs) using message-passing application programmer interface (MPI). These algorithms dynamically schedule the process to finish tasks in a high-performance computing environment and showing promising results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Toktam Ghafarian, Hossein Deldari, Mohammad-R “Multiprocessor Scheduling with Evolving Cellular Automata Based on Ant Colony Optimization” IEEE Proceedings of the 14th International CSI Computer Conference (CSICC’09), pp. 432–436, (2009).

    Google Scholar 

  2. T. Shih, M. C. Ruey, HYueh-Min, W. Chung-Lun “Multiprocessor system scheduling with precedence and resource constraints using an enhanced ant colony system” Elsevier Ltd, pp. 2071–2018, (2007).

    Google Scholar 

  3. L. Shih-Tang, C. Ruey-Maw, H. Yueh-Min, W. Chung-Lun “Multiprocessor system scheduling with precedence and resource constraints using an enhanced ant colony system” Elsevier Ltd, pp. 2071–2081, (2007).

    Google Scholar 

  4. P. Annu and S.K. Sudip “A Survey on Multiprocessor Scheduling using Evolutionary Technique” 3rd international conference (NCCS-2017) Springer, 978-1-4673-9338-6, (2017).

    Google Scholar 

  5. T. Malhar, S. Rajiv, S. Priyam, C. Sheetal and R. Pooja “Efficient Implementation of Multilevel Feedback Queue Scheduling” IEEE WiSPNETconference, pp. 1950–1954, (2016).

    Google Scholar 

  6. R. Sandeep Singh and R. Lakshmi “Experiments with CPU Scheduling Algorithm on a Computational Grid” IEEE International Advance Computing Conference IACC, pp. 71–75, (2009).

    Google Scholar 

  7. Savas_ Balin “Non-identical parallel machine scheduling using genetic algorithm” Elsevier Ltd, pp. 6814–6821, (2010).

    Google Scholar 

  8. Z. Xingwu Zheng “Exploring plan-based scheduling for large-scale computing systems” IEEE, pp. 259–268, (2016).

    Google Scholar 

  9. Y. S. Byung and D. R. Chita “Good Processor Management = Fast Allocation + Efficient Scheduling” IEEE, pp. 280–287, (1997).

    Google Scholar 

  10. H. Hsiu-Jy and L. Wei-Ming “A Performance-Optimizing Scheduling Technique for Mesh-Connected Multicomputer Based on Real-Time Job Size Distribution” IEEE Proceedings of the Tenth International Conference on Parallel and Distributed Systems (ICPADS’04), 1521–9097, (2004).

    Google Scholar 

  11. D. Shun-LI, Y. Jing-BO, J. Jiu-Bin “An algorithm for Agent-based task scheduling in Grid Environments” IEEE Proceedings of the Third International Conference on Machine Learning and Cybemetics, Shanghai, 26–29 August, pp. 2809-2814, (2004).

    Google Scholar 

  12. L. William, K. George, and K. Vipin “Job Scheduling in the presence of Multiple Resource Requirements” IEEE Proceedings of the ACM/IEEE SC99 Conference, 1-58113-091-0, (1999).

    Google Scholar 

  13. S. k. Prabhat and G. Prasoon “Job Scheduling in the presence of Multiple Resource Requirements” IEEE Proceedings of the ACM/IEEE Conference (SC’99), pp. 513–517, (1999).

    Google Scholar 

  14. C. C. Marcia, P.P. Guilheme, P. L. Maurcio, M. B. Nicolas and N. O. A. Philippe. “Scheduling Dynamically Spawned Processes in MPI-2”.

    Google Scholar 

  15. A. Hadi lotfii, A. Broumandnia, A. Shahriar “Task Graph Scheduling in Multiprocessor Systems Using a Coarse Grained Genetic Algorithm” IEEE 2nd International Conference on Computer Technology and Development ICCTD, pp. 259–268, (2010).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Annu Priya .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Priya, A., Sahana, S.K. (2019). Processor Scheduling in High-Performance Computing Environment Using MPI. In: Chattopadhyay, J., Singh, R., Bhattacherjee, V. (eds) Innovations in Soft Computing and Information Technology . Springer, Singapore. https://doi.org/10.1007/978-981-13-3185-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-3185-5_5

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-3184-8

  • Online ISBN: 978-981-13-3185-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics