Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- posterFebruary 2008
Practical experiences with Java software transactional memory
- Evgueni Brevnov,
- Yuri Dolgov,
- Boris Kuznetsov,
- Dmitry Yershov,
- Vyacheslav Shakin,
- Dong-Yuan Chen,
- Vijay Menon,
- Suresh Srinivas
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 287–288https://doi.org/10.1145/1345206.1345259In this paper, we evaluate the emerging Transactional Memory (TM) area by developing a set of Java transactional memory workloads and studying their performance under a Java Software Transactional Memory (STM) system and comparing them to their lock ...
- posterFebruary 2008
Extracting coarse-grain parallelism in general-purpose programs
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 281–282https://doi.org/10.1145/1345206.1345256While the chip multiprocessor (CMP) has quickly become the predominant processor architecture, its continuing success largely depends on the parallelizability of complex programs. In the early 1990s great successes were obtained to extract parallelism ...
-
- posterFebruary 2008
Automated application-level checkpointing based on live-variable analysis in MPI programs
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 273–274https://doi.org/10.1145/1345206.1345252This paper proposes an optimization method of data saving for application-level checkpointing based on the live-variable analysis method for MPI programs. We presents the implementation of a source-to-source precompiler (CAC) for automating ...
- posterFebruary 2008
Cache-aware iteration space partitioning
- Arun Kejariwal,
- Alexandru Nicolau,
- Utpal Banerjee,
- Alexander V. Veidenbaum,
- Constantine D. Polychronopoulos
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 269–270https://doi.org/10.1145/1345206.1345250The need for high performance per watt has led to the development of multi-core systems such as the Intel Core 2 Duo processor and the Intel quad-core Kentsfield processor. Maximal exploitation of the hardware parallelism supported by such systems ...
- posterFebruary 2008
Assertional reasoning about data races in relaxed memory models
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 267–268https://doi.org/10.1145/1345206.1345249We describe the ideas behind a method to use assertional reasoning to statically show that all sequentially consistent executions of a concurrent program are free from data races.
- posterFebruary 2008
All-window profiling of concurrent executions
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 265–266https://doi.org/10.1145/1345206.1345248This paper first demonstrates the need for all-window profiling in a concurrent execution, then presents an approximate algorithm, and finally discusses related work.
- posterFebruary 2008
Experiences using adaptive concurrency in transactional memory with Lee's routing algorithm
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 261–262https://doi.org/10.1145/1345206.1345246Experience in profiling Lee's routing algorithm, a new complex TM application, showed that transactional applications may exhibit dynamic exploitable parallelism, i.e. the amount of useful parallelism available at any point in time varies during the ...
- panelFebruary 2008
Where will all the threads come from?
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 259–260https://doi.org/10.1145/1345206.1345244Today, multicore microprocessors are at the heart of systems ranging from laptops to supercomputers. The shift to multicore architectures has transformed the problem of improving program performance from a micro-architecture problem to a software ...
- research-articleFebruary 2008
Software transactional memory for large scale clusters
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 247–258https://doi.org/10.1145/1345206.1345242While there has been extensive work on the design of software transactional memory (STM) for cache coherent shared memory systems, there has been no work on the design of an STM system for very large scale platforms containing potentially thousands of ...
- research-articleFebruary 2008
Dynamic performance tuning of word-based software transactional memory
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 237–246https://doi.org/10.1145/1345206.1345241The current generation of software transactional memories has the advantage of being simple and efficient. Nevertheless, there are several parameters that affect the performance of a transactional memory, for example the locality of the application and ...
- research-articleFebruary 2008
Toward high performance nonblocking software transactional memory
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 227–236https://doi.org/10.1145/1345206.1345240Substantial advances in STM performance in recent years have mostly focused on blocking systems. We describe our work integrating the most important techniques and optimizations emerging from the recent work on blocking STMs into several variants of a ...
- research-articleFebruary 2008
Transactional boosting: a methodology for highly-concurrent transactional objects
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 207–216https://doi.org/10.1145/1345206.1345237We describe a methodology for transforming a large class of highly-concurrent linearizable objects into highly-concurrent transactional objects. As long as the linearizable implementation satisfies certain regularity properties (informally, that every ...
- research-articleFebruary 2008
Split hardware transactions: true nesting of transactions using best-effort hardware transactional memory
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 197–206https://doi.org/10.1145/1345206.1345236Transactional Memory (TM) is on its way to becoming the programming API of choice for writing correct, concurrent, and scalable programs. Hardware TM (HTM) implementations are expected to be significantly faster than pure software TM (STM); however, ...
- research-articleFebruary 2008
Modeling optimistic concurrency using quantitative dependence analysis
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 185–196https://doi.org/10.1145/1345206.1345234This work presents a quantitative approach to analyze parallelization opportunities in programs with irregular memory access where potential data dependencies mask available parallelism. The model captures data and causal dependencies among critical ...
- research-articleFebruary 2008
On the correctness of transactional memory
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 175–184https://doi.org/10.1145/1345206.1345233Transactional memory (TM) is perceived as an appealing alternative to critical sections for general purpose concurrent programming. Despite the large amount of recent work on TM implementations, however, very little effort has been devoted to precisely ...
- research-articleFebruary 2008
Nested parallelism in transactional memory
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 163–174https://doi.org/10.1145/1345206.1345232This paper investigates adding transactions with nested parallelism and nested transactions to a dynamically multithreaded parallel programming language that generates only series-parallel programs. We describe XConflict, a data structure that ...
- research-articleFebruary 2008
ZOID: I/O-forwarding infrastructure for petascale architectures
PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programmingPages 153–162https://doi.org/10.1145/1345206.1345230The ZeptoOS project is developing an open-source alternative to the proprietary software stacks available on contemporary massively parallel architectures. The aim is to enable computer science research on these architectures, enhance community ...