674 search results - page 47 / 135 » The computational complexity of the parallel knock-out probl... |
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
Grid computing allows the utilization of vast computational resources for solving complex scientific and engineering problems. However, development tools for Grid applications are...
CIT
2006
Springer
15 years 5 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
122
click to vote
ICPP
2006
IEEE
15 years 7 months ago
2006
IEEE
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
109
click to vote
HPCA
2007
IEEE
16 years 1 months ago
2007
IEEE
Chip multiprocessors with multiple simpler cores are gaining popularity because they have the potential to drive future performance gains without exacerbating the problems of powe...