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

SilkRoad II: mixed paradigm cluster computing with RC_dag consistency

PARALLEL COMPUTING 2003年第8期29卷 1091-1115页

作者： Peng, L Wong, WF Yuen, CK Natl Univ Singapore Dept Comp Sci Singapore 117543 Singapore

A parallel programming paradigm indicates the way to express applications. It also restricts the algorithms that may be used in the applications. Unfortunately, runtime systems for parallel computing often impose a particular programming paradigm. For a wider choice of algorithms, it is therefore desirable to support more than one paradigm. In this paper, we propose a formalism for modeling parallel programming paradigms from a graph-theoretic view of their execution instance dag and the memory consistency assumptions. This model allows us to formally reason about the properties of parallel programming paradigms that are hitherto only known informally and intuitively. We propose the concept of general paradigm and show that the single program multiple data, the divide and conquer, and the master/slave paradigms are all sub-sets of this general paradigm. We will also propose a super set of these three paradigms which we called the mixed paradigm and introduce the RC-dag memory consistency model. We also present our work on SilkRoad II, a variant of the Cilk runtime system for cluster computing. What is unique about SilkRoad II is its memory model which supports multiple paradigms with the underlying software distributed shared memory. Our experimental results show that the stronger RC-dag can achieve performance comparable to LC of Cilk while supporting a bigger set of paradigms with rather good performance. (C) 2003 Published by Elsevier B.V.

关键词： software distributed shared memory parallel programming paradigm memory consistency model directed acyclic graph

来源：评论

学校读者我要写书评

暂无评论

OpenMP for networks of SMPs

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2000年第12期60卷 1512-1530页

作者： Hu, YC Lu, HH Cox, AL Zwaenepoel, W Rice Univ Dept Comp Sci Houston TX 77005 USA Rice Univ Dept Elect & Comp Engn Houston TX 77005 USA

In this paper, we present the first system that implements OpenMP on a network of shared-memory multiprocessors. This system enables the programmer to rely on a single, standard, shared-memory API for parallelization within a multiprocessor and between multiprocessors. It is implemented via a translator that converts OpenMP directives to appropriate calls to a modified version of the TreadMarks software distributed shared-memory (SDSM) system. In contrast to previous SDSM systems for SMPs, the modified TreadMarks system uses POSIX threads for parallelism within an SMP node. This approach greatly simplifies the changes required to the SDSM in order to exploit the intranode hardware shared memory. We present performance results for seven applications (Barnes-Hut, CLU, and Water from SPLASH-2, 3D-FFT from NAS, Red-Black SOR, TSP, and MGS) running on an SP2 with four four-processor SMP nodes. A comparison between the thread implementation and the original implementation of TreadMarks shows that using the hardware shared memory within an SMP node significantly reduces the amount of data and the number of messages transmitted between nodes and consequently achieves speedups that are up to 30% better than the original versions. We also compare SDSM against message passing. Overall, the speedups or multithreaded TreadMarks programs are within 7-30% of the MPI versions. (C) 2000 Academic Press.

关键词： OpenMP shared memory programming POSIX threads networks of SMPs software distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Programmability and Performance of New Global-View Programming API for Multi-Node and Multi-Core Processing

Programmability and Performance of New Global-View Programmi...

引用

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)

作者： Sakaguchi, Yugo Midorikawa, Hiroko Seikei Univ Grad Sch Sci & Technol Tokyo Japan

ISBN: (纸本)9781728127941

Various partitioned global address space (PGAS) languages capable of providing global-view programming environments on multi-node computer systems have been proposed to improve programming productivity in high-performance computing. However, several PGAS languages often require a detailed description of the remote data access, similar to descriptions used in message passing interface one-sided communications. Some PGAS languages have limitations pertaining to remote data access and recommend their local-view programming models, rather than the global-view ones, due to performance-related reasons. In this study, we propose SMint, which is an application programming interface that provides a global-view programming model with a software distributed shared memory mSMS as the runtime. Using stencil computation as a typical processing method, the performance and programmability of SMint have been compared with those of XcalableMP and Unified Parallel C, which are well-known examples of PGAS languages based on the C language. It was found that SMint achieved the best performance under the ideal global-view programming model.

关键词： PGAS directive-based language API global-view programming global address space parallel language software distributed shared memory cluster shared memory programming multi-node processing programming model

来源：评论

学校读者我要写书评

暂无评论

MigThread: Thread migration in DSM systems

MigThread: Thread migration in DSM systems

引用

31st International Conference on Parallel Processing (ICPP 2002)

作者： Jiang, H Chaudhary, V Wayne State Univ Inst Comp Sci Detroit MI 48202 USA

ISBN: (纸本)0769516807

