Editing Granularity (section)

===Parallel computing===
{{See also|Granularity (parallel computing)}}
In [[parallel computing]], granularity means the amount of [[computation]] in relation to communication, i.e., the ratio of computation to the amount of communication.{{sfn|Spacey|Luk|Kelly|Kuhn|2012}}

Fine-grained parallelism means individual tasks are relatively small in terms of code size and execution time. The data is transferred among processors frequently in amounts of one or a few memory words. Coarse-grained is the opposite: data is communicated infrequently, after larger amounts of computation.

The finer the granularity, the greater the potential for parallelism and hence speed-up, but the greater the overheads of synchronization and communication.<ref>[http://foldoc.org/granularity FOLDOC]</ref> Granularity disintegrators exist as well and are important to understand in order to determine the accurate level of granularity.<ref>{{cite web |title=Software Architecture: The Hard Parts |language=en |website=Thoughtworks |url=https://www.thoughtworks.com/insights/books/software-architecture-hard-parts |access-date=2023-01-15}}</ref>

In order to attain the best parallel performance, the best balance between load and communication overhead needs to be found. If the granularity is too fine, the performance can suffer from the increased communication overhead. On the other side, if the granularity is too coarse, the performance can suffer from load imbalance.