Skip to main content
SpringerLink
Log in

Effects of job size irregularity on the dynamic resource scheduling of a 2-D mesh multicomputer

  • Paper Sessions
  • Conference paper
  • First Online:
Book cover PARLE '93 Parallel Architectures and Languages Europe (PARLE 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 694))

Abstract

Irregularities of the shapes and sizes of jobs are important factors affecting the performance of a resource scheduling algorithm in a 2-D mesh multicomputer. We examine the performance effect of irregularity, by examining a dynamic scheduling system that schedules jobs with requests that range from regular-shaped partitions of a multicomputer to irregular-shaped partitions. In order to evaluate the effect of irregularity, we examine a job scheduling algorithm called the BWQ-search algorithm, which uses multiple queues for ordering jobs to be placed on a 2-D mesh multicomputer. We find that the performance is similar when the system schedules jobs that request various types of irregular-shaped partitions. A large improvement in performance occurs if all jobs scheduled on the multicomputer request very regular-shaped partitions.

This research was supported in part by the NSF grant no. CCR-9010906, CDA-9121641 and CDA-9222901.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alverson, R., and et. al.: The Tera Computer System. In Proc. 1990 International Conference on Supercomputing (Jun 1990), pp. 1–6

    Google Scholar 

  2. Chen, M.-S., and Shin, K.: Processor Allocation in an N-Cube Multiprocessor Using Gray Code. IEEE Trans. on Computers C-36, 12 (Dec 1987), 1396–1407

    Google Scholar 

  3. Chuang, P.-J., and Tzeng, N.-F.: An Efficient Submesh Allocation Strategy for Mesh Computer Systems. In Proceedings of the 1991 International Conference on Distributed Computing Systems (May 1991), IEEE

    Google Scholar 

  4. Dally, W. J.: Performance Analysis of k-ary n-cube Interconnection Networks. IEEE Transactions on Computers 39, 6 (1990), 775–785

    Google Scholar 

  5. Dally, W. J., and Seitz, C. L.: The Torus Routing Chip. Journal of Distributed Computing 1, 3 (1986), 187–196

    Google Scholar 

  6. Krueger, P., Lai, T.-H., and Radiya, V. A.: Processor Allocation vs. Job Scheduling on Hypercube Computers. In Proceedings of the 1991 International Conference on Distributed Computing Systems (May 1991), IEEE

    Google Scholar 

  7. Leutenegger, S. T., and Vernon, M. K.: The Performance of Multiprogrammed Multiprocessor Scheduling Algorithms. Proc. of the 1990 ACM Conf. on Measurement and Modeling of Computer Systems (May 1990), ACM, pp. 226–236

    Google Scholar 

  8. Li, K., and Cheng, K. H.: A Two Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System. In Proceedings of the ACM Computer Science Conference (1990), pp. 22–28

    Google Scholar 

  9. Min, D., and Mutka, M. W.: A Framework for Predicting Delay Due to Job Interaction in a 2-D Mesh multicomputer. In Proc. of the 7th International Parallel Processing Symposium (Apr 1993), IEEE

    Google Scholar 

  10. Peng, D.-T., and Shin, K. G.: Static Allocation of Periodic Tasks with Precedence Constraints in Distributed Real-Time Systems In Proc. of Intl. Conf. on Distributed Computing Systems (1990), IEEE, pp. 190–198

    Google Scholar 

  11. Ramamritham, K.: Allocation and Scheduling of Complex Periodic Tasks. In Proc. of 1990 Int. Conference on Distributed Computing Systems (1990), IEEE, pp. 108–115

    Google Scholar 

  12. Seitz, C. L., and et. al.: The Architecture and Programming of the Amtek Series 2010 Multicomputer. In Proc. of the Third Conference on Hypercube Concurrent Computers and Applications, 1 (Jan 1988), ACM, pp. 33–36

    Google Scholar 

  13. Shirazi, B., and Wang, M.: Analysis and Evaluation of Heuristic Methods for Static Task Scheduling. Journal of Parallel and Distributed Computing (Oct 1990), 222–232

    Google Scholar 

  14. Silberschatz, A., Peterson, J., and Galvin, P.: Operating System Concepts, 3rd ed. Addison Wesley, 1991.

    Google Scholar 

  15. Zorpette, G.: Technology 1991: Minis and Mainframes. IEEE Spectrum (Jan 1991), 40–43

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Michigan State University, 48824-1027, East Lansing, MI

    Dugki Min & Matt W. Mutka

Authors
  1. Dugki Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matt W. Mutka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode Mike Reeve Gottfried Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Min, D., Mutka, M.W. (1993). Effects of job size irregularity on the dynamic resource scheduling of a 2-D mesh multicomputer. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-56891-3_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56891-9

  • Online ISBN: 978-3-540-47779-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation