Content deleted Content added
Updated concurrent program to concurrent algorithm. Lots of concurrent programs would not recieve a performance improvement from parallelism. Only specific problems can be optimized with concurrent parallelism. Asynchronous IO is a form of concurrency, I added the wiki page as a citation. MVCC is an example of an appropriate problem solution, the wiki article explains why its necessary and it was asking for a citation. |
m add reference to book section about Gustafon's Law in advantages |
||
Line 52:
===Advantages===
{{Unreferenced section|date=December 2006}}
* Increased program throughput—parallel execution of a concurrent algorithm allows the number of tasks completed in a given time to increase proportionally to the number of processors according to [[Gustafson's law]].<ref>{{Cite book |last=Padua |first=David |title=Encyclopedia of Parallel Computing |publisher=Springer New York, NY |year=2011 |isbn=978-0-387-09765-7 |publication-date=September 8, 2011 |pages=819-825 |language=en}}</ref>
* High responsiveness for input/output—input/output-intensive programs mostly wait for input or output operations to complete. Concurrent programming allows the time that would be spent waiting to be used for another task.<ref>{{Citation |title=Asynchronous I/O |date=2024-12-20 |work=Wikipedia |url=https://en.wikipedia.org/wiki/Asynchronous_I/O |access-date=2024-12-27 |language=en}}</ref>
* More appropriate program structure—some problems and problem domains are well-suited to representation as concurrent tasks or processes. For example [[Multiversion concurrency control|MVCC]].
| |||