Sort function race

作者: Joisha Pramod G

DOI:

关键词:

摘要: In one example, a system for sort function race can include processor, and memory resource storing instructions executable by the processor to generate plurality of variant functions that utilize an input from parent function, perform as separate processes, identify completes in shortest period time, receive results identified function.

参考文章(15)
Anand Rajaraman, Digvijay Singh Lamba, Wang Chee Lam, Taraka Subrahmanya Prasad Siripurapu, Processing data feeds ,(2011)
Paolo Ferragina, Giovanni Manzini, Shanmugavelayut Muthukrishnan, Fabrizion Luccio, Method of structuring and compressing labeled trees of arbitrary degree and shape ,(2007)
Matthew Alan Palmer, Carl Steven Mower, Intelligent sorting for N-way secure split tunnel ,(2013)
Doug Lea, A Java fork/join framework Proceedings of the ACM 2000 conference on Java Grande. pp. 36- 43 ,(2000) , 10.1145/337449.337465
Waihong Ng, Katsuhiko Kakehi, Merging String Sequences by Longest Common Prefixes Ipsj Digital Courier. ,vol. 4, pp. 69- 78 ,(2008) , 10.2197/IPSJDC.4.69
David A. Koblas, Jonathan J. Oliver, Brian K. Wilson, Message classification using legitimate contact points ,(2012)