In this paper, we study the partitioning of a context-aware shared memory data structure so that it can be implemented as a distributed data structure running on multiple machines. By context-aware data structures, we...
In the dispersion problem, a group of k <= n mobile robots, initially placed on the vertices of an anonymous graph G with n vertices, must redistribute themselves so that each vertex hosts no more than one robot. W...
详细信息
ISBN:
(纸本)9783031814037;9783031814044
In the dispersion problem, a group of k <= n mobile robots, initially placed on the vertices of an anonymous graph G with n vertices, must redistribute themselves so that each vertex hosts no more than one robot. We address this challenge on an anonymous triangular grid graph, where each vertex can connect to up to six adjacent vertices. We propose a distributed deterministic algorithm that achieves dispersion on an unoriented triangular grid graph in O(root n) time, where n is the number of vertices. Each robot requires O(log n) bits of memory. The time complexity of our algorithm and the memory usage per robot are optimal. This work builds on previous studies by Kshemkalyani et al. [WALCOM 2020 [17]] and Banerjee et al. [ALGOWIN 2024 [3]]. Importantly, our algorithm terminates without requiring prior knowledge of n and resolves a question posed by Banerjee et al. [ALGOWIN 2024 [3]].
The research and application of big data processing and analysis have been quite mature, but more and more fields have put forward demands for real-time analysis and rapid response of fast and massive distributed big ...
详细信息
The Spark distributed algorithm is a distributedcomputing implementation based on the map reduce algorithm, which has the advantages of Hadoop MapReduce. However, unlike MapReduce, the intermediate output and results...
详细信息
Graphics Processing Units (GPUs) are widely used as powerful hardware accelerators for data-intensive tasks. However, their efficacy can be hindered by constraints in device memory and data transfer speeds via the PCI...
详细信息
Electric power computing resources are distributed in the respective regions of provincial data centers and transmission and transformation equipment, and the scheduling efficiency of computing resources is limited by...
详细信息
The SWMR atomic register is a fundamental building block in shared memorydistributed systems and implementing it from SWSR atomic registers is an important problem. While this problem has been solved in crash-prone s...
详细信息
Very recently, a memory-efficient version (called MeZO) of simultaneous perturbation stochastic approximation (SPSA), one well-established zeroth-order optimizer from the automatic control community, has shown competi...
详细信息
With the development of Vehicular Edge computing (VEC) computing architectures, in the study of task offloading problem, based on the differences in task delay sensitivity and the dynamic characteristics of environmen...
详细信息
Edge computing has transformed machine learning by using computing closer to the data sources, thereby reducing latency. The ever-increasing volume of data has necessitated forming clusters of edge devices, possibly w...
详细信息
暂无评论