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

Modelling and model checking a distributed shared memory consistency protocol 19th

19th International Conference on Application and Theory of Petri Nets (ICATPN 98)

作者： Fisler, K Girault, C Rice Univ Dept Comp Sci Houston TX 77005 USA Univ Paris 06 Lab Comp Sci LIP6 F-75252 Paris 05 France

ISBN: (纸本)3540646779

distributed shared memory (DSM) systems provide the abstraction of a common virtual address space across a network of processors. Such systems employ a variety of protocols to maintain a consistent view of data across all local memories. Li and Hudak proposed several of the pioneering protocols for DSM [LH 89]. We have used both Petri net modelling and model checking to explore some of their protocols. Our work has detected inefficiencies, unstated assumptions, and errors in the original protocol descriptions. This paper presents Petri net models for one protocol at two layers of abstraction. For each model, we describe corresponding specifications for model checking and provide verification statistics. This combination of models and specifications gives different views of the protocol, inspiring greater confidence in the correctness of our analysis than if we had used only one approach.

关键词： protocol design and verification distributed shared memory memory consistency model checking high level Petri nets

来源：评论

学校读者我要写书评

暂无评论

Constructive and adaptable distributed shared memory 3

Constructive and adaptable distributed shared memory

引用

3rd International Workshop on High-Level Parallel Programming Models and Supportive Environments at the IPPS/SPDP 1998

作者： Bataller, J Bernabeu-Auban, JM Univ Politecn Valencia Dept Sistemes Informat & Computacio E-46071 Valencia Spain

ISBN: (纸本)0818684127

distributed shared memory (DSM) is a paradigm for programming distributed systems, which provides an alternative to the message passing model. DSM offers the agents of the system a shared address space through which they can communicate with each other The main problem of a DSM implementation on top of a message passing system is performance. Performance of an implementacion is closely related to the consistency the DSM system offers: strong consistency (all agents agree about how memory events happen) is more expensive to implement than weak consistency (disagreements are allowed). There have been many DSM systems proposals, each one supporting different consistency levels. Experience has shown that no one is well suited for the whole range of problems. Im some cases, strong consistent primitives are not needed, while in other cases, the weak semantics provided are useless. This is also true for different implementations of the same memory model, since performance is also afected by the data access patterns of the aplications.

关键词： distributed shared memory memory consistency models synchronized memory models

来源：评论

学校读者我要写书评

暂无评论

Exploring regional locality in distributed shared memory 4th

引用

4th Asian Computing Science Conference (ASIAN 98)

作者： Huang, ZY Sun, CZ Sattar, A Griffith Univ Sch Comp & Informat Technol Brisbane Qld 4111 Australia

ISBN: (纸本)3540653880

Two most commonly used classifications of reference locality are: temporal locality and spatial locality. This paper introduces a new class of reference locality, called Regional Locality, which is the program behavior that a set of addresses which are accessed in one critical or non-critical region will be very likely accessed as a whole in the same critical region or other nan-critical regions. We proposed three updates propagation protocols based on Regional Locality in distributed shared memory systems. These protocols include: Selective Lazy/Eager Updates Propagation protocol, First Hit Updates Propagation protocol, and Second Hit Updates Propagation protocol. Our experimental results indicate that Regional Locality exists in executions of many distributed shared memory concurrent programs. We have shown that the proposed protocols outperform the existing updates propagation protocols based on temporal locality. Exploring Regional Locality in other shared memory systems would be an interesting future research direction.

关键词： distributed shared memory temporal locality Regional Locality

来源：评论

学校读者我要写书评

暂无评论

View-Based Consistency and Its Implementation 01

View-Based Consistency and Its Implementation

引用

Proceedings of the 1st International Symposium on Cluster Computing and the Grid

作者： Z. Huang S. Cranefield M. Purvis C. Sun

ISBN: (纸本)9780769510101

