CORC  > 浙江工商大学
An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines
Jiang, Yiwei[1]; Zhou, Wei[2]; Zhou, Ping[3]
2018
卷号35期号:3
URL标识查看原文
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/5895315
专题浙江工商大学
作者单位1.[1]Zhejiang Congshang Univ, Contemporary Business & Trade Res Ctr, Sch Management & E Business, Hangzhou 310018, Zhejiang, Peoples R China
2.[2]Zhejiang Sci Tech Univ, Dept Math, Hangzhou 310018, Zhejiang, Peoples R China
3.[3]Zhejiang Business Coll, Coll Humanities, Hangzhou 310053, Zhejiang, Peoples R China
推荐引用方式
GB/T 7714
Jiang, Yiwei[1],Zhou, Wei[2],Zhou, Ping[3]. An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines[J],2018,35(3).
APA Jiang, Yiwei[1],Zhou, Wei[2],&Zhou, Ping[3].(2018).An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines.,35(3).
MLA Jiang, Yiwei[1],et al."An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines".35.3(2018).
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace