Abstract
Campaign Scheduling is characterized by multiple job submissions issued from multiple users over time. This model perfectly suits today’s systems since most available parallel environments have multiple users sharing a common infrastructure. When scheduling individually the jobs submitted by various users, one crucial issue is to ensure fairness. This work presents a new fair scheduling algorithm called OStrich whose principle is to maintain a virtual time-sharing schedule in which the same amount of processors is assigned to each user. The completion times in the virtual schedule determine the execution order on the physical processors. Then, the campaigns are interleaved in a fair way by OStrich. For independent sequential jobs, we show that OStrich guarantees the stretch of a campaign to be proportional to campaign’s size and the total number of users. The stretch is used for measuring by what factor a workload is slowed down relative to the time it takes on an unloaded system. The theoretical performance of our solution is assessed by simulating OStrich compared to the classical FCFS algorithm, issued from synthetic workload traces generated by two different user profiles. This is done to demonstrate how OStrich benefits both types of users, in contrast to FCFS.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The number of active users may vary on time. Here, we assume that \(k\) is the biggest value it assume during the execution of the campaign.
References
Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52(2), 229–242 (2004)
Beaumont, O., Carter, L., Ferrante, J., Legrand, A., Marchal, L., Robert, Y.: Centralized versus distributed schedulers for bag-of-tasks applications. IEEE Trans. Parallel Distrib. Syst. 19(5), 698–709 (2008)
Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’98, pp. 270–279. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1998). http://dl.acm.org/citation.cfm?id=314613.314715
Bender, M.A., Muthukrishnan, S., Rajaraman, R.: Improved algorithms for stretch scheduling. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’02, pp. 762–771. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2002). http://dl.acm.org/citation.cfm?id=545381.545482
Bruno, J., Coffman, J.E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17(7), 382–387 (1974). http://doi.acm.org/10.1145/361011.361064
Casanova, H., Desprez, F., Suter, F.: Minimizing stretch and makespan of multiple parallel task graphs via malleable allocations. In: 2010 39th International Conference on Parallel Processing (ICPP), September 2010, pp. 71–80 (2010)
Celaya, J., Marchal, L.: A fair decentralized scheduler for bag-of-tasks applications on desktop grids. In: 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid), May 2010, pp. 538–541 (2010)
Donassolo, B., Legrand, A., Geyer, C.: Non-cooperative scheduling considered harmful in collaborative volunteer computing environments. In: Proceedings of the 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid, Computing, CCGRID’11, pp. 144–153 (2011)
Emeras, J., Pinheiro, V., Rzadca, K., Trystram, D.: Fair scheduling for multiple submissions. Research Report RR-LIG-033, LIG, Grenoble, France (2012)
Feitelson, D.: Workload modeling for computer systems performance evaluation (2005). http://www.cs.huji.ac.il/feit/wlmod/wlmod.pdf
Ghodsi, A., Sekar, V., Zaharia, M., Stoica, I.: Multi-resource fair queueing for packet processing. ACM SIGCOMM Comput. Commun. Rev. 42(4), 1–12 (2012)
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM JOURNAL ON APPLIED MATHEMATICS 17(2), 416–429 (1969)
Iosup, A., Jan, M., Sonmez, O.O., Epema, D.H.J.: The Characteristics and Performance of Groups of Jobs in Grids. In: Kermarrec, A.-M., Bougé, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 382–393. Springer, Heidelberg (2007)
Iosup, A., Sonmez, O., Anoep, S., Epema, D.: The performance of bags-of-tasks in large-scale distributed systems. In: Proceedings of the 17th International Symposium on High Performance Distributed Computing, pp. 97–108. ACM (2008)
Lee, C.Y.: Parallel machines scheduling with nonsimultaneous machine available time. Discrete Appl. Math. 30, 53–61 (1991). http://dx.doi.org/10.1016/0166-218X(91)90013-M
Legrand, A., Su, A., Vivien, F.: Minimizing the stretch when scheduling flows of biological requests. In: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’06, pp. 103–112. ACM, New York, NY, USA (2006). http://doi.acm.org/10.1145/1148109.1148124
Mehrzadi, D., Feitelson, D.G.: On extracting session data from activity logs. In: Proceedings of the 5th Annual International Systems and Storage Conference, SYSTOR’12, pp. 3:1–3:7 (2012)
Pinheiro, V., Rzadca, K., Trystram, D.: Campaign scheduling. In: IEEE International Conference on High Performance Computing (HiPC), Proceedings (2012, accepted for publication)
Raz, D., Levy, H., Avi-Itzhak, B.: A resource-allocation queueing fairness measure. SIGMETRICS Perform. Eval. Rev. 32(1), 130–141 (2004)
Sabin, G., Kochhar, G., Sadayappan, P.: Job fairness in non-preemptive job scheduling. In: Proceedings of the 2004 International Conference on Parallel Processing, ICPP’04, pp. 186–194 (2004)
Saule, E., Trystram, D.: Multi-users scheduling in parallel systems. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium, May 2009, pp. 1–9. Washington, DC, USA (2009)
Shmueli, E., Feitelson, D.: Using site-level modeling to evaluate the performance of parallel system schedulers. In: 14th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2006, MASCOTS 2006, September 2006, pp. 167–178 (2006)
Wu, Y., Cao, G.: Stretch-optimal scheduling for on-demand data broadcasts. In: Proceedings of Tenth International Conference on Computer Communications and Networks, pp. 500–504 (2001)
Zakay, N., Feitelson, D.G.: On identifying user session boundaries in parallel workload logs. In: Proceedings of the 16th Workshop on Job Scheduling Strategies for Parallel Processing. The Hebrew University, Israel (May 2012). http://www.cs.huji.ac.il/feit/parsched/jsspp12/p12-zakay.pdf
Acknowledgement
Krzysztof Rzadca is partly supported by Polish National Research Center SONATA grant UMO-2012/07/D/ST6/02440 Work partly supported by the French-Polish scientific cooperation program POLONIUM. Vinicius Pinheiro is partly supported by the CAPES/COFECUB Program (project number 4971/11-6).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Emeras, J., Pinheiro, V., Rzadca, K., Trystram, D. (2014). OStrich: Fair Scheduling for Multiple Submissions. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2013. Lecture Notes in Computer Science(), vol 8385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55195-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-55195-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-55194-9
Online ISBN: 978-3-642-55195-6
eBook Packages: Computer ScienceComputer Science (R0)