Advertisement

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

  • Dugki Min
  • Matt W. Mutka
Paper Sessions Scheduling
Part of the Lecture Notes in Computer Science book series (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.

Keywords

Mesh System Processor Allocation Static Scheduler Multicomputer System Dynamic Resource Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alverson, R., and et. al.: The Tera Computer System. In Proc. 1990 International Conference on Supercomputing (Jun 1990), pp. 1–6Google Scholar
  2. 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–1407Google Scholar
  3. 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), IEEEGoogle Scholar
  4. 4.
    Dally, W. J.: Performance Analysis of k-ary n-cube Interconnection Networks. IEEE Transactions on Computers 39, 6 (1990), 775–785Google Scholar
  5. 5.
    Dally, W. J., and Seitz, C. L.: The Torus Routing Chip. Journal of Distributed Computing 1, 3 (1986), 187–196Google Scholar
  6. 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), IEEEGoogle Scholar
  7. 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–236Google Scholar
  8. 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–28Google Scholar
  9. 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), IEEEGoogle Scholar
  10. 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–198Google Scholar
  11. 11.
    Ramamritham, K.: Allocation and Scheduling of Complex Periodic Tasks. In Proc. of 1990 Int. Conference on Distributed Computing Systems (1990), IEEE, pp. 108–115Google Scholar
  12. 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–36Google Scholar
  13. 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–232Google Scholar
  14. 14.
    Silberschatz, A., Peterson, J., and Galvin, P.: Operating System Concepts, 3rd ed. Addison Wesley, 1991.Google Scholar
  15. 15.
    Zorpette, G.: Technology 1991: Minis and Mainframes. IEEE Spectrum (Jan 1991), 40–43Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Dugki Min
    • 1
  • Matt W. Mutka
    • 1
  1. 1.Department of Computer ScienceMichigan State UniversityEast Lansing

Personalised recommendations