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

    題名: An efficient optimization technique for task matching and scheduling in heterogeneous computing systems
    作者: Chuang, Po-Jen;Wei, Chia-Hsin
    貢獻者: 淡江大學電機工程學系
    關鍵詞: 最佳化;任務符合;排程;異質性計算;基因演算法;模擬退火演算法;Optimization;Task Matching;Scheduling;Heterogeneous Computing;Genetic Algorithm;Simulated Annealing Algorithm
    日期: 2002-12
    上傳時間: 2013-03-07 14:47:08 (UTC+8)
    出版者: New York: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: A new optimization technique, the Genetic Annealing Algorithm (GAA), is proposed in this paper to solve the task matching and scheduling problem in a heterogeneous computing system. The GAA is simple in design; it employs only the stir operation, a novel idea with the annealing concept, to locate optimal solutions, Experimental evaluation shows that compared with the Genetic Algorithm, Simulated Annealing and Guide Evolutionary Simulated Annealing approaches, the GAA yields constantly favorable performance in terms of speedup, running time, cost and complexity.
    關聯: Parallel and Distributed Systems, 2002. Proceedings. Ninth International Conference on, pp.419-424
    DOI: 10.1109/ICPADS.2002.1183433
    顯示於類別:[電機工程學系暨研究所] 會議論文


    檔案 描述 大小格式瀏覽次數
    An Efficient Optimization Technique for Task Matching and Scheduling in Heterogeneous Computing Systems_英文摘要.docx摘要20KbMicrosoft Word83檢視/開啟



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