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

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

来源：评论

学校读者我要写书评

暂无评论

distributed shared abstractions (DSA) on multiprocessors

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1996年第2期22卷 132-152页

作者： Clemencon, C Mukherjee, B Schwan, K IBM CORP THOMAS J WATSON RES CTRYORKTOWN HTSNY 10598 GEORGIA INST TECHNOL COLL COMPATLANTAGA 30332

Any parallel program has abstractions that are shared by the program's multiple processes, including data structures containing shared data, code implementing operations like global sums or minima, type instances used for process synchronization or communication. Such shared abstractions can considerably affect the performance of parallel programs, on both distributed and shared memory multiprocessors. As a result, their implementation must be efficient, and such efficiency should be achieved without unduly compromising program portability and maintainability. Unfortunately, efficiency and portability can be at cross-purposes, since high performance typically requires changes in the representation of shared abstractions across different parallel machines. The primary contribution of the DSA library presented and evaluated in this paper is its representation of shared abstractions as objects that may be internally distributed across different nodes of a parallel machine. Such distributed shared abstractions (DSA) are encapsulated so that their implementations are easily changed while maintaining program portability across parallel architectures ranging from small-scale multiprocessors, to medium-scale shared and distributed memory machines, and potentially, to networks of computer workstations. The principal results presented in this paper are 1) a demonstration that the fragmentation of object state across different nodes of a multiprocessor machine can significantly improve program performance, and 2) that such object fragmentation can be achieved without compromising portability by changing object interfaces. These results are demonstrated using implementations of the DSA library on several medium-scale multiprocessors, including the BBN Butterfly, Kendall Square Research, and SGI shared memory multiprocessors. The DSA library's evaluation uses synthetic workloads and a parallel implementation of a branch-and-bound algorithm for solving the Traveling Salesperson P

关键词： distributed shared memory application dependent memory consistency fragmented objects asynchronous events topology

来源：评论

学校读者我要写书评

暂无评论

A simulation study of hardware-oriented DSM approaches

引用

IEEE PARALLEL & distributed TECHNOLOGY 1996年第1期4卷 74-83页

作者： Grujic, A Tomasevic, M Milutinovic, V University of Belgrade Yugoslavia Univerzitet u Beogradu Beograd Beograd RS Belgrade Univ. Serbia

distributed shared memory combines the advantages of shared memory multi-processors and distributed computer systems. Evaluations of four experimental or commercial approaches to hardware DSM show its potential for la... 详细信息

关键词： Parallel Processing distributed shared memory Cache Coherence

来源：评论

学校读者我要写书评

暂无评论

New propositions to improve the efficiency and scalability of DSM systems

New propositions to improve the efficiency and scalability o...

引用

1996 IEEE 2nd International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 96)

作者： Brunie, L Lefevre, L Ecole Normale Superieure de Lyon Lyon France

ISBN: (纸本)0780335295

This paper describes the DOSMOS(1) parallel programming environment. Based on a DSM layer, this system has been specially designed to ensure scalability and efficiency. Several novel features are introduced as the grouping of processes, the possibility of mixing message-passing (PVM) code and DSM code, the definition of optimized weak consistency protocols, the integration of monitoring facilities. First experiments on networks of workstations show the effectiveness of these features.

关键词： parallel programming environments distributed shared memory scalability monitoring

来源：评论

学校读者我要写书评

暂无评论

DECENTRALIZED SEMAPHORE SUPPORT IN A VIRTUAL shared-memory SYSTEM

引用

JOURNAL OF SUPERCOMPUTING 1995年第1-2期9卷 51-70页

作者： RAMACHANDRAN, M SINGHAL, M Department of Computer and Information Science The Ohio State University Columbus

distributed shared memory has increasingly become a desirable programming model on which to program multicomputer systems. Such systems strike a balance between the performance attainable in distributed-memory multiprocessors and the ease of programming on shared-memory systems. In shared-memory systems, concurrent tasks communicate through shared variables, and synchronization of access to shared data is an important issue. Semaphores have been traditionally used to provide this synchronization. In this paper we propose a decentralized scheme to support semaphores in a virtual shared-memory system. Our method of grouping semaphores into semaphore pages and caching a semaphore at a processor on demand eliminates the reliability problems and bottlenecks associated with centralized schemes. We compare the performance of our scheme with a centralized implementation of semaphores and conclude that our system performs better under high semaphore access rates as well as larger numbers of processors.

关键词： OPERATING SYSTEMS PROCESS SYNCHRONIZATION SEMAPHORES distributed-memory ARCHITECTURES distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

