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

20th Telecommunications Forum

作者： Hussein, Abd El-Fattah Ibrahim, Osman Arab Acad Mari Transport & Technol AAST Fac Engn Cairo Egypt British Univ Egypt BUE Fac Comp Sc & Informat Cairo Egypt

ISBN: (纸本)9781467329842;9781467329835

Cloud computing is the delivery of computing as a service rather than a product, whereby shared resources, software, and information are provided to computers and other devices as a utility over a network (typically the Internet). Erlang programming Language is a perfect fit for cloud computing, not only for developing applications, but also for powering cloud infrastructure. In this paper we propose two frameworks employing Erlang programming language for building reliable and scalable cloud applications using Erlang features and its related components and libraries. Erlang native features of directly supporting distribution, fault tolerance will help write, deploy, and run applications easily in the cloud.

关键词： Cloud Computing concurrent programming Distribution Computation Erlang programming Language

来源：评论

学校读者我要写书评

暂无评论

Competitors or Cousins? Studying the Parallels between Distributed programming Languages SystemJ and IEC61499 19

Competitors or Cousins? Studying the Parallels between Distr...

引用

19th IEEE International Conference on Emerging Technology and Factory Automation (ETFA)

作者： Sinha, Roopak Vyatkin, Valeriy Salcic, Zoran Park, Hee Jong Auckland Univ Technol Comp & Math Sci Auckland New Zealand Lulea Univ Technol S-95187 Lulea Sweden Aalto Univ Helsinki Finland Univ Auckland Elect & Comp Engn Auckland 1 New Zealand

ISBN: (纸本)9781479948451

We face a glut of languages for programming distributed software today. However, only a few languages have proven their potential with wider practical use in different domains of computing. We picked two such languages, meant for different domains, to see if they could cross-pollinate and enrich one another. Specifically, we chose SystemJ, a language to program distributed embedded systems, and IEC61499, the next generation standard for distributed industrial automation control software. Unsurprisingly, we found similar structures and artifacts between the two. We also found significant differences mainly due to differing domain-specific requirements. This comparison leads to observations and guidelines for improving both languages, and we discuss directions towards an "ideal" distributed software programming language.

关键词： IEC 61499 SystemJ distributed programming concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Single and Multiple Thread programming for Geo-visualization by Using WebGL with Web Workers

Single and Multiple Thread Programming for Geo-visualization...

引用

World Congress on Engineering and Computer Science

作者： Kim, Hyung Woo Lee, Yang-Won Pukyong Natl Univ Pusan South Korea

ISBN: (纸本)9789881925237

So far, various web elements and web environments have contributed to Web GIS as alternative technologies of existing GIS technologies. Map and web services such as Google Maps and Google Earth appeared as main components of web GIS and they still used as favorite services by general people who don't even know about GIS well. However, there is limit on visualizing raster data on web browser because of limit of raster data as image. Most geo-browsers like Google Earth still handle raster data as image and this causes limitation of expressiveness because delicate expression of raster on Google Earth is impossible. So WebGL which supports 3d graphic library is suggested as an alternative technology and diverse studies suggest WebGL application as result of them. But if we use WebGL as client, huge size of raster data causes overload during execution procedure. To secure operational efficiency on web environments, concurrent process is needed to use each core effectively. In this paper, to develop the method for visualizing raster by WebGL, we designed the processing which displays raster data on a Web browser as it preprocesses them by building shaders and dividing data. And to check efficiency of concurrent environment, we applied single and concurrent thread to the visualizing process and performed benchmarking between single and concurrent environments by comparing the visualizing processes in different environment variables.

关键词： concurrent programming 3D Visualization WebGL Web Worker Web GIS Benchmarking

来源：评论

学校读者我要写书评

暂无评论

The OpenMP Cluster programming Model 51

The OpenMP Cluster Programming Model

引用

51st International Conference on Parallel Processing (ICPP)

作者： Yviquel, Herve Pereira, Marcio Francesquini, Emilio Valarini, Guilherme Leite, Gustavo Rosso, Pedro Ceccato, Rodrigo Cusihualpa, Carla Dias, Vitoria Rigo, Sandro Souza, Alan Araujo, Guido Univ Campinas UNICAMP Campinas Brazil Petrobras SA Rio De Janeiro Brazil

ISBN: (纸本)9781450394451

