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

A correctness condition for high-performance multiprocessors

SIAM JOURNAL ON COMPUTING 1998年第6期27卷 1637-1670页

作者： Attiya, H Friedman, R Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel Cornell Univ Dept Comp Sci Ithaca NY 14850 USA

Hybrid consistency, a consistency condition for shared memory multiprocessors, attempts to capture the guarantees provided by contemporary high-performance architectures. It combines the expressiveness of strong consistency conditions (e.g., sequential consistency, linearizability) and the efficiency of weak consistency conditions (e.g., pipelined RAM, causal memory). memory access operations are classified as either strong or weak. A global ordering of strong operations at different processes is guaranteed, but there is very little guarantee on the ordering of weak operations at different processes, except for what is implied by their interleaving with the strong operations. A formal and precise definition of this condition is given and an algorithm for providing hybrid consistency on distributed memory machines is presented. The response time of the algorithm is proved to be within a constant multiplicative factor of the (theoretical) optimal time bounds.

关键词： distributed shared memory consistency conditions sequential consistency hybrid consistency weak consistency

来源：评论

学校读者我要写书评

暂无评论

distributed Programming Framework for Fast Iterative Optimization in Networked Cyber-Physical Systems

引用

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS 2014年第2-Sup期13卷 66-66页

作者： Balani, Rahul Wanner, Lucas F. Srivastava, Mani B. IBM Res Corp New Delhi India Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90024 USA Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90024 USA

Large-scale coordination and control problems in cyber-physical systems are often expressed within the networked optimization model. While significant advances have taken place in optimization techniques, their widespread adoption in practical implementations has been impeded by the complexity of internode coordination and lack of programming support for the same. Currently, application developers build their own elaborate coordination mechanisms for synchronized execution and coherent access to shared resources via distributed and concurrent controller processes. However, they typically tend to be error prone and inefficient due to tight constraints on application development time and cost. This is unacceptable in many CPS applications, as it can result in expensive and often irreversible side-effects in the environment due to inaccurate or delayed reaction of the control system. This article explores the design of a distributed shared memory (DSM) architecture that abstracts the details of internode coordination. It simplifies application design by transparently managing routing, messaging, and discovery of nodes for coherent access to shared resources. Our key contribution is the design of provably correct locality-sensitive synchronization mechanisms that exploit the spatial locality inherent in actuation to drive faster and scalable application execution through opportunistic data parallel operation. As a result, applications encoded in the proposed Hotline Application Programming Framework are error free, and in many scenarios, exhibit faster reactions to environmental events over conventional implementations. Relative to our prior work, this article extends Hotline with a new locality-sensitive coordination mechanism for improved reaction times and two tunable iteration control schemes for lower message costs. Our extensive evaluation demonstrates that realistic performance and cost of applications are highly sensitive to the prevalent deployment, network, an

关键词： Design Algorithms Performance Wireless sensor/actuator networks distributed optimization distributed shared memory synchronization subgradient methods

来源：评论

学校读者我要写书评

暂无评论

TRIPWIRE: A SYNCHRONISATION PRIMITIVE FOR VIRTUAL memory MAPPED COMMUNICATION

引用

Journal of Interconnection Networks 2001年第3期2卷 345-364页

作者： DAVID RIDDOCH STEVE POPE DEREK ROBERTS GLENFORD MAPP DAVID CLARKE DAVID INGRAM KIERAN MANSLEY ANDY HOPPER AT&T Laboratories-Cambridge 24a Trumpington Street Cambridge England Laboratory for Communications Engineering Department of Engineering University of Cambridge England

Existing user-level network interfaces deliver high bandwidth, low latency performance to applications, but are typically unable to support diverse styles of communication and are unsuitable for use in multiprogrammed environments. Often this is because the network abstraction is presented at too high a level, and support for synchronisation is inflexible. In this paper we present a new primitive for in-band synchronisation: the Tripwire . Tripwires provide a flexible, efficient and scalable means for synchronisation that is orthogonal to data transfer. We describe the implementation of a non-coherent distributed shared memory network interface, with Tripwires for synchronisation. This interface provides a low-level communications model with gigabit class bandwidth and very low overhead and latency. We show how it supports a variety of communication styles, including remote procedure call, message passing and streaming.

