Martin Thompson asserts that a STM that relies on a ref that relies on CAS will ultimately be limited by Amdahl's law. Amdahl's law being that the maximum performance of a parallel program is limited by the sequential (non-parallel) part of the program. Is Martin Thompson saying that CAS is by its nature non-parallel?
Why is a Compare-And-Swap operation limited by Amdahl's law?
185 Views Asked by hawkeye At
1
There are 1 best solutions below
Related Questions in CONCURRENCY
- Entity Framework Code First with Fluent API Concurrency `DbUpdateConcurrencyException` Not Raising
- How to return blocking queue to the right object?
- How to ensure data synchronization across threads within a "safe" area (e.g not in a critical section) without locking everything
- Breakpoint "concurrency" in Intellij
- java, when (and for how long) can a thread cache the value of a non-volatile variable?
- Reentrancy and Reentrant in C?
- How to do many simultaneous jsoup sessions (Spring boot project and concurrancy)
- Using multiple threads to print statements sequentially
- Interrupting long working thread
- Usage of C++11 std::unique_lock<std::mutex> lk(myMutex); not really clear
- Using getOrElseUpdate of TrieMap in Scala
- Concurrency of JPA when same DB used by other applications
- erlang processes and message passing architecture
- Erratic StampedLock.unlock(long) behaviour?
- Jersey Client, memory leak, static and concurrency
Related Questions in PARALLEL-PROCESSING
- Async vs Horizontal scaling
- Scattered indices in MPI
- How to perform parallel processes for different groups in a folder?
- Julia parallel programming - Making existing function available to all workers
- Running scala futures somewhat in parallel
- running a thread in parallel
- How to make DGEMM execute sequentially instead of in parallel in Matlab Mex Function
- Running time foreach package
- How to parallelize csh script with nested loop
- SSIS ETL parallel extraction from a AS400 file
- Fill an array with spmd in Matlab
- Distribute lines of code to workers
- Java 8 parallelStream for concurrent Database / REST call
- OutOfRangeException with Parallel.For
- R Nested Foreach Parallelization not Working
Related Questions in SEQUENTIAL
- Create a list of sequential monthly dates in PHP given initial date and quantity
- Sequential Consistency in Distributed Systems
- Simple but difficult. How to force external libs functions run sequentially?
- play sequential audio files swift
- Write a library in javascript that can run asynchronous functions sequentially
- MySQL: For each id, using sequential dates to calculate space in between
- XSLT sequential processing
- sequentially update rows in data.table
- How can I determine the nett effect of all joining/leaving records in each group?
- Running multiple ant builds sequentially from batch file
- %dopar% or alternative method to speed up sequential stochastic calculation
- VBA variable name that increases with each loop and can be used to populate a textbox
- Calling for sequential variables in Matlab loops
- Can a D flip flop be enabled this way?
- Matlab:renaming Files in a Sequential Order
Related Questions in COMPARE-AND-SWAP
- Does the following lock-free code exhibit a race-condition?
- weakCompareAndSwap vs compareAndSwap
- X32 and __gnu_cxx::__exchange_and_add_single?
- java - stealing bits from references
- Cuda atomics and conditional branches
- CAS vs synchronized performance
- using isBlank() in google apps script to mark column
- CMPXCHG16B correct?
- Compare and Swap (CAS) implementation in EhCache
- How to implement double-word compare and swap in C/Linux?
- Do atomic CAS-operations on x86_64 and ARM always use std::memory_order_seq_cst?
- How to modify structure elements atomically without using locks in C?
- How to use atomic variable as a mutex in C++?
- Why is a Compare-And-Swap operation limited by Amdahl's law?
- How can compare-and-swap be used for a wait-free mutual exclusion for any shared data structure?
Related Questions in PARALLELISM-AMDAHL
- Why Amdahl Law on serial and parallel fractions does not provide a theoretical speedup of 4 on quad-core CPU?
- Working through an example of Amdahl's Law with respect to percentage speedup
- Why is a Compare-And-Swap operation limited by Amdahl's law?
- Is it legal to use Amdahl's law in the inverse way? How many threads should I use?
- How to parallelize a class method in python?
- Negative speed up in Amdahl's law?
- Evaluating methods in parallel
- What is the performance of 100 processors capable of 2 GFLOPs running 2% sequential and 98% parallelizable code?
- CPU utilization calculation in Amdahl's law
- Is it beneficial to parallelize variable declaration?
- Why my code runs so much slower with joblib.Parallel() than without?
- Very slow example parallel code in python, slower then serial
- Does python's Pool() for parallelization prevent writing to global variables?
- Why python multiprocessing takes more time than serial code? How to speedup this?
- RegCM, MPICH, Computer Clustering
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
I would think that's exactly his point. The swap must come after the results of the compare are known, so ultimately you cannot run any faster than "compare, then swap, then next compare, then next swap, the next compare, ...".
Of course, in most realistic cases, you won't get anywhere close to reaching that limit -- and you would be unbelievably thrilled with the performance if you did. It's kind of like saying that cars can never go faster than the speed of light. It's almost undoubtedly true, but car manufacturers needn't worry about it.