concurrent algorithm造句

• A concurrent algorithm can perform differently on different runs due to a race condition.
• PCN includes the language for specifying concurrent algorithms and interfaces to C and Fortran.
• Concurrency control can require significant additional complexity and overhead in a concurrent algorithm compared to the simpler sequential algorithm.
• Further, non-parallel, non-concurrent algorithms are often referred to as " sequential algorithms ", by contrast with concurrent algorithms.
• Further, non-parallel, non-concurrent algorithms are often referred to as " sequential algorithms ", by contrast with concurrent algorithms.
• Dijkstra's algorithmic work ( especially graph algorithms, concurrent algorithms, and distributed algorithms ) plays an important role in many areas of computing science.
• The academic study of concurrent algorithms started in the 1960s, with credited with being the first paper in this field, identifying and solving mutual exclusion.
• At first it appeared that CSL was well suited to what Dijkstra has called loosely connected processes, but perhaps not to fine-grained concurrent algorithms with significant interference.
• The academic study of concurrent programming ( concurrent algorithms in particular ) started in the 1960s, with Edsger Dijkstra ( 1965 ) credited with being the first paper in this field, identifying and solving mutual exclusion.
• Many parallel algorithms are executed concurrently  though in general concurrent algorithms are a distinct concept  and thus these concepts are often conflated, with which aspect of an algorithm is parallel and which is concurrent not being clearly distinguished.
• In computer science, a "'concurrent algorithm "'is one that can be Concurrency often adds significant complexity to an algorithm, requiring concurrency control such as mutual exclusion to avoid problems such as race conditions.
• The requirement of mutual exclusion was first identified and solved by Edsger W . Dijkstra in his seminal 1965 paper titled " Solution of a problem in concurrent programming control ", which is credited as the first topic in the study of concurrent algorithms.
• The requirement of mutual exclusion was first identified and solved by Edsger W . Dijkstra in his seminal 1965 paper titled " Solution of a problem in concurrent programming control ", and is credited as the first topic in the study of concurrent algorithms.
• The problem is how to design a discipline of behavior ( a concurrent algorithm ) such that no philosopher will starve; i . e ., each can forever continue to alternate between eating and thinking, assuming that no philosopher can know when others may want to eat or think.
• On 5 April 2010, Dave Dice, Yossi Lev, Virendra Marathe, Mark Moir, Marek Olszewski and Dan Nussbaum released a paper " Simplifying Concurrent Algorithms by Exploiting Hardware Transactional Memory " to be presented at the 22nd ACM Symposium on Parallelism in Algorithms and Architectures ( SPAA 2010 ).
• E . g . : In a deterministic computing machine M the concurrent algorithms A1 and A2 each load data object O to register X, increment X, write X to O and halt; in my understanding this cannot ever produce more than one sequence of states ( e . g.