Job Scheduling with Lookahead Group Matchmaking for Time/Space Sharing on Multi-core Parallel Machines

  • Xijie Zeng
  • Angela C. Sodan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5798)


Multi-core nodes of parallel machines may only provide gradual performance improvement per application due to competition on resources like the cache. As shown in our earlier work, spreading out applications over as many nodes as possible or letting different applications with potentially complementary characteristics (semi time) share each node by allocating different cores to them may provide better performance. In the latter case, groups of jobs may be necessary to obtain balanced resource utilization due to different sizes of jobs. We present a scheduler G-LOMARC-TS which can match groups of jobs and consider both space- and time-sharing allocation. Since matchmaking may select jobs further down in the waiting queue, fairness in regards to possible delays of the other jobs is watched and delays are kept within certain bounds. This results in a large number of possible combinations. A number of heuristics to select the most promising combinations make it possible to deal with the NP-completeness of the problem. We show that our scheduler improves utilization of high-load phases by about 27% and subsequently average response times by about 36% (and 53% for long jobs) compared to space sharing scheduling for normal workloads. Additionally the scheduler can handle much higher workloads than a space-sharing scheduler.


space sharing semi time sharing lookahead matchmaking job groups 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alves, F., Silva, B., Scherson, I.D.: Concurrent Gang – Towards a Flexible and Scalable Gang Scheduler. In: Proc. 11th Symp. on Computer Architecture and High Performance Computing, Natal, Brazil (September 1999)Google Scholar
  2. 2.
    Brightwell, R., Underwood, K.D., Vaughan, C.: An Evaluation of the Impacts of Network Bandwidth and Dual-Core Processors on Scalability. In: Proc. Internat. Supercomputing Conference, Dresden, Germany (June 2007)Google Scholar
  3. 3.
    Carrington, L., Wolter, N., Snavely, A., Bailey Lee, C.: Applying an Automated Framework to Produce Accurate Blind Performance Predictions of Full-Scale HPC Applications. In: Proc. DoD Users Group Conference, Williamsburg, Virginia. IEEE, Los Alamitos (2004)Google Scholar
  4. 4.
    Chai, L., Gao, Q., Panda, D.K.: Understanding the Impact of Multi-Core Architecture in Cluster Computing–A Case Study with Intel Dual-Core System. In: Proc. CCGRID, Rio de Janeiro, Brazil. IEEE, Los Alamitos (2007)Google Scholar
  5. 5.
    Esbaugh, B., Sodan, A.C.: Coarse-Grain Time Slicing with Resource-Share Control in Parallel-Job Scheduling. In: Perrott, R., Chapman, B.M., Subhlok, J., de Mello, R.F., Yang, L.T. (eds.) HPCC 2007. LNCS, vol. 4782, pp. 30–43. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Feitelson Workload Archive, (last retrieved January 2008)
  7. 7.
    Feitelson, D.G., Rudolph, L., Schwiegelsohn, U., Sevcik, K.C., Parkson, W.: Theory and Practice in Parallel Job Scheduling. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1997 and JSSPP 1997. LNCS, vol. 1291, pp. 1–34. Springer, Heidelberg (1997)Google Scholar
  8. 8.
    Jung, C., Lim, D., Lee, J., Han, S.: Adaptive Execution Techniques for SMT Multiprocessor Architectures. In: Proc. ACM SIGPLAN PPoPP, Chicago, Illinois (June 2005)Google Scholar
  9. 9.
    Leng, T., Ali, R., Hsieh, J., Mashayekhi, V., Rooholamini, R.: An Empirical Study of Hyper-Threading in High Performance Computing Clusters. In: Proc. Linux HPC Revolution, St. Petersburg, Florida (2002)Google Scholar
  10. 10.
    Lublin, U., Feitelson, D.G.: The Workload on Parallel Supercomputers-Modeling the Characteristics of Rigid Jobs. Journal of Parallel and Distributed Computing 63(11), 1105–1122 (2003)zbMATHCrossRefGoogle Scholar
  11. 11.
    Moscibroda, T., Mutlu, O.: Memory Performance Attacks: Denial of Memory Service in Multi-core Systems. In: Proc. 16th USENIX Security Symp., Boston, Mass. (2007)Google Scholar
  12. 12.
    Sabin, G., Sadayapan, P.: Unfairness Metrics for Space-Sharing Parallel Job Schedulers. In: Feitelson, D.G., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2005. LNCS, vol. 3834, pp. 238–256. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Sodan, A.C.: Adaptive Scheduling for QoS Virtual-Machines under Different Resource Availability–First Experiences. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2009. LNCS, vol. 5798, pp. 259–279. Springer, Heidelberg (2009)Google Scholar
  14. 14.
    Sodan, A.C.: Loosely Coordinated Coscheduling in the Context of Other Dynamic Approaches for Job Scheduling–A Survey. Concurrency & Computation: Practice & Experience 17(15), 1725–1781 (2005)zbMATHCrossRefGoogle Scholar
  15. 15.
    Sodan, A.C., Gupta, G., Deshmeh, A., Zeng, X.: Benefits of Semi Time Sharing and Trading Space vs. Time in Computational Grids. Technical Report 08-020, University of Windsor, Computer Science (May 2008)Google Scholar
  16. 16.
    Sodan, A.C., Gupta, G.: Time vs. Space Adaptation with ATOP-Grid. In: Proc. ACM Workshop on Adaptive and Reflective Middleware (ARM), Melbourne, Australia (November 2006)Google Scholar
  17. 17.
    Sodan, A.C., Lan, L.: LOMARC Lookahead Matchmaking for Multiresource Coscheduling on Hyperthreaded CPUs. IEEE Trans. on Parallel and Distributed Systems 17(11), 1360–1375 (2006)CrossRefGoogle Scholar
  18. 18.
    Talby, D., Feitelson, D.G.: Supporting Priorities and Improving Utilization of the IBM SP Scheduler Using Slack-Based Backfilling. In: Proc. Internat. Symp. on Parallel Processing & Symp. on Parallel and Distributed Processing (IPPS/SPDP), Puerto Rico. IEEE, Los Alamitos (1999)Google Scholar
  19. 19.
    Weinberg, J., Snavely, A.: Symbiotic Space-Sharing on SDSC’s DataStar System. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2006. LNCS, vol. 4376, pp. 192–209. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  20. 20.
    Wiseman, Y., Feitelson, D.G.: Paired Gang Scheduling. IEEE Trans. Parallel and Distributed Systems 14(6), 581–592 (2003)Google Scholar
  21. 21.
    Zeng, X., Shi, J., Cao, X., Sodan, A.C.: Grid Scheduling with ATOP-Grid under Time Sharing. In: Proc. CoreGrid Workshop on Grid Middleware, Dresden. Springer, Heidelberg (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Xijie Zeng
    • 1
  • Angela C. Sodan
    • 1
  1. 1.University of WindsorWindsorCanada

Personalised recommendations