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

IEEE Global Telecommunications Conference (GLOBECOM 06)

作者： Hua, Nan Xu, Yang Wang, Peng Jin, Depeng Zeng, Lieguang Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Informat Engn Univ Zhengzhou 450002 Peoples R China

ISBN: (纸本)9781424403561

Emulating Output Queued (OQ) Switch with sustainable implementation cost and low fixed delay is always preferable in designing high performance routers. The Switch-memory-Switch (SMS) router, also called distributed shared memory (DSM) Switch, provides a possible way towards practically emulating OQ in backbone switches. However, the architectures and algorithms for SMS switches ever proposed are either unpractical or only supporting First-Come-First-Serve (FCFS) scheduling policy, which cannot support QoS and is unfair for light traffic flow. Our improved SMS architecture and algorithm aim at emulating Push-In-First-Out (PIFO) OQ. We employ a randomly-dispatching first stage and resolve memory access conflictions on the second stage of the switch through a probabilistic matching method, at the cost of fixed delay and sufficiently low cell loss probability (P-CLP). The relative fixed delay of our algorithms for an NxN switch is composed of two parts: N and (-3/2log(2)P(CLP)), which result from the pipelined scheduling process and probabilistic method, respectively. Moreover, both the total memory and fabric bandwidth of our architecture implemented on crossbar could be lowered to only 2NR, where R is line rate, counting read and write separately.

关键词： Switch-memory-Switch distributed shared memory Load-balanced Emulating PIFO OQ

来源：评论

学校读者我要写书评

暂无评论

How uniform is the structure of ability across childhood?

引用

EUROPEAN JOURNAL OF DEVELOPMENTAL PSYCHOLOGY 2009年第4期6卷 432-454页

作者： Dyck, Murray J. Piek, Jan P. Kane, Robert Patrick, Jeff Griffith Univ Sch Psychol Gold Coast Qld 9726 Australia Curtin Univ Technol Perth WA Australia Univ So Queensland Toowoomba Qld 4350 Australia

The DSM-IV implicitly assumes that development is uniform across ability domains, which implies that relationships between ability measures do not differ across development. We assessed whether correlations between measures of nine ability constructs differed across samples of children aged 3-5 (n = 117), 6-8 (n = 116), 9-11 (n = 124) and 12-14 years (n = 92). LISREL analyses show that correlations in each age group differ from those of each other age group. Parallel analyses indicate that the latent structure of ability differs across age groups. We conclude that shared maturational processes, including changes in the connectivity of neural systems, are responsible for decreasingly and increasingly strong relationships between some ability measures.

关键词： distributed shared memory CHILD development AGE distribution (Demography) INTERPERSONAL relations CORRELATION (Statistics)

来源：评论

学校读者我要写书评

暂无评论

Intrusion-Tolerant shared memory through a P2P Overlay Segmentation

Intrusion-Tolerant Shared Memory through a P2P Overlay Segme...

引用

26th IEEE International Conference on Advanced Information Networking and Applications (AINA)

作者： Boeger, Davi da Silva Fraga, Joni Alchieri, Eduardo Wangham, Michelle Univ Fed Santa Catarina Dept Automat & Syst Engn Florianopolis SC Brazil Univ Vale Itajai Embedded & Distributed Syst Grp Sao Jose Dos Campos Brazil

ISBN: (纸本)9780769546513

This paper describes our experience in developing an infrastructure which allows building intrusion-tolerant shared memory for large-scale systems. The infrastructure makes use of a P2P overlay and of the concept of State Machine Replication (SMR). Segmentation is introduced on the overlay key space to allow the use of algorithms for SMR. In this paper we describe the proposed infrastructure in its stratification and corresponding algorithms. An analysis about the algorithms and their costs is also presented.

关键词： instrusion-tolerance peer-to-peer networks distributed shared memory state machine replication

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable interconnects in DSM systems: A focus on context switch behavior

引用

ISPA 2006 International Conference

作者： Artundo, I. Manjarres, D. Heirman, W. Debaes, C. Dambre, J. Van Campenhout, J. Thienpont, H. Vrije Univ Brussels Dept Appl Phys & Photon TONA Pleinlaan 2 B-1050 Brussels Belgium Genet Unit Elect & Informat Syst Dept B-9000 Ghent Belgium

ISBN: (纸本)9783540498605

Recent advances in the development of reconfigurable optical interconnect technologies allow for the fabrication of low cost and run-time adaptable interconnects in large distributed shared-memory (DSM) multiprocessor machines. This can allow the use of adaptable interconnection networks that alleviate the huge bottleneck present due to the gap between the processing speed and the memory access time over the network. In this paper we have studied the scheduling of tasks by the kernel of the operating system (OS) and its influence on communication between the processing nodes of the system, focusing on the traffic generated just after a context switch. We aim to use these results as a basis to propose a potential reconfiguration of the network that could provide a significant speedup.

关键词： reconfiguration interconnection network distributed shared memory multiprocessors context switch

来源：评论

学校读者我要写书评

暂无评论

Optimistic synchronization and transactional consistency

Optimistic synchronization and transactional consistency

引用

2nd IEEE/ACM International Symposium on Cluster Computing and the Grid

作者： Wende, M Schoettner, M Goeckelmann, R Bindhammer, T Schulthess, P Univ Ulm Dept Distributed Syst Ulm Germany

ISBN: (纸本)0769515827

