{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T05:11:10Z","timestamp":1791090670115,"version":"4.1.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001342","name":"DST","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001342","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2015,5,1]]},"DOI":"10.1109\/tpds.2014.2322354","type":"journal-article","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T14:02:37Z","timestamp":1399471357000},"page":"1251-1264","source":"Crossref","is-referenced-by-count":40,"title":["Contention Aware Energy Efficient Scheduling on Heterogeneous Multiprocessors"],"prefix":"10.1109","volume":"26","author":[{"given":"Jagpreet","family":"Singh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandeep","family":"Betha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bhargav","family":"Mangipudi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nitin","family":"Auluck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.07.011"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.07.006"},{"key":"ref31","article-title":"IBM ILOG CPLEX Optimization Studio, version 12 release 2 information center","year":"2012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/HSC.1998.666245"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.11.006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.10.004"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.1264795"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.jpdc.2005.01.006","article-title":"Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication","volume":"65","author":"baskiyar","year":"2005","journal-title":"J Parallel Distrib Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/EURDAC.1996.558204"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11902140_30"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.64"},{"key":"ref17","article-title":"Embedded system synthesis benchmarks suites E3S (Apr., 2014).","author":"dick","year":"0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/PAAP.2012.37"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/71.655248"},{"key":"ref28","article-title":"Task graph generator","year":"2012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2009.16"},{"key":"ref27","first-page":"164","article-title":"Contention-aware application mapping for network-on-chip communication architectures","author":"chou","year":"0","journal-title":"Proc IEEE Int Conf Comput Des"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2005.39"},{"key":"ref6","first-page":"19","article-title":"Energy-efficient scheduling for parallel applications running on heterogeneous clusters","author":"zong","year":"0","journal-title":"Proc Int Conf Parallel Process"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2010.11.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-007-0113-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/Grid.2012.32"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.216"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/71.722221"},{"key":"ref1","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"ref22","article-title":"Classification, customization, and characterization: Using MILP for task allocation and scheduling","author":"davare","year":"0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2000.846020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20045092"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-011-0720-3"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1023\/B:SUPE.0000009321.92150.64"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2010691"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7081409\/06811172.pdf?arnumber=6811172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:42:20Z","timestamp":1641987740000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6811172\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,1]]},"references-count":33,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2014.2322354","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2015,5,1]]}}}