To migrate or to wait: Bandwidth-latency tradeoff in opportunistic scheduling of parallel tasks
暂无分享,去创建一个
Lang Tong | Kang-Won Lee | Ting He | Hyoil Kim | Shiyao Chen
[1] Yogish Sabharwal,et al. Varying bandwidth resource allocation problem with bag constraints , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).
[2] Aart J. C. Bik,et al. Pregel: a system for large-scale graph processing - "ABSTRACT" , 2009, PODC '09.
[3] Aart J. C. Bik,et al. Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.
[4] Jordi Torres,et al. Enabling Resource Sharing between Transactional and Batch Workloads Using Dynamic Application Placement , 2008, Middleware.
[5] DE Economist. A SURVEY ON THE BANDIT PROBLEM WITH SWITCHING COSTS , 2004 .
[6] Jeffrey K. Hollingsworth,et al. Unobtrusiveness and efficiency in idle cycle stealing for PC grids , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..
[7] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[8] Jean-Marc Vincent,et al. Discovering Statistical Models of Availability in Large Distributed Systems: An Empirical Study of SETI@home , 2011, IEEE Transactions on Parallel and Distributed Systems.