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

A distributed shared-memory SYSTEM WITH SELF-ADJUSTING COHERENCE SCHEME

PARALLEL COMPUTING 1994年第7期20卷 1007-1025页

作者： WANG, HH CHANG, RC NATL CHIAO TUNG UNIV INST COMP & INFORMAT SCIHSINCHUTAIWAN NATL CHIAO TUNG UNIV INST COMP SCI & INFORMAT ENGNHSINCHUTAIWAN ACAD SINICA INST INFORMAT SCINANKANGTAIWAN

The performance of distributed shared memory depends on the memory coherence algorithms and the access characteristics of shared data. In this paper, we propose an efficient coherence scheme using multiple coherence algorithms with self-adjusting feature. Our method can dynamically choose a more adaptive coherence algorithm for each variable class and the incorrect classification of shared variables will not affect the performance. We show that for each fixed classification, application programs suffer 5.1%, 4.6%, and 48.9% increases in the average execution time, when compared against the performance of a self-adjusting scheme. Experiments have shown our approach achieving good performance.

关键词： distributed shared memory memory COHERENCE MULTIPLE COHERENCE ALGORITHMS SELF-ADJUSTING COHERENCE SCHEME

来源：评论

学校读者我要写书评

暂无评论

distributed shared memory for roaming large volumes

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2006年第5期12卷 1299-1306页

作者： Castanie, Laurent Mion, Christophe Cavin, Xavier Levy, Bruno INRIA Earth Desis Nancy France INRIA ALICE Grp Nancy France

We present a cluster-based volume rendering system for roaming very large volumes. This system allows to move a gigabyte-sized probe inside a total volume of several tens or hundreds of gigabytes in real-time. While the size of the probe is limited by the total amount of texture memory on the cluster, the size of the total data set has no theoretical limit. The cluster is used as a distributed graphics processing unit that both aggregates graphics power and graphics memory. A hardware-accelerated volume renderer runs in parallel on the cluster nodes and the final image compositing is implemented using a pipelined sort-last rendering algorithm. Meanwhile, volume bricking and volume paging allow efficient data caching. On each rendering node, a distributed hierarchical cache system implements a global software-based distributed shared memory on the cluster. In case of a cache miss, this system first checks page residency on the other cluster nodes instead of directly accessing local disks. Using two Gigabit Ethernet network interfaces per node, we accelerate data fetching by a factor of 4 compared to directly accessing local disks. The system also implements asynchronous disk access and texture loading, which makes it possible to overlap data loading, volume slicing and rendering for optimal volume roaming.

关键词： large volumes volume roaming out-of-core hierarchical caching distributed shared memory hardware-accelerated volume visualization graphics hardware parallel rendering graphics cluster

来源：评论

学校读者我要写书评

暂无评论

distributed shared memory Based on Offloading to Cluster Network

Distributed Shared Memory Based on Offloading to Cluster Net...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Wada, Koichi Kawaguchi, Shinsuke Ono, Masaaki Yonezawa, Naoki Univ Tsukuba Dept Comp Sci 1-1-1 Tennodai Tsukuba Ibaraki 3058573 Japan Kanagawa Univ Dept Informat & Comp Sci Kanagawa Japan

ISBN: (纸本)9781457702518

distributed shared memory (DSM) is an important technology that provides programmers the underlying execution mechanism for shared memory programs. To improve the performance of DSM, recent studies have been carried out with introducing compiler assistance. The compiler generates codes for dependency analysis and communication. This paper proposes high-performance DSM, called Offloaded-DSM, in which the processes of dependency analysis and communication are offloaded to the cluster network. In Offloaded-DSM, the host machine can concentrate on computation of an application itself, while the network maintains coherency in parallel. Through the results of preliminary evaluation, Offloaded-DSM reduces execution time up to 32% in eight nodes and exhibits good scalability.

关键词： Arrays Field programmable gate arrays Libraries Nickel Runtime library Switches Synchronization cluster network offloading compiler assistance compiler code generation compiler generators dependency analysis distributed shared memory distributed shared me

来源：评论

学校读者我要写书评

暂无评论

distributed shared memory for roaming large volumes

Distributed shared memory for roaming large volumes

引用

IEEE Visualization Conference (Vis 2006)/IEEE Symposium on Information Visualization (InfoVis 2006)

