Talk:Concurrent computing: Difference between revisions

Revision as of 04:33, 24 May 2018

Latest revision as of 13:07, 7 February 2024

(6 intermediate revisions by 6 users not shown)

Line 1:

{{WikiProject Computingbanner shell|class=C|vital=yes|1=
{{WikiProject Computing |importance=high |software=y |software-importance=High |science=y |science-importance=High}}

{{WikiProject Computer science |importance=high |class=C}}

}}

== Merged content from [[Concurrent programming language]] ==

See [[Talk:Concurrent programming language]] for earlier discussions on concurrent programming languages, as well as dicussion on the merge into [[Concurrent computing]]. --[[User:Allan McInnes|Allan McInnes]] 07:03, 27 January 2006 (UTC)

Line 28 ⟶ 29:

--[[User:70.189.73.224|70.189.73.224]] 15:08, 23 September 2006 (UTC)

Monitors, Mutexes, tokens and other forms of resource control are not inherently part of the concurrent paradigm. Concurrency at its core describes a series of actions that regardless of execution time will deterministically conclude (this makes no assumptions about physical hardware and is provable). For any algorithm to be in a concurrent state it has to be non blocking, e.g. no single point of execution has any relation or dependency on any other point of execution. If there is a hardware limitation causing blocking behavior the execution can be freely paused without affecting its state(it can still alter the flow by its action on resources like memory, io control, or processor control) but not block or lock any other point of execution. Future readers should ignore the comment above this as it is clearly written by someone without expertise in concurrency. <!-- Template:Unsigned IP --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/76.88.186.107|76.88.186.107]] ([[User talk:76.88.186.107#top|talk]]) 13:41, 30 July 2018 (UTC)</small> <!--Autosigned by SineBot-->

== Types of concurrency ==

Line 114 ⟶ 117:

[[Special:Contributions/46.208.236.121|46.208.236.121]] ([[User talk:46.208.236.121|talk]]) 04:33, 24 May 2018 (UTC)

== Concurrent transmission ==

I have removed this paragraph from the lead as there is no support for it in the body of the article and it seems to be discussing a different subject. ~[[User:Kvng|Kvng]] ([[User talk:Kvng|talk]]) 00:22, 14 November 2018 (UTC)

:The concurrent scheduling of data transmission in [[Wireless network]] helps increase in network throughput. Use of [[Directional antennas]] and [[Millimeter-wave]] communication in [[WPAN]] gaining increased interest. Owing to properties of [[Directional antennas]] and [[Millimeter-wave]], the probability of concurrent scheduling of non‐interfering transmissions increases, which results in an immense increase in network throughput. However, the optimum scheduling of concurrent transmission is an NP-Hard problem <ref>{{cite journal|author=Bilal, Muhammad|displayauthors=etal|title=Time‐Slotted Scheduling Schemes for Multi‐hop Concurrent Transmission in WPANs with Directional Antenna|journal=ETRI Journal |url=https://onlinelibrary.wiley.com/doi/full/10.4218/etrij.14.0113.0703 |arxiv=1801.06018}}</ref>.

{{reflist-talk}}

== What does sheaf have to do with concurrent programming? ==

I will remove the link if no one objects. [[User:Digital27|Digital27]] ([[User talk:Digital27|talk]]) 14:17, 14 November 2023 (UTC)