{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:36:35Z","timestamp":1729636595425,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1109\/hipc.2009.5433225","type":"proceedings-article","created":{"date-parts":[[2010,3,24]],"date-time":"2010-03-24T14:33:20Z","timestamp":1269441200000},"page":"50-58","source":"Crossref","is-referenced-by-count":0,"title":["Spanning tree routing strategies for divisible load scheduling on arbitrary graphs — A comparative performance analysis"],"prefix":"10.1109","author":[{"given":"Sivakumar","family":"Viswanathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bharadwaj","family":"Veeravalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Jingxi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/B:CLUS.0000018567.06753.de"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1032"},{"key":"ref12","article-title":"Technical Report MN-ISYE-TR-06-006","author":"byrnes","year":"2006","journal-title":"Divisible Load Scheduling in Distributed Computing Environments Complexity and Algorithms"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref13"},{"key":"ref14","volume":"1","author":"knuth","year":"1997","journal-title":"The art of computer programming"},{"key":"ref4","first-page":"311","article-title":"Experiments with Scheduling Divisible Tasks in Clusters of Workstations","author":"drozdowski","year":"2000","journal-title":"Proc from the 6th Int'l Euro-Par Conf on Parallel Processing"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00104-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/12.869332"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TITB.2005.855559","article-title":"Aligning Biological Sequences on Distributed Bus Networks: A Divisible Load Scheduling Approach","volume":"9","author":"wong","year":"2005","journal-title":"IEEE Transactions on Information Technology in Biomedicine"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2003.1198238"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.04.003"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2004.01.004"},{"journal-title":"Scheduling Divisible Loads in Parallel and Distributed Systems","year":"1996","author":"veeravalli","key":"ref1"},{"key":"ref9","article-title":"Scalable scheduling in parallel processors","author":"juim","year":"2002","journal-title":"Proc of Conf on Information Sciences and Systems"}],"event":{"name":"2009 International Conference on High Performance Computing (HiPC)","start":{"date-parts":[[2009,12,16]]},"location":"Kochi, India","end":{"date-parts":[[2009,12,19]]}},"container-title":["2009 International Conference on High Performance Computing (HiPC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5426440\/5433175\/05433225.pdf?arnumber=5433225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T06:30:04Z","timestamp":1497853804000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5433225\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/hipc.2009.5433225","relation":{},"subject":[],"published":{"date-parts":[[2009,12]]}}}