> Libgomp will start N-1 new threads, and all of them would want to look up > mappings for i1,i2,...iK in the splay tree. The first one wouldn't find > anything and would map and insert all the values to the tree. But the > following > ones would look-up these addresses in the exactly same order, which will lead > to > totally unbalanced tree. > > Am I missing anything or is it a real problem? On second thought, this access order doesn't necessarily mean accessing in ascending/descending keys order, so there is no problem here.
Thanks, Michael