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

Limitations of fast consistency conditions for distributed shared memories

INFORMATION PROCESSING LETTERS 1996年第5期57卷 243-248页

作者： Attiya, H Friedman, R TECHNION ISRAEL INST TECHNOL DEPT COMP SCIIL-32000 HAIFAISRAEL CORNELL UNIV DEPT COMP SCIITHACANY 14853

A consistency condition for distributed shared memory is fast if it has a fast implementation in which the execution time of every operation is significantly faster than the network delay. These conditions include Pipelined RAM, weak consistency, causal memory, and one interpretation of processor consistency. It is shown that if a condition is fast then it does not support non-centralized solutions for mutual exclusion.

关键词： distributed computing distributed shared memory consistency conditions

来源：评论

学校读者我要写书评

暂无评论

Analytical prediction of performance for cache coherence protocols

引用

IEEE TRANSACTIONS ON COMPUTERS 1997年第11期46卷 1155-1173页

作者： Srbljic, S Vranesic, ZG Stumm, M Budin, L UNIV TORONTO DEPT ELECT & COMP ENGN TORONTO ON CANADA

In this paper, we introduce new analytical models for predicting the performance of parallel applications under Various cache coherence protocol assumptions. The purpose of these models is to determine which protocols are to be used for which data blocks, and, in the case of dynamic protocols, also to determine when to change protocols. Although we focus on tightly-coupled multiprocessor systems, similar models can be derived for loosely-coupled distributed systems, such as networks of workstations. Our models are unique in that they lie between a large body of theoretical models that assume independence and a uniform distribution of memory accesses across processors, and a large body of address-trace oriented models that assume the availability of a precise characterization of interleaving behavior of memory accesses. The former are not very realistic, and the latter are not suitable for compile-time and run-time usage. In contrast, our models enable us to choose different input parameters depending on how the models will be used and depending on the needed accuracy in performance prediction. We present the models and show how the required parameters can be obtained. We assess the accuracy of our models on 15 parallel applications. For these applications, our most complete model predicts performance within a 10 percent margin when compared to a simulation of a sequentially consistent multiprocessor system. As part of this study, we also show the potential advantage of using dynamic hybrid protocols.

关键词： cache coherence distributed shared memory memory access behavior analytical performance prediction performance evaluation dynamic hybrid protocols

来源：评论

学校读者我要写书评

暂无评论

GENESIS: an efficient, transparent and easy to use cluster operating system

引用

PARALLEL COMPUTING 2002年第4期28卷 557-606页

作者： Goscinski, A Hobbs, M Silcock, J Deakin Univ Sch Comp & Math Geelong Vic 3217 Australia

Present operating systems are not built to support parallel computing-they do not provide services to manage parallelism, i.e., to globally manage parallel processes and computational resources. The cluster operating environments that are used to assist the execution of parallel applications do not provide support for both programming paradigms, message passing (NIP) or distributed shared memory (DSM) they are mainly offered as separate components implemented at the user level as library and independent server processes, Due to poor operating systems users must deal with clusters as a set of independent computers rather than to see this cluster as a single powerful computer. A single system image (SSI) of the cluster is not offered to users. There is a need for an operating system for clusters. We claim and demonstrate in this paper that it is possible to develop a cluster operating system that is able to efficiently manage parallelism;use cluster resources efficiently;support NIP in the form of standard MP and PVM, and DSM;offer SSI;and make it easy to use. We show that to achieve these aims this operating system should inherit many features of a distributed operating system and provide new services which address the needs of parallel processes, cluster's resources, and application developers. In order to substantiate the claim the first version of a cluster operating system managing parallelism and offering SSI, called GENESIS, has been developed. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： operating systems clusters parallel processing on clusters parallelism management message passing PVM distributed shared memory single system image performance evaluation

来源：评论

学校读者我要写书评

暂无评论

A proposition and evaluation of DSM models suitable for a wide area distributed environment realized on high performance networks

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 1996年第2期E79B卷 153-162页

作者： Oguchi, M Aida, H Saito, T Faculty of Engineering University of Tokyo Tokyo 113 Japan

