Creating services with hard guarantees from cycle-harvesting systems
暂无分享,去创建一个
[1] Xian-He Sun,et al. Limitations of Cycle Stealing for Parallel Processing on a Network of Homogeneous Workstations , 1997, J. Parallel Distributed Comput..
[2] Miron Livny,et al. Evaluation of strategies to reduce the impact of machine reclaim in cycle-stealing environments , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.
[3] Bill Ravens,et al. An Introduction to Copulas , 2000, Technometrics.
[4] Van Jacobson,et al. An Expedited Forwarding PHB , 1999, RFC.
[5] Jeffrey K. Hollingsworth,et al. Exploiting Fine-Grained Idle Periods in Networks of Workstations , 2000, IEEE Trans. Parallel Distributed Syst..
[6] Scott Shenker,et al. Specification of Guaranteed Quality of Service , 1997, RFC.
[7] Arnold L. Rosenberg. Optimal Schedules for Cycle-Stealing in a Network of Workstations with a Bag-of-Tasks Workload , 2002, IEEE Trans. Parallel Distributed Syst..
[8] Andrew V. Carter. DeÞciency distance between multinomial and multivariate normal experiments under smoothness constraints on the parameter set , 2001 .
[9] Arnold L. Rosenberg. Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output , 2000, Int. J. Found. Comput. Sci..