{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:00:08Z","timestamp":1743012008931,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642246685"},{"type":"electronic","value":"9783642246692"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24669-2_9","type":"book-chapter","created":{"date-parts":[[2011,10,22]],"date-time":"2011-10-22T10:05:36Z","timestamp":1319277936000},"page":"89-98","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Tasks and Communications on a Hierarchical System with Message Contention"],"prefix":"10.1007","author":[{"given":"Jean-Yves","family":"Colin","sequence":"first","affiliation":[]},{"given":"Moustafa","family":"Nakechbandi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1142\/S0129626400000135","volume":"10","author":"E. Bampis","year":"2000","unstructured":"Bampis, E., Giroudeau, R., K\u00f6nig, J.-C.: Using Duplication for Multiprocessor Scheduling Problem with Hierarchical Communications. Parallel Processing Letters\u00a010(1), 133\u2013140 (2000)","journal-title":"Parallel Processing Letters"},{"key":"9_CR2","volume-title":"11th Heterogeneous Computing Workshop (HCW 2002)","author":"O. Beaumont","year":"2002","unstructured":"Beaumont, O., Boudet, V., Robert, Y.: A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors. In: 11th Heterogeneous Computing Workshop (HCW 2002). IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bittencourt, L.F., Sakellariou, R., Madeira, E.R.M.: DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm. In: 18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing (PDP 2010), Pisa, Italy (2010)","DOI":"10.1109\/PDP.2010.56"},{"issue":"6","key":"9_CR4","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1109\/TPDS.2008.260","volume":"20","author":"D. Bozdag","year":"2009","unstructured":"Bozdag, D., Ozguner, F., Catalyurek, U.V.: Compaction of Schedules and a Two Stage Approach for Duplication-Based DAG Scheduling. IEEE Transactions on Parallel and Distributed Systems\u00a020(6), 857\u2013871 (2009)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1287\/opre.39.4.680","volume":"39","author":"J.-Y. Colin","year":"1991","unstructured":"Colin, J.-Y., Chr\u00e9tienne, P.: Scheduling with Small Communication Delays and Task Duplication. Operations Research\u00a039(4), 680\u2013684 (1991)","journal-title":"Operations Research"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Colin, J.-Y., Colin, P.: Scheduling Tasks and Communications on a Virtual Distributed System. European Journal of Operational Research\u00a094(2) (1996)","DOI":"10.1016\/0377-2217(96)00128-2"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Colin, J.-Y., Nakechbandi, M.: Scheduling Tasks with Communication Delays on 2Levels Virtual Distributed Systems. In: Proceedings of the 7th Euromicro Workshop on Parallel and Distributed Processing (PDP 1999), Funchal, Portugal (1999)","DOI":"10.1109\/EMPDP.1999.746698"},{"key":"9_CR8","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Giroudeau, R., K\u00f6nig, J.-C.: Scheduling with Communication Delay. In: Multiprocessor Scheduling: Theory and Applications, pp. 1\u201326. ARS Publishing (2007)","DOI":"10.5772\/5215"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Efficient Algorithms for Graph Manipulation. Communications of the ACM\u00a016, 372\u2013378 (1973)","journal-title":"Communications of the ACM"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/S0167-8191(00)00031-4","volume":"26","author":"T. Kalinowski","year":"2000","unstructured":"Kalinowski, T., Kort, I., Trystram, D.: List Scheduling of General Task Graphs under LogP. Parallel Computing\u00a026, 1109\u20131128 (2000)","journal-title":"Parallel Computing"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/52.1991","volume":"5","author":"B. Kruatrachue","year":"1988","unstructured":"Kruatrachue, B., Lewis, T.G.: Grain Size Determination for Parallel Processing. IEEE Software\u00a05(1), 23\u201332 (1988)","journal-title":"IEEE Software"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y.-K. Kwok","year":"1999","unstructured":"Kwok, Y.-K., Ahmad, I.: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multi-Processors. ACM Computing Surveys (CSUR)\u00a031(4), 406\u2013471 (1999)","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1142\/S0129626407002879","volume":"17","author":"L. Marchal","year":"2007","unstructured":"Marchal, L., Rehn, V., Robert, Y., Vivien, F.: Scheduling Algorithms for Data Redistribution and Load-Balancing on Master-Slave Platforms. Parallel Processing Letters\u00a017(1), 61\u201377 (2007)","journal-title":"Parallel Processing Letters"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1142\/S012962649500031X","volume":"5","author":"M.G. Norman","year":"1995","unstructured":"Norman, M.G., Pelagatti, S., Thanisch, P.: On the Complexity of Scheduling with Communication Delay and Contention. Parallel Processing Letters\u00a05(3), 331\u2013341 (1995)","journal-title":"Parallel Processing Letters"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.B., Yannakakis, M.: Toward an Architecture Independent Analysis of Parallel Algorithms. In: Proceedings of the 20th Annual ACM Symposium Theory of Computing, Santa Clara, California, USA (1988)","DOI":"10.1145\/62212.62262"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","volume":"18","author":"V.J. Rayward-Smith","year":"1987","unstructured":"Rayward-Smith, V.J.: Scheduling with Unit Interprocessor Communication Delays. Discrete Math.\u00a018, 55\u201371 (1987)","journal-title":"Discrete Math."},{"key":"9_CR18","volume-title":"Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors","author":"V. Sarkar","year":"1989","unstructured":"Sarkar, V.: Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, Cambridge (1989)"},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TPDS.2005.64","volume":"16","author":"O. Sinnen","year":"2005","unstructured":"Sinnen, O., Sousa, L.: Communication Contention in Task Scheduling. IEEE Transactions on Parallel and Distributed Systems\u00a016(6), 503\u2013515 (2005)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.jpdc.2010.10.004","volume":"71","author":"O. Sinnen","year":"2011","unstructured":"Sinnen, O., To, A., Kaur, M.: Contention-Aware Scheduling with Task Duplication. Journal of Parallel and Distributed Computing\u00a071(1), 77\u201386 (2011)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1023\/A:1025765910100","volume":"6","author":"A. Tam","year":"2003","unstructured":"Tam, A., Wang, C.L.: Contention-Aware Communication Schedule for High Speed Communication. Cluster Computing\u00a06(4), 339\u2013353 (2003)","journal-title":"Cluster Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24669-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T08:04:25Z","timestamp":1560845065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24669-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642246685","9783642246692"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24669-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}