Sciweavers

89 search results - page 16 / 18
» A Framework for Portable Shared Memory Programming
Sort
View
ECOOP
2009
Springer
14 years 6 months ago
Making Sense of Large Heaps
Abstract. It is common for large-scale Java applications to suffer memory problems, whether inefficient designs that impede scalability, or lifetime bugs such as leaks. Making sens...
Nick Mitchell, Edith Schonberg, Gary Sevitsky
IPPS
1996
IEEE
13 years 10 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
PPOPP
2009
ACM
14 years 6 months ago
Safe open-nested transactions through ownership
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
Kunal Agrawal, I.-Ting Angelina Lee, Jim Sukha
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 6 months ago
Sawja: Static Analysis Workshop for Java
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
Laurent Hubert, Nicolas Barré, Fréd&...
POS
1998
Springer
13 years 10 months ago
Optimizing the Read and Write Barriers for Orthogonal Persistence
Persistent programming languages manage volatile memory as a cache for stable storage, imposing a read barrier on operations that access the cache, and a write barrier on updates ...
Antony L. Hosking, Nathaniel Nystrom, Quintin I. C...