
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Edi Shmueli, Dror G. Feitelson, "On Simulation and Design of ParallelSystems Schedulers: Are We Doing the Right Thing?," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 7, pp. 983996, July, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.152, author = {Edi Shmueli and Dror G. Feitelson}, title = {On Simulation and Design of ParallelSystems Schedulers: Are We Doing the Right Thing?}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {7}, issn = {10459219}, year = {2009}, pages = {983996}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.152}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  On Simulation and Design of ParallelSystems Schedulers: Are We Doing the Right Thing? IS  7 SN  10459219 SP983 EP996 EPD  983996 A1  Edi Shmueli, A1  Dror G. Feitelson, PY  2009 KW  Parallel job scheduling KW  tracedriven simulations KW  opensystem model KW  user behavior KW  feedback. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] D. Lifka, “The ANL/IBM SP Scheduling System,” Proc. IPPS Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '95), D.G. Feitelson and L. Rudolph, eds., pp. 295303, 1995.
[2] E. Shmueli and D.G. Feitelson, “Backfilling with Lookahead to Optimize the Packing of Parallel Jobs,” J. Parallel and Distributed Computing, vol. 65, no. 9, pp. 10901107, 2005.
[3] B.G. Lawson and E. Smirni, “MultipleQueue Backfilling Scheduling with Priorities and Reservations for Parallel Systems,” ACM SIGMETRICS Performance Evaluation Rev., vol. 29, no. 4, pp. 4047, 2002.
[4] A.W. Mu'alem and D.G. Feitelson, “Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 6, pp. 529543, June 2001.
[5] D. Talby and D.G. Feitelson, “Supporting Priorities and Improving Utilization of the IBM SP Scheduler Using SlackBased Backfilling,” Proc. 13th Int'l Symp. Parallel Processing and the 10th Symp. Parallel and Distributed Processing (IPPS/SPDP '99), p. 513, 1999.
[6] E. Shmueli and D.G. Feitelson, “Uncovering the Effect of System Performance on User Behavior from Traces of Parallel Systems,” Proc. 15th IEEE Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS '07), pp.274280, Oct. 2007.
[7] J. Zilber, O. Amit, and D. Talby, “What Is Worth Learning from Parallel Workloads? A User and Session Based Analysis,” Proc. 19th ACM Int'l Conf. Supercomputing (ICS '05), pp. 377386, June 2005.
[8] C.B. Lee and A. Snavely, “On the UserScheduler Dialogue: Studies of UserProvided Runtime Estimates and Utility Functions,” Int'l J. High Performance Computing Applications, vol. 20, no. 4, pp. 495506, 2006.
[9] D.G. Feitelson, “Packing Schemes for Gang Scheduling,” Proc. IPPS Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '96), D.G. Feitelson and L. Rudolph, eds., pp. 89110, 1996.
[10] D.G. Feitelson, “Locality of Sampling and Diversity in Parallel System Workloads,” Proc. 21st ACM Int'l Conf. Supercomputing (ICS '07), pp. 5363, June 2007.
[11] V. Lo and J. Mache, “Job Scheduling for Prime Time versus NonPrime Time,” Proc. IEEE Int'l Conf. Cluster Computing (CLUSTER '02), no. 4, pp. 488493, Sept. 2002.
[12] G. Sabin and P. Sadayappan, “Unfairness Metrics for SpaceSharing Parallel Job Schedulers,” Proc. 11th Int'l Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '05), D.G. Feitelson, E.Frachtenberg, L. Rudolph, and U. Schwiegelshohn, eds., pp.238256, 2005.
[13] S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan, “Selective Reservation Strategies for Backfill Job Scheduling,” Revised Papers from the Eighth Int'l Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '02), pp. 5571, 2002.
[14] J. William, A. Ward, C.L. Mahood, and J.E. West, “Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy,” Revised Papers from the Eighth Int'l Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '02), pp. 88102, 2002.
[15] A.B. Downey, “A Parallel Workload Model and Its Implications for Processor Allocation,” Cluster Computing, vol. 1, no. 1, pp.133145, 1998.
[16] J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riodan, “Modeling of Workload in MPPs,” Proc. IPPS Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '97), D.G. Feitelson and L. Rudolph, eds., pp. 95116, 1997.
[17] U. Lublin and D.G. Feitelson, “The Workload on Parallel Supercomputers: Modeling the Characteristics of Rigid Jobs,” J.Parallel and Distributed Computing, vol. 63, no. 11, pp.11051122, Nov. 2003.
[18] W. Cirne and F. Berman, “A Comprehensive Model of the Supercomputer Workload,” Proc. Fourth IEEE Int'l Workshop Workload Characterization (WWC '01), Dec. 2001.
[19] M.F. Arlitt, “Characterizing Web User Sessions,” ACM SIGMETRICS Performance Evaluation Rev., vol. 28, no. 2, pp.5063, 2000.
[20] H. Haugerud and S. Straumsnes, “Simulation of UserDriven Computer Behaviour,” Proc. 15th Usenix Conf. System Administration (LISA '01), pp. 101108, 2001.
[21] H. Hlavacs and G. Kotsis, “Modeling User Behavior: A Layered Approach,” Proc. Seventh IEEE Int'l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems (MASCOTS'99), p. 218, 1999.
[22] E. Shmueli and D.G. Feitelson, “Using SiteLevel Modeling to Evaluate the Performance of Parallel System Schedulers,” Proc. 14th IEEE Int'l Symp. Modeling, Analysis, and Simulation of Computer and Telecomm. Systems (MASCOTS '06), pp. 167178, 2006.
[23] A. Bouch, A. Kuchinsky, and N. Bhatti, “Quality Is in the Eye of the Beholder: Meeting Users' Requirements for Internet Quality of Service,” Proc. ACM SIGCHI Conf. Human Factors in Computing Systems (CHI '00), pp. 297304, 2000.
[24] D.N. Tran, W.T. Ooi, and Y.C. Tay, “Sax: A Tool for Studying CongestionInduced Surfer Behavior,” Proc. Passive and Active Measurement Conf. (PAM '06), Mar. 2006.
[25] K.T. Chen, C.Y. Huang, P. Huang, and C.L. Lei, “Quantifying Skype User Satisfaction,” Proc. ACM SIGCOMM '06, pp. 399410, 2006.
[26] D. Tsafrir, Y. Etsion, and D.G. Feitelson, “Backfilling Using SystemGenerated Predictions Rather Than User Runtime Estimates,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 789803, June 2007.
[27] S.H. Chiang, A. ArpaciDusseau, and M.K. Vernon, “The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance,” Proc. Eighth Int'l Workshop Job Scheduling Strategies for Parallel Processing (JSSPP '02), pp.103127, July 2002.