{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:24:00Z","timestamp":1648916640699},"reference-count":7,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2016edl8075","type":"journal-article","created":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T23:18:14Z","timestamp":1472771894000},"page":"2377-2380","source":"Crossref","is-referenced-by-count":0,"title":["2PTS: A Two-Phase Task Scheduling Algorithm for MapReduce"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Byungnam","family":"LIM","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Korea University"}]},{"given":"Yeeun","family":"SHIM","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Korea University"}]},{"given":"Yon Dohn","family":"CHUNG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Korea University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] J. Dean and S. Ghemawat, \u201cMapreduce: simplified data processing on large clusters,\u201d Communications of the ACM, vol.51, no.1, pp.107-113, 2008.","DOI":"10.1145\/1327452.1327492"},{"key":"2","unstructured":"[2] S. Chen and S.W. Schlosser, \u201cMap-reduce meets wider varieties of applications,\u201d Intel Research Pittsburgh, Tech. Rep. IRP-TR-08, vol.5, 2008."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] J. Ekanayake, S. Pallickara, and G. Fox, \u201cMapreduce for data intensive scientific analyses,\u201d eScience, 2008, eScience'08, IEEE Fourth International Conference on, pp.277-284, IEEE, 2008.","DOI":"10.1109\/eScience.2008.59"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] K. Shvachko, H. Kuang, S. Radia, and R. Chansler, \u201cThe hadoop distributed file system,\u201d 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), pp.1-10, IEEE, 2010.","DOI":"10.1109\/MSST.2010.5496972"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] M.J. Fischer, X. Su, and Y. Yin, \u201cAssigning tasks for efficiency in hadoop: extended abstract,\u201d Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, pp.30-39, ACM, 2010.","DOI":"10.1145\/1810479.1810484"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] M. Zaharia, D. Borthakur, J. Sen Sarma, K. Elmeleegy, S. Shenker, and I. Stoica, \u201cDelay scheduling: a simple technique for achieving locality and fairness in cluster scheduling,\u201d Proceedings of the 5th European conference on Computer systems, pp.265-278, ACM, 2010.","DOI":"10.1145\/1755913.1755940"},{"key":"7","unstructured":"[7] \u201cApache Hadoop.\u201d http:\/\/hadoop.apache.org, 2016."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/9\/E99.D_2016EDL8075\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:48:39Z","timestamp":1498340919000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/9\/E99.D_2016EDL8075\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":7,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edl8075","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}