Sciweavers

42 search results - page 7 / 9
» Provably Efficient Scheduling for Languages with Fine-Graine...
Sort
View
ICFP
2010
ACM
13 years 9 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...
ASPLOS
2006
ACM
14 years 9 days ago
Accurate and efficient filtering for the Intel thread checker race detector
Debugging data races in parallel applications is a difficult task. Error-causing data races may appear to vanish due to changes in an application's optimization level, thread...
Paul Sack, Brian E. Bliss, Zhiqiang Ma, Paul Peter...
PPOPP
2009
ACM
14 years 9 months ago
Mapping parallelism to multi-cores: a machine learning based approach
The efficient mapping of program parallelism to multi-core processors is highly dependent on the underlying architecture. This paper proposes a portable and automatic compiler-bas...
Zheng Wang, Michael F. P. O'Boyle
ASPLOS
2010
ACM
13 years 11 months ago
Decoupling contention management from scheduling
Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts stro...
Ryan Johnson, Radu Stoica, Anastasia Ailamaki, Tod...
IPPS
2006
IEEE
14 years 2 months ago
Performance analysis of Java concurrent programming: a case study of video mining system
As multi/many core processors become prevalent, programming language is important in constructing efficient parallel applications. In this work, we build a multithreaded video min...
Wenlong Li, Eric Li, Ran Meng, Tao Wang, Carole Du...