Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Robert Utterback"'
Publikováno v:
International Migration.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e1ca0238a3d584e463c2ae7d0d6e323
https://doi.org/10.1111/imig.13110
https://doi.org/10.1111/imig.13110
Publikováno v:
PPOPP
Record-and-replay systems are useful tools for debugging non-deterministic parallel programs by first recording an execution and then replaying that execution to produce the same access pattern. Existing record-and-replay systems generally target thr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05fee02f70b0bd79352868f976e7925a
https://doi.org/10.1145/3365659
https://doi.org/10.1145/3365659
Publikováno v:
PPoPP
This paper addresses the problem of provably efficient and practically good on-the-fly determinacy race detection in task parallel programs that use futures. Prior works determinacy race detection have mostly focused on either task parallel programs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d3061be7fefd6a9632aac99698e31af
https://doi.org/10.1145/3293883.3295732
https://doi.org/10.1145/3293883.3295732
Publikováno v:
SPAA
If a parallel program has determinacy race(s), different schedules can result in memory accesses that observe different values --- various race-detection tools have been designed to find such bugs. A key component of race detectors is an algorithm fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19eb915ff713f650630f8745e9b67e9c
https://doi.org/10.1145/2935764.2935801
https://doi.org/10.1145/2935764.2935801
Publikováno v:
SPAA
Although concurrent data structures are commonly used in practice on shared-memory machines, even the most efficient concurrent structures often lack performance theorems guaranteeing linear speedup for the enclosing parallel program. Moreover, effic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::75d4f9323dd28dcdf33f9bc18cbc6f51
https://doi.org/10.1145/2612669.2612688
https://doi.org/10.1145/2612669.2612688
Publikováno v:
PPOPP
This poster proposes an efficient runtime scheduler that provides provable performance guarantees to parallel programs that use data structures through the use of implicit batching.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cabd277e6c23be8a25a4432e63431d3d
https://doi.org/10.1145/2692916.2555284
https://doi.org/10.1145/2692916.2555284