Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Jim Sukha"'
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319460789
ISC Workshops
ISC Workshops
Many-core hardware platforms offer a tremendous opportunity for scaling up performance, but not all codes that run on these platforms have been modernized sufficiently to fully utilize the hardware. Assessing whether a code will effectively utilize a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a11e2d035c97c8e88781ed54519a6453
https://doi.org/10.1007/978-3-319-46079-6_23
https://doi.org/10.1007/978-3-319-46079-6_23
Publikováno v:
MIT web domain
PPOPP
PPOPP
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on the helper lock to aid in the execution of the parallel region. Suppose
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aefd7fe809805b25a6e6c140ec0c7f0a
https://doi.org/10.1145/1837853.1693487
https://doi.org/10.1145/1837853.1693487
Autor:
Jim Sukha
Publikováno v:
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef3affdda5b5ee6165255d31f925b754
https://doi.org/10.1145/3252271
https://doi.org/10.1145/3252271
Autor:
Jim Sukha
Publikováno v:
SPAA
Pipe-while loops have been proposed as a language construct for expressing pipeline parallelism in task-parallel languages. However, this loop construct has only been prototyped in research systems that lack compiler support. We demonstrate how to ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7871abfe7c602c38fbc79a9be303d76
https://doi.org/10.1145/2755573.2755610
https://doi.org/10.1145/2755573.2755610
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:
MIT web domain
SPAA
SPAA
Pipeline parallelism organizes a parallel program as a linear sequence of s stages. Each stage processes elements of a data stream, passing each processed data element to the next stage, and then taking on a new element before the subsequent stages h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff085f8b045a721f36cb850d149a28ed
https://orcid.org/0000-0003-0198-3283
https://orcid.org/0000-0003-0198-3283
Publikováno v:
MIT web domain
PPOPP
PPOPP
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be built into the runtime system to enable efficient deterministic parallel r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75a8c113e88ab9587921faac8da8343b
http://hdl.handle.net/1721.1/100926
http://hdl.handle.net/1721.1/100926
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
Publikováno v:
SPAA
In dynamically multithreaded platforms that employ work stealing, there appears to be a fundamental tradeoff between providing provably good time and space bounds and supporting SP-reciprocity, the property of allowing arbitrary calling between paral
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eab789ff29b55a4219f0f4a5ad246b11
https://doi.org/10.1145/1810479.1810517
https://doi.org/10.1145/1810479.1810517
Publikováno v:
IPDPS
NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Cilk++. We prove that Nabbit executes static task graphs in parallel in time which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1792de24c91cc4475e02a7e548d14282
https://doi.org/10.1109/ipdps.2010.5470403
https://doi.org/10.1109/ipdps.2010.5470403