Loading...
Please wait, while we are loading the content...
Similar Documents
Handling parallelism in a concurrency model.
| Content Provider | CiteSeerX |
|---|---|
| Author | Schill, Mischael Nanz, Sebastian |
| Abstract | Abstract. Programming models for concurrency are optimized for dealing with nondeterminism, for example to handle asynchronously arriving events. To shield the developer from data race errors effectively, such models may prevent shared access to data altogether. However, this restriction also makes them unsuitable for applications that require data parallelism. We present a library-based approach for permitting parallel access to arrays while preserving the safety guarantees of the original model. When applied to SCOOP, an object-oriented concurrency model, the approach exhibits a negligible performance overhead compared to ordinary threaded implementations of two parallel benchmark programs. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Concurrency Model Parallel Benchmark Program Original Model Shared Access Negligible Performance Overhead Threaded Implementation Data Race Error Object-oriented Concurrency Model Safety Guarantee Data Parallelism Parallel Access Library-based Approach |
| Content Type | Text |
| Resource Type | Article |
