English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3876033      在线人数 : 264
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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 Word98检视/开启



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