Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Renato B. Hoffmann"'
Publikováno v:
International Journal of Parallel Programming. 50:454-485
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f153efe270df4a8d422531902f3ec18f
https://doi.org/10.1007/s10766-022-00737-2
https://doi.org/10.1007/s10766-022-00737-2
Publikováno v:
The Journal of Supercomputing. 78:7655-7676
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23ece531e9540db3d20a836c6a5fae11
https://doi.org/10.1007/s11227-021-04182-9
https://doi.org/10.1007/s11227-021-04182-9
Publikováno v:
Anais da XXII Escola Regional de Alto Desempenho da Região Sul (ERAD-RS 2022).
Stream processing applications process raw data-flows to reveal insightful information. Efficiently coordinating the requirements of these applications is a challenge. We propose investigating high-level software solutions for these applications to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce511dcb484fcc9f31c1bc7792821224
https://doi.org/10.5753/eradrs.2022.19163
https://doi.org/10.5753/eradrs.2022.19163
Publikováno v:
Anais do XXII Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD 2021).
Profiling tools are essential to understand the behavior of parallel applications and assist in the optimization process. However, tools such as Perf generate a large amount of data. This way, they require significant storage space, which also compli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3c90cf34015247d059adab5fa999efe
https://doi.org/10.5753/wscad.2021.18516
https://doi.org/10.5753/wscad.2021.18516
Publikováno v:
Journal of Computer Languages. 73:101160
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef23df2633ab9c88c43e706b101fc181
https://doi.org/10.1016/j.cola.2022.101160
https://doi.org/10.1016/j.cola.2022.101160
Publikováno v:
Anais da XXI Escola Regional de Alto Desempenho da Região Sul (ERAD RS 2021).
OpenMP é complexo quando usado para desenvolver aplicações de fluxo de dados. Com o objetivo de mitigar essa dificuldade, foi utilizada uma metodologia existente, chamada SPar, para aumentar o nível de abstração. Portanto, foram utilizadas an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e1c8071311c397b07afd040334f883f
https://doi.org/10.5753/eradrs.2021.14777
https://doi.org/10.5753/eradrs.2021.14777
Publikováno v:
SBLP
Data generation, collection, and processing is an important workload of modern computer architectures. Stream or high-intensity data flow applications are commonly employed in extracting and interpreting the information contained in this data. Due to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03e712825bc2a093dc5cc9fa3d36d97d
http://hdl.handle.net/11568/1080447
http://hdl.handle.net/11568/1080447
Publikováno v:
Journal of Computer Languages. 65:101054
This work aims at contributing with a structured parallel programming abstraction for Rust in order to provide ready-to-use parallel patterns that abstract low-level and architecture-dependent details from application programmers. We focus on stream
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c33674ec24a22fff2bb0502827e4e4b
https://doi.org/10.1016/j.cola.2021.101054
https://doi.org/10.1016/j.cola.2021.101054
It is often a challenge to keep input/output tasks/results in order for parallel computations over data streams, particularly when stateless task operators are replicated to increase parallelism when there are irregular tasks. Maintaining input/outpu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a215cb6c5683f26a7507034df6c4a1ad
http://hdl.handle.net/11568/952756
http://hdl.handle.net/11568/952756
Autor:
Niculescu, Virginia1 (AUTHOR) virginia.niculescu@ubbcluj.ro, Loulergue, Frédéric2 (AUTHOR)
Publikováno v:
International Journal of Parallel Programming. Oct2023, Vol. 51 Issue 4/5, p271-273. 3p.