ABSTRACT
Virtual and Augmented Reality is one of the key driving technologies of the 4th Industrial Revolution, which is expected to radically disrupt almost every business sector and transform the way we live and interact with our environment and each other. End-user devices will soon enable users to immerse in 3D Virtual Environments (VEs) that offer access to remote services, such as health care, training and education, entertainment and social interaction. The advent of fast highly-available network connectivity in combination with afford- able 3D hardware (GPUs, VR/AR HMDs, etc.) has enabled making Networked Virtual Environments (NVEs) possible and available to multiple simultaneous end-users beyond the confines of expensive purpose-built 3D facilities and laboratories.
However, the algorithms making possible the NVEs of today are already reaching their limits, proving unreliable, suffer asynchronies and deployed over an inherently fault-prone network infrastructure. Current developments of distributed architectures used in NVEs handle concurrency by either providing weak consistency guarantees (e.g., eventual consistency), or by relying on the bounded life span of inconsistent states. Although sufficient for non-critical, yet time sensitive applications, those solutions will be incapable of handling the next generation of interactive Virtual Environments, where precise consistency guarantees will be required. Thus, new scalable, robust, and responsive strategies that can support the needs of the NVEs of tomorrow are necessary.
Recent scientific works are shifting the viewpoint around the practicality of strongly consistent distributed storage spaces by proposing latency-efficient algorithms of atomic R/W Distributed Shared Memory (DSM) with provable consistency guarantees. In this work we focus on transforming the theoretical findings of DSMs into tangible implementations and in investigating the practicality of those algorithmic solutions in Virtual Environments.
- Antonio Fernández Anta, Theophanis Hadjistasi, and Nicolas C. Nicolaou. 2016. Computationally Light "Multi-Speed" Atomic Memory. In 20th International Conference on Principles of Distributed Systems, OPODIS 2016, December 13--16, 2016, Madrid, Spain. 29:1--29:17. https://doi.org/10.4230/LIPIcs.OPODIS.2016.29Google Scholar
- Antonio Fernández Anta, Nicolas C. Nicolaou, and Alexandru Popa. 2015. Making "Fast" Atomic Operations Computationally Tractable. In 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14--17, 2015, Rennes, France. 19:1--19:16. https://doi.org/10.4230/LIPIcs.OPODIS.2015.19Google Scholar
- H. Attiya, A. Bar-Noy, and D. Dolev. 1996. Sharing Memory Robustly in Message Passing Systems. J. ACM 42(1) (1996), 124--142.Google Scholar
- Eric Cronin, Burton Filstrup, Anthony R. Kurc, and Sugih Jamin. 2002. An Efficient Synchronization Mechanism for Mirrored Game Architectures. In Proceedings of the 1st Workshop on Network and System Support for Games (Braunschweig, Germany) (NetGames '02). Association for Computing Machinery, New York, NY, USA, 67--73. https://doi.org/10.1145/566500.566510Google ScholarDigital Library
- Partha Dutta, Rachid Guerraoui, Ron R. Levy, and Arindam Chakraborty. 2004. How fast can a distributed atomic read be?. In Proceedings of the 23rd ACM symposium on Principles of Distributed Computing (PODC). 236--245.Google ScholarDigital Library
- Burkhard Englert, Chryssis Georgiou, Peter M. Musial, Nicolas Nicolaou, and Alexander A. Shvartsman. 2009. On the Efficiency of Atomic Multi-Reader, Multi-Writer Distributed Memory. In OPODIS 2009. 240--254.Google Scholar
- Chryssis Georgiou, Theophanis Hadjistasi, Nicolas Nicolaou, and Alexander A. Schwarzmann. 2022. Implementing three exchange read operations for distributed atomic storage. J. Parallel Distributed Comput. 163 (2022), 97--113. https://doi.org/10.1016/j.jpdc.2022.01.024Google ScholarDigital Library
- Chryssis Georgiou, Theophanis Hadjistasi, Nicolas C. Nicolaou, and Alexander A. Schwarzmann. 2018. Unleashing and Speeding Up Readers in Atomic Object Implementations. In NETYS 2018, Essaouria, Morocco, May 9--11, 2018, Proceedings.Google Scholar
- Chryssis Georgiou, Nicolas Nicolaou, Alexander Russel, and Alexander A. Shvartsman. 2011. Towards Feasible Implementations of Low-Latency Multi-Writer Atomic Registers. In NCA. 75--82.Google Scholar
- Chryssis Georgiou, Nicolas C. Nicolaou, and Alexander A. Shvartsman. 2008. On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory. In DISC 2008 (Arcachon, France). Springer-Verlag, Berlin, Heidelberg, 289--304.Google Scholar
- Chryssis Georgiou, Nicolas C. Nicolaou, and Alexander A. Shvartsman. 2009. Fault-tolerant semifast implementations of atomic read/write registers. J. Parallel and Distrib. Comput. 69, 1 (2009), 62--79. https://doi.org/10.1016/j.jpdc.2008.05.004Google ScholarDigital Library
- Theophanis Hadjistasi, Nicolas C. Nicolaou, and Alexander A. Schwarzmann. 2017. Oh-RAM! One and a Half Round Atomic Memory. In NETYS 2017, Marrakech, Morocco, May 17--19, 2017, Proceedings. 117--132.Google Scholar
- Theophanis Hadjistasi and Alexander A. Schwarzmann. 2018. Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper). In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9--13, 2018, Prague, Czech Republic (LIPIcs, Vol. 107), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1:1--1:19. https://doi.org/10.4230/LIPIcs.ICALP.2018.1Google Scholar
- L. Lamport. 1979. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Progranm. IEEE Trans. Comput. 28, 9 (1979), 690--691.Google ScholarDigital Library
- Barbara Liskov. 2010. The Power of Abstraction. In Distributed Computing, 24th Int-l Symposium, DISC 2010 Proc. (LNCS, Vol. 6343), Nancy A. Lynch and Alexander A. Shvartsman (Eds.). Springer.Google Scholar
- Nancy A. Lynch and Alexander A. Shvartsman. 1997. Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts. In Proceedings of Symposium on Fault-Tolerant Computing. 272--281.Google Scholar
- Achour Mostéfaoui and Michel Raynal. 2016. Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems. In Networked Systems - 4th International Conference, NETYS 2016, Marrakech, Morocco, May 18--20, 2016, Revised Selected Papers. 250--265. https://doi.org/10.1007/978--3--319--46140--3_21Google Scholar
- Peter M. Musial, Nicolas C. Nicolaou, and Alexander A. Shvartsman. 2014. Implementing distributed shared memory for dynamic networks. Commun. ACM 57, 6 (2014), 88--98. https://doi.org/10.1145/2500874Google ScholarDigital Library
- Lothar Pantel and Lars C. Wolf. 2002. On the Suitability of Dead Reckoning Schemes for Games. In Proceedings of the 1st Workshop on Network and System Support for Games (Braunschweig, Germany) (NetGames '02). Association for Computing Machinery, New York, NY, USA, 79--84. https://doi.org/10.1145/566500.566512Google ScholarDigital Library
Index Terms
Exploring the use of Strongly Consistent Distributed Shared Memory in 3D NVEs
Recommendations
The Designing and Implementing of Distributed Shared Memory
CICC-ITOE '10: Proceedings of the 2010 International Conference on Innovative Computing and Communication and 2010 Asia-Pacific Conference on Information Technology and Ocean EngineeringThe distributed shared memory is used to manage the memory in distributed system. In this paper, we have studied the DSM, modified the structure of DSM, and have designed and implemented it. In unstructured DSM, The key issues are the granularity of ...
Consistency Requirements of Distributed Shared Memory for Dijkstra's Mutual Exclusion Algorithm
ICDCS '00: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)As is well known any algorithm correct in asynchronous shared memory setting (physically shared memory) can be directly applied in distributed shared memory (DSM) systems if the latter guarantees strong consistency (atomic or sequential) of replicas. ...
An information-based dynamic extrapolation model for networked virtual environments
Various Information Management techniques have been developed to help maintain a consistent shared virtual world in a Networked Virtual Environment. However, such techniques have to be carefully adapted to the application state dynamics and the ...
Comments