distributed shared memory (DSM) systems provide a logically shared memory over physically distributed memory to enable parallel computation on Networks of Workstations (NOWs), In this paper, we propose an infrastructure for DSM systems to utilize idle cycles in the network by thread migration. To maintain high portability and flexibility, a generic thread migration package, MigThread, is implemented at language level. At compile-time, a preprocessor scans C programs to build thread state, detects possible thread adaptation points, and transforms the source code accordingly. At runtime, MigThread moves DSM threads around to utilize idle cycles on remote machines, Since the physical thread state is transformed into a logical form, MigThread is ready to be used in heterogeneous DSM systems. We implemented MigThread in a DSM system Strings. A comparison with other migration schemes and some performance measurements on real applications are reported to show the efficiency.

关键词： software distributed shared memory adaptive parallel computing thread migration thread scheduling compile-time code transformations

来源：评论

学校读者我要写书评

暂无评论

CUDA-For-Clusters: A System for Efficient Execution of CUDA Kernels on Multi-core Clusters

引用

18th International Conference on Euro-Par Parallel Processing

作者： Prabhakar, Raghu Govindarajan, R. Thazhuthaveetil, Matthew J. Univ Calif Los Angeles Los Angeles CA 90095 USA Indian Inst Sci Supercomp Educ & Res Ctr Bangalore Karnataka India

ISBN: (纸本)9783642328206

Rapid advancements in multi-core processor architectures coupled with low-cost, low-latency, high-bandwidth interconnects have made clusters of multi-core machines a common computing resource. Unfortunately, writing good parallel programs that efficiently utilize all the resources in such a cluster is still a major challenge. Various programming languages have been proposed as a solution to this problem, but are yet to be adopted widely to run performance-critical code mainly due to the relatively immature software framework and the effort involved in re-writing existing code in the new language. In this paper, we motivate and describe our initial study in exploring CUDA as a programming language for a cluster of multi-cores. We develop CUDA-For-Clusters (CFC), a framework that transparently orchestrates execution of CUDA kernels on a cluster of multi-core machines. The well-structured nature of a CUDA kernel, the growing popularity, support and stability of the CUDA software stack collectively make CUDA a good candidate to be considered as a programming language for a cluster. CFC uses a mixture of source-to-source compiler transformations, a work distribution run-time and a light-weight software distributed shared memory to manage parallel executions. Initial results on running several standard CUDA benchmark programs achieve impressive speedups of up to 7.5X on a cluster with 8 nodes, thereby opening up an interesting direction of research for further investigation.

关键词： CUDA Multi-Cores distributed Programming distributed Systems Clusters software distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

The performance model of SilkRoad a multithreaded DSM system for clusters

The performance model of SilkRoad a multithreaded DSM system...

引用

3rd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid2003)

作者： Liang, P Wong, WF Yuen, CK Natl Univ Singapore Dept Comp Sci Singapore 117543 Singapore

ISBN: (纸本)0769519199

distributed shared memory (DSM) is a highly desirable programming model for cluster based computing. Even though a number of software DSMs have been developed with their performance evaluated, few of them have a theoretical performance model. In this paper we propose and analyze the performance model of the software DSM of SilkRoad, a multithreaded runtime system for cluster computing. SilkRoad is built on the Cilk system with an extended memory consistency model which we call RCdag consistency. Extending Cilk's theoretical performance model, we show that with the RCdag consistent DSM, the expected execution time T-P of a partially strict multithreaded computation on P processors is O((T-1 (Z, L) + N)/P + muHT(infinity)), where T-1(Z, L) is the total work of computation, T,,. is the critical path, N is the number of lock acquisitions, mu is the service time of a cache miss, and H is the height of memory. Finally, we present experimental evidence that verify the performance model.

关键词： software distributed shared memory memory consistency models theoretical performance model

来源：评论

学校读者我要写书评

暂无评论

Program development environment for OpenMP programs on ccNUMA architectures 3rd

引用

3rd International Conference on Large-Scale Scientific Computing (ICLSSC 2001)

作者： Chapman, B Hernandez, O Patil, A Prabhakar, A Univ Houston Dept Comp Sci Houston TX USA

ISBN: (纸本)3540430431

OpenMP is emerging as a viable high-level programming model for shared memory parallel systems. Although it has also been implemented on ccNUMA architectures, it is hard to obtain high performance on such systems. In this paper, we discuss various ways in which OpenMP may be used on ccNUMA and NUMA architectures, and describe a programming style that can provide scalable high performance on such systems. We give an example of its use on the SGI Origin 2000, and on TreadMarks, a software DSM system from Rice University. These results have encouraged us to work on a programming environment that provides general support for OpenMP application development and incorporates a system to translate standard loop-level parallel OpenMP code, with additional user input in the form of directives, into an equivalent OpenMP program relying on our alternative programming style. The equivalent program does not use constructs external to OpenMP.

