{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:28Z","timestamp":1725798628112},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319098722"},{"type":"electronic","value":"9783319098739"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09873-9_52","type":"book-chapter","created":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T06:04:21Z","timestamp":1407737061000},"page":"620-631","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Constructing DAG-Schedules with Large AREAs"],"prefix":"10.1007","author":[{"given":"Scott T.","family":"Roche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnold L.","family":"Rosenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Phillips, C.A.: Scheduling DAGs on asynchronous processors. In: 19th ACM Symp. on Parallel Algorithms and Architectures, pp. 35\u201345 (2007)","DOI":"10.1145\/1248377.1248384"},{"key":"52_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11823285_20","volume-title":"Euro-Par 2006 Parallel Processing","author":"S.-S. Boutammine","year":"2006","unstructured":"Boutammine, S.-S., Millot, D., Parrot, C.: An Adaptive Scheduling Method for Grid Computing. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol.\u00a04128, pp. 188\u2013197. Springer, Heidelberg (2006)"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Casanova, H., Dufoss\u00e9, F., Robert, Y., Vivien, F.: Scheduling parallel iterative applications on volatile resources. In: 25th IEEE Int\u2019l Parallel and Distributed Processing Symp. (2011)","DOI":"10.1109\/IPDPS.2011.97"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0166-218X(98)00143-7","volume":"98","author":"C. Chekuri","year":"1999","unstructured":"Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Math.\u00a098, 29\u201338 (1999)","journal-title":"Discrete Applied Math."},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1016\/j.jpdc.2012.06.007","volume":"72","author":"G. Cordasco","year":"2012","unstructured":"Cordasco, G., De Chiara, R., Rosenberg, A.L.: On scheduling DAGs for volatile computing platforms: Area-maximizing schedules. J. Parallel and Distr. Computing\u00a072, 1347\u20131360 (2012)","journal-title":"J. Parallel and Distr. Computing"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Cordasco, G., De Chiara, R., Rosenberg, A.L.: An AREA-oriented heuristic for scheduling DAGs on volatile computing platforms (2013) (submitted for publication), See also Assessing the Computational Benefits of AREA-Oriented DAG-Scheduling. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part I. LNCS, vol.\u00a06852, pp. 180\u2013192. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-23400-2_18"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Cordasco, G., Malewicz, G., Rosenberg, A.L.: Applying IC-scheduling theory to some familiar computations. In: Wkshp. on Large-Scale, Volatile Desktop Grids (2007)","DOI":"10.1109\/IPDPS.2007.370673"},{"key":"52_CR8","unstructured":"Cordasco, G., Rosenberg, A.L.: On scheduling series-parallel DAGs to maximize AREA. In: Int\u2019l J. Foundations of Computer Science (to appear, 2014)"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Estrada, T., Taufer, M., Reed, K.: Modeling job lifespan delays in volunteer computing projects. In: 9th IEEE Int\u2019l Symp. on Cluster, Cloud, and Grid Computing (2009)","DOI":"10.1109\/CCGRID.2009.69"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18, 30\u201355","DOI":"10.1137\/0218003"},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Kowalski, D.R.: Performing dynamically injected tasks on processes prone to crashes and restarts. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 165\u2013180. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24100-0_15"},{"key":"52_CR12","unstructured":"Gonz\u00e1lez-Escribano, A., van Gemund, A., Carde\u00f1oso-Payo, V.: Mapping unstructured applications into nested parallelism. In: High Performance Computing for Computational Sci. (2002)"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Hall, R., Rosenberg, A.L., Venkataramani, A.: A comparison of DAG -scheduling strategies for Internet-based computing. In: 21st IEEE Int\u2019l Parallel and Distr.\u00a0Processing Symp. (2007)","DOI":"10.1109\/IPDPS.2007.370245"},{"key":"52_CR14","doi-asserted-by":"crossref","unstructured":"Isard, M., Prabhakaran, V., Currey, J., Wieder, U., Talwar, K., Goldberg, A.: Quincy: Fair scheduling for distributed computing clusters. In: ACM Symp. on Operating Systs. Principles (2009)","DOI":"10.1145\/1629575.1629601"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Kondo, D., Casanova, H., Wing, E., Berman, F.: Models and scheduling mechanisms for global computing applications. In: 16th Int\u2019l Parallel and Distr.\u00a0Processing Symp. (2002)","DOI":"10.1109\/IPDPS.2002.1015590"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Korpela, E., Werthimer, D., Anderson, D., Cobb, J., Lebofsky, M.: SETI@home: massively distributed computing for SETI. In: Dubois, P.F. (ed.) Computing in Science and Engineering. IEEE Computer Soc. Press (2000)","DOI":"10.1109\/5992.895191"},{"key":"52_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E.L. Lawler","year":"1978","unstructured":"Lawler, E.L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Annals of Discrete Math.\u00a02, 75\u201390 (1978)","journal-title":"Annals of Discrete Math."},{"key":"52_CR18","first-page":"98","volume":"62","author":"M. Lombardi","year":"2013","unstructured":"Lombardi, M.: Robust scheduling of task graphs under execution time uncertainty. IEEE Trans.\u00a0Computers\u00a062, 98\u2013111 (2013)","journal-title":"IEEE Trans.\u00a0Computers"},{"key":"52_CR19","doi-asserted-by":"crossref","unstructured":"Millot, D.: Scheduling on unspecified heterogeneous distributed resources. In: IEEE Int\u2019l Symp. on Parallel and Distributed Processing: Wkshps. and PhD Forum, pp.45\u201356 (2011)","DOI":"10.1109\/IPDPS.2011.126"},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10723-007-9065-9","volume":"5","author":"G. Malewicz","year":"2007","unstructured":"Malewicz, G., Foster, I., Rosenberg, A.L., Wilde, M.: A tool for prioritizing DAGMan jobs and its evaluation. J. Grid Computing\u00a05, 197\u2013212 (2007)","journal-title":"J. Grid Computing"},{"key":"52_CR21","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TC.2006.91","volume":"55","author":"G. Malewicz","year":"2006","unstructured":"Malewicz, G., Rosenberg, A.L., Yurkewych, M.: Toward a theory for scheduling sc DAGs in Internet-based computing. IEEE Trans.\u00a0Comput.\u00a055, 757\u2013768 (2006)","journal-title":"IEEE Trans.\u00a0Comput."},{"key":"52_CR22","unstructured":"Nurmi, D., Wolski, R., Brevik, J.: Model-based checkpoint scheduling for volatile resource environments. In: Cluster 2005 (2005)"},{"key":"52_CR23","first-page":"165","volume":"18","author":"N. Policella","year":"2005","unstructured":"Policella, N.: Scheduling with uncertainty: A proactive approach using partial order schedules. AI Communications\u00a018, 165\u2013167 (2005)","journal-title":"AI Communications"},{"key":"52_CR24","doi-asserted-by":"crossref","unstructured":"Radulescu, A., van Gemund, A.J.C.: On the complexity of list scheduling algorithms for distributed memory systems. In: 13th Int\u2019l Conf. on Supercomputing, pp.68\u201375 (1999)","DOI":"10.1145\/305138.305162"},{"key":"52_CR25","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L.: On scheduling mesh-structured computations for Internet-based computing. IEEE Trans.\u00a0Comput.\u00a053, 1176\u20131186 (2004)","DOI":"10.1109\/TC.2004.64"},{"key":"52_CR26","volume-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"V. Sarkar","year":"1989","unstructured":"Sarkar, V.: Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, Cambridge (1989)"},{"issue":"2","key":"52_CR27","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1287\/opre.23.2.283","volume":"23","author":"J.B. Sidney","year":"1975","unstructured":"Sidney, J.B.: Decomposition algorithms for single-machine sequencing with precedence relations and deferral costs. Operations Res.\u00a023(2), 283\u2013298 (1975)","journal-title":"Operations Res."},{"key":"52_CR28","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. Smith","year":"1956","unstructured":"Smith, W.: Various optimizers for single-stage production. Naval Res.\u00a0Logistics Quart.\u00a03, 59\u201366 (1956)","journal-title":"Naval Res.\u00a0Logistics Quart."},{"key":"52_CR29","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H. Topcuoglu","year":"2002","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans.\u00a0Parallel and Distr.\u00a0Systs.\u00a013, 260\u2013274 (2002)","journal-title":"IEEE Trans.\u00a0Parallel and Distr.\u00a0Systs."},{"key":"52_CR30","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0166-218X(02)00427-4","volume":"131","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger, G.J.: On the approximability of average completion time scheduling under precedence constraints. Discr. Appl. Math.\u00a0131, 237\u2013252 (2003)","journal-title":"Discr. Appl. Math."},{"key":"52_CR31","doi-asserted-by":"crossref","unstructured":"Yao, S., Lee, H.-H.S.: Using mathematical modeling in provisioning a heterogeneous cloud computing environment., pp. 55\u201362. IEEE Computer (August 2011)","DOI":"10.1109\/MC.2011.96"},{"key":"52_CR32","unstructured":"Zaharia, M., Konwinski, A., Joseph, A.D., Katz, R., Stoica, I.: Improving MapReduce performance in heterogeneous environments. In: 7th USENIX Symp.\u00a0on Operating System Design and Implementation (2008)"},{"key":"52_CR33","doi-asserted-by":"crossref","unstructured":"Zheng, W.: A monte-carlo approach for full-ahead stochastic DAG-scheduling. In: 26th IEEE Int\u2019l Parallel and Distributed Processing Symp.: Wkshps. and PhD Forum, pp. 99\u2013112 (2012)","DOI":"10.1109\/IPDPSW.2012.8"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2014 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09873-9_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:21:18Z","timestamp":1587342078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09873-9_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319098722","9783319098739"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09873-9_52","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}