{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:06:51Z","timestamp":1704931611691},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2012]]},"DOI":"10.1587\/transcom.e95.b.1669","type":"journal-article","created":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T06:41:48Z","timestamp":1337841708000},"page":"1669-1678","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Transferable Uniform Multi-Round Algorithm for Minimizing Makespan"],"prefix":"10.23919","volume":"E95.B","author":[{"given":"Hiroshi","family":"YAMAMOTO","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Nagaoka University of Technology"}]},{"given":"Masato","family":"TSURU","sequence":"additional","affiliation":[{"name":"Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology"}]},{"given":"Katsuyuki","family":"YAMAZAKI","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Nagaoka University of Technology"}]},{"given":"Yuji","family":"OIE","sequence":"additional","affiliation":[{"name":"Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology"}]}],"member":"263","reference":[{"key":"1","unstructured":"[1] I. Foster and C. Kesselman, The GRID Blueprint for a New Computing Infrastructure, Morgan Kaufmann Publishers, 1998."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] I. Foster, C. Kesselman, and S. Tuecke, “The anatomy of the Grid,” Int. J. Supercomputer Applications, vol.15, no.3, pp.200-222, 2001.","DOI":"10.1177\/109434200101500302"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D.A.L. Piriyakumar and C.S.R. Murthy, “Distributed computation for a hypercube network of sensor-driven processors with communication delays including setup time,” IEEE Trans. Syst. Man. Cybern. A, Syst. Humans, vol.28, no.2, pp.245-251, March 1998.","DOI":"10.1109\/3468.661152"},{"key":"4","unstructured":"[4] J.T. Hung, H.J. Kim, and T.G. Robertazzi, “Scalable scheduling in parallel processors,” Proc. 2002 Conference on Information Sciences and Systems, Princeton University, March 2002."},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J.T. Hung and T.G. Robertazzi, “Scalable scheduling for clusters and grids using cut through switching,” Int. J. Comput. Appl., vol.26, no.3, pp.147-156, 2004.","DOI":"10.2316\/Journal.202.2004.3.202-1461"},{"key":"6","unstructured":"[6] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems, IEEE Computer Society Press, 1996."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] T.G. Robertazzi, “Ten reasons to use divisible load theory,” J. Computer, vol.36, no.5, pp.63-68, May 2003.","DOI":"10.1109\/MC.2003.1198238"},{"key":"8","unstructured":"[9] Y. Yang and H. Casanova, “UMR: A multi-round algorithm for scheduling divisible workloads,” Proc. International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France, April 2003."},{"key":"9","unstructured":"[10] Y. Yang and H. Casanova, “A multi-round algorithm for scheduling divisible workload applications: Analysis and experimental evaluation,” Technical Report of Dept. of Computer Science and Engineering, University of California CS20020721, 2002."},{"key":"10","unstructured":"[11] O. Beaumont, A. Legrand, and Y. Robert, “Optimal algorithms for scheduling divisible workloads on heterogeneous systems,” Proc. International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France, April 2003."},{"key":"11","unstructured":"[12] C. Cyril, O. Beaumont, A. Legrand, and Y. Robert, “Scheduling strategies for master-slave tasking on heterogeneous processor grids,” Technical Report 2002-12, LIP, March 2002."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] A.L. Rosenberg, “Sharing partitionable workloads in heterogeneous NOWs: Greedier is not better,” Proc. 3rd IEEE International Conference on Cluster Computing (Cluster 2001), pp.124-131, California, USA, Oct. 2001.","DOI":"10.1109\/CLUSTR.2001.959961"},{"key":"13","unstructured":"[14] H. Yamamoto, M. Tsuru, and Y. Oie, “Parallel transferable uniform multi-round algorithm for achieving minimum application turnaround times for divisible workload,” Proc. 2005 International Conference on High Performance Computing and Communications (HPCC-05), LNCS 3726, pp.817-828, Capri-Sorrento Penisular, Italy, Sept. 2005."},{"key":"14","unstructured":"[15] H. Yamamoto, M. Tsuru, and Y. Oie, “A parallel transferable uniform multi-round algorithm in heterogeneous distributed computing environment,” Proc. 2006 International Conference on High Performance Computing and Communications (HPCC-06), LNCS 4208, pp.51-60, Munich, Germany, Sept. 2006."},{"key":"15","doi-asserted-by":"crossref","unstructured":"[17] N.T. Loc and S. Elnaffar, “A dynamic scheduling algorithm for divisible loads in grid environments,” J. Commun., vol.2, no.4, pp.57-64, 2007.","DOI":"10.4304\/jcm.2.4.57-64"},{"key":"16","unstructured":"[18] M. Drozdowski and M. Lawenda, “Multi-installment divisible load processing in heterogeneous distributed systems,” Concurrency and Computation: Practice & Experience, vol.19, no.17, pp.2237-2253, 2007."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[19] X. Lin, Y. Lu, J. Deogun, and S. Goddard, “Multi-round real-time divisible load scheduling for clusters,” Proc. 15th International Conference on High Performance Computing, LNCS 5374 Bangalore, India, Dec. 2008.","DOI":"10.1007\/978-3-540-89894-8_20"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[22] Z. Fei, M. Yang, M.H. Ammar, and E.W. Zegura, “A framework for allocating clients to rate-constrained multicast servers,” J. Comput. Commun., vol.26, no.12, pp.1255-1262, 2003.","DOI":"10.1016\/S0140-3664(02)00263-3"}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E95.B\/5\/E95.B_5_1669\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:58:00Z","timestamp":1704898680000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E95.B\/5\/E95.B_5_1669\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012]]}},"URL":"http:\/\/dx.doi.org\/10.1587\/transcom.e95.b.1669","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"value":"0916-8516","type":"print"},{"value":"1745-1345","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}
