AutoPlacer Scalable Self-Tuning Data Placement in Distributed Key-Value Stores
This article addresses the problem of self-tuning the data placement in replicated key-value
stores. The goal is to automatically optimize replica placement in a way that leverages …
stores. The goal is to automatically optimize replica placement in a way that leverages …
Concurrent and distributed cloudsim simulations
Cloud Computing researches involve a tremendous amount of entities such as users,
applications, and virtual machines. Due to the limited access and often variable availability …
applications, and virtual machines. Due to the limited access and often variable availability …
On data placement in distributed systems
Data placement refers to the problem of deciding how to assign data items to nodes in a
distributed system to optimize one or several of a number of performance criteria such as …
distributed system to optimize one or several of a number of performance criteria such as …
A mathematical model for latency constrained self-organizing application placement in the edge
The highly dynamic and heterogeneous environment that characterizes the edge of the
Cloud/Edge Continuum calls for new intelligent methods for tackling the needs of such a …
Cloud/Edge Continuum calls for new intelligent methods for tackling the needs of such a …
Improving zookeeper atomic broadcast performance by coin tossing
ZooKeeper atomic broadcast (Zab) is at the core of ZooKeeper system, enforcing a total
order on service requests that seek to modify the replicated service state. Since it is a leader …
order on service requests that seek to modify the replicated service state. Since it is a leader …
Emerging trends on the evolving green500: Year three
It has been traditionally viewed that as the scale of a supercomputer increases, its energy
efficiency decreases due to performance that scales sub-linearly and power consumption …
efficiency decreases due to performance that scales sub-linearly and power consumption …
Self-tuning in distributed transactional memory
Many different mechanisms have been developed to implement Distributed Transactional
Memory (DTM). Unfortunately, there is no “one-size-fits-all” design that offers the desirable …
Memory (DTM). Unfortunately, there is no “one-size-fits-all” design that offers the desirable …
Improving zookeeper atomic broadcast performance when a server quorum never crashes
Operating at the core of the highly-available ZooKeeper system is the ZooKeeper atomic
broadcast (Zab) for imposing a total order on service requests that seek to modify the …
broadcast (Zab) for imposing a total order on service requests that seek to modify the …
An atomic-multicast service for scalable in-memory transaction systems
R Emerson, P Ezhilchelvan - 2014 IEEE 6th International …, 2014 - ieeexplore.ieee.org
Atomic Multicasts are central to the management of replicated data in distributed systems.
Previous work has proven the effectiveness of utilising atomic multicasts, opposed to the …
Previous work has proven the effectiveness of utilising atomic multicasts, opposed to the …
Bumper: Sheltering distributed transactions from conflicts
Large scale cloud applications are difficult to program due to the need to access data in a
consistent manner. To lift this burden from programmers, Deferred Update Replication …
consistent manner. To lift this burden from programmers, Deferred Update Replication …