A graph and connected dominating set-based mathematical model for task mapping in cloud computing
暂无分享,去创建一个
[1] Arobinda Gupta,et al. A Distributed Self-Stabilizing Algorithm for Finding a Connected Dominating Set in a Graph , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).
[2] Martin Bichler,et al. A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers , 2010, IEEE Transactions on Services Computing.
[3] Zhenyu Zhang,et al. Modeling and testing of cloud applications , 2009, 2009 IEEE Asia-Pacific Services Computing Conference (APSCC).
[4] Bora Uçar,et al. Integrated data placement and task assignment for scientific workflows in clouds , 2011, DIDC '11.
[5] Min Li,et al. CAM: a topology aware minimum cost flow based resource manager for MapReduce applications in the cloud , 2012, HPDC '12.
[6] Baomin Xu,et al. Job scheduling algorithm based on Berger model in cloud environment , 2011, Adv. Eng. Softw..
[7] Satoshi Fujita. On Guha and Khuller's Greedy Algorithm for Finding a Minimum CDS for Unit Disk Graphs , 2014, 2014 Second International Symposium on Computing and Networking.
[9] Frank Leymann,et al. Formalizing the Cloud through Enterprise Topology Graphs , 2012, 2012 IEEE Fifth International Conference on Cloud Computing.
[10] Kang-Won Lee,et al. Minimum Congestion Mapping in a Cloud , 2015, SIAM J. Comput..