Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Yuelu Duan"'
Publikováno v:
ASPLOS
There have been several recent efforts to improve the performance of fences. The most aggressive designs allow post-fence accesses to retire and complete before the fence completes. Unfortunately, such designs present implementation difficulties due
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54eecee3cf1d7bdd23c9c477846cf076
https://doi.org/10.1145/2786763.2694388
https://doi.org/10.1145/2786763.2694388
Publikováno v:
ISCA
Although fences are designed for low-overhead concurrency coordination, they can be expensive in current machines. If fences were largely free, faster fine-grained concurrent algorithms could be devised, and compilers could guarantee Sequential Consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09275fc0e792c79ed9b392b9ecbfb15f
https://doi.org/10.1145/2508148.2485941
https://doi.org/10.1145/2508148.2485941
Publikováno v:
ASPLOS
Alias analysis is a critical component in many compiler optimizations. A promising approach to reduce the complexity of alias analysis is to use speculation. The approach consists of performing optimizations assuming the alias relationships that are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29393586757ce01afee53ed4171d36f5
https://doi.org/10.1145/2499368.2451136
https://doi.org/10.1145/2499368.2451136
Publikováno v:
HPCA
Sequential Consistency Violations (SCV) in relaxed consistency machines cause programs to malfunction and are hard to debug. While there are proposals for detecting and recording SCVs, they are limited in that they end program execution after detecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a25ccd06d6242758c1ce110b797dd80
https://doi.org/10.1109/hpca.2016.7446069
https://doi.org/10.1109/hpca.2016.7446069
Publikováno v:
HPCA
Recent proposals for determinism-enforcement architectures are able to honor the dependences between threads through a commit step that often becomes a performance bottleneck. As they commit code blocks (or chunks) in a round-robin order, if one chun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::308726dcf2b0952b3971b0385c888b16
https://doi.org/10.1109/hpca.2012.6169040
https://doi.org/10.1109/hpca.2012.6169040
Publikováno v:
CGO
Work-stealing is a key technique in many multi-threading programming languages to get good load balancing. The current work-stealing techniques have a high implementation overhead in some applications and require a large amount of memory space for da
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e184a7c1d4957f52353a50ccd7e5f517
https://doi.org/10.1145/1772954.1772992
https://doi.org/10.1145/1772954.1772992
Publikováno v:
CGO
When a concurrent shared-memory program written with a sequential consistency (SC) model is run on a machine implemented with a relaxed consistency (RC) model, it could cause SC violations that are very hard to debug. To avoid such violations, progra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27bbbdb175aeb5513fe11a265fea34b7
https://doi.org/10.1109/cgo.2009.29
https://doi.org/10.1109/cgo.2009.29
Publikováno v:
2009 International Symposium on Code Generation & Optimization; 2009, p25-34, 10p