distributed shared memory (DSM) is an interesting alternative to build distributed object system. Explicit message passing and remote invocation is replaced by the simple and unified DSM abstraction. The recurrent performance drawbacks of DSM Systems are often caused by expensive distributed locking mechanisms. In response to this our multi purpose Plurix Operating System (OS) implements a transaction based DSM. memory consistency is maintained by atomic transactions and optimistic synchronization mechanisms which have been used in database technology in the past. Such a transaction based DSM with optimistic synchronization guarantees a sequential consistent view on the shared data to every, node in the cluster.

关键词： distributed shared memory operating systems memory consistency transactions

来源：评论

学校读者我要写书评

暂无评论

Using Traditional Data Analysis Algorithms to Detect Access Patterns for Big Data Processing

Using Traditional Data Analysis Algorithms to Detect Access ...

引用

15th IEEE International Conference on High Performance Computing and Communications (HPCC) /11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Zhao, Jiaqi Tao, Jie Wang, Lizhe Ranjan, Rajiv Kolodziej, Joanna Changchun Univ Technol Sch Basic Sci Changchun Jilin Peoples R China Karlsruhe Inst Technol Steinbuch Ctr Comp D-76021 Karlsruhe Germany Chinese Acad Sci Inst Remote Sensing & Digital Earth Beijing 100864 Peoples R China Commonwealth Sci & Ind Res Org ICT Ctr Clayton Vic Australia Cracow Univ Technol Inst Comp Sci Krakow Poland

ISBN: (纸本)9780769550886

The data sets produced in our daily life is getting larger and larger. How to manage and analyze such big data is currently a grand challenge for scientists in various research fields. MapReduce is regarded as an appropriate programming model for processing such big data. However, the users or developers still need to efficiently program appropriate data processing actions related to their analytics requirements. In other words analytics actions in MapReduce is not portable across different big data types. In this paper we propose to adopt traditional data clustering algorithms to automatically analyze large data sets. We applied this approach to process performance data on distributed shared memory machines for detecting the application access patterns. The advantage is that application developers need not write codes to understand the runtime access behavior of their applications. We optimized several benchmark applications based on the analysis results and the experiments show a considerable improvement in terms of execution time and speedup.

关键词： Data Analysis memory Performance Data Locality distributed shared memory Code Optimization

来源：评论

学校读者我要写书评

暂无评论

A performance comparison of DSM, PVM, and MPI

A performance comparison of DSM, PVM, and MPI

引用

4th International Conference on Parallel and distributed Computing, Applications and Technologies (PDCAT 2003)

作者： Werstein, P Pethick, M Huang, ZY Univ Otago Dunedin New Zealand

ISBN: (纸本)0780378407

We compare the performance of the Treadmarks DSM system with two popular message passing systems (PVM and MPI). The comparison is done on 1, 2, 4, 8, 16, 24, and 32 nodes. Applications are chosen to represent three classes of problems: loosely synchronous, embarrassingly parallel, and synchronous. The results show DSM has similar performance to message passing for the embarrassingly parallel class. However, the performance of DSM is lower than PVM and MPI for the synchronous and loosely synchronous classes of problems. An analysis of the reasons is presented.

关键词： distributed shared memory distributed computing PVM MPI

来源：评论

学校读者我要写书评

暂无评论

Experiments with parallelizing a tribology application

Experiments with parallelizing a tribology application

引用

31st International Conference on Parallel Processing (ICPP 2002)

作者： Chaudhary, V Hase, WL Jiang, H Sun, L Thakert, D Wayne State Univ Inst Comp Sci Detroit MI 48202 USA

ISBN: (纸本)0769516807

Different parallelization methods vary in their system requirements, programming styles, efficiency of exploring parallelism, and the application characteristics they can handle. Different applications can exhibit totally different performance gains depending on the parallelization method used. This paper compares OpenMP, MPI, and Strings(A distributed shared memory)for parallelizing a complicated tribology problem. The problem size and computing infrastructure are changed and their impacts on the parallelization methods are studied. All of the methods studied exhibit good performance improvements. This paper exhibits the benefits that are the result of applying parallelization techniques to applications in this field.

关键词： molecular dynamics OpenMP MPI distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

View-based consistency and its implementation

View-based consistency and its implementation

引用

1st IEEE/AMC International Symposium on Cluster Computing and the Grid

作者： Huang, Z Sun, C Cranefield, S Purvis, M Univ Otago Dept Comp & Informat Sci Dunedin New Zealand

ISBN: (纸本)0769510108;0769510116

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.

关键词： distributed shared memory Sequential Consistency false sharing

来源：评论

学校读者我要写书评

暂无评论

The thread migration mechanism of DSM-PEPE

The thread migration mechanism of DSM-PEPE

引用

7th International Conference on Algorithms and Architectures for Parallel Processing

作者： Meza, Federico Ruz, Cristian Univ Talca Dept Ciencia Computac Camino Los Niches Km 1 Curico Chile Univ Diego Portales Ejercito 441 Escuela Ingenie Informat Santiago Chile

ISBN: (纸本)9783540729044

In this paper we present the thread migration mechanism of DSM-PEPE, a multithreaded distributed shared memory system. DSM systems like DSM-PEPE provide a parallel environment to harness the available computing power of computer networks. DSM systems offer a virtual shared memory space on top of a distributed-memory multicomputer, featuring the scalability and low cost of a multicomputer, and the ease of programming of a shared-memory multiprocessor. DSM systems rely on data migration to make data available to running threads. The thread migration mechanism of DSM-PEPE was designed as an alternative to this data migration paradigm. Threads are allowed to migrate from one node to another, as needed by the computation. We show by experimentation the feasibility of the thread migration mechanism of DSM-PEPE as an alternative to improve application perfomance by enhancing spatial locality.

关键词： thread migration distributed shared memory multithreading spatial locality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：