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

10th IEEE international symposium on distributed Simulation and Real-Time Applications

作者： Quaglia, Francesco Univ Roma La Sapienza Dipartimento Informat & Sistemat I-00161 Rome Italy

ISBN: (纸本)0769526977

In this paper we explore active replication in the context of advanced simulation systems, with the aim of improving the timeliness for the production of simulation output. Our proposal is framed by the High-Level-Architecture (HLA), i.e. the middleware based standard for interoperability of simulation packages. It results in the design and implementation of an Active Replication Management Layer (ARML) targeted to SMP computing systems, which supports the execution of (diversity-based) active replicas of a same simulation pack-age in a totally transparent manner.

关键词： Middleware Computational modeling Application software Context modeling Packaging Data structures Runtime High performance computing Production systems Proposals

来源：评论

学校读者我要写书评

暂无评论

Mobility-enabled Publish/Subscribe: A Case Study

Mobility-enabled Publish/Subscribe: A Case Study

引用

19th IEEE Pacific Rim international symposium on Dependable Computing (PRDC)

作者： Salvador, Zigor Lafuente, Alberto Larrea, Mikel Univ Basque Country UPV EHU Donostia San Sebastian Spain

ISBN: (纸本)9780769551302

The integration of mobile devices within distributed systems introduces a wide range of constraints for developers. Some constraints arise from the hardware, software and interaction features of mobile platforms, while others stem from the use of wireless networks that are more dynamic, less reliable and performing than wired networks. In either case, software engineering processes have to tackle these constraints in order to provide mobility-enabled systems and applications. Based on first-hand experience in the field, this paper provides a framework to categorise these constraints and their severity, and describes some of the strategies that can be used to cope with them, with an emphasis in those relevant to middleware design.

关键词： distributed systems publish/subscribe software engineering mobility constraints design guidelines case study

来源：评论

学校读者我要写书评

暂无评论

Admission Control for distributed Complex Responsive systems

Admission Control for Distributed Complex Responsive Systems

引用

8th international symposium on parallel and distributed Computing

作者： Garces-Erice, Luis IBM Corp Zurich Res Lab CH-8803 Ruschlikon Switzerland

ISBN: (纸本)9780769536804

The software in modern systems has become too complex to make accurate predictions about their performance under different configurations. Real-time or even responsiveness requirements cannot be met because it is not possible to perform admission control for new or changing tasks if we cannot tell how their execution affects the other tasks already running. Previously, we proposed a resource-allocation middleware that manages the execution of tasks in a complex distributed system with real-time requirements. The middleware behavior can be modeled depending on the configuration of the tasks running, so that the performance of any given configuration can be calculated. This makes it possible to have admission control in such a system, but the model requires knowledge of run-time parameters. We propose the utilization of machine-learning algorithms to obtain the model parameters, and be able to predict the system performance under any configuration, so that we can provide a full admission control mechanism for complex software systems.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Distinguishing Medical Drugs from a Large Set of Side Effects Using a distributed Genetic Algorithm on a PC Cluster

Distinguishing Medical Drugs from a Large Set of Side Effect...

引用

IEEE international symposium on Circuits and systems (ISCAS)

作者： Noor, Fazal Alhaisoni, Majed Alshammari, Mashaan A. Ramachandran, Ravi P. Univ Hail Comp Sci & Software Engn Hail Saudi Arabia Rowan Univ Elect & Comp Engn Glassboro NJ USA

ISBN: (纸本)9781479983919

A distributed Genetic Algorithm to compute minimal reducts is presented for a novel biomedical application to distinguish 50 medical drugs from 228 side effects. The results indicate that 15 side effects are sufficient to differentiate among all the 50 drugs. In fact, any one of 4 sets of 15 side effects can be used. The distributed Genetic Algorithm is inherently parallel, uses a variable mutation rate and is efficiently implemented on a PC cluster using 5, 10 and 20 nodes each with a Message Passing Interface. Results show that the distributed algorithm with 20 nodes uses much less computation time than two sequential methods (savings of about a factor of 5).

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

SunwayMR: A distributed parallel computing framework with convenient data-intensive applications programming

引用

FUTURE GENERATION COMPUTER systems-THE international JOURNAL OF ESCIENCE 2017年 71卷 43-56页

作者： Wu, Renke Huang, Linpeng Yu, Peng Zhou, Haojie Shanghai Jiao Tong Univ Dept Comp Sci & Engn 800 Dong Chuan Rd Shanghai 200240 Peoples R China Shanghai Jiao Tong Univ Sch Software 800 Dong Chuan Rd Shanghai 200240 Peoples R China Jiangnan Inst Comp Technol State Key Lab Math Engn & Adv Comp 699 Shanshui East Rd Wuxi 214000 Peoples R China

