A Proposition and Evaluation of DSM Models Suitable for a Wide Area Distributed Environment Realized on High Performance Networks

スポンサーリンク

概要

• 論文の詳細を見る

• 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 SCRAMNe^ltTMgt, 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.

• 社団法人電子情報通信学会の論文
• 1996-02-25

著者

• Saito T

  Okayama Prefectural Univ. Okayama‐shi Jpn

• Aida Hitoshi

  The Faculty Of Engineering The University Of Tokyo

• Oguchi Masato

  The Faculty Of Engineering The University Of Tokyo:the Author Is Also With Research And Development

• SAITO Tadao

  the Faculty of Engineering, the University of Tokyo

• Saito Tadao

  The Faculty Of Engineering The University Of Tokyo

関連論文

• A Multi-Agent System for Dynamic Network Routing(IEICE/IEEE Joint Special Issue on Autonomous Decentralized Systems and Systems' Assurance)
• Analytical Approximate Derivation of BPSK-BER Characteristics in Adjacent Two Channels' Interference
• New Derivation Method of BPSK Bit Error Rate Performance in Cochannel Interference
• Radiation Characteristics of Antenna with External High-Impedance-Plane Shield(Special Issue on Microwave and Millimeter Wave Technology)
• B-6-17 A Scalable and High Capacity Router on Multi-Dimension Crossbar Switch Principle
• An Architecture for Large-Scale Multicast ATM Switching with Hybrid Routing
• A Connection-Level Design of Multistage Nonblocking ATM Switches
• A Nonblocking ATM Switch with Internal Link Partitioning Routing (Special Section of Letters Selected from the '92 Fall Conference and the '93 Spring Conference)
• A Request Cluster Allocation Method for DOCSIS CATV/HFC Networks(Network)
• A Proposition and Evaluation of DSM Models Suitable for a Wide Area Distributed Environment Realized on High Performance Networks

スポンサーリンク