English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 50123/85142 (59%)
造訪人次 : 7898588      線上人數 : 44
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/93541

    題名: Dynamically Iterative MapReduce
    作者: Lee, Wei-Tsong;Wu, Ming-Zhi;Wei, Hsin-Wen;Yu, Fang-Yi;Lin, Yu-Sun
    貢獻者: 淡江大學電機工程學系
    關鍵詞: Dynamically iterative MapReduce;K-Means;Particle swarm optimization (PSO);Genetic algorithm (GA);Simulated annealing (SA)
    日期: 2013-11-01
    上傳時間: 2014-01-22 16:43:39 (UTC+8)
    出版者: 臺北市:臺灣學術網路管理委員會
    摘要: 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.
    關聯: 網際網路技術學刊=Journal of Internet Technology 14(6),頁 953-962
    DOI: 10.6138/JIT.2013.14.6.10
    顯示於類別:[電機工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    Dynamically Iterative MapReduce.pdf624KbAdobe PDF670檢視/開啟



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