作者： Castanie, Laurent Mion, Christophe Cavin, Xavier Levy, Bruno INRIA Earth Desis Nancy France INRIA ALICE Grp Nancy France

关键词： large volumes volume roaming out-of-core hierarchical caching distributed shared memory hardware-accelerated volume visualization graphics hardware parallel rendering graphics cluster

来源：评论

学校读者我要写书评

暂无评论

distributed shared memory based Live VM Migration 9

Distributed Shared Memory based Live VM Migration

引用

9th IEEE International Conference on Cloud Computing (CLOUD)

作者： Daradkeh, Tariq Agarwal, Anjali Concordia Univ Dept Elect & Comp Engn Montreal PQ Canada

ISBN: (纸本)9781509026197

Live virtual machine migration is an essential tool for dynamic resource management in current data centers. Many techniques have been developed to achieve this goal with minimum service interruption. In this paper, we propose a pre-copy live VM migration using distributed shared memory (DSM) computing model. The setup is built using two identical computation nodes to construct the environment services architecture namely the virtualization infrastructure, the shared storage server, and the DSM and High Performance Computing (HPC) cluster. The custom DSM framework is based on a low latency memory update Grappa. HPC cluster with OPENMPI and MPI libraries support parallelization and auto-parallelization work load by using CPUs computation nodes. The DSM allows the cluster CPUs to access the same memory space pages resulting in a lower memory data updates based on locality attributes updates, which reduces the amount of data transferred through the network. This model achieves a good enhancement of the live VM migration metrics. Downtime is reduced by 50% in the idle workload of Windows VM and 66.6% in case of Ubuntu Linux idle workload. In general, this model not only reduces the downtime and the total amount of data sent, but also does not degrade other metrics like the total migration time and the application performance.

关键词： Virtual Machine Total Migration Time Down Time distributed shared memory Physical Machine HPC

来源：评论

学校读者我要写书评

暂无评论

CBBR: enabling distributed shared memory-based coordination among mobile robots

引用

Science China(Information Sciences) 2016年第8期59卷 23-39页

作者： Xue JIANG Yu HUANG State Key Laboratory for Novel Software Technology Nanjing University

Coordinating mobile robots are widely used in commercial and industrial settings to fulfill various tasks. However, to program the coordination among mobile robots is challenging. A coordination framework is needed to shield the programmer from handling low-level details of robot control and communication, while supporting flexible and cost-effective coordination at the same time. The coordination framework should also be able to well coexist with the underlying robot control. To this end, we propose the Coordination-enabled Behavior-Based Robotics(CBBR) framework. CBBR employs distributed shared memory(DSM) to support coordination. The shared memory illusion built by the DSM greatly simplifies the coordination logic. Moreover,the flexible access patterns of the DSM and the rich consistency semantics of the DSM reads and writes enable flexible and cost-effective coordination. With the coordination support from the DSM, CBBR naturally extends the classical Behavior-Based Robotics(BBR) for robot control. From the perspective of robot control using BBR, the shared variables in the DSM act as the logical sensors capturing the status of coordination. The coordination algorithms are encapsulated into coordination behaviors. Thus, the physical environment status and the coordination status may trigger the physical and the coordination behaviors. The scheduling of both types of behaviors integrates coordination into robot control. We conduct a case study to demonstrate the use of CBBR. The performance measurements show the cost-effectiveness of coordinating mobile robots based on CBBR, in terms of time, space, and energy consumption.

关键词： distributed shared memory behavior-based robotics coordination behavior hierarchy behavior scheduling

来源：评论

学校读者我要写书评

暂无评论

Selecting threads for workload migration in software distributed shared memory systems

引用

PARALLEL COMPUTING 2002年第6期28卷 893-913页

作者： Liang, TY Shieh, CK Li, JQ Natl Cheng Kung Univ Dept Elect Engn Tainan 70101 Taiwan Leader Univ Dept Comp Sci & Informat Engn Tainan Taiwan

When threads are migrated from heavily loaded nodes to lightly loaded nodes for load balance in software distributed shared memory systems, the communication cost of maintaining data consistency is increased if migration threads are carelessly selected. Program performance is degraded when loss from increased communication exceeds the benefit from load balancing. This study addresses the problem with a novel selection policy called reduction of inter-node sharing costs. The main characteristic of this policy is simultaneously considering thread memory access types and global sharing. The experimental results show that this policy can reduce the communication of benchmark applications by 50% during load balancing. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： distributed shared memory load balance selection policy memory access types global sharing

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of directory protocols on an optical broadcast-based distributed shared memory multiprocessor