关键词： shared memory parallel programming OpenMP ccNUMA architectures restructuring data locality data distribution software distributed shared memory programming environments

来源：评论

学校读者我要写书评

暂无评论

COMIC: A Coherent shared memory Interface for Cell BE

COMIC: A Coherent Shared Memory Interface for Cell BE

引用

17th International Conference on Parallel Architectures and Compilation Techniques

作者： Lee, Jaejin Seo, Sangmin Kim, Chihun Kim, Junghyun Chun, Posung Sura, Zehra Kim, Jungwon Han, SangYong Seoul Natl Univ Sch Engn & Comp Sci Seoul South Korea

ISBN: (纸本)9781605582825

The Cell BE processor is a heterogeneous multicore that contains one PowerPC Processor Element (PPE) and eight Synergistic Processor Elements (SPEs). Each SPE has a small software-managed local store. Applications must explicitly control all DMA transfers of code and data between the SPE local stores and the main memory, and they must perform any coherence actions required for data transferred. The need for explicit memory management, together with the limited size of the SPE local stores, makes it challenging to program the Cell BE and achieve high performance. In this paper, we present the design and implementation of our COMIC runtime system and its programming model. It provides the program with an illusion of a globally shared memory, in which the PPE and each of the SPEs can access any shared data item, without the programmer having to worry about where the data is, or how to obtain it. COMIC is implemented entirely in software with the aid of user-level libraries provided by the Cell SDK. For each rea or write operation in SPE code, a COMIC runtime function is inserted to check whether the data is available in its local store, and to automatically fetch it if it is not. We propose a memory consistency model and a programming model or COMIC, in which the management of synchronization and coherence is centralized in the PPE. To characterize the effectiveness of the COMIC runtime system, we evaluate it with twelve OpenMP benchmark applications on a Cell BE system and an SMP-like homogeneous multicore (Xeon).

关键词： software distributed shared memory software shared Virtual memory Heterogeneous Multicores OpenMP Cell BE

来源：评论

学校读者我要写书评

暂无评论

SAC Goes Cluster: Fully Implicit distributed Computing 33

SAC Goes Cluster: Fully Implicit Distributed Computing

引用

33rd IEEE International Parallel and distributed Processing Symposium (IPDPS)

作者： Macht, Thomas Grelck, Clemens Univ Amsterdam Grad Sch Informat Amsterdam Netherlands Univ Amsterdam Informat Inst Amsterdam Netherlands

ISBN: (纸本)9781728112466

SAC (Single Assignment C) is a purely functional, data-parallel array programming language that predominantly targets compute-intensive applications. Thus, clusters of workstations, or distributed memory architectures in general, form highly relevant compilation targets. Notwithstanding, SAC as of today only supports shared-memory architectures, graphics accelerators and heterogeneous combinations thereof. In our current work we aim at closing this gap. At the same time, we are determined to uphold SAC's promise of entirely compiler-directed exploitation of concurrency, no matter what the target architecture is. distributed memory architectures are going to make this promise a particular challenge. Despite SAC's functional semantics, it is generally far from straightforward to infer exact communication patterns from architecture-agnostic code. Therefore, we intend to capitalise on recent advances in network technology, namely the closing of the gap between memory bandwidth and network bandwidth. We aim at a solution based on a custom-designed software distributed shared memory (S-DSM) and large per-node software-managed cache memories. To this effect the functional nature of SAC with its write-once/read-only arrays provides a strategic advantage that we thoroughly exploit. Throughout the paper we further motivate our approach, sketch out our implementation strategy, show preliminary results and discuss the pros and cons of our approach.

关键词： Cluster computing auto-parallelisation software distributed shared memory Single Assignment C

来源：评论

学校读者我要写书评

暂无评论

Evaluation of emerging high speed networks on brazos software DSM system

Evaluation of emerging high speed networks on brazos softwar...

引用

8th International Conference on Parallel and distributed Systems (ICPADS 2001)

作者： Matsunaga, AM Tsugawa, MO Kofuji, ST Univ Sao Paulo Dept Elect Engn BR-05508900 Sao Paulo Brazil

ISBN: (纸本)0769511538

One of the factors that can influence the performance of a DSM system is the efficiency of multipoint access on interconnection network. This work presents an evaluation of Brazos System, a software implemented distributed shared memory (DSM) system designed for x86 SMP nodes running Windows NT and that takes advantage of multicast communication, with regard to different configurations of communication network: broadcast Fast Ethernet, switched Fast Ethernet and LANE-ATM. In this evaluation, although the bandwidth of the ATM is larger than the Fast Ethernet, a low performance using LANE-ATM was observed, compared to the Brazos System performance using broadcast or switched Fast Ethernet. It shows the importance of the communication subsystem and the necessity of improvements on aspects like multipoint access, which has been not much explored on networks like ATM.

关键词： software distributed shared memory network multicast

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：