Simulation Scenarios

  • Art Sedighi
  • Milton Smith


Table 8.1 outlines the seventeen simulated scenarios run in our work. The goal of these simulations was to simulate the model proposed in Sect. 8.2. These simulations cover the four classes of job profiles discussed in Sect  1.2.


Case 1 Case 2 Case 3 Case 4 Case 5 Case 6 Case 7 Case 8 Case 9 Case 10 Case 11 Case 12 Case 13 Case 14 Case 15 Case 16 Case 17 Class A Class B Class C Class D 2 users 6 users 11 users 21 users Assumptions Simulations 


  1. D. Feitelson, L. Rudolph, U. Schwiegelshohn, K. Sevcik, P. Wong, Theory and practice in parallel job scheduling, in Job scheduling strategies for parallel processing, ed. by D. Feitelson, L. Rudolph, vol. 1291, (Springer, Heidelberg, 1997), pp. 1–34CrossRefGoogle Scholar
  2. S. D. Kleban, S. H. Clearwater, Fair share on high performance computing systems: What does fair really mean? Paper presented at the Cluster Computing and the Grid, 2003. Proceedings. CCGrid 2003. 3rd IEEE/ACM International Symposium on (2003)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Art Sedighi
    • 1
  • Milton Smith
    • 1
  1. 1.Industrial, Manufacturing & Systems EngineeringTexas Tech UniversityLubbockUSA

Personalised recommendations