The problem of cooperatively performing a set of tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distributed computing. This problem is crucial in various applications, such as distributed databases, cloud computing, and peer-to-peer networks. The goal is to design algorithms that can efficiently and reliably perform tasks in the presence of failures. In this research activity, we aim to investigate the feasibility of implementing low-latency multiwriter/multi-reader (MWMR) atomic registers in asynchronous, crash-prone, message-passing systems. We will explore the trade-offs between latency, computational feasibility, and fault tolerance in the design of such registers. The outcome of this research will provide insights into the development of efficient and reliable distributed computing systems.