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

33rd IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Zuo, Zhiqiang Gu, Rong Jiang, Xi Wang, Zhaokang Huang, Yihua Wang, Linzhang Li, Xuandong Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China

ISBN: (纸本)9781728112466

Static program analysis is widely used in various application areas to solve many practical problems. Although researchers have made significant achievements in static analysis, it is still too challenging to perform sophisticated interprocedural analysis on large-scale modern software. The underlying reason is that interprocedural analysis for large-scale modern software is highly computation- and memory-intensive, leading to poor scalability. We aim to tackle the scalability problem by proposing a novel big data solution for sophisticated static analysis. Specifically, we propose a data-parallel algorithm and a join-process-filter computation model for the CFL-reachability based interprocedural analysis and develop an efficient distributed static analysis engine in the cloud, called BigSpa. Our experiments validated that BigSpa running on a cluster scales greatly to perform precise interprocedural analyses on millions of lines of code, and runs an order of magnitude or more faster than the existing state-of-the-art analysis tools.

关键词： Interprocedural static analysis distributed systems data-parallel computation

来源：评论

学校读者我要写书评

暂无评论

On Closed Nesting and Checkpointing in Fault-Tolerant distributed Transactional Memory

On Closed Nesting and Checkpointing in Fault-Tolerant Distri...

引用

IEEE 27th international parallel and distributed Processing symposium (IPDPS)

作者： Dhoke, Aditya Ravindran, Binoy Zhang, Bo Virginia Tech ECE Dept Blacksburg VA 24061 USA

ISBN: (纸本)9780769549712

We consider the closed nesting and checkpointing model for transactions in fault-tolerant distributed transactional memory (DTM). The closed nested model allows inner-nested transactions to be aborted (in the event of a transactional conflict) without aborting the parent transaction, while checkpointing allows transactions to rollback to a previous execution state, potentially improving concurrency over flat nesting. We consider a quorum-based replicated model for fault-tolerant DTM, and present algorithms to support closed nesting and checkpointing. The algorithms use incremental validation to avoid communication overhead on commit, and ensure 1-copy equivalence. Our experimental studies using a Java DTM implementation of the algorithms on micro and macro benchmarks reveal the conditions when they improve transactional throughput over flat nesting, and also their relative advantages and disadvantages.

关键词： software transactional memory distributed systems replication closed nesting checkpointing

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Adaptive parallel and distributed Simulation 16

Fault-Tolerant Adaptive Parallel and Distributed Simulation

引用

20th IEEE/ACM international symposium on distributed Simulation and Real Time Applications (DS-RT)

作者： D'Angelo, Gabriele Ferretti, Stefano Marzolla, Moreno Armaroli, Lorenzo Univ Bologna Dept Comp Sci & Engn I-40126 Bologna Italy

ISBN: (纸本)9781509035052

