Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2012
Integrating task parallelism with actors
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 753–772https://doi.org/10.1145/2384616.2384671This paper introduces a unified concurrent programming model combining the previously developed Actor Model (AM) and the task-parallel Async-Finish Model (AFM). With the advent of multi-core computers, there is a renewed interest in programming models ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
Efficiently combining parallel software using fine-grained, language-level, hierarchical resource management policies
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 717–736https://doi.org/10.1145/2384616.2384669This paper presents Poli-C, a language extension, runtime library, and system daemon enabling fine-grained, language-level, hierarchical resource management policies. Poli-C is suitable for use in applications that compose parallel libraries, frameworks,...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
AutoMan: a platform for integrating human-based and digital computation
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 639–654https://doi.org/10.1145/2384616.2384663Humans can perform many tasks with ease that remain difficult or impossible for computers. Crowdsourcing platforms like Amazon's Mechanical Turk make it possible to harness human-based computational power at an unprecedented scale. However, their ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
Scaling symbolic execution using ranged analysis
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 523–536https://doi.org/10.1145/2384616.2384654This paper introduces a novel approach to scale symbolic execution --- a program analysis technique for systematic exploration of bounded execution paths---for test input generation. While the foundations of symbolic execution were developed over three ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
IFRit: interference-free regions for dynamic data-race detection
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 467–484https://doi.org/10.1145/2384616.2384650We propose a new algorithm for dynamic data-race detection. Our algorithm reports no false positives and runs on arbitrary C and C++ code. Unlike previous algorithms, we do not have to instrument every memory access or track a full happens-before ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
From clarity to efficiency for distributed algorithms
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 395–410https://doi.org/10.1145/2384616.2384645This paper describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language supports high-level control flows where complex synchronization conditions ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
Elixir: a system for synthesizing concurrent graph programs
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 375–394https://doi.org/10.1145/2384616.2384644Algorithms in new application areas like machine learning and network analysis use "irregular" data structures such as graphs, trees and sets. Writing efficient parallel code in these problem domains is very challenging because it requires the ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
Molecule: using monadic and streaming I/O to compose process networks on the JVM
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 315–334https://doi.org/10.1145/2384616.2384640Molecule is a domain specific language library embedded in Scala for easing the creation of scalable and modular concurrent applications on the JVM. Concurrent applications are modeled as parallel process networks that exchange information over mobile ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
Work-stealing without the baggage
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 297–314https://doi.org/10.1145/2384616.2384639Work-stealing is a promising approach for effectively exploiting software parallelism on parallel hardware. A programmer who uses work-stealing explicitly identifies potential parallelism and the runtime then schedules work, keeping otherwise idle ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
Mitigating the compiler optimization phase-ordering problem using machine learning
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 147–162https://doi.org/10.1145/2384616.2384628Today's compilers have a plethora of optimizations to choose from, and the correct choice of optimizations can have a significant impact on the performance of the code being optimized. Furthermore, choosing the correct order in which to apply those ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10 - research-articleOctober 2012
Safe compiler-driven transaction checkpointing and recovery
OOPSLA '12: Proceedings of the ACM international conference on Object oriented programming systems languages and applicationsPages 41–56https://doi.org/10.1145/2384616.2384620Several studies have shown that a large fraction of the work performed inside memory transactions in representative programs is wasted due to the transaction experiencing a conflict and aborting. Aborts inside long running transactions are especially ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 10