Zobrazeno 1 - 10
of 35
pro vyhledávání: '"I-Ting Angelina Lee"'
Publikováno v:
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d73a3fca427d6ceb47f312e56b4868ef
https://doi.org/10.1145/3558481.3591092
https://doi.org/10.1145/3558481.3591092
Autor:
Tao B. Schardl, I-Ting Angelina Lee
Publikováno v:
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3b6f1f44456be5285a12fa3b83deac5
https://doi.org/10.1145/3572848.3577509
https://doi.org/10.1145/3572848.3577509
Publikováno v:
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6531156608daa3b6069708ffb5245e97
https://doi.org/10.1109/ipdps53621.2022.00087
https://doi.org/10.1109/ipdps53621.2022.00087
Publikováno v:
SPAA
In task-parallel code, a determinancy race occurs when two logically parallel instructions access the same memory location in a conflicting way. A determinacy race tends to be a bug as it leads to non-deterministic program behaviors. Researchers have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79309597f09a8a61f4bf4e07a8b4406d
https://doi.org/10.1145/3409964.3461815
https://doi.org/10.1145/3409964.3461815
Autor:
Anchengcheng Zhou, Tao B. Schardl, Yifan Xu, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee
Publikováno v:
SPAA
While there has been extensive research on race-detection algorithms for task-parallel programs, most of this research has focused on optimizing a particular component, namely, reachability analysis, which checks whether two instructions are logicall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d88ee224f820643d2d79f9edf5113f7
https://doi.org/10.1145/3409964.3461825
https://doi.org/10.1145/3409964.3461825
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:
IPDPS
Parallel loops are commonly used parallel constructs to parallelize high-performance scientific applications. In the paradigm of task parallelism, the parallel loop construct is used to express the logical parallelism of the loop, indicating that the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cb256438f9e1820890c616d35ebfcd2
https://doi.org/10.1109/ipdps49936.2021.00067
https://doi.org/10.1109/ipdps49936.2021.00067
Autor:
I-Ting Angelina Lee, Stefan K. Muller, Umut A. Acar, Kunal Agrawal, Kyle Singer, Noah Goldstein
Publikováno v:
SPAA
Many modern parallel applications, such as desktop software and cloud-based web services, are service-oriented, long running, and perform frequent interactions with the external world (e.g., responding to user input). We want such interactive applica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00967826d21183f29697f9fa7a7aeebc
https://doi.org/10.1145/3350755.3400236
https://doi.org/10.1145/3350755.3400236
Autor:
Noah Goldstein, I-Ting Angelina Lee, Kunal Agrawal, Umut A. Acar, Stefan K. Muller, Kyle Singer
Publikováno v:
PLDI
Motivated by the increasing shift to multicore computers, recent work has developed language support for responsive parallel applications that mix compute-intensive tasks with latency-sensitive, usually interactive, tasks. These developments include
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6fc572a7c484be337d235ea618389d48
http://arxiv.org/abs/2004.02870
http://arxiv.org/abs/2004.02870
Publikováno v:
PPoPP
The use of futures can generate arbitrary dependences in the computation, making it difficult to detect races efficiently. Algorithms proposed by prior work to detect races on programs with futures all have to execute the program sequentially. We pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22e9a993ddf1b50aa1a365cf7b582836
https://doi.org/10.1145/3332466.3374536
https://doi.org/10.1145/3332466.3374536