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

Satin: A High-Level and Efficient Grid programming model

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2010年第3期32卷 9-9.39页

作者： Van Nieuwpoort, Rob V. Wrzesinska, Gosia Jacobs, Ceriel J. H. Bal, Henri E. Vrije Univ Amsterdam Fac Exacte Wetenschappen NL-1081 HV Amsterdam Netherlands Pointl Dev NL-3001 GC Rotterdam Netherlands

Computational grids have an enormous potential to provide compute power. However, this power remains largely unexploited today for most applications, except trivially parallel programs. Developing parallel grid applications simply is too difficult. Grids introduce several problems not encountered before, mainly due to the highly heterogeneous and dynamic computing and networking environment. Furthermore, failures occur frequently, and resources may be claimed by higher-priority jobs at any time. In this article, we solve these problems for an important class of applications: divide-and-conquer. We introduce a system called Satin that simplifies the development of parallel grid applications by providing a rich high-level programming model that completely hides communication. All grid issues are transparently handled in the runtime system, not by the programmer. Satin's programming model is based on Java, features spawn-sync primitives and shared objects, and uses asynchronous exceptions and an abort mechanism to support speculative parallelism. To allow an efficient implementation, Satin consistently exploits the idea that grids are hierarchically structured. Dynamic load-balancing is done with a novel cluster-aware scheduling algorithm that hides the long wide-area latencies by overlapping them with useful local work. Satin's shared object model lets the application define the consistency model it needs. If an application needs only loose consistency, it does not have to pay high performance penalties for wide-area communication and synchronization. We demonstrate how grid problems such as resource changes and failures can be handled transparently and efficiently. Finally, we show that adaptivity is important in grids. Satin can increase performance considerably by adding and removing compute resources automatically, based on the application's requirements and the utilization of the machines and networks in the grid. Using an extensive evaluation on real grids with

关键词： Languages Performance Grid computing divide-and-conquer programming model

来源：评论

学校读者我要写书评

暂无评论

A programming model performance study using the NAS parallel benchmarks

引用

SCIENTIFIC programming 2010年第3-4期18卷 153-167页

作者： Shan, Hongzhang Blagojevic, Filip Min, Seung-Jai Hargrove, Paul Jin, Haoqiang Fuerlinger, Karl Koniges, Alice Wright, Nicholas J. Univ Calif Berkeley Lawrence Berkeley Lab Computat Res Div Future Technol Grp Berkeley CA 94720 USA NASA Ames Res Ctr NAS Div Moffett Field CA 94035 USA Univ Calif Berkeley Dept EECS Div Comp Sci Berkeley CA 94720 USA Univ Calif Berkeley Lawrence Berkeley Lab NERSC Berkeley CA 94720 USA

Harnessing the power of multicore platforms is challenging due to the additional levels of parallelism present. In this paper we use the NAS Parallel Benchmarks to study three programming models, MPI, OpenMP and PGAS to understand their performance and memory usage characteristics on current multicore architectures. To understand these characteristics we use the Integrated Performance Monitoring tool and other ways to measure communication versus computation time, as well as the fraction of the run time spent in OpenMP. The benchmarks are run on two different Cray XT5 systems and an Infiniband cluster. Our results show that in general the three programming models exhibit very similar performance characteristics. In a few cases, OpenMP is significantly faster because it explicitly avoids communication. For these particular cases, we were able to re-write the UPC versions and achieve equal performance to OpenMP. Using OpenMP was also the most advantageous in terms of memory usage. Also we compare performance differences between the two Cray systems, which have quad-core and hex-core processors. We show that at scale the performance is almost always slower on the hex-core system because of increased contention for network resources.

关键词： programming model performance study UPC OpenMP MPI memory usage

来源：评论

学校读者我要写书评

暂无评论

Evidential Reasoning-Based Nonlinear programming model for MCDA Under Fuzzy Weights and Utilities

引用

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2010年第1期25卷 31-58页

作者： Zhou, Mi Liu, Xin-Bao Yang, Jian-Bo Hefei Univ Technol Sch Management Inst Decis Sci & Informat Syst Technol Hefei 230009 Anhui Peoples R China Univ Manchester Manchester Business Sch Manchester M15 6PB Lancs England

in a multiple-criteria decision analysis (MCDA) problem, qualitative information with subjective judgments of ambiguity is often provided by people, together with quantitative data that may also be imprecise or incomplete. There are several uncertainties that may be considered in an MCDA problem, such as fuzziness and ambiguity. The evidential reasoning (ER) approach is well suited for dealing with such MCDA problems and can generate comprehensive distributed assessments for different alternatives. Many researches in dealing with imprecise or uncertain belief structures have been conducted on the ER approach. In this paper, both triangular fuzzy weights of criteria and fuzzy utilities assigned to evaluation grades are introduced to the ER approach, which may be incurred in several circumstances such as group decision-making situation. The Hadamard multiplicative combination of judgment matrix is extended for the aggregation of triangular fuzzy judgment matrices, the result of which is applied as the fuzzy weights used in the fuzzy ER approach. The consistency of the aggregated triangular fuzzy judgment matrix is also proved. Several pairs of ER-based programming models are designed to generate the total fuzzy belief degrees and the overall expected fuzzy utilities for the comparison of alternatives. A numerical example is conducted to show the effectiveness of the proposed approach. (C) 2009 Wiley Periodicals, Inc.