distributed shared memory is an attractive option for realizing functionally distributed computing in a wide area distributed environment, because of its simplicity and flexibility in software programming. However, up till now, distributed shared memory has mainly been studied in a local environment. In a widely distributed environment, latency of communication greatly affects system performance. Moreover, bandwidth of networks available in a wide area is dramatically increasing recently DSM architecture using high performance networks must be different from the case of low speed networks being used. In this paper, distributed shared memory models in a widely distributed environment are discussed and evaluated. First, existing distributed shared memory models are examined: They are shared virtual memory and replicated shared memory. Next, an improved replicated shared memory model, which uses internal machine memory,is proposed. In this model, we assume the existence of a seamless, multi-cast wide area network infrastructure - for example, an ATM network. A prototype of this model using multi-thread programming have been implemented on multi-CPU SPARCstations and an ATM-LAN. These DSM models are compared with SCRAMNet(TM), whose mechanism is based on replicated shared memory. Results from this evaluation show the superiority of the replicated shared memory compared to shared virtual memory when the length of the network is large. While replicated shared memory using external memory is influenced by the ratio of local and global accesses, replicated shared memory using internal machine memory is suitable for a wide variety of cases. The replicated shared memory model is considered to be suitable particularly for applications which impose real time operation in a widely distributed environment, since some latency hiding techniques such as context switching or data prefetching are not effective for real time demands.

关键词： distributed shared memory wide area distributed environment shared virtual memory multi-casting high performance networks

来源：评论

学校读者我要写书评

暂无评论

Performability evaluation of multipurpose multiprocessor systems: The "Separation of concerns" approach

引用

IEEE TRANSACTIONS ON COMPUTERS 2003年第2期52卷 223-236页

作者： Rabah, M Kanoun, K Univ Rochelle IUT INFO F-17026 La Rochelle France CNRS LAAS F-31077 Toulouse 4 France

The aim of our work is to provide a modeling framework for evaluating performability measures of Multipurpose, Multiprocessor Systems (MMSs). The originality of our approach is in the explicit separation between the architectural and environmental concerns of a system. The overall dependability model, based on Stochastic Reward Nets, is composed of 1) an architectural model describing the behavior of system hardware and software components, 2) a service-level model, and 3) a maintenance policy model. The two latter models are related to the system utilization environment. The results can be used for supporting the manufacturer design choices as well as the potential end-user configuration selection. We illustrate the approach on a particular family of MMSs under investigation by a system manufacturer for Internet and e-commerce applications. As the systems are scalable, we consider two architectures: a reference one composed of 16 processors and an extended one with 20 processors. Then, we use the obtained results to evaluate the performability of a clustered system composed of four reference systems. We evaluate comprehensive measures defined with respect to the end-user service requirements and specific measures in relation to the distributed shared memory paradigm.

关键词： dependability and performability evaluation stochastic reward nets modular modeling multipurpose multiprocessors systems distributed shared memory clustered systems

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of cohesion

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 1998年第4期14卷 725-741页

作者： Shieh, CK Ueng, JC Lai, AC Liang, TY Mac, SC Natl Cheng Kung Univ Dept Elect Engn Tainan 701 Taiwan

This paper describes a prototype DSM system called Cohesion which supports two memory consistency models, namely, Sequential consistency and Release consistency, within a single program to improve performance and support a wide variety of parallel programs for the system. memory that is sequentially consistent is further divided into object-based and conventional (page-based) memory, where they are constructed at the user-level and kernel-level, respectively. In object-based memory, the shared data are kept consistent in terms of the granularity of an object;this is provided to improve the performance of fine-grained parallel applications that may incur a significant overhead in conventional or release memory as well as to eliminate unnecessary movement of pages which are protected in a critical section. On the other hand, the Release consistency model is supported in Cohesion to attack the problem of excessive network traffic and false sharing. Cohesion programs are written in C++, and the annotation of shared objects for release and object-based memory is accomplished by inheriting a system-provided base class. Cohesion is built up on a network of Intel 486-33 personal computers which are connected by a 10Mbps Ethernet. Three application programs, including Matrix Multiplication, SOR, and N-body, have been employed to evaluate the efficiency of Cohesion. In addition, a Producer-Consumer program has been tested to show that the object-based memory will benefit us in a critical section.

关键词： distributed shared memory multiple consistency protocols upcall mechanism

来源：评论

学校读者我要写书评

暂无评论

