{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:32:11Z","timestamp":1725521531908},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540928584"},{"type":"electronic","value":"9783540928591"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","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-92859-1_13","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T04:45:28Z","timestamp":1229316328000},"page":"123-136","source":"Crossref","is-referenced-by-count":4,"title":["A List Scheduling Algorithm for Scheduling Multi-user Jobs on Clusters"],"prefix":"10.1007","author":[{"given":"Jorge","family":"Barbosa","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio P.","family":"Monteiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"13_CR1","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/71.707547","volume":"9","author":"A.K. Amoura","year":"1998","unstructured":"Amoura, A.K., Bampis, E., K\u00f6nig, J.-C.: Scheduling algorithms for parallel gaussian elimination with communication costs. IEEE Transactions on Parallel and Distributed Systems\u00a09(7), 679\u2013686 (1998)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"13_CR2","first-page":"1","volume-title":"Heteropar 2005","author":"J. Barbosa","year":"2005","unstructured":"Barbosa, J., Morais, C., Nobrega, R., Monteiro, A.P.: Static scheduling of dependent parallel tasks on heterogeneous clusters. In: Heteropar 2005, pp. 1\u20138. IEEE Computer Society, Los Alamitos (2005)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/10703040_38","volume-title":"Vector and Parallel Processing \u2013 VECPAR\u201998","author":"J. Barbosa","year":"1999","unstructured":"Barbosa, J., Padilha, A.J.: Algorithm-dependent method to determine the optimal number of computers in parallel virtual machines. In: Hern\u00e1ndez, V., Palma, J.M.L.M., Dongarra, J. (eds.) VECPAR 1998. LNCS, vol.\u00a01573, pp. 508\u2013521. Springer, Heidelberg (1999)"},{"key":"13_CR4","first-page":"147","volume-title":"Proceedings of 9th Heterogeneous Computing Workshop","author":"J. Barbosa","year":"2000","unstructured":"Barbosa, J., Tavares, J., Padilha, A.J.: Linear algebra algorithms in a heterogeneous cluster of personal computers. In: Proceedings of 9th Heterogeneous Computing Workshop, pp. 147\u2013159. IEEE CS Press, Los Alamitos (2000)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Berman, F., Wolski, R., Figueira, S., Schopf, J., Shao, G.: Application-level scheduling on distributed heterogeneous networks. In: Supercomputing 1996 (1996)","DOI":"10.1145\/369028.369109"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0377-2217(02)00760-9","volume":"149","author":"J. Blazewicz","year":"2003","unstructured":"Blazewicz, J., Dell\u2019Olmo, P., Drozdowski, M., Maczka, P.: Scheduling multiprocessor tasks on parallel processors with limited availability. European journal of Operational Research\u00a0(149), 377\u2013389 (2003)","journal-title":"European journal of Operational Research"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/B:ANOR.0000030682.25673.c0","volume":"129","author":"J. Blazewicz","year":"2004","unstructured":"Blazewicz, J., Machowiak, M., Weglarz, J., Kovalyov, M., Trystram, D.: Scheduling malleable tasks on parallel processors to minimize the makespan. Annals of Operations Research\u00a0(129), 65\u201380 (2004)","journal-title":"Annals of Operations Research"},{"key":"13_CR8","volume-title":"Heteropar 2004","author":"S. Shivle","year":"2004","unstructured":"Shivle, S., et al.: Mapping of subtasks with multiple versions in a heterogeneous ad hoc grid environment. In: Heteropar 2004. IEEE Computer Society, Los Alamitos (2004)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.jpdc.2006.06.005","volume":"67","author":"J.-K. Kim","year":"2007","unstructured":"Kim, J.-K., et al.: Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment. Journal of Parallel and Distributed Computing\u00a067, 154\u2013169 (2007)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"13_CR10","unstructured":"Geijn, R., Watts, J.: Summa: Scalable universal matrix multiplication algorithm. Technical Report CS-95-286, University of Tennessee, Knoxville (1995)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Gerasoulis, A., Yang, T.: On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems, 686\u2013701 (June 1993)","DOI":"10.1109\/71.242154"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00453-003-1078-6","volume":"39","author":"K. Jansen","year":"2004","unstructured":"Jansen, K.: Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. Algorithmica\u00a039, 59\u201381 (2004)","journal-title":"Algorithmica"},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y. Kwok","year":"1999","unstructured":"Kwok, Y., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys\u00a031(4), 406\u2013471 (1999)","journal-title":"ACM Computing Surveys"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.jpdc.2005.05.028","volume":"65","author":"Y. Kwok","year":"2005","unstructured":"Kwok, Y., Ahmad, I.: On multiprocessor task scheduling using efficient state space search approaches. Journal of Parallel and Distributed Computing\u00a065, 1515\u20131532 (2005)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1016\/S0377-2217(02)00264-3","volume":"142","author":"R. Lep\u00e8re","year":"2002","unstructured":"Lep\u00e8re, R., Mouni\u00e9, G., Trystram, D.: An approximation algorithm for scheduling trees of malleable tasks. European journal of Operational Research\u00a0(142), 242\u2013249 (2002)","journal-title":"European journal of Operational Research"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0304-3975(97)00178-3","volume":"215","author":"Oh-Heum","year":"1999","unstructured":"Oh-Heum, Chwa, K.-Y.: Scheduling parallel tasks with individual deadlines. Theoretical Computer Science\u00a0215, 209\u2013223 (1999)","journal-title":"Theoretical Computer Science"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0167-739X(03)00139-0","volume":"20","author":"G.-L. Park","year":"2004","unstructured":"Park, G.-L.: Performance evaluation of a list scheduling algorithm in distributed memory multiprocessor systems. Future Generation Computer Systems (20), 249\u2013256 (2004)","journal-title":"Future Generation Computer Systems"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/0743-7315(90)90014-G","volume":"10","author":"B. Shirazi","year":"1990","unstructured":"Shirazi, B., Wang, M., Pathak, G.: Analysis and evaluation of heuristic methods for static task scheduling. Journal of Parallel and Distributing Computing\u00a010, 222\u2013232 (1990)","journal-title":"Journal of Parallel and Distributing Computing"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.parco.2003.09.002","volume":"30","author":"O. Sinnen","year":"2004","unstructured":"Sinnen, O., Sousa, L.: List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Computing (30), 81\u2013101 (2004)","journal-title":"Parallel Computing"},{"issue":"3","key":"13_CR20","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":"13_CR21","doi-asserted-by":"crossref","unstructured":"Trystram, D.: Scheduling parallel applications using malleable tasks on clusters. In: 15th International Conference on Parallel and Distributed Processing Symposium (2001)","DOI":"10.1109\/IPDPS.2001.925211"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science - VECPAR 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92859-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T06:37:37Z","timestamp":1551681457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92859-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540928584","9783540928591"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92859-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}