{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:58Z","timestamp":1750308718829,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":17,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1145\/2676585.2676609","type":"proceedings-article","created":{"date-parts":[[2015,1,16]],"date-time":"2015-01-16T19:18:59Z","timestamp":1421435939000},"page":"248-255","source":"Crossref","is-referenced-by-count":4,"title":["Cost efficient real-time applications scheduling in mobile cloud computing"],"prefix":"10.1145","author":[{"given":"Cong-Thinh","family":"Huynh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien-Dung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huu-Quoc","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eui-Nam","family":"Huh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2676585.2676609-1","unstructured":"The Magellan Report. The magellan report on cloud computing for science.U.S. Department of Energy Office of Science, Office of Advanced Scientific Computing Research (ASCR), December 2011."},{"key":"key-10.1145\/2676585.2676609-2","unstructured":"Amazon Webservices. Idc forecasts worldwide public it cloud services spending to reach nearly 108 billion us dollars by 2017 as focus shifts from savings to innovation. http:\/\/www.idc.com\/getdoc.jsp?containerId=prUS24298013."},{"key":"key-10.1145\/2676585.2676609-3","doi-asserted-by":"crossref","unstructured":"J. D. Ullman. Np-complete scheduling problems.J. Comput. Syst. Sci., 10(3): 384--393, June 1975.","DOI":"10.1016\/S0022-0000(75)80008-0"},{"key":"key-10.1145\/2676585.2676609-4","unstructured":"Amazon Webservices. Amazon ec2. http:\/\/aws.amazon.com\/ec2\/."},{"key":"key-10.1145\/2676585.2676609-5","doi-asserted-by":"crossref","unstructured":"Jr. Coffman, E. G. and R. L. Graham. Optimal scheduling for two-processor systems.Acta Informatica, 1(3): 200--213, 1972.","DOI":"10.1007\/BF00288685"},{"key":"key-10.1145\/2676585.2676609-6","doi-asserted-by":"crossref","unstructured":"Hesham El-Rewini and T. G. Lewis. Scheduling parallel program tasks onto arbitrary target machines.J. Parallel Distrib. Comput., 9(2): 138--153, June 1990.","DOI":"10.1016\/0743-7315(90)90042-N"},{"key":"key-10.1145\/2676585.2676609-7","doi-asserted-by":"crossref","unstructured":"Samantha Ranaweera and Dharma P. Agrawal. A task duplication based scheduling algorithm for heterogeneous systems. Inin Proc. of 14th International Parallel and Distributed Processing Symposium (IPDPS'00), pages 445--450, 2000.","DOI":"10.1109\/IPDPS.2000.846020"},{"key":"key-10.1145\/2676585.2676609-8","doi-asserted-by":"crossref","unstructured":"G. C. Sih and E. A Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures.Parallel and Distributed Systems, IEEE Transactions on, 4(2): 175--187, Feb 1993.","DOI":"10.1109\/71.207593"},{"key":"key-10.1145\/2676585.2676609-9","doi-asserted-by":"crossref","unstructured":"Jing-Jang Hwang, Yuan-Chieh Chow, Frank D. Anger, and Chung-Yee Lee. Scheduling precedence graphs in systems with interprocessor communication times.SIAM J. Comput., 18(2): 244--257, April 1989.","DOI":"10.1137\/0218016"},{"key":"key-10.1145\/2676585.2676609-10","doi-asserted-by":"crossref","unstructured":"Haluk Topcuouglu, Salim Hariri, and Min-you Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing.IEEE Trans. Parallel Distrib. Syst., 13(3): 260--274, March 2002.","DOI":"10.1109\/71.993206"},{"key":"key-10.1145\/2676585.2676609-11","doi-asserted-by":"crossref","unstructured":"Marek Wieczorek, Radu Prodan, and Thomas Fahringer. Scheduling of scientific workflows in the askalon grid environment.SIGMOD Rec., 34(3): 56--62, September 2005.","DOI":"10.1145\/1084805.1084816"},{"key":"key-10.1145\/2676585.2676609-12","doi-asserted-by":"crossref","unstructured":"Philipp Wieder, Jan Seidel, Oliver Waldrich, Wolfgang Ziegler, and Ramin Yahyapour. Using sla for resource management and scheduling - a survey. InGrid Middleware and Services, pages 335--347. Springer US, 2008.","DOI":"10.1007\/978-0-387-78446-5_22"},{"key":"key-10.1145\/2676585.2676609-13","doi-asserted-by":"crossref","unstructured":"Ching-Hsien Hsu, J. Zhan, Wai-Chi Fang, and Jianhua Ma. Towards improving qos-guided scheduling in grids. InChinaGrid Annual Conference, 2008. ChinaGrid '08. The Third, pages 89--95, Aug 2008.","DOI":"10.1109\/ChinaGrid.2008.38"},{"key":"key-10.1145\/2676585.2676609-14","doi-asserted-by":"crossref","unstructured":"XiaoShan He, XianHe Sun, and Gregor von Laszewski. Qos guided min-min heuristic for grid task scheduling.J. Comput. Sci. Technol., 18(4): 442--451, July 2003.","DOI":"10.1007\/BF02948918"},{"key":"key-10.1145\/2676585.2676609-15","doi-asserted-by":"crossref","unstructured":"S. Selvarani and G. S. Sadhasivam. Improved cost-based algorithm for task scheduling in cloud computing. InComputational Intelligence and Computing Research (ICCIC), 2010 IEEE International Conference on, pages 1--5, Dec 2010.","DOI":"10.1109\/ICCIC.2010.5705847"},{"key":"key-10.1145\/2676585.2676609-16","doi-asserted-by":"crossref","unstructured":"Jian Li, Sen Su, Xiang Cheng, Qingjia Huang, and Zhongbao Zhang. Cost-conscious scheduling for large graph processing in the cloud. InHigh Performance Computing and Communications (HPCC), 2011 IEEE 13th International Conference on, pages 808--813, Sept 2011.","DOI":"10.1109\/HPCC.2011.147"},{"key":"key-10.1145\/2676585.2676609-17","unstructured":"Rizos Sakellariou, Henan Zhao, Eleni Tsiakkouri, and Marios D. Dikaiakos. Scheduling workflows with budget constraints. Inin Integrated Research in Grid Computing, S. Gorlatch and M. Danelutto, Eds.: CoreGrid series. Springer-Verlag, 2007."}],"event":{"name":"the Fifth Symposium","start":{"date-parts":[[2014,12,4]]},"number":"5","location":"Hanoi, Viet Nam","end":{"date-parts":[[2014,12,5]]},"acronym":"SoICT '14"},"container-title":["Proceedings of the Fifth Symposium on Information and Communication Technology - SoICT '14"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676585.2676609","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2676609&amp;ftid=1529183&amp;dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:30Z","timestamp":1750277670000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2676585.2676609"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2014]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1145\/2676585.2676609","relation":{},"subject":[],"published":{"date-parts":[[2014]]}}}