Managing servers integration to realize distributed data computing framework is an important concern. Regardless of the underlying architecture and the actual distributed system's complexity, such framework gives programmers an abstract view of systems to achieve variously data-intensive applications. However, some state-of-the-art frameworks need too much library dependencies and parameters configuration, or lack extensibility in application programming. Moreover, general framework's precise design is a nontrivial work, which is fraught with challenges of task scheduling, message communication and computing efficiency, etc. To address these problems, we present a general, scalable and programmable parallel computing framework called SunwayMR, which only needs GCC/G++ environment. We argue it from the following aspects: (1) distributed data partitioning, message communication and task organization are given to support transparent application execution on parallel hardware. By searching threads table of each node, the task gets an idle thread (with preferred node IP address) for executing data partition. A novel communication component, SunwayMRHelper, is employed to merge periodical results synchronously. Through identifying whether current node is master or slave, SunWayMR deals with the periodical task's results differently. (2) As for optimizations, a simple fault tolerance is given to resume data-parallel applications, and thread-level stringstream is utilized to boost computing. To ensure ease-of-use, open Application Programming Interface (API) excerpts can be invoked by various of applications with fewer handwritten code than OpenMPl/MPI. We conduct extensively experimental studies to evaluate the performance of SunwayMR over real-world datasets. Results indicate that SunwayMR (runs on 16 computational nodes) outperforms Spark in various applications, and has good scaling with data sizes, nodes and threads. (C) 2017 Elsevier B.V. All rights reserved.

关键词： parallel processing Computer software software engineering software development environment and technique distributed programming and environment SunwayMR

来源：评论

学校读者我要写书评

暂无评论

Fully Dynamic Line Maintenance by Hybrid Programmable Matter 36

Fully Dynamic Line Maintenance by Hybrid Programmable Matter

引用

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

作者： Nokhanji, Nooshin Flocchini, Paola Santoro, Nicola Carleton Univ Sch Comp Sci Ottawa ON Canada Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON Canada

ISBN: (纸本)9781665497473

Motivated by the manipulation of nanoscale materials, recent investigations have focused on hybrid systems where passive elements incapable of movement, called tiles, are manipulated by one or more mobile entities, called robots, with limited computational capabilities. Like in most self-organizing systems, the fundamental concern is with the (geometric) shapes created by the position of the tiles;among them, the line is perhaps the most important. The existing investigations have focused on formation of the shape, but not on its reconfiguration following the failure of some of the tiles. In this paper, we study the problem of maintaining a line formation in presence of fully dynamic failures: any tile can stop functioning at any time. We show how this problem can be solved by a group of very simple robots, with the computational power of deterministic finite automata.

关键词： Shape formation fault-tolerance hybrid programmable matter line maintenance distributed algorithms self-assembly

来源：评论

学校读者我要写书评

暂无评论

Dependable distributed embedded system assessment platform design

Dependable distributed embedded system assessment platform d...

引用

8th ACIS international Conference on software engineering, Artificial Intelligence, Networking and parallel/distributed Computing/3rd ACIS international Workshop on Self-Assembling Wireless Networks

作者： Huang Qiang Liang XiaoFeng Zhu YingYing Shezhen Univ Coll Informat Engn Shenzhen 518060 Peoples R China

ISBN: (纸本)0769529097

Dependable distributed embedded systems (DDES) are being deployed widely in automobile industry over the world. These systems always post rigorous requirement for timing accuracy and reliability. Both hardware and software architecture have important effect on the system dependability. Adding or substitute for more reliable hardware could increase the system reliability moreover achieves faster system response. Apparently this would increase the manufacturing cost, while software could be a more cost-effective ways for providing support for dependable distributed embedded system development. The dependable distributed embedded system assessment platform (DDESAP) which based on vehicle control system provides testing and assessment support for various automobile dependable software. DDESAP evaluates the vehicle control hardware and operational environments. software architectures such as time-triggered, event-triggered, hybrid-triggered and other fault tolerant mechanisms for dependable distributed embedded systems were tested on DDESAP. A vehicle dynamic model, a motorway traffic model, and a driver model were developed for DDESAP. Simulation show these models comply with manufacturer and empirical data. DDESAP enables the evaluation of novel software architectures for safety-critical automobile control systems, like the fault tolerant adaptive cruise control systems (ACCS) presented.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Deploying loosely coupled, component-based applications into distributed environments

