287 search results - page 2 / 58 » Introducing parallelism and concurrency in the data structur... |
SIGCSE
2004
ACM
13 years 11 months ago
2004
ACM
This paper presents a family of programming projects appropriate to a sophomore-level data structures course, centered around the concept of a buffer pool serving as the access i...
ASPLOS
2008
ACM
13 years 7 months ago
2008
ACM
Concurrency control is one of the main sources of error and complexity in shared memory parallel programming. While there are several techniques to handle concurrency control such...
PODC
2011
ACM
12 years 8 months ago
2011
ACM
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
AFP
2008
Springer
13 years 11 months ago
2008
Springer
This practical tutorial introduces the features available in Haskell for writing parallel and concurrent programs. We first describe how to write semi-explicit parallel programs b...
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...