Zobrazeno 1 - 10
of 76
pro vyhledávání: '"distributed data structure"'
Publikováno v:
Algorithms, Vol 11, Iss 7, p 105 (2018)
We propose a new strategy for the parallelization of mesh processing algorithms. Our main contribution is the definition of distributed combinatorial maps (called n-dmaps), which allow us to represent the topology of big meshes by splitting them into
Externí odkaz:
https://doaj.org/article/089faa8e55804c5e9f0dd1a22b1fde1f
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.
Autor:
Hilley, David B
Continuous live stream analysis applications are increasingly common. Video-based surveillance, emergency response, disaster recovery, and critical infrastructure monitoring are all examples of such applications. These applications are distributed an
Externí odkaz:
http://hdl.handle.net/1853/31695
Autor:
Simović, Boris
Cilj ovog rada je programsko ostvarenje i mjerenje učinkovitosti podatkovne strukture SDR stabla. SD-R stablo je raspodijeljena podatkovna struktura temeljena na podtkovnim strukturama R stabla i AVL stabla. Kako bi se osiguralo konzistentno stanje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7aad43d8e4460319721ec61e5511e3f7
https://www.bib.irb.hr/1262422
https://www.bib.irb.hr/1262422
Publikováno v:
Algorithms
Algorithms, MDPI, 2018, 11 (7), pp.1-20. ⟨10.3390/a11070105⟩
Volume 11
Issue 7
Algorithms, Vol 11, Iss 7, p 105 (2018)
Algorithms, MDPI, 2018, 11 (7), pp.1-20. ⟨10.3390/a11070105⟩
Volume 11
Issue 7
Algorithms, Vol 11, Iss 7, p 105 (2018)
International audience; We propose a new strategy for the parallelization of mesh processing algorithms. Our main contribution is the definition of distributed combinatorial maps (called n-dmaps), which allow us to represent the topology of big meshe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b34a815c5275260bf467796e242838b3
https://hal.archives-ouvertes.fr/hal-01844433/document
https://hal.archives-ouvertes.fr/hal-01844433/document
Conference
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.
Autor:
Busch, Costas, Mavronicolas, Marios
Publikováno v:
Theoretical Computer Science
Theor.Comput.Sci.
IPPS/SPDP
Theor.Comput.Sci.
IPPS/SPDP
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. High-performance asynchronous multiprocessi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c549cd57081344dac7f814319c3d86d
Publikováno v:
Journal of Systems and Software. 83:529-542
Access to data stored in distributed main memory is much faster than access to local disks. Highly available, Scalable Distributed Data Structures (SDDS) utilize this fast access. They counteract the effects of failed or unavailable nodes by storing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b917de6f4e2897ddf144f8516900dd78
https://doi.org/10.1016/j.jss.2009.10.013
https://doi.org/10.1016/j.jss.2009.10.013
Publikováno v:
Computer Communications. 33:73-82
This paper presents a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. It supports range queries as well as single point queries which are routed in O(logn) hops. Our structure, called Sk
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23735734316c6fe2d64409f291438651
https://doi.org/10.1016/j.comcom.2009.08.001
https://doi.org/10.1016/j.comcom.2009.08.001
Autor:
Dadenkov Sergey, Kokoulin Andrew
Publikováno v:
2015 9th International Conference on Application of Information and Communication Technologies (AICT).
This paper describes an approach that improves the functionality of LH*RS - high-availability scalable distributed data structure. The core concept behind this approach is the particular implementation of LH* schema that allows efficient imagery data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8989f067a4d8ac53c722a0a715fa6611
https://doi.org/10.1109/icaict.2015.7338507
https://doi.org/10.1109/icaict.2015.7338507