Despite the various research initiatives and proposed programming models, efficient solutions for parallel programming in HPC clusters still rely on a complex combination of different programming models (e.g., OpenMP and MPI), languages (e.g., C++ and CUDA), and specialized runtimes (e.g., Charm++ and Legion). On the other hand, task parallelism has shown to be an efficient and seamless programming model for clusters. This paper introduces OpenMP Cluster (OMPC), a task-parallel model that extends OpenMP for cluster programming. OMPC leverages OpenMP's offloading standard to distribute annotated regions of code across the nodes of a distributed system. To achieve that it hides MPI-based data distribution and load-balancing mechanisms behind OpenMP task dependencies. Given its compliance with OpenMP, OMPC allows applications to use the same programming model to exploit intra- and internode parallelism, thus simplifying the development process and maintenance. We evaluated OMPC using Task Bench, a synthetic benchmark focused on task parallelism, comparing its performance against other distributed runtimes. Experimental results show that OMPC can deliver up to 1.53x and 2.43x better performance than Charm++ on CCR and scalability experiments, respectively. Experiments also show that OMPC performance weakly scales for both Task Bench and a real-world seismic imaging application.

关键词： Parallel programming concurrent programming HPC

来源：评论

学校读者我要写书评

暂无评论

DEFINITION AND IMPLEMENTATION OF A FLEXIBLE COMMUNICATION PRIMITIVE FOR DISTRIBUTED-programming

DEFINITION AND IMPLEMENTATION OF A FLEXIBLE COMMUNICATION PR...

引用

IFIP WG10.3 Working Conference on Applications in Parallel and Distributed Computing

作者： MOSTEFAOUI, A RAYNAL, M

ISBN: (纸本)0444818707

Distributed programming has to face problems due to asynchronism of underlying communication networks. If for some applications the only use of FIFO channels eliminates the undesired effects due to asynchronism, this is generally not sufficient. Total or causal order of deliveries of messages have been proposed to overcome such problems but in some cases these orders impose a too strong property that can reduce the potential parallelism of the application. This paper proposes a flexible broadcast primitive that attaches a type (ordinary or causal) to each message;these types impose constraints on messages deliveries. In that way the programmer is able to exploit the potential parallelism of his application in order to get an efficient program. All causal messages obey causal delivery whereas ordinary messages deliveries are only constrained by their position (sending time) with respect to causal messages. A protocol implementing these communication primitives is given and proved. Extensions are suggested.

关键词： concurrent programming LANGUAGE CONSTRUCTS AND FEATURES COMMUNICATIONS MANAGEMENT

来源：评论

学校读者我要写书评

暂无评论

programming COMMUNICATING DISTRIBUTED REACTIVE AUTOMATA - THE WEAK SYNCHRONOUS PARADIGM

PROGRAMMING COMMUNICATING DISTRIBUTED REACTIVE AUTOMATA - TH...

引用

IFIP WG10.3 International Conference on Decentralized and Distributed Systems (ICDDS 93)

作者： BONIOL, F ADELANTADO, M

ISBN: (纸本)0444817913

The aim of this paper is to present a new paradigm for reactive and real-time distributed programming: weak synchronism. We define a small language for communicating reactive automata, and characterize it by an operational semantics. We show that weak synchronism provides a deterministic semantics of concurrency and allows physical distributed implementations. This weak synchronous paradigm can then be extended to real-time programming, by defining a more general paradigm, a strong-weak synchronous coupling.

关键词： concurrent programming SEMANTICS OF programming LANGUAGES FORMAL LANGUAGES

来源：评论

学校读者我要写书评

暂无评论

DVM: A Big Virtual Machine for Cloud Computing

引用

IEEE TRANSACTIONS ON COMPUTERS 2014年第9期63卷 2245-2258页

作者： Ma, Zhiqiang Sheng, Zhonghua Gu, Lin Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China

As cloud-based computation grows to be an increasingly important paradigm, providing a general computational interface to support datacenter-scale programming has become an imperative research agenda. Many cloud systems use existing virtual machine monitor (VMM) technologies, such as Xen, VMware, and Windows Hypervisor, to multiplex a physical host into multiple virtual hosts and isolate computation on the shared cluster platform. However, traditional multiplexing VMMs do not scale beyond one single physical host, and it alone cannot provide the programming interface and cluster-wide computation that a datacenter system requires. We design a new instruction set architecture, DISA, to unify myriads of compute nodes to form a big virtual machine called DVM and present programmers the view of a single computer, where thousands of tasks run concurrently in a large, unified, and snapshotted memory space. The DVM provides a simple yet scalable programming model and mitigates the scalability bottleneck of traditional distributed shared memory systems. Along with an efficient execution engine, the capacity of a DVM can scale up to support large clusters. We have implemented and tested DVM on four platforms, and our evaluation shows that DVM has excellent performance and scalability. On one physical host, the system overhead of DVM is comparable to that of traditional VMMs. On 16 physical hosts, the DVM runs 10 times faster than MapReduce/Hadoop and X10. On 160 compute nodes in the TH-1/GZ supercomputer, the DVM delivers a 12.99x speedup over the computation on 10 compute nodes. The implementation of DVM also allows it to run above traditional VMMs, and we verify that DVM shows linear speedup on a parallelizable workload on 256 large EC2 instances.

