Indexed by:
Abstract:
Aiming to the new problems of cost optimization for concurrent multiple DAG(Directed Acyclic Graph) workflow sharing heterogeneous resource on the basis of maximizing overall throughput of DAGs scheduling, we propose an algorithm called PDTC(based on the Probe of the Total Cost Decrease) to minimize the total cost of these DAG while meeting a user-defined deadline. Last experiments demonstrate that these algorithms and methods can improve the related performances. ©, 2014, Chinese Institute of Electronics. All right reserved.
Keyword:
Reprint Author's Address:
Email:
Source :
Acta Electronica Sinica
ISSN: 0372-2112
Year: 2014
Issue: 9
Volume: 42
Page: 1767-1774
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 1
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 6
Affiliated Colleges: