Sciweavers

287 search results - page 4 / 58
» Introducing parallelism and concurrency in the data structur...
Sort
View
PPOPP
2006
ACM
14 years 1 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
SIGCSE
2002
ACM
149views Education» more  SIGCSE 2002»
13 years 7 months ago
A comprehensive project for CS2: combining key data structures and algorithms into an integrated web browser and search engine
We present our experience using a large, real-world application as a course project for the second half of the semester of a CS2 course. Our primary goal for the project was to cr...
Tia Newhall, Lisa Meeden
IPPS
1998
IEEE
13 years 11 months ago
Hiding Communication Latency in Data Parallel Applications
Interprocessor communication times can be a significant fraction of the overall execution time required for data parallel applications. Large communication to computation ratios o...
Vivek Garg, David E. Schimmel
OOPSLA
2009
Springer
14 years 1 months ago
The design of a task parallel library
The Task Parallel Library (TPL) is a library for .NET that makes it easy to take advantage of potential parallelism in a program. The library relies heavily on generics and delega...
Daan Leijen, Wolfram Schulte, Sebastian Burckhardt
WDAG
2009
Springer
130views Algorithms» more  WDAG 2009»
14 years 1 months ago
Contention-Sensitive Data Structures and Algorithms
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
Gadi Taubenfeld