Software-Distributed Shared Memory
Software-Distributed Shared Memory over Heterogeneous Micro-Server Architecture
... tributed memory systems can be built on top of heterogeneous platforms using, for example, cluster implementations of OpenMP and PGAS implementations (provided it does not rely on hardware mechanisms such as ...
13
Software-Distributed Shared Memory for Heterogeneous Machines: Design and Use Considerations
... Abstract Distributed shared memory (DSM) allows to implement and deploy applications onto distributed architectures using the convenient shared memory programming model in which ...
25
Adaptive message passing polling for energy efficiency: Application to software‐distributed shared memory over heterogeneous computing resources
... Abstract Autonomous vehicles, smart manufacturing, heterogeneous systems and new high-performance embed- ded computing (HPEC) applications can benefit from the reuse of code coming from the high-performance computing ...
24
Attribute-Based Encryption and Its Application to a Software-Distributed Shared Memory
... safe distributed systems. In distributed architectures, distributed shared memory systems (DSM) are used to build an abstraction layer over remote ...convenient shared ...
7
Introduction of shared-memory parallelism in a distributed-memory multifrontal solver
... the software we rely on, together with our experimental ...pure shared- memory environment, where only one MPI process is ...the memory accesses can dramatically impact ...
39
Real-Time Support for Software Transactional Memory
... transactional memory (TM) concept has attracted much interest from both academy [1], [2] and industry [3] as it eases programming and avoids the problems of lock-based ...to shared resources, transactional ...
10
A distributed multi-agent framework for shared resources scheduling
... section. Then, all SCEP models send an existing signal to the master supervisor. LS and IS models publish the public activities provided by shared resources to the shared resources register. RS and IS ...
7
Distributed Aspects: better separation of crosscutting concerns in distributed software systems
... 4.4.3 Comparison to a JBoss-only solution To conclude this section, let us compare the two previous examples to the implementation based only on JBoss. Figure 4.16 shows three methods from three different classes that ...
163
Shared Memory, Odours and Sociotransmitters or: "Save the Interaction!"
... of memory that I have distinguished above: protomemory, memory, ...of shared memory: they contribute, on a daily basis, to an interindividual (intersubjective) focalization of the recall or of ...
15
Efficient shared memory message passing for inter-VM communications
... 2 Fast MPI communication over shared-memory architectures In recent years, shared memory processing machines have become increasingly prevalent and complex. On the one hand, the advent of ...
11
Optimization of memory management on distributed machine
... stack, memory mapping seg- ment and heap by adding an ...process memory as the mem- ory spaces of the process are different between the different ...of memory regions in checkpoints when injecting them ...
160
The Renaming Problem in Shared Memory Systems: an Introduction
... read/write shared memory model with n processes, starting on one input con guration, can be represented by an (n − 1)-dimensional solid object with no ...
30
Parallelizing RRT on large-scale distributed-memory architectures
... Algorithms building several RRTs can benefit from this work. For example, in the bidirectional-RRT variant where both trees are extended toward the same random configuration [2], processes can be separated into two ...
10
Architectural support to exploit commutativity in shared-memory systems
... CoMMTM requires simple program changes to exploit commutativity: defining a reducible state to avoid conflicts among commutative operations, using labeled memory accesses to p[r] ...
64
Merging the Publish-Subscribe Pattern with the Shared Memory Paradigm
... Event-based applications are popular in web services, wireless networks and peer-to-peer (P2P) systems. It can be used to monitor a sensor, the output of a computation or a decision system. This makes the programming ...
13
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
... Comparison with Related Work Erasure coding has been used to develop shared memory emulation techniques for systems with crash failures in [3, 4, 13, 29] and Byzantine failures in [2, 8, 12, 18] ii . In ...
29
Coded Emulation of Shared Atomic Memory for Message Passing Architectures
... Storage cost. Informally speaking, at any point of an execution of an algorithm, the storage cost is the total number of bits stored by the servers. Similarly to how we mea- sured the communication costs, in this paper, ...
26
Coded Emulation of Shared Atomic Memory for Message Passing Architectures
... of shared-memory systems in distributed message-passing environments has been an active area of research [2–8, 12–18, 24, 29, ...for distributed systems in the context of shared ...
29
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
... Comparison with Related Work Erasure coding has been used to develop shared memory emulation techniques for systems with crash failures in [3, 4, 13, 29] and Byzantine failures in [2, 8, 12, 18] ii . In ...
30
A coded shared atomic memory algorithm for message passing architectures
... In the standard message passing model, in a fair ex- ecution, every channel eventually delivers the messages that are input in the channel. In particular, under the stan- dard definition of fairness, the channel ...
25