{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T13:27:47Z","timestamp":1694611667212},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2010,10,22]],"date-time":"2010-10-22T00:00:00Z","timestamp":1287705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s11432-010-4097-3","type":"journal-article","created":{"date-parts":[[2010,10,21]],"date-time":"2010-10-21T03:56:09Z","timestamp":1287633369000},"page":"2272-2286","source":"Crossref","is-referenced-by-count":8,"title":["Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems"],"prefix":"10.1007","volume":"53","author":[{"given":"PengCheng","family":"Mu","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Nezan","sequence":"additional","affiliation":[]},{"given":"Micka\u00ebl","family":"Raulet","sequence":"additional","affiliation":[]},{"given":"Jean-Gabriel","family":"Cousin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,22]]},"reference":[{"key":"4097_CR1","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/5.381846","volume":"83","author":"E. Lee","year":"1995","unstructured":"Lee E, Parks T. Dataflow process networks. Proc IEEE, 1995, 83: 773\u2013801","journal-title":"Proc IEEE"},{"key":"4097_CR2","volume-title":"Embedded Multiprocessors-Scheduling and Synchronization","author":"S. Sriram","year":"2000","unstructured":"Sriram S, Bhattacharyya S S. Embedded Multiprocessors-Scheduling and Synchronization. New York, NY: Marcel Dekker, Inc., 2000"},{"key":"4097_CR3","volume-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"V. Sarkar","year":"1989","unstructured":"Sarkar V. Partitioning and Scheduling Parallel Programs for Multiprocessors. Cambridge, MA: MIT Press, 1989"},{"key":"4097_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1990","unstructured":"Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY: W H Freeman & Co., 1990"},{"key":"4097_CR5","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"T. L. Adam","year":"1974","unstructured":"Adam T L, Chandy K M, Dickson J R. A comparison of list schedules for parallel processing systems. Commun ACM, 1974, 17: 685\u2013690","journal-title":"Commun ACM"},{"key":"4097_CR6","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","volume":"33","author":"H. Kasahara","year":"1984","unstructured":"Kasahara H, Narita S. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans Comput, 1984, 33: 1023\u20131029","journal-title":"IEEE Trans Comput"},{"key":"4097_CR7","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"J. J. Hwang","year":"1989","unstructured":"Hwang J J, Chow Y C, Anger F D, et al. Scheduling precedence graphs in systems with interprocessor communication times. SIAM J Comput, 1989, 18: 244\u2013257","journal-title":"SIAM J Comput"},{"key":"4097_CR8","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"M. Y. Wu","year":"1990","unstructured":"Wu M Y, Gajski D. Hypertool: A programming aid for message-passing systems. IEEE Trans Parallel Distr Syst, 1990, 1: 330\u2013343","journal-title":"IEEE Trans Parallel Distr Syst"},{"key":"4097_CR9","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T. Yang","year":"1994","unstructured":"Yang T, Gerasoulis A. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans Parallel Distr Syst, 1994, 5: 951\u2013967","journal-title":"IEEE Trans Parallel Distr Syst"},{"key":"4097_CR10","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"Y. K. Kwok","year":"1996","unstructured":"Kwok Y K, Ahmad I. Dynamic critical-path scheduling: An effective technique for allocating task graphs onto multiprocessors. IEEE Trans Parallel Distr Syst, 1996, 7: 506\u2013521","journal-title":"IEEE Trans Parallel Distr Syst"},{"key":"4097_CR11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/71.207593","volume":"4","author":"G. Sih","year":"1993","unstructured":"Sih G, Lee E. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans Parallel Distr Syst, 1993, 4: 175\u2013187","journal-title":"IEEE Trans Parallel Distr Syst"},{"key":"4097_CR12","doi-asserted-by":"crossref","unstructured":"Kwok Y K, Ahmad I. Bubble scheduling: A quasi dynamic algorithm for static allocation of tasks to parallel architectures. In: Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing, Washington, DC, USA, 1995","DOI":"10.1109\/SPDP.1995.530662"},{"key":"4097_CR13","doi-asserted-by":"crossref","unstructured":"Grandpierre T, Lavarenne C, Sorel Y. Optimized rapid prototyping for real-time embedded heterogeneous multiprocessors. In: Proceedings of 7th International Workshop on Hardware\/Software Co-Design, Rome, Italy, 1999","DOI":"10.1145\/301177.301489"},{"key":"4097_CR14","doi-asserted-by":"crossref","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 Trans Parallel Distr Syst, 2005, 16: 503\u2013515","journal-title":"IEEE Trans Parallel Distr Syst"},{"key":"4097_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s11432-009-0010-3","volume":"52","author":"X. Tang","year":"2009","unstructured":"Tang X, Li K, Padua D. Communication contention in APN list scheduling algorithm. Sci China Ser F-Inf Sci, 2009, 52: 59\u201369","journal-title":"Sci China Ser F-Inf Sci"},{"key":"4097_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/0470121173","volume-title":"Task Scheduling for Parallel Systems","author":"O. Sinnen","year":"2007","unstructured":"Sinnen O. Task Scheduling for Parallel Systems. Hoboken, NJ: John Wiley & Sons, Inc., 2007"},{"key":"4097_CR17","doi-asserted-by":"crossref","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 multiprocessors. ACM Comput Surveys, 1999, 31: 406\u2013471","journal-title":"ACM Comput Surveys"},{"key":"4097_CR18","doi-asserted-by":"crossref","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 Comput, 2004, 30: 81\u2013101","journal-title":"Parallel Comput"},{"key":"4097_CR19","unstructured":"Stuijk S, Geilen M, Basten T. SDF3: SDF for free. In: Proceedings of 6th International Conference on Application of Concurrency to System Design, Los Alamitos, CA, USA, 2006"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4097-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-4097-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4097-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:36:07Z","timestamp":1559403367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-4097-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,22]]},"references-count":19,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["4097"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-4097-3","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,22]]}}}