CAUSAL memory - DEFINITIONS, IMPLEMENTATION, AND PROGRAMMING

引用

distributed COMPUTING 1995年第1期9卷 37-49页

作者： AHAMAD, M NEIGER, G BURNS, JE KOHLI, P HUTTO, PW INTEL CORP SOFTWARE TECHNOL LABHILLSBOROOR 97124 GEORGIA INST TECHNOL COLL COMPATLANTAGA 30332

The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, providing these guarantees entails access latencies that prevent scaling to large systems. This paper weakens such guarantees by defining causal memory, an abstraction that ensures that processes in a system agree on the relative ordering of operations that are causally related. Because causal memory is weakly consistent, it admits more executions, and hence more concurrency, than either atomic or sequentially consistent memories. This paper provides a formal definition of causal memory and gives an implementation for message-passing systems. In addition, it describes a practical class of programs that, if developed for a strongly consistent memory, run correctly with causal memory.

关键词： memory CONSISTENCY CAUSAL memory SEQUENTIAL CONSISTENCY distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a blackboard using Stochastic Petri Nets

引用

SIMULATION 1995年第4期65卷 269-278页

作者： DeBosschere, K Almhana, J UNIV MONCTON DEPT COMP SCI MONCTON NB E1A 3E9 CANADA

In this paper, a general blackboard based system is studied using Stochastic Perti Nets (SPN). We show how the dynamic behavior of the blackboard can be modeled, and analyze the marketing graph of the resulting stochastic Perti Net. The net is simulated with respect to the number of available processors, the event interarrival time and the average unification time, and performance results are presented.

关键词： Stochastic Petri Net blackboard distributed shared memory interprocess communication Linda

来源：评论

学校读者我要写书评

暂无评论

distributed HARDWIRED BARRIER SYNCHRONIZATION FOR SCALABLE MULTIPROCESSOR CLUSTERS

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 1995年第6期6卷 591-605页

作者： SHANG, SS HWANG, K KAOHSIUNG POLYTECH INST DEPT COMP ENGNKAOHSIUNGTAIWAN UNIV SO CALIF DEPT ELECT ENGNLOS ANGELESCA 90089

Conventional multiprocessors mostly use centralized, memory-based barriers to synchronize concurrent processes created in multiple processors. These centralized barriers often become the bottleneck or hot spots in the shared memory, In this paper, we overcome the difficulty by presenting a distributed and hardwired barrier architecture, that is hierarchically constructed for fast synchronization in cluster-structured multiprocessors, The hierarchical architecture enables the scalability of cluster-structured multiprocessors. A special set of synchronization primitives is developed for explicit use of distributed barriers dynamically, To show the application of the hardwired barriers, we demonstrate how to synchronize Doall and Doacross loops using a limited number of hardwired barriers, Timing analysis shows an O(10(2)) to O(10(5)) reduction in synchronization overhead, compared with the use of software-controlled barriers implemented in a shared memory, The hardwired architecture is effective is implementing any partially ordered set of barriers or fuzzy barriers with extended synchronization regions, The versatility, scalability, programmability, and low overhead make the distributed barrier architecture attractive in constructing fine-grain, massively parallel MIMD systems using multiprocessor clusters with distributed shared memory.

关键词： BARRIER SYNCHRONIZATION distributed shared memory DOACROSS LOOPS DOALL LOOPS FUZZY BARRIERS PARALLEL PROCESSING PARTIALLY ORDERED BARRIERS SCALABLE MULTIPROCESSORS WIRED-NOR LOGIC

来源：评论

学校读者我要写书评

暂无评论

PARALLEL PROGRAMMING IN PANDA

引用

JOURNAL OF SUPERCOMPUTING 1995年第1-2期9卷 71-90页

作者： ASSENMACHER, H BREITBACH, T BUHLER, P HUBSCH, V PEINE, H SCHWARZ, R Department of Computer Science University of Kaiserslautern Kaiserslautern Germany

distributed systems are an alternative to shared-memory multiprocessors for the execution of parallel applications. PANDA is a run-time system that provides architectural support for efficient parallel and distributed programming. It supplies fast user-level threads and a means for transparent and coordinated sharing of objects across a homogeneous network. The paper motivates the major architectural choices that guided our design. The problem of sharing data in a distributed environment is discussed, and the performance of the mechanisms provided by the PANDA prototype implementation is assessed.

关键词： distributed SYSTEMS PARALLEL PROGRAMMING distributed shared memory OBJECT MOBILITY USER-LEVEL THREADS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：