user8501: what are the top parallel search algorithms used by top engines ,and which one is the best ?
And is there a reference implementation of them in any programming language ? I know most of  the top engines are open source but they tend to be extremely complex and unsuitable for learning .

user2213: Best performing algorithms are YBWC and DTS. Lazy SMP is probably giving best performance/complexity ratio. You can read more about parallel search algorithms here (make sure to check referencies and links. 
As for reference realization, I haven't seen any, so I just used simpler engines with parallel search,  and, mostly, algorithms descriptions. 

8501: <p>what are the top parallel search algorithms used by top engines ,and which one is the best ?
And is there a reference implementation of them in any programming language ? I know most of  the top engines are open source but they tend to be extremely complex and unsuitable for learning .</p>
 2213: <p>Best performing algorithms are YBWC and DTS. Lazy SMP is probably giving best performance/complexity ratio. You can read more about parallel search algorithms <a href="http://chessprogramming.wikispaces.com/Parallel+Search" rel="nofollow">here</a> (make sure to check referencies and links. 
As for reference realization, I haven't seen any, so I just used simpler engines with parallel search,  and, mostly, algorithms descriptions. </p>