This paper proposes a novel View-based Consistency model for distributed shared memory. A view is a set of ordinary data objects that a processor has the right to access in a data-race-free program. The View-based Consistency model only requires that the data objects of a view are updated before a processor accesses them. Compared with other memory consistency models, the View-based Consistency model can achieve data selection without user annotation and can reduce much false-sharing effect. This model has been implemented based on TreadMarks. Performance results have shown that for all our applications the View-based Consistency model outperforms the Lazy Release Consistency model.

关键词： False Sharing. Sequential Consistency distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Multigrain shared memory

引用

ACM TRANSACTIONS ON COMPUTER SYSTEMS 2000年第2期18卷 154-196页

作者： Yeung, D Kubiatowicz, J Agarwal, A Univ Maryland Inst Adv Comp Studies Dept Elect & Comp Engn College Pk MD 20742 USA Univ Calif Berkeley Berkeley CA 94720 USA MIT Boston MA USA

Parallel workstations, each comprising tens of processors based on shared memory, promise cost-effective scalable multiprocessing. This article explores the coupling of such small- to medium-scale shared-memory multiprocessors through software over a local area network to synthesize larger shared-memory systems. We call these systems distributed shared-memory MultiProcessors (DSMPs). This article introduces the design of a shared-memory system that uses multiple granularities of sharing, called MGS, and presents a prototype implementation of MGS on the MIT Alewife multiprocessor. Multigrain shared memory enables the collaboration of hardware and software shared memory, thus synthesizing a single transparent shared-memory address space across a cluster of multiprocessors. The system leverages the efficient support for fine-grain cache-line sharing within multiprocessor nodes as often as possible, and resorts to coarse-grain page-level sharing across nodes only when absolutely necessary. Using our prototype implementation of MGS, an in-depth study of several shared-memory applications is conducted to understand the behavior of DSMPs. Our study is the first to comprehensively explore the DSMP design space, and to compare the performance of DSMPs against all-software and all-hardware DSMs on a single experimental platform. Keeping the total number of processors fixed, we show that applications execute up to 85% faster on a DSMP as compared to an all-software DSM. We also show that all-hardware DSMs hold a significant performance advantage over DSMPs on challenging applications, between 159% and 1014%. However, program transformations to improve data locality for these applications allow DSMPs to almost match the performance of an all-hardware multiprocessor of the same size.

关键词： design experimentation measurement performance distributed shared memory symmetric multiprocessors system of systems

来源：评论

学校读者我要写书评

暂无评论

Program development tools for clusters of shared memory multiprocessors

引用

JOURNAL OF SUPERCOMPUTING 2000年第3期17卷 311-322页

作者： Chapman, B Merlin, J Pritchard, D Bodin, F Mevel, Y Sorevik, T Hill, L Univ Southampton Dept Elect & Comp Sci Southampton SO9 5NH Hants England Univ Rennes IRISA Rennes France Univ Bergen Inst Informat Bergen Norway Simulog SA Sophia Antipolis France

Applications are increasingly being executed on computational systems that have hierarchical parallelism. There are several programming paradigms which may be used to adapt a program for execution in such an environment. In this paper, we outline some of the challenges in porting codes to such systems, and describe a programming environment that we are creating to support the migration of sequential and MPI code to a cluster of shared memory parallel systems, where the target program may include MPI, OpenMP or both. As part of this effort, we are evaluating several experimental approaches to aiding in this complex application development task.

关键词： parallel programming distributed shared memory parallelization program transformations program development environment

来源：评论

学校读者我要写书评

暂无评论

Dynamic adaptation of sharing granularity in DSM systems

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2000年第1期55卷 19-32页

作者： Itzkovitz, A Niv, N Schuster, A Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel NYU Courant Inst Math Sci Dept Comp Sci New York NY 10012 USA

The trade-off between false sharing elimination and aggregation in distributed shared memory (DSM) systems has a major effect on their performance. Some studies in this area show that fine grain access is advantageous, while others advocate the use of large coherency units. One way to resolve the trade-off is to dynamically adapt the granularity to the application memory access pattern. In this paper, we propose a novel technique for implementing multiple sharing granularities over page-based DSMS. We present protocols for efficient switching between small and large sharing units during runtime. We show that applications may benefit from adapting the memory sharing to the memory access pattern, using both coarse grain sharing and fine grain sharing interchangeably in different stages of the computation. Our experiments show a substantial improvement in the performance using adapted granularity level over using a fixed granularity level. (C) 2000 Elsevier Science Inc. All rights reserved.

