Synchronization complexity: Difference between revisions
Content deleted Content added
Unreferenced orphan should be merged |
m clean up using AWB |
||
| Line 1: | Line 1: | ||
{{Multiple issues| |
{{Multiple issues| |
||
{{Orphan|few=July 2015}} |
{{Orphan|few=July 2015|date=August 2016}} |
||
{{Unreferenced|date=July 2015}} |
{{Unreferenced|date=July 2015}} |
||
{{Merge|Cyclomatic complexity|date=July 2015}} |
{{Merge|Cyclomatic complexity|date=July 2015}} |
||
| Line 10: | Line 10: | ||
[[Category:Software metrics]] |
[[Category:Software metrics]] |
||
{{soft-eng-stub}} |
{{soft-eng-stub}} |
||
Revision as of 07:06, 15 August 2016
 | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
Synchronization complexity is a quantified attribute (see also: measurement) of a characteristic of a concurrent software product. It measures the additional complexity incurred by the synchronization constructs used in the software, and does that by analyzing the software source code. It is essentially an extension of the cyclomatic complexity for multitasking/multithreaded programs.
Further reading
 | This software-engineering-related article is a stub. You can help Wikipedia by expanding it. |