Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Ivan Walulya"'
Publikováno v:
ICDCN
The Nearest neighbour search (NNS) is a fundamental problem in many application domains dealing with multidimensional data. In a concurrent setting, where dynamic modifications are allowed, a linearizable implementation of the NNS is highly desirable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1394ce866fc73646c5b74858c6cdcb14
https://doi.org/10.1016/j.tcs.2021.06.041
https://doi.org/10.1016/j.tcs.2021.06.041
Publikováno v:
IPDPS
Stochastic gradient descent (SGD) is an essential element in Machine Learning (ML) algorithms. Asynchronous parallel shared-memory SGD (AsyncSGD), including synchronization-free algorithms, e.g. HOGWILD!, have received interest in certain contexts, d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::118e8cf9e5361740a6a1d7f7256bf7fd
Autor:
Marina Papatriantafilou, Ivan Walulya, Magnus Almgren, Charalampos Stylianopoulos, Olaf Landsiedel
Publikováno v:
EuroSys
Sketches are data structures designed to answer approximate queries by trading memory overhead with accuracy guarantees. More specifically, sketches efficiently summarize large, high-rate streams of data and quickly answer queries on these summaries.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b946f7a653689ac5590032b199437070
https://doi.org/10.1145/3342195.3387542
https://doi.org/10.1145/3342195.3387542
Autor:
Dimitris Palyvos-Giannas, Yiannis Nikolakopoulos, Ivan Walulya, Vincenzo Gulisano, Marina Papatriantafilou, Philippas Tsigas
Publikováno v:
Future Generation Computer Systems. 88:297-308
Stream Processing Engines (SPEs) process continuous streams of data and produce results in a real-time fashion, typically through one-at-a-time tuple analysis. In Fog architectures, the limited resources of the edge devices, enabling close-to-the-sou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c3997d0939c790dbebf5ac68ab55bad
https://doi.org/10.1016/j.future.2018.05.067
https://doi.org/10.1016/j.future.2018.05.067
Publikováno v:
Journal of Systems Architecture. :48-60
Streaming aggregation is a fundamental operation in the area of stream processing and its implementation provides various challenges. Data flow management is traditionally performed by high performance computing systems. However, nowadays there is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6b43801465de46f485f29fd6a33a04a
https://doi.org/10.1016/j.sysarc.2016.04.013
https://doi.org/10.1016/j.sysarc.2016.04.013
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030032319
SSS
SSS
The priority queue with DeleteMin and Insert operations is a classical interface for ordering items associated with priorities. Some important algorithms, such as Dijkstra’s single-source-shortest-path, Adaptive Huffman Trees, etc. also require cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::204e24ac4d6e288098668debffa68a51
https://doi.org/10.1007/978-3-030-03232-6_24
https://doi.org/10.1007/978-3-030-03232-6_24
Autor:
Ivan Walulya, Marina Papatriantafilou, Vincenzo Gulisano, Philippas Tsigas, Yiannis Nikolakopoulos
Publikováno v:
Euro-Par 2017: Parallel Processing Workshops ISBN: 9783319751771
Euro-Par Workshops
Euro-Par Workshops
Stream Processing Engines (SPEs) process continuous streams of data and produce up-to-date results in a real-time fashion, typically through one-at-a-time tuple analysis. When looking into the vital SPE processing properties required from application
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3aee6b3fff5df229b4ab2db03927883
https://doi.org/10.1007/978-3-319-75178-8_11
https://doi.org/10.1007/978-3-319-75178-8_11
Autor:
Ivan Walulya, Philippas Tsigas
Publikováno v:
IPDPS
Dynamic vectors are among the most commonly used data structures in programming. They provide constant time random access and resizable data storage. Additionally, they provide constant time insertion (pushback) and deletion (popback) at the end of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83ffbf2363d239a86db7b6caae22ca19
https://doi.org/10.1109/ipdps.2017.73
https://doi.org/10.1109/ipdps.2017.73
Performance and power consumption evaluation of concurrent queue implementations in embedded systems
Autor:
Ivan Walulya, Lazaros Papadopoulos, Dimitrios Soudris, Paul Renaud-Goud, Philippas Tsigas, Brendan Barry
Publikováno v:
Computer Science - Research and Development. 30:165-175
Embedded and high performance computing (HPC) systems face many common challenges. One of them is the synchronization of the memory accesses in shared data. Concurrent queues have been extensively studied in the HPC domain and they are used in a wide
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec452c03d141d396f513d50f08476fde
https://doi.org/10.1007/s00450-014-0261-0
https://doi.org/10.1007/s00450-014-0261-0
Publikováno v:
IEEE Transactions on Computers
Modern multicore embedded systems often execute applications that rely heavily on concurrent data structures. The selection of efficient concurrent data structure implementations for a specific application is usually a complex and time consuming task
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2cb26b900bf3a229c63f845ef29bd16f
https://zenodo.org/record/1406943
https://zenodo.org/record/1406943