关键词： User-level networking Synchronization distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Group Consistency Model Which separates the intra-group Consistency Maintenance from the inter-group Consistency Maintenace in Large Scale DSM Systems

引用

Operating Systems Review (ACM) 1997年第2期31卷 23-35页

作者： Li, Qun Ji, Hua Xie, Li Dept. of Computer Science Nanjing University Nanjing 210093 China

According to the characteristics of large scale network computing systems, we proposed a group consistency model based on the concept of group to construct a DSM system. The novel model can use different inter-group and intra-group consistencies and lend itself to flexible, easily-managable, and application-suitable DSM in large scale systems. A group consistency model, which applies entry consistency among groups and lazy release consistency in a group, together with its implementation policy is discussed in this paper. It employs write-update and multiple-writer protocols in a group, and thus facilitates the simultaneous read and write in a group. The suitable protocols eliminate the false sharing and reduce the data acquiring time in a group. Furthermore, the inter-group consistency also suits the features of data sharing among groups and transmits the data modifications originated from a group in bulk to reduce the network traffic. In the end, an example using group consistency model is given and the trivial group consistency is discussed.

关键词： distributed shared memory Entry consistency model memory coherence Release consistency model

来源：评论

学校读者我要写书评

暂无评论

Eventually Consistent: Not What You Were Expecting?

引用

COMMUNICATIONS OF THE ACM 2014年第3期57卷 38-44页

作者： Golab, Wojciech Rahman, Muntasir R. AuYoung, Alvin Keeton, Kimberly Li, Xiaozhou (Steve) Univ Waterloo Waterloo ON N2L 3G1 Canada Hewlett Packard Labs Palo Alto CA USA Univ Illinois Distributed Protocols Res Grp Urbana IL USA Google Washington DC USA

Methods of quantifying consistency (or lack thereof) in eventually consistent storage systems.

关键词： distributed computing Client/server computing Computer network architectures Multiuser computer systems Peer-to-peer architecture (Computer networks) distributed shared memory distributed tracking

来源：评论

学校读者我要写书评

暂无评论

ASPIRE: Exploiting Asynchronous Parallelism in Iterative Algorithms using a Relaxed Consistency based DSM

引用

ACM SIGPLAN NOTICES 2014年第10期49卷 861-878页

作者： Vora, Keval Koduru, Sai Charan Gupta, Rajiv Univ Calif Riverside CSE Dept Riverside CA 92521 USA

Many vertex-centric graph algorithms can be expressed using asynchronous parallelism by relaxing certain read-after-write data dependences and allowing threads to compute vertex values using stale (i.e., not the most recent) values of their neighboring vertices. We observe that on distributed shared memory systems, by converting synchronous algorithms into their asynchronous counterparts, algorithms can be made tolerant to high inter-node communication latency. However, high inter-node communication latency can lead to excessive use of stale values causing an increase in the number of iterations required by the algorithms to converge. Although by using bounded staleness we can restrict the slow-down in the rate of convergence, this also restricts the ability to tolerate communication latency. In this paper we design a relaxed memory consistency model and consistency protocol that simultaneously tolerate communication latency and minimize the use of stale values. This is achieved via a coordinated use of best effort refresh policy and bounded staleness. We demonstrate that for a range of asynchronous graph algorithms and PDE solvers, on an average, our approach outperforms algorithms based upon: prior relaxed memory models that allow stale values by at least 2.27x;and Bulk Synchronous Parallel (BSP) model by 4.2x. We also show that our approach frequently outperforms GraphLab, a popular distributed graph processing framework.

关键词： distributed shared memory Communication Latency Bounded Staleness Best Effort Refresh PDE Solvers Graph Mining Graph Analytics

来源：评论

学校读者我要写书评

暂无评论

