Essays about: "Distributed shared memory"
Showing result 1 - 5 of 25 essays containing the words Distributed shared memory.
-
1. Exploring Selective coherence as a Solution to Self-invalidation in ArgoDSM
University essay from Uppsala universitet/DatorteknikAbstract : Maintaining coherency in a distributed system can prove challenging, this is especially true for distributed shared memory systems. The problem with remote synchronization in the distributed shared memory software ArgoDSM occurs when a lock operation has to cross the boundaries of a node, this causes a large number of self-invalidations (SI) or self-downgrades (SD) which is costly. READ MORE
-
2. Design and Implementation of a Distributed FleetSimulator
University essay from Örebro universitet/Institutionen för naturvetenskap och teknikAbstract : Det finns en efterfrågan för flottor av autonoma fordon i många industrier såsom gruvdrift, byggplatseroch lager där arbete ska utföras av robotar. Tre viktiga problem som man måste taitu med för att på ett säkert sätt använda autonoma fordon är: koordination för att etablerasäker trafik i miljön där robotarna agerar, rörelseplanering för att bestämma en genomförbarväg för robotarna, och kontroll av robotar för att utföra rörelsen längs den planerade vägen. READ MORE
-
3. A Study of Page-Based Memory Allocation Policies for the Argo Distributed Shared Memory System
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Software distributed shared memory (DSM) systems have been one of the main areas of research in the high-performance computing community. One of the many implementations of such systems is Argo, a page-based, user-space DSM, built on top of MPI. READ MORE
-
4. Garbage Collected CRDTs on the Web : Studying the Memory Efficiency of CRDTs in a Web Context
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : In today's connected society, where it is common to have several connected devices per capita, it is more important than ever that the data you need is omnipresent, i.e. its available when you need it, no matter where you are. We identify one key technology and platform that could be the future—peer-to-peer communication and the Web. READ MORE
-
5. Streaming Graph Partitioning with Graph Convolutional Networks
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In this work, we present a novel approach to the streaming graph partitioning problem which handles unbounded streams.Graph partitioning is a process of dividing a graph into groups of nodes or edges. READ MORE