Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJune 2007
CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 456–467https://doi.org/10.1145/1250734.1250787Concurrent garbage collectors are notoriously hard to design, implement, and verify. We present a framework for the automatic exploration of a space of concurrent mark-and-sweep collectors. In our framework, the designer specifies a set of "building ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6 - ArticleJune 2007
Software behavior oriented parallelization
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 223–234https://doi.org/10.1145/1250734.1250760Many sequential applications are difficult to parallelize because of unpredictable control flow, indirect data access, and input-dependent parallelism. These difficulties led us to build a software system for behavior oriented parallelization (BOP), ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6 - ArticleJune 2007
Optimistic parallelism requires abstractions
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 211–222https://doi.org/10.1145/1250734.1250759Irregular applications, which manipulate large, pointer-based data structures like graphs, are difficult to parallelize manually. Automatic tools and techniques such as restructuring compilers and run-time speculative execution have failed to uncover ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6 - ArticleJune 2007
Reliable and efficient programming abstractions for wireless sensor networks
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 200–210https://doi.org/10.1145/1250734.1250757It is currently difficult to build practical and reliable programming systems out of distributed and resource-constrained sensor devices. The state of the art in today's sensornet programming is centered around a component-based language called nesC. ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6 - ArticleJune 2007
Combining events and threads for scalable network services implementation and evaluation of monadic, application-level concurrency primitives
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 189–199https://doi.org/10.1145/1250734.1250756This paper proposes to combine two seemingly opposed programming models for building massively concurrent network services: the event-driven model and the multithreaded model. The result is a hybrid design that offers the best of both worlds--the ease ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6 - ArticleJune 2007
Automatic inversion generates divide-and-conquer parallel programs
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 146–155https://doi.org/10.1145/1250734.1250752Divide-and-conquer algorithms are suitable for modern parallel machines, tending to have large amounts of inherent parallelism and working well with caches and deep memory hierarchies. Among others, list homomorphisms are a class of recursive functions ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6 - ArticleJune 2007
Enforcing isolation and ordering in STM
- Tatiana Shpeisman,
- Vijay Menon,
- Ali-Reza Adl-Tabatabai,
- Steven Balensiefer,
- Dan Grossman,
- Richard L. Hudson,
- Katherine F. Moore,
- Bratin Saha
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 78–88https://doi.org/10.1145/1250734.1250744Transactional memory provides a new concurrency control mechanism that avoids many of the pitfalls of lock-based synchronization. High-performance software transactional memory (STM) implementations thus far provide weak atomicity: Accessing shared data ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6 - ArticleJune 2007
CheckFence: checking consistency of concurrent data types on relaxed memory models
PLDI '07: Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and ImplementationPages 12–21https://doi.org/10.1145/1250734.1250737Concurrency libraries can facilitate the development of multi-threaded programs by providing concurrent implementations of familiar data types such as queues or sets. There exist many optimized algorithms that can achieve superior performance on ...
Also Published in:
ACM SIGPLAN Notices: Volume 42 Issue 6