Heuristic-Based Job Flow Allocation in Distributed Computingстатья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 21 сентября 2017 г.
Аннотация:In this paper, we propose a meta-data based approach for a deliberate job flow distribution in computing environments, such as utility Grids. Under conditions of a heterogeneous job flow composition and a variety of resource domains, we examine how different job and resource characteristics affect the efficiency of the scheduling process. Based on the most significant job flow and resource domain characteristics a heuristic distribution quality indicator is introduced. Additional simulation study is performed to verify the indicator in different distribution strategies and to compare them with a random job flow allocation.