检索结果-内蒙古大学图书馆

KLNK: Expanding Page Boundaries in a distributed shared memory System

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2024年第9期35卷 1524-1535页

作者： Ci, Yi-Wei Lyu, Michael R. Zhang, Zhan Zuo, De-Cheng Yang, Xiao-Zong Chinese Acad Sci Inst Software Beijing 100045 Peoples R China Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China

Software-based distributed shared memory (DSM) allows multiple processes to access shared data without the need for specialized hardware. However, this flexibility comes at a significant cost due to the need for data synchronization. One approach to mitigate these costs is to relax the consistency model, which can lead to delayed updates to the shared data. This approach typically requires the use of explicit synchronization primitives to regulate access to the shared memory and determine the timing of data synchronization. To circumvent the need for explicit synchronization, an alternative approach is to manage shared memory transparently using the underlying system. While this can simplify programming, it often imposes a fixed granularity for data sharing, which can limit the expansion of the coherence domain and increase the synchronization requirements. To overcome this limitation, we propose an abstraction called the elastic coherence domain, which dynamically adjusts the scope of data synchronization and is supported by the underlying system for transparent management of shared memory. The experimental results show that this approach can improve the efficiency of memory sharing in distributed environments.

关键词： Synchronization Coherence distributed databases memory management Operating systems Protocols Heuristic algorithms Operating system inter-process communication distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Partial Failure Resilient memory Management System for (CXL-based) distributed shared memory 23

