Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Many-task computing"'
Autor:
Sergey Vostokin, Irina Bobyleva
Publikováno v:
Современные информационные технологии и IT-образование, Vol 16, Iss 1, Pp 64-71 (2020)
The paper proposes a method for writing parallel algorithms. Our goal was to make a detailed description of concurrency while carrying no dependencies in programming language or underlying parallel architecture. We also wanted the description to be a
Externí odkaz:
https://doaj.org/article/b009168fdbd2494b804ea7d38f7576a1
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 27, Iss 2, Pp 385-399 (2017)
With the rapid evolution of the distributed computing world in the last few years, the amount of data created and processed has fast increased to petabytes or even exabytes scale. Such huge data sets need data-intensive computing applications and imp
Externí odkaz:
https://doaj.org/article/2133493f5bf747ba9e76fec8e94d529f
Publikováno v:
Applied Sciences; Volume 12; Issue 9; Pages: 4797
Scientific applications often require substantial amount of computing resources for running challenging jobs potentially consisting of many tasks from hundreds of thousands to even millions. As a result, many institutions collaborate to solve large-s
Publikováno v:
KIISE Transactions on Computing Practices. 25:585-593
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
International Journal of Applied Mathematics and Computer Science
International Journal of Applied Mathematics and Computer Science, Vol 27, Iss 2, Pp 385-399 (2017)
International Journal of Applied Mathematics and Computer Science, Vol 27, Iss 2, Pp 385-399 (2017)
With the rapid evolution of the distributed computing world in the last few years, the amount of data created and processed has fast increased to petabytes or even exabytes scale. Such huge data sets need data-intensive computing applications and imp
В работе предлагается метод проектирования параллельных алгоритмов. Цель метода – обеспечение точности описания алгоритмов без завис
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2f967dafcb52a7385ff82c0f2ee6265
Autor:
Timothy C. Haas
Publikováno v:
PLoS ONE, Vol 15, Iss 11, p e0226861 (2020)
PLoS ONE
PLoS ONE
Models of political-ecological systems can inform policies for managing ecosystems that contain endangered species. One way to increase the credibility of these models is to subject them to a rigorous suite of data-based statistical assessments. Doin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69a02766e43069ae99aeffb8f8132927
Publikováno v:
Cluster Computing. 22:2527-2540
We have designed and implemented a new data processing framework called “Many-task computing On HAdoop” (MOHA) which aims to effectively support fine-grained many-task applications that can show another type of data-intensive workloads in the YAR
Publikováno v:
Distributed and Parallel Databases. 36:613-641
Association rules mining has attracted much attention among data mining topics because it has been successfully applied in various fields to find the association between purchased items by identifying frequent patterns (FPs). Currently, databases are