distributed Parallel Super-Block-Based Star Detection and Centroid Calculation

引用

IEEE SENSORS JOURNAL 2018年第19期18卷 8096-8107页

作者： Wang, Zhen Jiang, Jie Zhang, Guangjun Beijing Univ Aeronaut & Astronaut Sch Instrumentat Sci & Optoelect Engn Minist Educ Key Lab Precis Optomechatron Technol Beijing 100191 Peoples R China

Due to the inadequacies of the speed of star detection and centroid calculation (SDCC), the applications of high-resolution and high-frame-rate image sensors are greatly limited in star trackers, restricting the performance of the star trackers. To resolve this problem, a novel distributed parallel super-block-based SDCC method is proposed in this paper. In contrast to the previous SDCC methods, the proposed method divides the star images into several sub-images and processes these sub-images in parallel. Then, by using a super-block-based method and a distributed shared memory-based method to process the stars in sub-images (sub-stars) and in adjacent sub-images (boundary stars), respectively, the position information of all the stars are detected during the parallel scan of the sub-images. The proposed method exhibits a speed that is up to 4 x M times faster than the previous SDCC methods in processing the star images that are divided into M sub-images. Experimental results demonstrate that the proposed method is correct and effective. It is applicable to the use of most high-performance image sensors and resolves the performance limitation of star trackers to achieve better attitude accuracy and attitude update rate.

关键词： distributed parallel star detection centroid location star tracker distributed shared memory image sensors application

来源：评论

学校读者我要写书评

暂无评论

WAKASHI/C - A STORAGE-SYSTEM FOR MULTIMEDIA DATABASE

引用

SYSTEMS AND COMPUTERS IN JAPAN 1995年第7期26卷 13-23页

作者： BAI, GY AMANO, H MAKINOUCHI, A Member Faculty of Engineering Kyushu University Fukuoka Japan 812 Guaagyi Bai:receivedhis B.E. degree in 1985 from Dept. Electronic Eng. Jilin Inst. Tech. China his M.S. degree (Comput. Eng.) in 1988 from Dongbei Univ. China and is currently in the doctoral program at Kyushu Univ. He is engaged in research on multimedia database and distributed database. He is a member of the Inf. Proc. Soc. Members

WAKASHI/C (centralized server version) is a subsystem at the base level of the ''Shusse Uo'' project. It provided the C programmer with the basic functions to manipulate the distributed shared persistent data and the distributed shared volatile data. In WAKASHI/C, the virtual memory scheme and the distributed shared memory scheme are combined to realize the distributed shared persistent heap and the distributed and shared volatile heap, for the efficient handling of multimedia data. This paper discusses the realization of WAKASHI/C corresponding to the distributed computing environment. To evaluate the performance for the manipulation of the multimedia database, the extended object operation benchmark is proposed, and the execution performance of WAKASHI/C is evaluated.

关键词： distributed shared PERSISTENT HEAP VIRTUAL memory distributed shared memory MULTIMEDIA DATABASE DATABASE BENCHMARK

来源：评论

学校读者我要写书评

暂无评论

Toward integration of data race detection in DSM systems

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 1999年第2期59卷 180-203页

作者： Itzkovitz, A Schuster, A Zeev-Ben-Mordehai, O NYU Dept Comp Sci New York NY 10012 USA Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel

We present a distributed algorithm, called DJIT, for detecting data races in DSM systems. DJIT is designed as a DSM add-on, detecting a race condition as soon as one is created. It instantly displays to the user the precise place in the program where the race occurred. There are no false detections, and no data races are missed. We have implemented DJIT On top of MILLIPAGE-a fine granularity, page-based DSM system. Our implementation makes novel use of the operating system protection mechanisms. In particular, we propose a protection cache. which call be used for local logging of accesses to variables. As a result. our implementation does not increase the message complexity of the execution. piggybacking all its communication activity on top of the DSM-related messages. The performance figures show that our data race detection mechanism has only a minor influence on performance. The measured overheads. averaging only few percent, are two orders of magnitude smaller than those achieved in previous work. Thus, our technique makes the integration of on-the-fly data race detection during the regular DSM execution feasible for the first time. (C) 1999 Academic Press.

关键词： distributed shared memory parallel computation data race detection debugging tools

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：