SPAWC 2024, 25th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 10-13 September 2024, Lucca, Italy
In this paper, we explore a distributed setting, where a user seeks to compute a linearly-separable Boolean function of degree M from N servers, each with a cache size M. Exploiting the fundamental concepts of sensitivity and influences of Boolean functions, we devise a novel approach to capture the interplay between dataset placement across servers and server transmissions and to determine the optimal solution for dataset placement that minimizes the communication cost. In particular, we showcase the achievability of the minimum average joint sensitivity, N 2M−1 , as a measure for the communication cost.
Type:
Conférence
City:
Lucca
Date:
2024-09-10
Department:
Systèmes de Communication
Eurecom Ref:
7782
Copyright:
© 2024 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