关键词： Evidential Reasoning-Based programming model subjective judgments Erbium Judgment Public utilities Triangular Fuzzy

来源：评论

学校读者我要写书评

暂无评论

A Dynamic programming model of the Coordination between Forest and Socio-economy

A Dynamic Programming Model of the Coordination between Fore...

引用

International Conference on Applied Mechanics and Mechanical Engineering

作者： Ye, Tao Hangzhou Dianzi Univ Sch Management Hangzhou 310037 Zhejiang Peoples R China

ISBN: (纸本)9780878492459

Based on the illustration of the importance of the coordination between forest and socio-economy, a dynamic programming model aimed at the coordination is created and the basic characters of the functions in the model are discussed. A solution under a simple and ideal situation is studied, which results in the equation of the economic yield when forest coordinates with socio-economy and several other conclusions.

关键词： Dynamic programming model Forest Socio-economy

来源：评论

学校读者我要写书评

暂无评论

SysCellC: a data-flow programming model on multi-GPU

SysCellC: a data-flow programming model on multi-GPU

引用

International Conference on Computational Science (ICCS)

作者： Houzet, Dominique Huet, Sylvain Rahman, Anis CNRS GIPSA Lab F-38402 St Martin Dheres France

High performance computing with low cost machines becomes a reality with GPU. Unfortunately, high performances are achieved when the programmer exploits the architectural specificities of the GPU prefetching: he has to focus on inter-GPU communications, task allocations among the GPUs, task scheduling, external memory prefetching, and synchronization. In this paper, we propose and evaluate a compile flow. It automates the transformation of a program expressed with the high level system design language SystemC, to its implementation on a cluster of multi-GPU. SystemC constructs and schedualer are directly mapped to the GPU API, preserving their semantic. Inter-GPU communications are abstracted by means of SystemC channels. (C) 2010 Published by Elsevier Ltd.

关键词： programming model GPU SystemC

来源：评论

学校读者我要写书评

暂无评论

Efficient and Simplified Parallel Graph Processing over CPU and MIC 29

Efficient and Simplified Parallel Graph Processing over CPU ...

引用

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Chen, Linchuan Huo, Xin Ren, Bin Jain, Surabhi Agrawal, Gagan Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781479986484

Intel Xeon Phi (MIC architecture) is a relatively new accelerator chip, which combines large-scale shared memory parallelism with wide SIMD lanes. Mapping applications on a node with such an architecture to achieve high parallel efficiency is a major challenge. In this paper, we focus on developing a system for heterogeneous graph processing, which is able to utilize both a many-core Xeon Phi and a multi-core CPU on one node. We propose a simple programming API with an intuitive interface for expressing SIMD parallelism. We develop efficient techniques for supporting our high-level API, focusing on exploiting wide SIMD lanes, massive number of cores, and partitioning of the work across CPU and accelerator, while handling the irregularity of graph applications. The components of our runtime system include a condensed static memory buffer, which supports efficient message insertion and SIMD message reduction while keeping memory requirements low, and specifically for MIC, a pipelining scheme for efficient message generation by avoiding frequent locking operations. Besides, a hybrid graph partitioning module is able to effectively partition the workload between the CPU and the MIC, ensuring balanced workload and low communication overhead. The main observations from our experimental evaluation using five popular applications are: for MIC executions, pipelining scheme is up to 3.36x faster than a naive approach using locking based message generation, and the speedup over OpenMP ranges from 1.17 to 4.15. Heterogeneous CPU-MIC execution achieves a speedup of up to 1.41 over the better of the CPU-only and MIC-only executions.

关键词： CPU Graph Processing Intel MIC programming model

来源：评论

学校读者我要写书评

暂无评论

Scalable Embedded Systems: Towards the Convergence of High-Performance and Embedded Computing 13

Scalable Embedded Systems: Towards the Convergence of High-P...

引用

13th International Conference on Embedded and Ubiquitous Computing (EUC 2015)

作者： Giorgi, Roberto Univ Siena Siena Italy

ISBN: (纸本)9781467382991

