Abstract
In this paper, we study the lattice linearity of multiplication and modulo operations. We demonstrate that these operations are lattice linear and the parallel processing algorithms that we study for both these operations are able to exploit the lattice linearity of their respective problems. This implies that these algorithms can be implemented in asynchronous environments, where the nodes are allowed to read old information from each other. These algorithms also exhibit snap-stabilizing properties, i.e., starting from an arbitrary state, the sequence of state transitions made by the system strictly follows its specification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bui, A., Datta, A.K., Petit, F., Villain, V.: State-optimal snap-stabilizing PIF in tree networks. In: Proceedings 19th IEEE International Conference on Distributed Computing Systems, pp. 78–85 (1999)
Butler, J.T., Sasao, T.: Fast hardware computation of X mod Z. In: 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, pp. 294–297 (2011)
Cesari, G., Maeder, R.: Performance analysis of the parallel karatsuba multiplication algorithm for distributed memory architectures. J. Symb. Comput. 21(4), 467–473 (1996)
Garg, V.: A lattice linear predicate parallel algorithm for the dynamic programming problems. In: 23rd International Conference on Distributed Computing and Networking, ICDCN 2022, New York, NY, USA, pp. 72–76. Association for Computing Machinery (2022)
Garg, V.K.: Predicate detection to solve combinatorial optimization problems. In: Scheideler, C., Spear, M. (eds.) SPAA 2020: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 15–17 July 2020, pp. 235–245. ACM (2020)
Garg, V.K.: A lattice linear predicate parallel algorithm for the housing market problem. In: Johnen, C., Schiller, E.M., Schmid, S. (eds.) SSS 2021. LNCS, vol. 13046, pp. 108–122. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91081-5_8
Gupta, A.T., Kulkarni, S.S.: Extending lattice linearity for self-stabilizing algorithms. In: Johnen, C., Schiller, E.M., Schmid, S. (eds.) SSS 2021. LNCS, vol. 13046, pp. 365–379. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-91081-5_24
Gupta, A.T., Kulkarni, S.S.: Brief announcement: fully lattice linear algorithms. In: Devismes, S., Petit, F., Altisen, K., Di Luna, G.A., Fernandez Anta, A. (eds.) SSS 2022. LNCS, vol. 13751, pp. 341–345. Springer, Heidelberg (2022). https://doi.org/10.1007/978-3-031-21017-4_24
Gupta, A.T., Kulkarni, S.S.: Lattice linearity of multiplication and modulo. CoRR/2302.07207 (2023)
Karatsuba, A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. In: Doklady Akademii Nauk SSSR, vol. 14, no. 145, pp. 293–294 (1962)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)
Zeugmann, T.: Highly parallel computations modulo a number having only small prime factors. Inf. Comput. 96(1), 95–114 (1992)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Gupta, A.T., Kulkarni, S.S. (2023). Lattice Linearity of Multiplication and Modulo. In: Dolev, S., Schieber, B. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2023. Lecture Notes in Computer Science, vol 14310. Springer, Cham. https://doi.org/10.1007/978-3-031-44274-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-44274-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-44273-5
Online ISBN: 978-3-031-44274-2
eBook Packages: Computer ScienceComputer Science (R0)