Partial Failure Resilient Memory Management System for (CXL-...

引用

29th ACM Symposium on Operating Systems Principles (SOSP)

作者： Zhang, Mingxing Ma, Teng Hua, Jinqi Liu, Zheng Chen, Kang Ding, Ning Du, Fan Jiang, Jinlei Ma, Tao Wu, Yongwei Tsinghua Univ Beijing Peoples R China Alibaba Grp Hangzhou Peoples R China Zhongguancun Lab Beijing Peoples R China Intel Santa Clara CA USA

ISBN: (纸本)9798400702297

The efficiency of distributed shared memory (DSM) has been greatly improved by recent hardware technologies. But, the difficulty of distributed memory management can still be a major obstacle to the democratization of DSM, especially when a partial failure of the participating clients (e.g., due to crashed processes or machines) should be tolerated. In this paper, we present CXL-SHM, an automatic distributed memory management system based on reference counting. The reference count maintenance in CXL-SHM is implemented with a special era-based non-blocking algorithm. Thus, there are no blocking synchronization, memory leak, double free, and wild pointer problems, even if some participating clients unexpectedly fail without freeing their possessed memory references. We evaluated our system on real CXL hardware with both micro-benchmarks and end-to-end applications, which demonstrate the efficiency of CXL-SHM and the simplicity/flexibility of using CXL-SHM to build efficient distributed applications.

关键词： CXL distributed shared memory Non-blocking

来源：评论

学校读者我要写书评

暂无评论

FaaSPipe: Fast Serverless Workflows on distributed shared memory 19th

FaaSPipe: Fast Serverless Workflows on Distributed Shared Me...

引用

19th International Conference on Network and Parallel Computing (NPC)

作者： Tong, Ruizhe Shanghai Jiao Tong Univ Shanghai Peoples R China

ISBN: (纸本)9783031213946;9783031213953

Serverless workflows consist of multiple chained functions that pass intermediate data through function invocations. Existing platforms implement data passing via remote storage services that incur significant performance and maintenance overhead. Some recent works optimize data passing with local shared memory but require specialized function scheduling support and are available only in constrained settings. In this paper, we observed that a simplified, peer-to-peer form of distributed shared memory (DSM) is sufficient and efficient to pass data in serverless workflows. With the observation, we propose FaaSPipe, a serverless workflow runtime built on the simplified DSM. FaaSPipe provides PipeFunc, a user-friendly shared memory-based serverless workflow programming model. To support PipeFunc and take full advantage of the simplified DSM, FaaSPipe designs the intra-workflow memory sharing scheme for address space coordination and builds full-duplex memory transfer channels to enable fast, non-blocking peer-to-peer data passing. Evaluation results on real-world workflow applications show that FaaSPipe reduces workflow latency by up to 61% and consumes up to 2.07x less network traffic compared to state-of-art serverless platforms.

关键词： Serverless computing FaaS distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Exploring the Network-Sensitive Scheduling on distributed shared memory 14

Exploring the Network-Sensitive Scheduling on Distributed Sh...

引用

IEEE 14th International Conference on Cloud Computing (CLOUD)

作者： Wei, Xing Hu, Huiqi Zhou, Aoying East China Normal Univ Sch Data Sci & Engn Shanghai Peoples R China

ISBN: (纸本)9781665400602

distributed shared memory abstraction can organize a cluster of machine nodes to empower the application execution with the big memory spaces and abundant parallelism. However, when deploying an application on the distributed shared memory, these loosely-coupled machine nodes may also make the execution of its tasks suffer from the frequent network traffic based on the existing scheduling strategies. In this paper, we conduct a detailed case study to reveal that the network-intensive task and poor data locality contribute to the major part of network traffic, which could impose the network burden on the execution. To address this issue, we propose the network-sensitive scheduling that fully takes the network traffic into the consideration of scheduling on DSM. The experimental results reveal that this network-sensitive scheduling ran reduce the execution time by up to 32%, and decrease the network traffic by 18% under the real-world cases.

关键词： distributed shared memory Task Scheduling Network Bound Data Locality

来源：评论

学校读者我要写书评

暂无评论

Experiments Using a Software-distributed shared memory, MPI and 0MQ over Heterogeneous Computing Resources

Experiments Using a Software-Distributed Shared Memory, MPI ...

引用

26th International Conference on Parallel and distributed Computing (Euro-Par)

作者： Cudennec, Loic Trabelsi, Kods CEA LIST PC 172 F-91191 Gif Sur Yvette France DGA MI Dept Artificial Intelligence BP 7 F-35998 Rennes Armees France

ISBN: (纸本)9783030715939;9783030715922

distributed heterogeneous computing systems escalate the problem of choosing the appropriate programming model. Programming models such as message passing are efficient but require low-level management of communications. Higher level of programming such as shared memory are convenient for the application design but they usually have performance issues. With the recent development of distributed heterogeneous systems and new protocols to access remote memories, there is an opportunity for distributed shared memory systems to offer a satisfying level of abstraction while not giving up on performance. In this paper a video processing application is written using MPI, 0MQ and an in-house software-distributed shared memory (S-DSM) backend and deployed over a set of heterogeneous computing boards. Results show that 0MQ implementation is the most efficient but at the price of writing the application with the targeted platform in mind. The S-DSM implementation runs up to 2 times faster than the pure OpenMPI implementation and competes with 0MQ when the data granularity is small.

关键词： Heterogeneous computing distributed computing distributed shared memory Message passing

来源：评论

学校读者我要写书评

暂无评论

Jasmine: Exploring the Dependency-Aware Execution on distributed shared memory 21

Jasmine: Exploring the Dependency-Aware Execution on Distrib...

引用

30th ACM International Conference on Information and Knowledge Management (CIKM)

作者： Wei, Xing Hu, Huiqi Zhou, Xuan Qi, Xuecheng Qian, Weining Wang, Jiang Zhou, Aoying East China Normal Univ Shanghai Peoples R China Huawei Shenzhen Peoples R China

ISBN: (纸本)9781450384469

distributed shared memory abstraction can coordinate a cluster of machine nodes to empower performance-critical queries with the scalable memory space and abundant parallelism. But to deploy the query under such an abstraction, the general execution model just makes operators expressed as multiple subtasks and sequentially schedule them in parallel, while neglecting those vital dependencies between subtasks and data. In this paper, we conduct the in-depth researches about the issues (i.e., low CPU Utilization and poor data locality) raised by the ignorance of dependencies, and then propose a dependency-aware query execution model called Jasmine, which can (i) help users explicitly declare the dependencies and (ii) take these declared dependencies into the consideration of execution to address the issues. We invite our audience to use the rich graphical interfaces to interact with Jasmine to explore the dependency-aware query execution on distributed shared memory.

关键词： distributed shared memory Task Scheduling Data Locality

来源：评论

学校读者我要写书评

暂无评论

Random Priority-Based Thrashing Control for distributed shared memory

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2020年第3期31卷 663-674页

作者： Ci, Yi-Wei Lyu, Michael R. Zhang, Zhan Zuo, De-Cheng Yang, Xiao-Zong Chinese Acad Sci Inst Software Beijing 100190 Peoples R China CUHK Dept Comp Sci & Engn Hong Kong Peoples R China Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Heilongjiang Peoples R China

shared memory is widely used for inter-process communication. The shared memory abstraction allows computation to be decoupled from communication, which offers benefits, including portability and ease of programming. To enable shared memory access by processes that are on different machines, distributed shared memory (DSM) can be employed. However, DSM systems can suffer from thrashing: while different processes update certain hot data items, the largest amount of effort is spent on data synchronization, and little progress is made by each process. To avoid interference between processes during data updating while providing shared memory at page granularity, more time is reserved for a writer to hold a page in a traditional manner. In this paper, we report on complex thrashing, which can explain why extending the time of holding a page might not be sufficient to control thrashing. To increase the throughput, we propose a thrashing control mechanism that allows each process to update a set of pages during a period of time, where the pages compose a logical area. Because of the isolation of areas, updates on different areas can be performed concurrently. To allow the areas to be fairly well used, each process is assigned with a random priority for thrashing control. The thrashing control mechanism is implemented on a Linux-based DSM system. Performance results show that the execution time of the applications that are apt to cause system thrashing can be significantly reduced by our approach.

关键词： Synchronization Process control memory management Programming distributed databases Frequency synchronization Message passing distributed shared memory inter process communication thrashing control

来源：评论

学校读者我要写书评

暂无评论

Shray: An Owner-Compute distributed shared-memory System 10

Shray: An Owner-Compute Distributed Shared-Memory System

引用

10th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming (ARRAY)

作者： Schrijvers, Stefan Koopman, Thomas Scholz, Sven-Bodo Radboud Univ Nijmegen Nijmegen Netherlands

ISBN: (纸本)9798400706202

In this paper, we propose a new library for storing arrays in a distributed fashion on distributed memory systems. From a programmer's perspective, these arrays behave for arbitrary reads as if they were allocated in shared memory. When it comes to writes into these arrays, the programmer has to ensure that all writes are restricted to a fixed range of address that are "owned" by the node executing the writing operation. We show how this design, despite the owner-compute restriction can aid programmer productivity by enabling straight-forward parallelisations of typical array-manipulating codes. Furthermore, we delineate an open-source implementation of the proposed library named Shray. Using the programming interface of Shray, we compare possible hand-parallelised codes of example applications with implementations in other DSM/PGAS systems demonstrating the programming style enabled by Shray, and providing some initial performance figures.

关键词： distributed shared memory Partitioned Global Address Space Array Programming Parallel Computing

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Encryption and Its Application to a Software-distributed shared memory 17

Attribute-Based Encryption and Its Application to a Software...

引用

17th International Joint Conference on E-Business and Telecommunications (SECRYPT)

作者： Stan, Oana Cudennec, Loic Syoen, Louis CEA LIST PC 172 F-91191 Gif Sur Yvette France DGA MI Dept Artificial Intelligence BP 7 F-35998 Rennes Armees France

ISBN: (纸本)9789897584466

Due to the widespread of cloud computing, there is an increasing interest in distributed systems as well as in data privacy and security. However, unlike the multi-core processors and NUMA architectures, the distributed shared memory (DSM) systems do not benefit from the numerous works on security and privacy. We argue here that their potential deployment onto distributed heterogeneous systems requires new approaches to securely manage access to shared data. In this paper we propose to rely on the Attribute-Based Encryption (ABE) techniques to tackle the problem of data security within the Software DSM. Moreover, this approach allowing to directly store encrypted data within the DSM and to manage the access control to these data is made transparent for the user. The implementation over an in-house S-DSM using libbswabe, an ABE library, shows that, as expected, the overhead is significant, but that it can also be adapted to the application requirements as a trade-off between security and performance.

关键词： distributed shared memory Attribute-Based Encryption

来源：评论

学校读者我要写书评

暂无评论

MENPS: A Decentralized distributed shared memory Exploiting RDMA 4

MENPS: A Decentralized Distributed Shared Memory Exploiting ...

引用

IEEE/ACM 4th Annual Workshop on Emerging Parallel and distributed Runtime Systems and Middleware (IPDRM)

作者： Endo, Wataru Sato, Shigeyuki Taura, Kenjiro Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan

ISBN: (纸本)9780738110646

The spread of RDMA-capable interconnects on supercomputers has enabled the middleware developers to explore new design options for runtime systems based on efficient communications. Observing low-latency networks and shared-memory infrastructure for multi-core processors, we have focused on extending shared-memory abstraction into multiple nodes exploiting RDMA, i.e., distributed shared memory (DSM). We have found that the traditional protocols of DSM designed for two-sided communications cannot fully exploit the performance of RDMA, which necessitates decentralization and coarse-grained communications. To solve this problem, we introduced two methods for the DSM coherence protocol to exploit RDMA and implemented a DSM library MENPS using this protocol. Our evaluation shows that MENPS could accelerate two of five shared-memory applications with minimal modifications and beat an existing RDMA-based DSM runtime.

关键词： Cache coherence protocol distributed shared memory Home migration Rdma Timestamp based coherence

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：