一个map-reduce任务由m个mapper和r个reducer构成,计算的效率可以认为正比于mr的乘积(数据管道的个数),在限定任务的mr乘积约等于10000的情况下,假定每个mapper和每个reducer的成本分别为1和7,那么最佳的资源分配最接近于以下哪个方案?
mapper100个,reducer100个
Mapper200个,reducer50个
Mapper264个,reducer38个
Mapper316个,reducer32个
Mapper500个,reducer20个
Mapper1000个,reducer10个