Tolerance to asynchrony in algorithms for multiplication and modulo

In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms induce a lattice among the global states. Lattice-linearity impli...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 1024; p. 114914
Main Authors: Gupta, Arya Tanmay, Kulkarni, Sandeep S
Format: Journal Article
Language:English
Published: Elsevier B.V 12.01.2025
Subjects:
ISSN:0304-3975
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first