关键词： Distributed systems concurrent programming datacenter virtualization cloud computing

来源：评论

学校读者我要写书评

暂无评论

Concurrency and Message Passing in Erlang

引用

COMPUTING IN SCIENCE & ENGINEERING 2012年第6期14卷 24-34页

作者： Vinoski, Steve Basho Technologies

Developers use the open source Erlang programming language in domains such as telecommunications, database systems, and the Web due to its superior support for concurrency and reliability. Erlang applications comprise numerous processes-lightweight user-space threads-that communicate via message passing. This article focuses on Erlang's concurrency support and details an example 1D Poisson solver program.

关键词： Welding concurrent Computing programming Telecommunications Reliability Syntactics Pattern Matching Scientific Computing Applicative Functional programming concurrent programming programming Paradigms concurrent Languages Distributed Languages Parallel Languages

来源：评论

学校读者我要写书评

暂无评论

Formal methods applied to high-performance computing software design: a case study of MPI one-sided communication-based locking

引用

SOFTWARE-PRACTICE & EXPERIENCE 2010年第1期40卷 23-43页

作者： Pervez, Salman Gopalakrishnan, Ganesh Kirby, Robert M. Thakur, Rajeev Gropp, William Univ Utah Sch Comp Salt Lake City UT 84112 USA Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Argonne Natl Lab Div Math & Comp Sci Argonne IL 60439 USA Univ Illinois Dept Comp Sci Urbana IL 61801 USA

There is a growing need to address the complexity of verifying the numerous concurrent protocols employed in the high-performance Computing software. Today's approaches for verification consist of testing detailed implementations of these protocols. Unfortunately, this approach can seldom show the absence of bugs, and often results in serious bugs escaping into the deployed software. An approach called Model Checking has been demonstrated to be eminently helpful in debugging these protocols early in the software life cycle by offering the ability to represent and exhaustively analyze simplified formal protocol models. The effectiveness of model checking has yet to be adequately demonstrated in high-performance computing. This paper presents a case study of a concurrent protocol that was thought to be sufficiently well tested, but proved to contain two very non-obvious deadlocks in them. These bugs were automatically detected through model checking. The protocol models in which these bugs were detected were also easy to create. Recent work in Our group demonstrates that even this tedium of model creation can be eliminated by employing dynamic source-code-level analysis methods. Our case study comes from the important domain of Message Passing Interface (MPI)-based programming, which is universally employed for simulating and predicting anything from the structural integrity of combustion chambers to the path of hurricanes. We argue that model checking must be taught as well as used widely within HPC, given this and similar success stories. Copyright (C) 2009 John Wiley & Sons, Ltd.

关键词： concurrent programming formal verification model checking race condition SPIN dynamic analysis high-performance computing (HPC) Message Passing Interface (MPI) one-sided communication

来源：评论

学校读者我要写书评

暂无评论

Hazard pointers: Safe memory reclamation for lock-free objects

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2004年第6期15卷 491-504页

作者： Michael, MM IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA

Lock-free objects offer significant performance and reliability advantages over conventional lock-based objects. However, the lack of an efficient portable lock-free method for the reclamation of the memory occupied by dynamic nodes removed from such objects is a major obstacle to their wide use in practice. This paper presents hazard pointers, a memory management methodology that allows memory reclamation for arbitrary reuse. It is very efficient, as demonstrated by our experimental results. It is suitable for user-level applications-as well as system programs-without dependence on special kernel or scheduler support. It is wait-free. It requires only single-word reads and writes for memory access in its core operations. It allows reclaimed memory to be returned to the operating system. In addition, it offers a lock-free solution for the ABA problem using only practical single-word instructions. Our experimental results on a multiprocessor system show that the new methodology offers equal and, more often, significantly better performance than other memory management methods, in addition to its qualitative advantages regarding memory reclamation and independence of special hardware support. We also show that lock-free implementations of important object types, using hazard pointers, offer comparable performance to that of efficient lock-based implementations under no contention and no multiprogramming, and outperform them by significant margins under moderate multiprogramming and/or contention, in addition to guaranteeing continuous progress and availability, even in the presence of thread failures and arbitrary delays.

关键词： lock-free synchronization concurrent programming memory management multiprogramming dynamic data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：