{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:37:41Z","timestamp":1777541861560,"version":"3.51.4"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/infocom.2015.7218468","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T17:33:36Z","timestamp":1440437616000},"page":"963-972","source":"Crossref","is-referenced-by-count":29,"title":["Priority algorithm for near-data scheduling: Throughput and heavy-traffic optimality"],"prefix":"10.1109","author":[{"given":"Qiaomin","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629601"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0152"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2001.946370"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/2479942.2479947","article-title":"A throughput optimal algorithm for map task scheduling in mapreduce with data locality","volume":"40","author":"wang","year":"2013","journal-title":"SIGMETRICS Perform Eval Rev"},{"key":"ref14","article-title":"Priority algorithm for near-data scheduling: Throughput and heavy-traffic optimality","author":"xie","year":"2014","journal-title":"Techical Report"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755940"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1015345343"},{"key":"ref3","year":"2011","journal-title":"Apache Hadoop"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-012-9305-y"},{"key":"ref5","article-title":"MapReduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc of OSDI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1028903452"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2307\/1426671"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966472"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2011.26"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019188531950"}],"event":{"name":"IEEE INFOCOM 2015 - IEEE Conference on Computer Communications","location":"Kowloon, Hong Kong","start":{"date-parts":[[2015,4,26]]},"end":{"date-parts":[[2015,5,1]]}},"container-title":["2015 IEEE Conference on Computer Communications (INFOCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7172813\/7218353\/07218468.pdf?arnumber=7218468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T14:12:56Z","timestamp":1498227176000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7218468\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/infocom.2015.7218468","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}