Scalable and Adaptive Load Balancing on IBM PowerNP
暂无分享,去创建一个
[1] Joachim H. Ahrens,et al. Efficient table-free sampling methods for the exponential, Cauchy, and normal distributions , 1988, CACM.
[2] George Marsaglia,et al. The Monty Python method for generating random variables , 1998, TOMS.
[3] Ellen W. Zegura,et al. Performance of hashing-based schemes for Internet load balancing , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[4] Kenneth G. Hamilton,et al. Algorithm 780: exponential pseudorandom distribution , 1998, TOMS.
[5] Keith W. Ross,et al. Hash routing for collections of shared Web caches , 1997, IEEE Netw..
[6] Julio F. Fernández,et al. Fast algorithms for random numbers with exponential and normal distributions , 1996 .
[7] Donald E. Knuth,et al. Sorting and Searching , 1973 .
[8] CachesKeith W. RossDepartment. Hash-Routing for Collections of Shared Web , 1997 .
[9] David Thaler,et al. Using name-based mappings to increase hit rates , 1998, TNET.
[10] Chris S. Wallace. Fast pseudorandom generators for normal and exponential variates , 1996, TOMS.