{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:02:05Z","timestamp":1648771325891},"reference-count":17,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Many modern computing platforms are \u201ctask-hungry\u201d: their performance is enhanced by always having as many tasks available for execution as possible. IC-scheduling, a master-worker framework for executing static computations that have intertask dependencies (modeled as dags), was developed with precisely the goal of rendering a computation-dag\u2019s tasks eligible for execution at the maximum possible rate. The current paper addresses the problem of enhancing IC-scheduling so that it can accommodate the varying computational resources of different workers, by clustering a computation-dag\u2019s tasks, while still producing eligible (now, clustered) tasks at the maximum possible rate. The task-clustering strategies presented exploit the structure of the computation being performed, ranging from a strategy that works for any dag, to ones that build increasingly on the explicit structure of the dagbeing scheduled.<\/jats:p>","DOI":"10.2478\/s13537-011-0002-4","type":"journal-article","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T09:11:36Z","timestamp":1299661896000},"source":"Crossref","is-referenced-by-count":3,"title":["On clustering DAGs for task-hungry computing platforms"],"prefix":"10.2478","volume":"1","author":[{"given":"Gennaro","family":"Cordasco","sequence":"first","affiliation":[]},{"given":"Arnold","family":"Rosenberg","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Sims","sequence":"additional","affiliation":[]}],"member":"374","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1109\/TAU.1970.1162132","volume":"AU-18","author":"L.I. Bluestein","year":"1970","unstructured":"Bluestein L.I., A linear filtering approach to the computation of the Discrete Fourier Transform, IEEE TRANS AUDIO ELECTROACOUST, 1970, AU-18, 451\u2013455","journal-title":"IEEE TRANS AUDIO ELECTROACOUST"},{"key":"2_CR2","unstructured":"Buyya R., Abramson D., Giddy J., A case for economy Grid architecture for service oriented Grid computing, 10th Heterogeneous Computing Wkshp. (23 April 2001 San Francisco USA), IEEE Computer Society, 2001"},{"key":"2_CR3","unstructured":"Cirne W., Marzullo K., The Computational Co-Op: gathering clusters into a metacomputer, 13th Int\u2019l Parallel Processing Symp. (1999 San Juan, Puerto Rico), IEEE Computer Society, 1999, 160\u2013166"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1109\/TPDS.2007.1067","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 T PARALL DISTR, 2007, 18, 1607\u20131617","journal-title":"IEEE T PARALL DISTR"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cordasco G., Malewicz G., Rosenberg A.L., Applying IC-scheduling theory to some familiar computations, Wkshp. on Large-Scale, Volatile Desktop Grids (PCGrid\u201907) (2007, Long Beach, California, USA), IEEE Computer Society, 2007","DOI":"10.1109\/IPDPS.2007.370673"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.jpdc.2009.11.001","volume":"70","author":"G. Cordasco","year":"2010","unstructured":"Cordasco G., Malewicz G., Rosenberg A.L., Extending IC-scheduling via the Sweep algorithm, J PARALLEL DISTR COM, 2010, 70, 201\u2013211","journal-title":"J PARALLEL DISTR COM"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Cordasco G., Rosenberg A.L., On scheduling dags to maximize area, 23rd IEEE Int\u2019l Parallel and Distributed Processing Symp. (IPDPS) (2009, Rome, Italy), IEEE Computer Society, 2009","DOI":"10.1109\/IPDPS.2009.5160983"},{"key":"2_CR8","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA, 2001","edition":"2nd ed."},{"key":"2_CR9","volume-title":"The Grid 2: Blueprint for a New Computing Infrastructure","author":"I. Foster","year":"2004","unstructured":"Foster I., Kesselman C., The Grid 2: Blueprint for a New Computing Infrastructure, 2nd ed., Morgan-Kaufmann, San Francisco, 2004","edition":"2nd ed."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0743-7315(92)90012-C","volume":"16","author":"A. Gerasoulis","year":"1992","unstructured":"Gerasoulis A., Yang, T., A comparison of clustering heuristics for scheduling dags on multiprocessors, J PARALLEL DISTR COM, 1992, 16, 276\u2013291","journal-title":"J PARALLEL DISTR COM"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Hall R., Rosenberg A.L., Venkataramani A., A comparison of dag-scheduling strategies for Internet-based computing, 21st IEEE Int\u2019l Parallel and Distributed Processing Symp.(IPDPS) (2007, Long Beach, California, USA), IEEE Computer Society, 2007","DOI":"10.1109\/IPDPS.2007.370245"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Kondo D., Casanova H., Wing E., Berman F., Models and scheduling mechanisms for global computing applications, Int\u2019l Parallel and Distr. Processing Symp. (IPDPS) (2002, Fort Lauderdale, California), IEEE Computer Society, 2002","DOI":"10.1109\/IPDPS.2002.1015590"},{"key":"2_CR13","volume-title":"Computing in Science and Engineering","author":"E. Korpela","year":"2000","unstructured":"Korpela E., Werthimer D., Anderson D., Cobb J., Lebofsky M., SETI@home: massively distributed computing for SETI, In: P.F. Dubois (Ed.), Computing in Science and Engineering, IEEE Computer Soc. Press, Los Alamitos, CA, 2000"},{"key":"2_CR14","doi-asserted-by":"crossref","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 DAG Man jobs and its evaluation, JOURNAL OF GRID COMPUTING, 2007, 5, 197\u2013212","journal-title":"JOURNAL OF GRID COMPUTING"},{"key":"2_CR15","doi-asserted-by":"crossref","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 dags in Internet-based computing, IEEE T COMPUT, 2006, 55, 757\u2013768","journal-title":"IEEE T COMPUT"},{"key":"2_CR16","doi-asserted-by":"crossref","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 T COMPUT, 2004, 53, 1176\u20131186","journal-title":"IEEE T COMPUT"},{"key":"2_CR17","doi-asserted-by":"crossref","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 T COMPUT, 2005, 54, 428\u2013438","journal-title":"IEEE T COMPUT"}],"container-title":["Open Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-011-0002-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.2478\/s13537-011-0002-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.2478\/s13537-011-0002-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,28]],"date-time":"2021-02-28T16:19:01Z","timestamp":1614529141000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.2478\/s13537-011-0002-4\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":17,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.2478\/s13537-011-0002-4","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}