{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:47:41Z","timestamp":1729669661110,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/hipc.2011.6152721","type":"proceedings-article","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T20:27:21Z","timestamp":1329942441000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing throughput of jobs with multiple resource requirements"],"prefix":"10.1109","author":[{"given":"Venkatesan T.","family":"Chakaravarthy","sequence":"first","affiliation":[]},{"given":"Sambuddha","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[]},{"given":"Neha","family":"Sengupta","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470347"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0377-2217(84)90053-5","article-title":"Approximation algorithms for the m-dimensional 0–1 Knapsack problem:worst-case and probabilistic analyses:","volume":"15","author":"leonardi","year":"1984","journal-title":"European J of Operations Research"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90003-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225138"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799356265"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1041680.1041683"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90048-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.77"},{"key":"ref5","first-page":"401","article-title":"Improved approximation algorithms for resource allocation","author":"calinescu","year":"2002","journal-title":"IPCO"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1210-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132617"},{"key":"ref2","article-title":"Abstract coordinated allocation and scheduling of multiple resources in real-time operating systems","author":"gopalan","year":"0","journal-title":"OSPERT 2007"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1145\/331532.331579","article-title":"Job scheduling in the presence of multiple resource requirements","author":"leinberger","year":"1999","journal-title":"Supercomputing'99"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273343"}],"event":{"name":"2011 18th International Conference on High Performance Computing (HiPC)","start":{"date-parts":[[2011,12,18]]},"location":"Bengaluru, India","end":{"date-parts":[[2011,12,21]]}},"container-title":["2011 18th International Conference on High Performance Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6146509\/6152423\/06152721.pdf?arnumber=6152721","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T14:39:14Z","timestamp":1497969554000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6152721\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/hipc.2011.6152721","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}