An: 收藏
分享
引用; SIAM Journal on Computing 2010年第7期39卷 2726-2760页; 作者： Wojciech Golab Danny Hendler Philipp Woelfel; The leader election problem is a fundamental coordination problem. We present leader election algorithms for multiprocessor systems where processes communicate by reading and writing shared memory asynchronously and d... 详细信息; The leader election problem is a fundamental coordination problem. We present leader election algorithms for multiprocessor systems where processes communicate by reading and writing shared memory asynchronously and do not fail. In particular, we consider the cache-coherent (CC) and distributed shared memory (DSM) models of such systems. We present leader election algorithms that perform a constant number of remote memory references (RMRs) in the worst case. Our algorithms use splitter-like objects [J. Anderson and M. Moir, Sci. Comput. Programming, 25 (1995), pp. 1–39; H. Attiya and A. Fouren, Theory Comput. Syst., 31 (2001), pp. 642–664] in a novel way, by organizing active processes into teams that share work. As there is an $Ω (\log n)$; 来源：评论; 学校读者我要写书评

暂无评论

Dynamic Search Mechanism with Threat Prediction in a GNSS Receiver

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2017年第1期2017卷 10-10页

作者： Liu, Fang Liu, Meng Shenyang Ligong Univ Sch Informat Sci & Engn Shenyang 110159 Peoples R China

With the development of GNSS and the application of multimode signals, efficient GNSS receiver research has become very important. However, threat signals in the received signal are inevitable, which will represent important threats to navigation applications and will lead to leakage and fault detection for the receiver. Therefore, the searches with threat prediction in GNSS signals have been regarded as the important problem for GNSS receivers. In view of the limitations and nonadaptability of the current search technologies as well as on the basis of the proportionality peak judgment mechanism, a dynamic search mechanism with threat prediction (DSM-TP) is proposed in this paper, in which we define a series of preset coefficients and a threat index to optimize the decision mechanism. The simulation results demonstrate that the DSM-TP method can predict the threat situation and can adapt to lower SNR environments compared to the traditional method. In addition, the DSM-TP method can avoid the impact of threats, and the detection capability of the new method is better than the detection capability of the traditional method.

关键词： GLOBAL Positioning System MICROWAVE receivers MULTIMODE waveguides SIGNAL processing distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Next-generation Multi-mechanics Simulation Engine in a Highly Interactive Environment

引用

Procedia Computer Science 2011年 7卷 292-293页

作者： David Le Touzé John Biddiscombe Andrea Colagrossi Erwan Jacquin Francis Leboeuf Jean-Christophe Marongiu Nathan Quinlan Andrea Amicarelli Matteo Antuono Daniel Barcarolo Mihai Basa Joelle Caro Matthieu De Leffe Nicolas Grenier Pierre-Michel Guilcher Matthieu Kerhuel Fang Le Libor Lobovský Salvatore Marrone Adam Marsh Jérôme Soumagne Ecole Centrale de Nantes 1 Rue de la Noë BP 92101 44321 Nantes Cedex 3 France CSCS Swiss National Supercomputing Centre Galleria 2 - Via Cantonale 6928 Manno Switzerland CNR–INSEAN Via di Vallerano 139 00128 Roma Italy HydrOcean 1 Rue de la Noë CS 31122 44321 Nantes Cedex 3 France École Centrale de Lyon 36 Avenue Guy de Collongue 69134 Ecully Cedex France Andritz Hydro Vevey Switzerland National University of Ireland Galway University Road Galway Ireland

We describe the development of a highly interactive approach to simulation of engineering multi-mechanics problems, using the smoothed particle hydrodynamics mesh-free method as the computational engine, for applicati... 详细信息

关键词： Smoothed particle hydrodynamics Computational fluid dynamics distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Transactional memory Consistency : A New Consistency Model for distributed Transactional memory

Transactional Memory Consistency : A New Consistency Model f...

引用

The Third International Joint Conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

作者： Xuping Tu Xuepeng Fan Hai Jin Long Zheng Xin Peng Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

Transactional memory (TM) is a parallel programming concept. Existing consistency protocols in distributed transactional memory system consume too much bandwidth and bring high latency. In this paper, we propose our Transaction memory Consistency Protocol (TMCP), and point the new features compared to the current protocols. After formulating our model and analyzing the performance, we found both too much and too little execution time will cause more conflicts, given that the execution time of transaction population follows Gamma distribution. We indicate that it is important to adjust the execution time to a reasonable value to improve performance.

关键词： distributed system distributed shared memory software transactional memory consistency model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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