32
edits
Changes
→Coding Time Comparison for STL and TBB
https://www.inf.ed.ac.uk/teaching/courses/ppls/TBBtutorial.pdf
==Coding Time Code Implementation Comparison for STL and TBB==
{| class="wikitable collapsible collapsed" style="text-align: left;margin:0px;"
|-
''Details: http://en.cppreference.com/w/cpp/thread''
====Implementation Safety====
TBB specifically makes concurrent vector not to support insert and erase operations. Only new items can only be pushed back, and cannot be shrunk;
-This prevents devs to write bad code
-Allowing this could cause a mistake on implementing parallel code. Which will cause a big performance hit, burdening both iterating and growing operations. Which will make the concurrent containers in TBB unless due to this risk.
'''Note for TBB (to trash less on STL)'''
-Some operations in TBB containers are not thread safe, like reserve() and clear() in concurrent vector.
-Complexity on concurrent containers is higher compared to STL. For layouts and implementation. This due to the nature of running in parallel and how TBB
implements it.
