{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:16:19Z","timestamp":1743135379327,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642551949"},{"type":"electronic","value":"9783642551956"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55195-6_3","type":"book-chapter","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T14:55:32Z","timestamp":1399474532000},"page":"26-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["OStrich: Fair Scheduling for Multiple Submissions"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Emeras","sequence":"first","affiliation":[]},{"given":"Vinicius","family":"Pinheiro","sequence":"additional","affiliation":[]},{"given":"Krzysztof","family":"Rzadca","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52(2), 229\u2013242 (2004)","journal-title":"Oper. Res."},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TPDS.2007.70747","volume":"19","author":"O Beaumont","year":"2008","unstructured":"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\u2013709 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR3","unstructured":"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\u201998, pp. 270\u2013279. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1998). http:\/\/dl.acm.org\/citation.cfm?id=314613.314715"},{"key":"3_CR4","unstructured":"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\u201902, pp. 762\u2013771. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2002). http:\/\/dl.acm.org\/citation.cfm?id=545381.545482"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bruno, J., Coffman, J.E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17(7), 382\u2013387 (1974). http:\/\/doi.acm.org\/10.1145\/361011.361064","DOI":"10.1145\/361011.361064"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"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\u201380 (2010)","DOI":"10.1109\/ICPP.2010.16"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013541 (2010)","DOI":"10.1109\/CCGRID.2010.13"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"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\u201911, pp. 144\u2013153 (2011)","DOI":"10.1109\/CCGrid.2011.34"},{"key":"3_CR9","unstructured":"Emeras, J., Pinheiro, V., Rzadca, K., Trystram, D.: Fair scheduling for multiple submissions. Research Report RR-LIG-033, LIG, Grenoble, France (2012)"},{"key":"3_CR10","unstructured":"Feitelson, D.: Workload modeling for computer systems performance evaluation (2005). http:\/\/www.cs.huji.ac.il\/feit\/wlmod\/wlmod.pdf"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2377677.2377679","volume":"42","author":"A Ghodsi","year":"2012","unstructured":"Ghodsi, A., Sekar, V., Zaharia, M., Stoica, I.: Multi-resource fair queueing for packet processing. ACM SIGCOMM Comput. Commun. Rev. 42(4), 1\u201312 (2012)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM JOURNAL ON APPLIED MATHEMATICS 17(2), 416\u2013429 (1969)","journal-title":"SIAM JOURNAL ON APPLIED MATHEMATICS"},{"key":"3_CR13","series-title":"LNCS","first-page":"382","volume-title":"Euro-Par 2007","author":"A Iosup","year":"2007","unstructured":"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\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 382\u2013393. Springer, Heidelberg (2007)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"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\u2013108. ACM (2008)","DOI":"10.1145\/1383422.1383435"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Lee, C.Y.: Parallel machines scheduling with nonsimultaneous machine available time. Discrete Appl. Math. 30, 53\u201361 (1991). http:\/\/dx.doi.org\/10.1016\/0166-218X(91)90013-M","DOI":"10.1016\/0166-218X(91)90013-M"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"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\u201906, pp. 103\u2013112. ACM, New York, NY, USA (2006). http:\/\/doi.acm.org\/10.1145\/1148109.1148124","DOI":"10.1145\/1148109.1148124"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Mehrzadi, D., Feitelson, D.G.: On extracting session data from activity logs. In: Proceedings of the 5th Annual International Systems and Storage Conference, SYSTOR\u201912, pp. 3:1\u20133:7 (2012)","DOI":"10.1145\/2367589.2367592"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Pinheiro, V., Rzadca, K., Trystram, D.: Campaign scheduling. In: IEEE International Conference on High Performance Computing (HiPC), Proceedings (2012, accepted for publication)","DOI":"10.1109\/HiPC.2012.6507489"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/1012888.1005704","volume":"32","author":"D Raz","year":"2004","unstructured":"Raz, D., Levy, H., Avi-Itzhak, B.: A resource-allocation queueing fairness measure. SIGMETRICS Perform. Eval. Rev. 32(1), 130\u2013141 (2004)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Sabin, G., Kochhar, G., Sadayappan, P.: Job fairness in non-preemptive job scheduling. In: Proceedings of the 2004 International Conference on Parallel Processing, ICPP\u201904, pp. 186\u2013194 (2004)","DOI":"10.1109\/ICPP.2004.1327920"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Saule, E., Trystram, D.: Multi-users scheduling in parallel systems. In: Proceedings of IEEE International Parallel and Distributed Processing Symposium, May 2009, pp. 1\u20139. Washington, DC, USA (2009)","DOI":"10.1109\/IPDPS.2009.5161037"},{"key":"3_CR22","unstructured":"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\u2013178 (2006)"},{"key":"3_CR23","unstructured":"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\u2013504 (2001)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/978-3-642-35867-8_12"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55195-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T02:56:55Z","timestamp":1676861815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-55195-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642551949","9783642551956"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55195-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 May 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}