检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:姜凯华 韩锐[1] 孙鹏[1] 刘轶峰 JIANG Kaihua;HAN Rui;SUN Peng;LIU Yifeng(National Network New Media Engineering Research Center,Institute of Acoustics,Chinese Academy of Sciences,Beijing,100190,China;University of Chinese Academy of Sciences,Beijing,100049,China)
机构地区:[1]中国科学院声学研究所国家网络新媒体工程技术研究中心,北京100190 [2]中国科学院大学,北京100049
出 处:《网络新媒体技术》2020年第4期37-40,共4页Network New Media Technology
基 金:中国科学院先导专项课题:SEANET技术标准化研究与系统研制(编号:XDC02070100)。
摘 要:针对目前网络边缘智能终端间热迁移服务时任务只能独立处理、停机时间占用完工时间等问题,提出一种适用于前置依赖任务队列的迁移方法。通过将待迁移任务队列卸载到邻近节点,并将执行结果交付给新接入节点,避免停机迁移过程中任务等待。同时,本文改进了Min-Min算法,同优先级内做Min-Min调度,不同优先级根据依赖关系和传输时间选择执行节点,使其适用于有前置依赖的任务队列。实验结果表明,服务交付时间较现有方案明显缩短。To solve the dependent task series and minimize the whole makespan during service migration among smart terminals,this paper proposed a migration method suitable for the dependent task series.By offloading migrated tasks to nearby nodes,execution results were provided directly by new access points,which avoided downtime of task pause during migration.Meanwhile,this paper improved Min-Min algorithm for dependent task series.By selecting nodes according to dependency and transmission time to tasks of different priority,and scheduling tasks of same priority with Min-Min optimal,the Min-Min algorithm was appropriate for dependent task series.The experiment results demonstrated that the service delay and downtime of the improved strategy shortened considerably compared with the current methods.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49