Safe, Fast Sharing of memcached as a Protected Library

Kjellqvist, Chris; Hedayati, Mohammad; Scott, Michael L.

doi:10.1145/3404397.3404443

Cited by 7 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To confirm the data structure results in a more realistic application, we use Montage to persist a variant of memcached developed by Kjellqvist et al [26]. This variant links directly to a multithreaded client application, dispensing with the usual socket-based communication.…”

Section: Hash Map Validation Using Memcachedmentioning

confidence: 99%

Montage: A General System for Buffered Durably Linearizable Data Structures

Wen,

Cai,

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

The recent emergence of fast, dense, nonvolatile main memory suggests that certain long-lived data might remain in its natural pointer-rich format across program runs and hardware reboots. Operations on such data must be instrumented with explicit write-back and fence instructions to ensure consistency in the wake of a crash. Techniques to minimize the cost of this instrumentation are an active topic of research.We present what we believe to be the first general-purpose approach to building buffered durably linearizable persistent data structures, and a system, Montage, to support that approach. Montage is built on top of the Ralloc nonblocking persistent allocator. It employs a slow-ticking epoch clock, and ensures that no operation appears to span an epoch boundary.It also arranges to persist only that data minimally required to reconstruct the structure after a crash. If a crash occurs in epoch e, all work performed in epochs e and e − 1 is lost, but work from prior epochs is preserved.We describe the implementation of Montage, argue its correctness, and report unprecedented throughput for persistent queues, sets/mappings, and general graphs.

show abstract

Section: Hash Map Validation Using Memcachedmentioning

confidence: 99%

Montage: A General System for Buffered Durably Linearizable Data Structures

Wen,

Cai,

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Stack allocations are slightly more complex. Existing works convert shared stack allocations to shared heap allocations [6,32,44]. This approach is costly from a performance perspective: an allocation+free on the fast path for a modern allocator typically takes 30-60 cycles, and up to thousands of cycles on the slow path [40].…”

Section: Intel Mpk Isolation Backendmentioning

confidence: 99%

FlexOS: towards flexible OS isolation

Lefeuvre

Bădoiu

Jung

et al. 2022

Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

View full text Add to dashboard Cite

At design time, modern operating systems are locked in a specific safety and isolation strategy that mixes one or more hardware/software protection mechanisms (e.g. user/kernel separation); revisiting these choices after deployment requires a major refactoring effort. This rigid approach shows its limits given the wide variety of modern applications' safety/performance requirements, when new hardware isolation mechanisms are rolled out, or when existing ones break.We present FlexOS, a novel OS allowing users to easily specialize the safety and isolation strategy of an OS at compilation/deployment time instead of design time. This modular LibOS is composed of finegrained components that can be isolated via a range of hardware protection mechanisms with various data sharing strategies and additional software hardening. The OS ships with an exploration technique helping the user navigate the vast safety/performance design space it unlocks. We implement a prototype of the system and demonstrate, for several applications (Redis/Nginx/SQLite), FlexOS' vast configuration space as well as the efficiency of the exploration technique: we evaluate 80 FlexOS configurations for Redis and show how that space can be probabilistically subset to the 5 safest ones under a given performance budget. We also show that, under equivalent configurations, FlexOS performs similarly or better than existing solutions which use fixed safety configurations. CCS CONCEPTS• Software and its engineering → Operating systems; • Security and privacy → Operating systems security.

show abstract

“…To protect database and hash table integrity, we store them in separate data domains and grant read-only access to the workers. Since domain heaps grow dynamically, we do not need preallocation as other PKU-based Memcached adaptations [55,82].…”

Section: Memcached With Sdrobmentioning

confidence: 99%

Unlimited Lives: Secure In-Process Rollback with Isolated Domains

Turhan¹,

Nyman²,

Bauman³

et al. 2022

Preprint

View full text Add to dashboard Cite

The use of unsafe programming languages still remains one of the major root causes of software vulnerabilities. Although well-known defenses that detect and mitigate memory-safety related issues exist, they don't address the challenge of software resilience, i.e., whether a system under attack can continue to carry out its function when subjected to malicious input. We propose secure rollback of isolated domains as an efficient and secure method of improving the resilience of software targeted by run-time attacks. We show the practicability of our methodology by realizing a software library for Secure Domain Rollback (SDRoB) and demonstrate how SDRoB can be applied to real-world software.

show abstract

Safe, Fast Sharing of memcached as a Protected Library

Cited by 7 publications

References 10 publications

Montage: A General System for Buffered Durably Linearizable Data Structures

Montage: A General System for Buffered Durably Linearizable Data Structures

FlexOS: towards flexible OS isolation

Unlimited Lives: Secure In-Process Rollback with Isolated Domains

Contact Info

Product

Resources

About