Utilization of data structure of low contention in execution core of Anahy-3

This article analyze the use of low contention strategies in the implementation of the Anahy execution environment, specifically at its core scheduling. These strategies aims for overhead reduction when using the mutex to access list data with multiple threads. The results show that the optmized implementations have better performance if compared with STL. This article also compares various multithread execution tools, such as Cilk, TBB and OpenMP. In one of the cases, the result was 190% better. Therefore, Anahy can be an alternative to other environments because of its performance and also for allowing the programmer code with more ease.