Embedded System toolchains are highly customized for a specific System-on-Chip (SoC). When the application needs more performance, the designer is typically forced to adopt a new SoC and possibly another toolchain. The rationale for not scaling performance by using, e.g., two SoCs, is that maintining most of the operations on-chip may allow for higher energy efficiency. We are exploring the feasibility and trade-offs of designing and manufacturing a new Single Board Computer (SBC) that could serve flexibly for a number of current and future applications, by allowing scalability through clusters of SBCs while keeping the same programming model for the SBC. This board is based on FPGAs and embedded processors, and its key points are: i) a fast custom interconnect for board-to-board communication and ii) an easily programmable environment which would allow both the off-loading of code into accelerators (either soft-IP blocks or hard-IP blocks) and, at the same time, the distribution of computation across boards. A key challenge to successfully deploying this paradigm is to properly distribute the threads across several boards without the explicit intervention of the programmer. In this paper we describe how to dynamically and efficiently distribute the computational threads in symbiosis with an appropriate memory model to allow the system scalability, so that we can double the performance by simply connecting two boards without i) changing the basic hardware components (e.g., to a different System-On-Chip) and ii) changing the programming model to follow the vendor specific toolchain. Our approach is to reduce data movement across boards. Our initial experiments have confirmed the feasibility of our approach.

关键词： Cyber-Physical Systems Reconfigurable Systems Cluster programming FPGA programming Distributed Shared Memory programming model Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

Capsule-oriented programming 37

Capsule-oriented Programming

引用

IEEE/ACM 2nd International Workshop on Software Architecture and Metrics (SAM)

作者： Rajan, Hridesh Iowa State Univ Sci & Technol Dept Comp Sci Ames IA 50010 USA

ISBN: (纸本)9781479919345

"Explicit concurrency should be abolished from all higher-level programming languages (i.e. everything except - perhaps-plain machine code.)." Dijkstra [1] (paraphrased). A promising class of concurrency abstractions replaces explicit concurrency mechanisms with a single linguistic mechanism that combines state and control and uses asynchronous messages for communications, e.g. active objects or actors, but that doesn't remove the hurdle of understanding non-local control transfer. What if the programming model enabled programmers to simply do what they do best, that is, to describe a system in terms of its modular structure and write sequential code to implement the operations of those modules and handles details of concurrency? In a recently sponsored NSF project we are developing such a model that we call capsule-oriented programming and its realization in the Panini project. This model favors modularity over explicit concurrency, encourages concurrency correctness by construction, and exploits modular structure of programs to expose implicit concurrency.

关键词： Capsules Concurrency abstraction Implicit concurrency Modular structure Modularity programming model

来源：评论

学校读者我要写书评

暂无评论

High-Performance Coarray Fortran Support with MVAPICH2-X: Initial Experience and Evaluation 29

High-Performance Coarray Fortran Support with MVAPICH2-X: In...

引用

29th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Lin, Jian Hamidouche, Khaled Lu, Xiaoyi Li, Mingzhe Panda, Dhabaleswar K. (D K) Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9781467376846

Coarray Fortran (CAF) is a parallel programming paradigm that extends Fortran for the partitioned global address space (PGAS) programming model at the language level. The current runtime implementations of CAF are mainly using MPI or GASNet as underlying communication components. MVAPICH2-X is a hybrid MPI+PGAS programming library with a Unified Communication Runtime (UCR) design. In this paper, the classic implementation of CAF runtime in OpenUH is redesigned and rebuilt on top of MVAPICH2-X. The proposed design does not only enable the support of MPI+CAF hybrid programming model, but also provides superior performance on most of the CAF one-sided operations and the newly proposed collective operations in Fortran 2015 specification. A comprehensive evaluation with different benchmarks and applications has been performed. Comparing with current GASNet-based solutions, the CAF runtime with MVAPICH2-X can improve the bandwidths of put and bidirectional operations up to 3.5X for inter-node communication, and improve the bandwidths of collective communication operations represented by broadcast up to 3.0X on 64 processes. It also reduces the execution time of NPB CAF benchmarks by up to 18% on 256 processes.

关键词： CAF MPI MVAPICH2 PGAS programming model

来源：评论

学校读者我要写书评

暂无评论

A Survey on Big Data Storage Strategies 1

A Survey on Big Data Storage Strategies

引用

International Conference on Green Computing and Internet of Things (ICGCIoT)

作者： Gazal Kaur, Pankaj Deep Guru Nanak Dev Univ Reg Campus Dept Comp Sci Jalandhar India

ISBN: (纸本)9781467379106

Over the last decade the enterprises across public and personal entities have made strategic determination to change big data into useful advantage. Big data used to describe the large and complex set of both structured and unstructured data range in the size of exabytes (10(16)) and quintillions. Such amount of data surpassed the potential of present online storage systems and computing systems. Big data is being produced at alarming rate which is driven by individuals and their increased used of media, organizations, the switch from analogue to digital technologies, the expansion of internet connected devices and systems. Such the swelling of big data will approach the zettabyte per year range with in a little time period. The one major characteristic of big data is volume;other characteristics are velocity and variety. The storage issue seems to be easily handled in the recent session but shows a tedious session challenges. Big Data technologies explains the new batch of storage technologies and new framework proposed to monetarily extricate the useful information from the huge amount of unstructured data.

关键词： Big data Distributed system File system Database technologies programming model Hadoop

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：