Advertisement

Implementing the combination of time sharing and space sharing on AP/Linux

  • Kuniyasu Suzaki
  • David Walsh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1459)

Abstract

We report the implementation of a scheduling method which combines time sharing and space sharing on AP/Linux. To run many tasks simultaneously on a parallel computer, the parallel computer system needs a partitioning algorithm that can partition processors for incoming tasks. However, a typical problem for the algorithm is a blockade situation, which causes low processor utilization and slow response. To avoid such a situation, we present a Time Sharing System(TSS) scheme that uses a partitioning algorithm. In this paper we state the implementation design of our TSS on a real parallel computer, the Fujitsu AP1000+. The design is based on the parallel operating system, AP/Linux. We report our current implementation and the performance.

Keywords

time sharing space sharing partitioning algorithm AP/Linux 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    P. Chuang and N. Tzeng. An efficient submesh allocation strategy for mesh computer systems. Proceedings of the 11th International Conference on Distributed Computing Systems, pages 259–263, 1991.Google Scholar
  2. 2.
    K. Li and K. Cheng. A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. Journal of Parallel and Distributed Computing, (12):79–83, 1991.CrossRefGoogle Scholar
  3. 3.
    Y. Zhu. Efficient processor allocation strategies for mesh-connected parallel computers. Journal of Parallel and Distributed Computing, 16:328–337, 1992.MATHCrossRefGoogle Scholar
  4. 4.
    J. Ding and L. N. Bhuyan. An adaptive submesh allocation strategy for two-dimensional mesh connected systems. Proceedings of International Conference on Parallel Processing, pages (II)193–200, 1993.Google Scholar
  5. 5.
    D. D. Sharma and D. K. Pradhan. A fast and efficient strategy for submesh allocation in mesh-connected parallel computers. Procedings of the 5th IEEE Symposium on Parallel and Distributed Processing, pages 682–689, 1993.Google Scholar
  6. 6.
    S.M. Yoo and H.Y. Youn. An efficient task allocation scheme for two-dimensional mesh-connected systems. Proceedings of the 15th International Conference on Distributed Computing Systems, pages 501–508, 1995.Google Scholar
  7. 7.
    W. Liu, V. Lo, K. Windish, and B Nitzberg. Non-contiguous Processor Allocation Algorithms for Distributed Memory Multicomputers. Supercomputing, pages 227–236, 1994.Google Scholar
  8. 8.
    V. Lo, K. Windish, W. Liu, and B Nitzberg. Non-contiguous Processor Allocation Algorithms for Mesh-connected Multicomputers. IEEE Trans. on PARALLEL AND DISTRIBUTED SYSTEMS, 8(7):712–726, 1997.CrossRefGoogle Scholar
  9. 9.
    B. Yoo, C. Das, and C. Yu. Processor management techniques for mesh-connected multiprocessors. Proceedings on International Conference on Parallel Processing, pages II-105–112, 1995.Google Scholar
  10. 10.
    K. Suzaki, H. Tanuma, S. Hirano, Y. Ichisugi, and M. Tukamoto. Time sharing systems that use a partitioning algorithm on mesh-connected parallel computers. The Ninth International Conference on Parallel and Distributed Computing Systems, pages 268–275, 1996.Google Scholar
  11. 11.
    J.K. Ousterout. Scheduling techniques for concurrent Systems. Proceedings of the 3rd International Conference on Distributed Computing Systems, pages 22–30, 1982.Google Scholar
  12. 12.
    D. Feitelson and L. Rudolph. Distributed Hierachical Control for Parallel Processing. IEEE COMPUTER, 23(5):65–77, 1990.Google Scholar
  13. 13.
    A. Tridgell, P. Mackerras, D. Sitsky, and D. Walsh. Ap/linux a modern os for the apl000+. The 6th Parallel Computing Workshop, pages P2C1–P2C9, 1996.Google Scholar
  14. 14.
    Connection Machine CM-5 Technical Summary. Thinking Machines, 1992.Google Scholar
  15. 15.
    D. Feitelson. Packing Schemes for Gang Scheduling. Lecture Notes in Computer Science 1162, pages 89–110, 1996.Google Scholar
  16. 16.
    A. Hori, Y. Ishikawa, H. Konaka, M. Maeda, and T. Tomokiyo. A scalable time-sharing scheduling for partitionalble, distributed memory parallel machines. Proceedings of the 28th Annual Hawaii International Conference on System Sciences, pages 173–182, 1995.Google Scholar
  17. 17.
    D. Sitsky, P. Mackerras, A. Tridgell, and D. Walsh. Implementing MPI under AP/Linux. Second MPI Developers Conference, pages 32–39, 1996.Google Scholar
  18. 18.
    D. C. Burger, R. S. Hyder, B. P. Miller, and D.A. Wood. Paging Trade off in Distributed Shared-Memory Multiprocessors. Supercomputing, pages 590–599, 1994.Google Scholar
  19. 19.
    D. Walsh. Parallel process management on the ap1000+ under ap/linux. The 7th Parallel Computing Workshop, pages P1V1–P1v5, 1997.Google Scholar
  20. 20.
    K. Suzaki, H. Tanuma, S. Hirano, Y. Ichisugi, C. Connelly, and M. Tukamoto. Multi-tasking method on parallel computers which combines a contiguous and a non-contiguous processor partitioning algorithm. Lecture Notes in Computer Science 1184, pages 641–650, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Kuniyasu Suzaki
    • 1
    • 2
  • David Walsh
    • 1
  1. 1.Australian National UniversityCanberraAustralia
  2. 2.Electrotechnical LaboratoryTsukubaJapan

Personalised recommendations