科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we introduce the Divisible Load Scheduling (DLS) family of algorithms for data-intensive applications. The polynomial time algorithms partition the input data and generate optimal mappings to collection of autonomous and heterogeneous computational systems. We prove the optimality of the solution and report a simulation study of the algorithms.
- 出版日期2010-3