关键词： distributed shared memory virtual parallel machine network programming

来源：评论

学校读者我要写书评

暂无评论

On the performance of distributed objects

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2000年第5期46卷 411-428页

作者： Venkatesulu, D Gonsalves, TA Hariram, RK Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India

Early distributed shared memory systems used the shared virtual memory approach with fixed-size pages, usually 1-8 KB. As this does not match the variable granularity of sharing of most programs, recently the emphasis has shifted to distributed object-oriented systems. With small object sizes, the overhead of inter-process communication could be large enough to make a distributed program too inefficient for practical use. To support research in this area, we have implemented a user-level distributed programming testbed, DIPC, that provides shared memory, semaphores and barriers. We develop a computationally-efficient model of distributed shared memory using approximate queueing network techniques. The model can accommodate several algorithms including central server, migration and read-replication. These models have been carefully validated against measurements on our distributed shared memory testbed. Results indicate that for large granularities of sharing and small access bursts, central server performs better than both migration and read-replication algorithms. Read-replication performs better than migration for small and moderate object sizes for applications with high degree of read-sharing and migration performs better than read-replication for large object sizes for applications having moderate degree of read-sharing. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

关键词： distributed shared memory distributed semaphore distributed barrier mean value analysis queueing network model distributed objects

来源：评论

学校读者我要写书评

暂无评论

Or-parallel Prolog on a distributed memory architecture

引用

JOURNAL OF LOGIC PROGRAMMING 2000年第2期43卷 173-186页

作者： Silva, F Watson, P Univ Porto DCC FC P-4150 Porto Portugal Univ Porto LIACC P-4150 Porto Portugal Univ Newcastle Upon Tyne Dept Comp Newcastle Upon Tyne NE1 7RU Tyne & Wear England

This paper discusses the design of Dorpp, an or-parallel Prolog system for distributed memory architectures, The problem of sharing the environment across a set of nodes that do not physically share memory is addressed in a novel manner by designing a Virtual shared memory (VSM) scheme to specifically meet the requirements of or-parallelism The aim is to avoid the overheads of a general VSM scheme that would provide a stricter level of memory coherence than is actually required, The paper identifies the requirements for memory coherence in or-parallel Prolog, and describes how they can be met cheaply, Simulation results are presented and analyzed in order to highlight key aspects of the system's run-time behavior. (C) 2000 Elsevier Science Inc. All rights reserved.

关键词： or-parallelism distributed shared memory memory coherency

来源：评论

学校读者我要写书评

暂无评论

Adaptive cache coherence over a high bandwidth broadband mesh network

引用

PARALLEL COMPUTING 2000年第2-3期26卷 285-311页

作者： Chu, JC Dowd, PW Sun Microsyst Chelmsford MA 01824 USA Univ Maryland Dept Elect Engn College Pk MD 20742 USA US Dept Def Ft George G Meade MD USA

Networks have traditionally been an obstacle to high performance distributed computing. Specific problems are insufficient bandwidth and long transaction latencies. While pipelining data can achieve high bandwidth, it does nothing for latency which is still a bottleneck in performance. One approach is to develop a cache coherence protocol which exploits recurring data sharing patterns to reduce the impact of latency. This paper proposes an adaptive cache coherence protocol which detects producer-consumer type sharing and maintains coherence on only those cache blocks which exhibit producer-consumer sharing via updates rather than invalidates. Execution driven simulations of this protocol show improved performance compared to a standard write-invalidate protocol protocol and a competitive update protocol. When there are no access patterns to exploit, the protocol does not degrade performance. When there is producer-consumer type sharing, the proposed protocol runs benchmarks up to 30% faster than the better of either write-invalidate or competitive update. As a side-effect, it shows improved tolerance of increasing network latency. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

关键词： distributed shared memory adaptive protocol producer-consumer sharing performance evaluation latency tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：