Author:
Dheenadayalan Kumar,Muralidhara V. N.,Srinivasaraghavan Gopalakrishnan
Publisher
Springer International Publishing
Reference21 articles.
1. Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. Algorithmica 47(3), 253–268 (2007)
2. Breiman, L.: Random forests. Mach. Learn. 45(1), 5–32 (2001)
3. CERN: European Laboratory for Particle Physics (2014).
http://home.web.cern.ch/about/computing
. Accessed 30 September 2014
4. Chen, J., Zhou, B.B., Wang, C., Lu, P., Wang, P., Zomaya, A.: Throughput enhancement through selective time sharing and dynamic grouping. In: 2013 IEEE 27th International Symposium on Parallel Distributed Processing (IPDPS), pp. 1183–1192 (2013)
5. Choudhury, B.R.: IBM Platform Load Sharing Facility (LSF) Integration with Netapp Storage. Technical report (2013)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献