{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:17:08Z","timestamp":1738387028638,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693833"},{"type":"electronic","value":"9783540693840"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69384-0_31","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:39:15Z","timestamp":1217486355000},"page":"254-263","source":"Crossref","is-referenced-by-count":2,"title":["Evaluation of Eligible Jobs Maximization Algorithm for DAG Scheduling in Grids"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Szepieniec","sequence":"first","affiliation":[]},{"given":"Marian","family":"Bubak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"You, S.Y., Kim, H.Y., Hwang, D.H., Kim, S.C.: Task Scheduling Algorithm in GRID Considering Heterogeneous Environment. In: Proc. of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2004, Nevada, USA, June 2004, pp. 240\u2013245 (2004)"},{"key":"31_CR2","unstructured":"Ma, T., Buyya, R.: Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids. In: Proc. of the 17th International Symposium on Computer Architecture and High Performance Computing, Rio de Janeiro, Brazil (October 2005)"},{"issue":"6","key":"31_CR3","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., Yurkewych, M.: Towards a Theory for Scheduling Dags in Internet-Based Computing. IEEE Transactions on Computers\u00a055(6), 757\u2013768 (2006)","journal-title":"IEEE Transactions on Computers"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1109\/TC.2004.64","volume":"53","author":"A.L. Rosenberg","year":"2004","unstructured":"Rosenberg, A.L.: On scheduling mesh-structured computations for Internet-based computing. IEEE Trans. Comput.\u00a053, 1176\u20131186 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TC.2005.65","volume":"54","author":"A.L. Rosenberg","year":"2005","unstructured":"Rosenberg, A.L., Yurkewych, M.: Guidelines for scheduling some common computation-dags for Internet-based computing. IEEE Trans. Comput.\u00a054, 428\u2013438 (2005)","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"31_CR6","first-page":"1045","volume":"18","author":"G. Cordasco","year":"2007","unstructured":"Cordasco, G., Malewicz, G., Rosenberg, A.L.: Advances in IC-Scheduling Theory: Scheduling Expansive and Reductive Dags and Scheduling Dags via Duality. IEEE TPDS\u00a018(11) (November 2007) ISSN: 1045-9219","journal-title":"IEEE TPDS"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Foster, I., Rosenberg, A., Wilde, M.: A Tool for Prioritizing DAGMan Jobs and Its Evaluation. In: 15th IEEE International Symposium on High Performance Distributed Computing (HPDC-15), pp. 156\u2013167 (2006)","DOI":"10.1109\/HPDC.2006.1652146"},{"key":"31_CR8","unstructured":"Dong, F., Akl, S.G.: Scheduling Algorithms for Grid Computing: State of the Art and Open Problems. Technical Report of Queen\u2019s University School of Computing, 2006-504 (January 2006)"},{"issue":"3","key":"31_CR9","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 Transactions on Parallel and Distributed Systems\u00a013(3), 260\u2013274 (2002)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Radulescu, A., van Gemund, A.J.C.: On the Complexity of List Scheduling Algorithms for Distributed Memory Systems. In: Proc. of 13th International Conference on Supercomputing, Portland, Oregon, USA, ovember 1999, pp. 68\u201375 (1999)","DOI":"10.1145\/305138.305162"},{"issue":"6","key":"31_CR11","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.future.2005.11.002","volume":"22","author":"Z. Shi","year":"2006","unstructured":"Shi, Z., Dongarra, J.J.: Scheduling workflow applications on processors with different capabilities. Future Generation Computer Systems\u00a022(6), 665\u2013675 (2006)","journal-title":"Future Generation Computer Systems"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Sakellariou, R., Zhao, H.: A Hybrid Heuristic for DAG Scheduling on Heterogeneous Systems. In: Proc. of 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, New Mexico USA, April 2004, pp. 111\u2013123 (2004)","DOI":"10.1109\/IPDPS.2004.1303065"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-45209-6_28","volume-title":"Euro-Par 2003 Parallel Processing","author":"H. Zhao","year":"2003","unstructured":"Zhao, H., Sakellariou, R.: An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 189\u2013194. Springer, Heidelberg (2003)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-540-74466-5_62","volume-title":"Euro-Par 2007 Parallel Processing","author":"F. Dong","year":"2007","unstructured":"Dong, F., Akl, S.G.: A Joint Data and Computation Scheduling Algorithm for the Grid. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol.\u00a04641, pp. 587\u2013597. Springer, Heidelberg (2007)"},{"key":"31_CR15","unstructured":"Wordwide LHC Grid Computing. Web page: http:\/\/lcg.web.cern.ch\/LCG\/"},{"key":"31_CR16","unstructured":"Daggen \u2013 Synthetic DAG Generation. http:\/\/www.loria.fr\/~suter\/dags.html"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Canon., L.C., Jeannot, E.: A Comparison of Robustness Metrics for Scheduling DAGs on Heterogeneous Systems. In: 6th Int. Workshop on Algorithms, Models and Tools \u2013 HeteroPar 2007, Austin (2007)","DOI":"10.1109\/CLUSTR.2007.4629283"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69384-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T07:31:17Z","timestamp":1738308677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69384-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693833","9783540693840"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69384-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}