Can we put concurrency back into redundant multithreading?
Björn DöbelHermann HärtigPublished in: EMSOFT (2014)
Keyphrases
- graph cuts
- multithreading
- parallel computing
- computational power
- highly efficient
- coarse grained
- data partitioning
- memory efficient
- concurrency control
- database systems
- fine grained
- shared memory
- distributed memory
- bayesian networks
- nested transactions
- low cost
- parallel processing
- message passing
- high level
- dynamic programming