Deploying loosely coupled, component-based applications into...

引用

13th Annual IEEE international symposium and Workshop on engineering of Computer Based systems

作者： Heydarnoori, Abbas Mavaddat, Farhad Arbab, Farhad Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada Ctr Wiskunde Informat Dept Software Engn NL-1090 Amsterdam Netherlands

ISBN: (纸本)0769525466

With significant advances in software development technologies in recent years, it is now possible to have complex software applications, which include a large number of heterogeneous software components distributed over a large network of computers with different computational capabilities. To run such applications, their components must be instantiated on proper hardware resources in their target environments so that some requirements and constraints are met. This process is called software deployment. For large, distributed, component-based applications with many constraints and requirements, it is difficult to do the deployment process manually, and some automated tools and techniques are required. This paper presents a graph-based approach for this purpose that is not dependent on any specific component technology and does the deployment planning with respect to the communication resources required by application components and communication resources available on the hosts in the target environment. In our approach, component-based applications and distributed environments are modeled with the help of graphs. Deployment of an application is then defined as the mapping of the application graph to the target environment graph.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

parallel tree building on a range of shared address space multiprocessors: Algorithms and application performance 1

Parallel tree building on a range of shared address space mu...

引用

1st Merged international parallel Processing symposium/symposium on parallel and distributed Processing (IPPS/SPDP 1998)

作者： Shan, HZ Singh, JP Princeton Univ Dept Comp Sci Princeton NJ 08544 USA

ISBN: (纸本)0818684038

irregular particle-based applications that use trees, far example hierarchical N-body applications, are important consumers of multiprocessor cycles, and are argued to benefit greatly in programming ease from a coherent shared address space programming model. As more and more supercomputing platforms that can support different programming models become available to users, from tightly-coupled hardware-coherent machines to clusters of workstations or SMPs, to truly deliver on its ease of programing advantages to application users it is important that the shared address space model nor only perform and scale well in the rightly-coupled case but also port well in performance across the range of platforms (as the message passing model can). For tree-based N-body applications, this is currently not true: While the actual computation of interactions ports well, the parallel tree building phase can become a severe bottleneck on coherent shared address space platforms, in particular an platforms with less aggressive, commodity-oriented communication architectures (even though it rakes less than 3 percent of the time in most sequential executions). We therefore investigate the performance of five parallel tree building methods in the context of a complete galaxy simulation on four very different platforms that support this programming model: an SGI Origin2000 (an aggressive hardware cache-coherent machine with physically distributed memory), an SGI Challenge bits-based shared memory multiprocessor art Intel Paragon running a shared virtual memory protocol in software at page granularity, and a Wisconsin Typhoon-zero in which the granularity of coherence can be varied using hardware support but the protocol runs in software (in the last case using both a page-based and a fine-grained protocol). We find that the algorithms used successfully and widely distributed so far for the first two platforms cause overall application performance to be very poor on the latter two commodit

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Hardware/software Mechanisms for Protecting an IDS Against Algorithmic Complexity Attacks

Hardware/Software Mechanisms for Protecting an IDS Against A...

引用

26th IEEE international parallel and distributed Processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Sreekar Shenoy, Govind Tubella, Jordi Gonzalez, Antonio Univ Politecn Cataluna Dept Comp Architecture Barcelona Spain

ISBN: (纸本)9780769546766

Intrusion Detection systems (IDS) have emerged as one of the most promising ways to secure systems in the network. An IDS like the popular Snort[17] detects attacks on the network using a database of previous attacks. So in order to detect these attack strings in the packet, Snort uses the Aho-Corasick algorithm. This algorithm first constructs a Finite State Machine (FSM) from the attack strings, and subsequently traverses the FSM using bytes from the packet. We observe that there are input bytes that result in a traversal of a series of FSM states (also viewed as pointers). This chain of pointer traversal significantly degrades (22X) the processing time of an input byte. Such a wide variance in the processing time of an input byte can be exploited by an adversary to throttle the IDS. If the IDS is unable to keep pace with the network traffic, the IDS gets disabled. So in the process the network becomes vulnerable. Attacks done in this manner are referred to as algorithmic complexity attacks, and arise due to weaknesses in IDS processing. In this work, we explore defense mechanisms to the above outlined algorithmic complexity attack. Our proposed mechanisms provide over 3X improvement in the worst-case performance.

关键词： Intrusion Detection systems Defense Mechanisms Hardware Support

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：