Distributed Alpha Beta Trimming

Question

I am looking for an efficient algorithm that allows me to process a minimax search tree for chess with alpha-beta cropping in a distributed architecture. The algorithms that I found (PVS, YBWC, DTS) are pretty old (1990 was the last). I assume that since then there have been many significant improvements. What is the current standard in this area?

Also, please provide me with the idiotic explanation of DTS, as I cannot understand it from the research papers that I read.