Algorithms for Divisible Load Scheduling of Data-intensive Applications |
| |
Authors: | Chen Yu Dan C Marinescu |
| |
Affiliation: | 1.School of Electrical Engineering & Computer Science,University of Central Florida,Orlando,USA |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|