Open Access
Subscription Access
Dynamically Iterative MapReduce
Abstract
MapReduce is a distributed and parallel computing model for data-intensive tasks with features of optimized scheduling, flexibility, high availability, and high manageability. MapReduce can work on various platforms; however, MapReduce is not suitable for iterative programs because the performance may be lowered by frequent disk I/O operations. In order to improve system performance and resource utilization, we propose a novel MapReduce framework named Dynamically Iterative MapReduce (DIMR) to reduce numbers of disk I/O operations and the consumption of network bandwidth by means of using dynamic task allocation and memory management mechanism. We show that DIMR is promising with detail discussions in this paper.
Keywords
Dynamically iterative MapReduce; K-Means; Particle swarm optimization (PSO); Genetic algorithm (GA); Simulated annealing (SA)
Citation Format:
Wei-Tsong Lee, Ming-Zhi Wu, Hsin-Wen Wei, Fang-Yi Yu, Yu-Sun Lin, "Dynamically Iterative MapReduce," Journal of Internet Technology, vol. 14, no. 6 , pp. 953-962, Nov. 2013.
Wei-Tsong Lee, Ming-Zhi Wu, Hsin-Wen Wei, Fang-Yi Yu, Yu-Sun Lin, "Dynamically Iterative MapReduce," Journal of Internet Technology, vol. 14, no. 6 , pp. 953-962, Nov. 2013.
Full Text:
PDFRefbacks
- There are currently no refbacks.
Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314 E-mail: jit.editorial@gmail.com