引用

COMPUTERS & ELECTRICAL ENGINEERING 2010年第1期36卷 114-131页

作者： Abasikeles, Ipek Akay, M. Fatih Cukurova Univ Dept Comp Engn TR-01330 Adana Turkey

Recent advances in the development of optical technologies suggest the possible emergence of broadcast-based optical interconnects within cache-coherent distributed shared memory (DSM) multiprocessor architectures. It is well known that the cache-coherence protocol is a critical issue in designing such architectures because it directly affects memory latencies. In this paper, we evaluate via simulation the performance of three directory-based cache-coherence protocols;strict request-response, intervention forwarding and reply forwarding on the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus), which is a low-latency and high-bandwidth broadcast-based fiber-optic interconnection network supporting DSM. The simulated system contains 64 nodes, each of which has a processor, a cache controller, a directory controller and an output channel. Simulations have been conducted for each protocol to measure average processor utilization, average network latency and average number of packets transferred over the network for varying values of the important DSM parameters such as the ratio of the mean channel service time to mean thread run time (T/R), probability of a cache block being in modified state {P(M)}, the fraction of write misses {P(W)} and home node contention rate. The results reveal that for all cases. except for low values of P(M), intervention forwarding gives the worst performance (lowest processor utilization and highest latency). The performance of strict request-response and reply forwarding is comparable for several values of the DSM parameters and contention rate. For a contention rate of 0%. the increase of P(M) makes reply forwarding perform better than strict request-response. The performance of all protocols decreases with the increase of P(W) and contention rate. However, the performance of strict request-response is the least affected among other protocols due to the negative impact of the increase of P(W) and contention rate. Therefore, for t

关键词： Directory protocols distributed shared memory Multiprocessors Performance evaluation Optical interconnects Simulation

来源：评论

学校读者我要写书评

暂无评论

A real-time operating system supporting distributed shared memory for embedded control systems

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第1期22卷 989-998页

作者： Tamura, Yuji Truong Thi Doan Chiba, Takahiro Yoo, Myungryun Yokoyama, Takanori Tokyo City Univ Setagaya Ku 1-28-1 Tamazutsumi Tokyo 1588557 Japan LINE Corp Tokyo Japan Syst Engn Consultants Co LTD Tokyo Japan

The paper presents a real-time operating system (RTOS) that provides a distributed shared memory (DSM) service for distributed embedded control systems. Model-based design is widely adopted in embedded control software design and the source code of software modules can be generated from a controller model. The generated software modules exchange their input and output values through shared variables. We develop a RTOS with a DSM service to provide a location-transparent environment, in which distributed software modules can exchange input and output values through the DSM. The RTOS is an extension to OSEK OS. We use a real-time network called FlexRay, which is based on a time division multiple access (TDMA) protocol. The consistency of the DSM is maintained according to the order of data transfer through FlexRay, not using inter-node synchronization. The worst case response time of the DSM is predictable if the FlexRay communication is well configured.

关键词： Operating systems Real-time systems Embedded systems distributed shared memory distributed control systems

来源：评论

学校读者我要写书评

暂无评论

Checkpointing distributed shared memory

引用

JOURNAL OF SUPERCOMPUTING 1997年第2期11卷 137-158页

作者： Silva, LM Silva, JG Departamento Engenharia Informatica Universidade de Coimbra Coimbra Portugal

distributed shared memory (DSM) is a very promising programming model for exploiting the parallelism of distributed memory systems, because it provides a higher level of abstraction than simple message passing. Although the nodes of standard distributed systems exhibit high crash rates only very few DSM environments have some kind of support for fault-tolerance. In this article, we present a checkpointing mechanism for a DSM system that is efficient and portable. It offers some portability because it is built on top of MPI and uses only the services offered by MPI and a POSIX compliant local file system. As far as we know, this is the first real implementation of such a scheme for DSM. Along with the description of the algorithm we present experimental results obtained in a cluster of workstations. We hope that our research shows that efficient, transparent and portable checkpointing is viable for DSM systems.

关键词： distributed shared memory checkpointing fault-tolerance portability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：