Discrete Event Simulation is a widely used technique that is used to model and analyze complex systems in many fields of science and engineering. The increasingly large size of simulation models poses a serious computational challenge, since the time needed to run a simulation can be prohibitively large. For this reason, parallel and Distributes Simulation techniques have been proposed to take advantage of multiple execution units which are found in multicore processors, cluster of workstations or HPC systems. The current generation of HPC systems includes hundreds of thousands of computing nodes and a vast amount of ancillary components. Despite improvements in manufacturing processes, failures of some components are frequent, and the situation will get worse as larger systems are built. In this paper we describe FT-GAIA, a software-based fault-tolerant extension of the GAIA/ART` IS parallel simulation middleware. FT-GAIA transparently replicates simulation entities and distributes them on multiple execution nodes. This allows the simulation to tolerate crash-failures of computing nodes;furthermore, FT-GAIA offers some protection against Byzantine failures since synchronization messages are replicated as well, so that the receiving entity can identify and discard corrupted messages. We provide an experimental evaluation of FT-GAIA on a running prototype. Results show that a high degree of fault tolerance can be achieved, at the cost of a moderate increase in the computational load of the execution units.

关键词： Computational modeling Fault tolerance Fault tolerant systems Middleware Adaptation models Fault tolerance Fault tolerant systems Middleware Computational modeling multiple execution Adaptation models simulating Simulation models discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Programming support for sensor-based scientific applications

Programming support for sensor-based scientific applications

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd IEEE international parallel and distributed Processing symposium

作者： Jiang, Nanyan Parashar, Manish Rutgers State Univ Dept Elect & Comp Engn Appl Software Syst Lab Piscataway NJ 08855 USA

ISBN: (纸本)9781424416936

Technical advances are enabling a pervasive computational ecosystem that integrates computing infrastructures with embedded sensors and actuators, and are giving rise to a new paradigm for monitoring, understanding, and managing natural and engineered systems - one that is information/data-driven. This research investigates programming systems for sensor-driven applications. It addresses abstractions and runtime mechanisms for integrating sensor systems with computational models for scientific processes, as well as for in-network data processing, e.g., aggregation, adaptive interpolation and assimilation. The current status of this research, as well as initial results are presented.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Safety Assurance for Emergent Collaboration of Open distributed systems 27

Safety Assurance for Emergent Collaboration of Open Distribu...

引用

27th IEEE international symposium on software Reliability engineering (ISSRE)

作者： Mueller, Sebastian Liggesmeyer, Peter Univ Kaiserslautern Chair Software Engn Dependabil Kaiserslautern Germany

ISBN: (纸本)9781509036011

For the next generation of distributed systems it is foreseen to enable new powerful applications based on system collaboration for dynamic integration of functionalities. This requires a certain level of autonomy for self-managing systems to change their effective and deterministic behavior during operation. In many application domains, however, collaboration processes for new higher-level functionalities are safety critical and an appropriate safety assurance approach is still missing. To ensure that the current operational situation based on an adapted system behavior is safe, we propose a safety evaluation with dynamic safety contracts between involved parties. The approach is based on a continuous monitoring, sharing and calculation of safety related quality characteristics of systems at runtime. We demonstrate the feasibility of our approach with a use case from the automotive domain.

关键词： Autonomous vehicles Collaborative systems Condition monitoring Conditional certificates Dynamic adaptation Dynamic safety contracts Safety

来源：评论

学校读者我要写书评

暂无评论

Performance analysis integration in the Uintah software development cycle

引用

international JOURNAL OF parallel PROGRAMMING 2003年第1期31卷 35-53页

作者： de St Germain, JD Morris, A Parker, SG Malony, AD Shende, S Univ Utah Sch Comp Salt Lake City UT 84112 USA Univ Oregon Dept Comp & Informat Sci Eugene OR 97403 USA

The increasing complexity of high-performance computing environments and programming methodologies presents challenges for empirical performance evaluation. Evolving parallel and distributed systems require performance technology that can be flexibly configured to observe different events and associated performance data of interest. It must also be possible to integrate performance evaluation techniques with the programming paradigms and software engineering methods. This is particularly important for tracking performance on parallel software projects involving many code teams over many stages of development. This paper describes the integration of the TAU and XPARE tools in the Uintah Computational Framework (UCF). Discussed is the use of performance mapping techniques to associate low-level performance data to higher levels of abstraction in UCF and the use of performance regression testing to provide a historical portfolio of the evolution of application performance. A scalability study shows the benefits of integrating performance technology in building large-scale parallel applications.

关键词： parallel performance software applications

来源：评论

学校读者我要写书评

暂无评论

Hardware-software interaction: Preliminary observations

Hardware-software interaction: Preliminary observations

引用

19th IEEE international parallel and distributed Processing symposium, IPDPS 2005

作者： Steiner, Neil Athanas, Peter Bradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg VA 24061

ISBN: (纸本)0769523129

As computational devices continue to advance, there are reasons to examine their foundations a little more deeply, and to ask whether there may not be something more to be found. The fundamental manner in which hardware and software interact is poorly understood, and yet there is little indication in the literature that this is being discussed or explored. In spite of our technological achievements, we are at a loss to precisely define the boundaries between hardware and software, and to describe the nature of their interface. This paper aims to raise some of the major issues and questions, to propose a hardware-information duality, and to suggest directions in which further research might be pursued.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Configuration and dynamic reconfiguration of components using the coordination paradigm

引用

FUTURE GENERATION COMPUTER systems-THE international JOURNAL OF ESCIENCE 2001年第8期17卷 1023-1038页

作者： Papadopoulos, GA Arbab, F Univ Cyprus Dept Comp Sci CY-1678 Nicosia Cyprus Ctr Math & Comp Sci Dept Software Engn NL-1098 SJ Amsterdam Netherlands

One of the most promising approaches in developing component-based (possibly distributed) systems is that of coordination models and languages. Coordination programming enjoys a number of advantages such as the ability to express different software architectures and abstract interaction protocols, support for multi-linguality, reusability and programming-in-the-large, etc. Configuration programming is another promising approach in developing large scale, component-based systems, with the increasing need for supporting the dynamic evolution of components. In this paper we explore and exploit the relationship between the notions of coordination and (dynamic) configuration and we illustrate the potential of control- or event-driven coordination languages to be used as languages for expressing dynamically reconfigurable software architectures. We argue that control-driven coordination has similar goals and aims with the notion of dynamic configuration and we illustrate how the former can achieve the functionality required by the latter. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： coordination languages and models software engineering for distributed and parallel systems modelling software architectures dynamic reconfiguration component-based systems

来源：评论

学校读者我要写书评

暂无评论

The Application of the Combinatorial Relaxation Theory on the Structural Index Reduction of DAE

The Application of the Combinatorial Relaxation Theory on th...

引用

12th international symposium on distributed Computing and Applications to Business, engineering and Science (DCABES)

作者： Wu, Xuesong Zeng, Yan Cao, Jianwen Chinese Acad Sci Inst Software Lab Parallel Software & Computat Sci Software Beijing 100190 Peoples R China

ISBN: (纸本)9780769550602

Multi-domain unified modeling is an important development direction in the study of complex system. Modelica is a popular multi-modeling language. It describes complex systems by mathematical equations, solves the high-index of Differential algebraic equations (DAE) generated by modeling. But in this process, the index reduction based on structural index, which is a key step of solving high-index DAE, will fail with small probability. Based on the combinatorial optimization theory, it analyzes the incorrect problem leaded by the index reduction algorithm for solving the DAE, gives the algorithm of detecting and correcting the incorrect of structural index reduction for matrix pencils. It implements the algorithm of detecting and correcting, and apply the algorithm into solving first-order linear time-invariant DAE system. The experiment result shows that for first-order linear time-invariant DAE, the problem about the failure of structural index reduction can be solved by the combinatorial optimization theory.

关键词： Complex system Modelica DAE Index reduction Combinatorial relaxation theory

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation Strategies for Hierarchical Non-Uniform Memory Access systems by Example of the Scale-Invariant Feature Transform Algorithm 30

Parallel Implementation Strategies for Hierarchical Non-Unif...

引用

30th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Plauth, Max Hagen, Wieland Feinbube, Frank Eberhardt, Felix Feinbube, Lena Polze, Andreas Univ Potsdam Hasso Plattner Inst Software Syst Engn Operating Syst & Middleware Grp Potsdam Germany

ISBN: (纸本)9781509036820

The domains of parallel and distributed computing have been converging continuously up to the degree that state-of-the-art server computer systems incorporate characteristics from both domains: They comprise a hierarchy of enclosures, where each enclosure houses multiple processor sockets and each socket again contains multiple memory controllers. A global address space and cache coherency are facilitated using multiple layers of fast interconnection technologies even across enclosures. The growing popularity of such systems creates an urge for efficient mappings of cardinal algorithms onto such hierarchical architectures. However, the growing complexity of such systems and the inconsistencies between implementation strategies of different hardware vendors make it increasingly harder to do find efficient mapping strategies that are universally valid. In this paper, we present scalable optimization and mapping strategies in a case study of the popular Scale-Invariant Feature Transform (SIFT) computer vision algorithm. Our approaches are evaluated using a state-of-the-art hierarchical Non-Uniform Memory Access (NUMA) system with 240 physical cores and 12 terabytes of memory, apportioned across 16 NUMA nodes (sockets). SIFT is particularly interesting since the algorithm utilizes a variety of common data access patterns, thus allowing us to discuss the scaling properties of optimization strategies from the distributed and parallel computing domains and their applicability on emerging server systems.

关键词： parallel programming Memory management Multiprocessor interconnection networks Network topology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：