English
Related papers

Related papers: Redy: Remote Dynamic Memory Cache

200 papers

Load balancing is critical for distributed storage to meet strict service-level objectives (SLOs). It has been shown that a fast cache can guarantee load balancing for a clustered storage system. However, when the system scales out to…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-02-18 Zaoxing Liu , Zhihao Bai , Zhenming Liu , Xiaozhou Li , Changhoon Kim , Vladimir Braverman , Xin Jin , Ion Stoica

Cloud applications often insert a caching lay\-er in front of a database in order to reduce I/O latency and improve throughput. One complication occurs when a client fetches some data from one cache node, then migrates to another (e.g., due…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-20 Haoran Zhang , Zihao Zhang , Shuai Mu , Sebastian Angel , Vincent Liu

We present Syndeo: a software framework for container orchestration of Ray on Slurm. In general the idea behind Syndeo is to write code once and deploy anywhere. Specifically, Syndeo is designed to addresses the issues of portability,…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-09-26 William Li , Rodney S. Lafuente Mercado , Jaime D. Pena , Ross E. Allen

We can use a hybrid memory system consisting of DRAM and Intel Optane DC Persistent Memory (We call it DCPM in this paper) as DCPM is now commercially available since April 2019. Even if the latency for DCPM is several times higher than…

Performance · Computer Science 2020-08-31 Kazuichi Oe

Coalescing RDMA and Persistent Memory (PM) delivers high end-to-end performance for networked storage systems, which requires rethinking the design of efficient hash structures. In general, existing hashing schemes separately optimize RDMA…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-15 Xinxin Liu , Yu Hua , Rong Bai

In today's Web and social network environments, query workloads include ad hoc and OLAP queries, as well as iterative algorithms that analyze data relationships (e.g., link analysis, clustering, learning). Modern DBMSs support ad hoc and…

Databases · Computer Science 2012-08-02 Svilen R. Mihaylov , Zachary G. Ives , Sudipto Guha

We consider the problem of Robust Dynamic Coded Distributed Storage (RDCDS) with partially storage constrained servers where the goal is to enable robust (resilient to server dropouts) and efficient (as measured by the communication costs)…

Information Theory · Computer Science 2025-11-12 Chen Zhao , Haobo Jia , Zhuqing Jia

Resource sharing between multiple workloads has become a prominent practice among cloud service providers, motivated by demand for improved resource utilization and reduced cost of ownership. Effective resource sharing, however, remains an…

With the rise of Software-Defined Networking (SDN) for managing traffic and ensuring seamless operations across interconnected devices, challenges arise when SDN controllers share infrastructure with deep learning (DL) workloads. Resource…

Networking and Internet Architecture · Computer Science 2025-07-04 Eyad Gad , Gad Gad , Mostafa M. Fouda , Mohamed I. Ibrahem , Muhammad Ismail , Zubair Md Fadlullah

In today's enterprise storage systems, supported data services such as snapshot delete or drive rebuild can cause tremendous performance interference if executed inline along with heavy foreground IO, often leading to missing SLOs (Service…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-03 Maher Kachmar , David Kaeli

Risk Limiting Dispatch (RLD) was proposed recently as a mechanism that utilizes information and market recourse to reduce reserve capacity requirements, emissions and achieve other system operator objectives. It induces a set of simple…

Optimization and Control · Mathematics 2012-12-04 Junjie Qin , Han-I Su , Ram Rajagopal

Intelligent robots are designed to effectively navigate dynamic and unpredictable environments laden with moving mechanical elements and objects. Such environment-induced dynamics, including moving obstacles, can readily alter the…

Robotics · Computer Science 2023-08-30 Zexin Li , Tao Ren , Xiaoxi He , Cong Liu

The rapid adoption of large language models (LLMs) is pushing AI accelerators toward increasingly powerful and specialized designs. Instead of further complicating software development with deeply hierarchical scratchpad memories (SPMs) and…

Hardware Architecture · Computer Science 2025-12-09 Zhongchun Zhou , Chengtao Lai , Yuhang Gu , Wei Zhang

With the sharp growth of cloud services and their possible combinations, the scale of data center network traffic has an inevitable explosive increasing in recent years. Software defined network (SDN) provides a scalable and flexible…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-03-13 He Li , Song Guo , Chentao Wu , Jie Li

The disaggregated memory (DM) architecture offers high resource elasticity at the cost of data access performance. While caching frequently accessed data in compute nodes (CNs) reduces access overhead, it requires costly centralized…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-26 Hanze Zhang , Kaiming Wang , Rong Chen , Xingda Wei , Haibo Chen

A key-value cache is a key component of many services to provide low-latency and high-throughput data accesses to a huge amount of data. To improve the end-to-end performance of such services, a key-value cache must achieve a high cache hit…

Networking and Internet Architecture · Computer Science 2021-12-21 Hiroshi Inoue

Distributed storage infrastructures require the use of data redundancy to achieve high data reliability. Unfortunately, the use of redundancy introduces storage and communication overheads, which can either reduce the overall storage…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-03-19 Lluis Pamies-Juarez , Ernst Biersack

When facing objects/files of differing sizes in content delivery networks (CDNs) caches, pursuing an optimal object miss ratio (OMR) by approximating Belady no longer ensures an optimal byte miss ratio (BMR), creating confusion about how to…

Networking and Internet Architecture · Computer Science 2022-12-29 Peng Wang , Yu Liu

Cloud computing enables the dynamic provisioning of server resources. To exploit this opportunity, a policy is needed for dynamically allocating (and deallocating) servers in response to the current load conditions. In this paper we…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-24 Niklas Carlsson , Derek Eager

Web application performance is heavily reliant on the hit rate of memory-based caches. Current DRAM-based web caches statically partition their memory across multiple applications sharing the cache. This causes under utilization of memory…

Operating Systems · Computer Science 2016-10-27 Asaf Cidon , Daniel Rushton , Stephen M. Rumble , Ryan Stutsman
‹ Prev 1 4 5 6 7 8 10 Next ›