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

Euromicro Workshop on Parallel and distributed Processing

作者： L. Boianov I. Jelly Laboratory for Distributed Systems and Computer Networks CICI Bulgarian Academy of Sciences Sofia Bulgaria Computing Research Centre School of Computing and Management Sciences Sheffield Hallam University Sheffield UK

The implementation of a distributed digital logic simulation algorithm on a network of workstations is presented. The simulation of digital circuits is done using a demand driven approach. The simulation is performed on a network of workstations using the Parallel Virtual Machine (PVM) software. The use of the PVM as a platform for parallel and distributed applications is assessed in the light of the test results. The feasibility of running parallel logical simulation algorithms on such platform is considered.< >

关键词： Logic circuits Circuit simulation Workstations Computational modeling Computer network management Digital circuits Application software Parallel algorithms Parallel processing Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Business aware Policy-based Management

Business aware Policy-based Management

引用

IEEE/IFIP International Workshop on Business-Driven IT Management (BDIM)

作者： I. Aib M. Salle C. Bartolini A. Boulmakoul R. Boutaba G. Pujolle Networks and Distributed Systems Laboratory University of Waterloo Canada HP Research Laboratories Palo Alto CA USA HP Research Laboratories Bristol UK PHARE Group LIP6 Laboratory University of Paris France

In this paper, we introduce a business aware framework for the policy-based management of IT systems and its application to utility computing environments. The framework couples two main subsystems on top of an IETF-like policy-based resource control layer. They are MBO (Management by Business Objectives) where the decision ability supported by analysis of business objectives resides, and GSLA (Generalized SLA), an advanced framework for SLA driven management that lends itself quite naturally to the derivation of IT management policies from the SLAs that the enterprise has contracted. We discuss the advantages and the limitations of the state-of-art policy-based approach to systems management, mainly the lack of business and service level context to drive policy-related decisions at system runtime. We then explain how this is remedied in our framework through the interaction mechanism between the reactive policy-based resource control layer and the more proactive business driven decision making engine.

关键词： Resource management Decision making Laboratories Engines Economic forecasting Milling machines Environmental management Computer applications Context-aware services Drives

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2009年 5918 LNCS卷 V-VI页

作者： Spyropoulos, Thrasyvoulos Hummel, Karin Anna ETH Zürich Computer Engineering and Networks Laboratory ETZ G 96 Gloriastr. 35 8092 Zürich Switzerland University of Vienna Department of Distributed and Multimedia Systems Lenaugasse 2/8 1080 Vienna Austria

来源：评论

学校读者我要写书评

暂无评论

Checkpointing distributed application running on mobile ad hoc networks

Checkpointing distributed application running on mobile ad h...

引用

International Journal of High Performance Computing and Networking

作者： Mansouri, Houssem Badache, Nadjib Aliouat, Makhlouf Pathan, Al-Sakib Khan Department of Computer Science Faculty of Exact Sciences University of Bejaia Bejaia06000 Algeria Research Center on Scientific and Technical Information CERIST Ben-Aknoun Algiers16000 Algeria Laboratory of Networks and Distributed Systems Computer Science Department University of Ferhat Abbas S?tif1 S?tif19000 Algeria Faculty of Computer and Information Systems Islamic University in Madinah Madinah al-Munawwarah Saudi Arabia CSE Department University of Asia Pacific Bangladesh

Mobile ad hoc network (MANET) is a type of wireless network consisting of a set of self-configured mobile hosts that can communicate with each other using wireless links without the assistance of any fixed infrastructure. This has made it possible for us to create distributed mobile computing applications and has also brought several new challenges in the field of distributed algorithm design. Checkpointing is a well explored fault tolerance technique for the wired and cellular mobile networks. However, it is not directly applicable to MANET owing to its dynamic topology, limited availability of stable storage, partitioning and the absence of fixed infrastructure. In this paper, we propose an adaptive, coordinated and non-blocking checkpointing algorithm to provide fault tolerance in cluster-based MANET, where only a minimum number of mobile hosts in the cluster should take checkpoints. The performance analysis and simulation results show that the proposed scheme requires less coordinating-message cost and performs well compared to the related previous works. Copyright ? 2018 Inderscience Enterprises Ltd.

关键词： Mobile ad hoc networks distributed computer systems Fault tolerance Mobile computing Cellular mobile networks Check pointing Clustering distributed mobile computing Fault tolerance techniques MANET Non blocking checkpointing Performance analysis and simulation

来源：评论

学校读者我要写书评

暂无评论

Spotlights on network operations and management research in Latin America - A report on LANOMS 2005

Spotlights on network operations and management research in ...

引用

作者： Granville, Lisandro Zambenedetti Gaspary, Luciano Paschoal Schulze, Bruno De Souza, José Neuman Brazil Special Interest Group on Computer Networks and Distributed Systems Brazilian Computer Society Brazil Brazilian Laboratory on Computer Networks Brazil IFIP/IEEE im Brazil Graduate Program on Applied Computing Universidade do Vale do Rio dos Sinos Brazil IEEE Communications Society Japan National Lab. for Scientific Computing - LNCC Brazil Brazilian National Research Council CNPq Brazil ACM Brazil IEEE Brazil Brazilian Computing Society Brazil Federal University of Ceará Brazil

来源：评论

学校读者我要写书评

暂无评论

The Interplay Between Timeliness and Scalability in Cloud Monitoring systems

The Interplay Between Timeliness and Scalability in Cloud Mo...

引用

IEEE Symposium on Computers and Communication

作者： Guilherme da Cunha Rodrigues Rodrigo N. Calheiros Marcio Barbosa de Carvalho Carlos Raniery Paula dos Santos Lisandro Zambenedetti Granville Liane Tarouco Rajkumar Buyya Computer Networks Group Institute of Informatics Federal University of Rio Grande do Sul Cloud Computing and Distributed Systems (CLOUDS) Laboratory Department of Computing and Information Systems The University of Melbourne Department of Applied Computing Federal University of Santa Maria

ISBN: (纸本)9781467371957

Cloud computing is a groundbreaking solution to acquire computational resources on demand. To deliver high quality cloud services and provide features such as reduced costs and availability to customers, a cloud, like any other computational system, needs to be properly managed in accordance with its characteristics (e.g., scalability, elasticity, timeliness). In this scenario, cloud monitoring is a key to achieve it. To properly work, cloud monitoring systems need to meet several requirements such as scalability, accuracy, and timeliness. This paper aims to unveil the trade-off between timeliness and scalability. Evaluations demonstrate the mutual influence between scalability and timeliness based on monitoring parameters (e.g., monitoring topologies, frequency sampling). Results show that non-deep monitoring topologies and decreasing the frequency sampling assist to reduce the mutual influence between timeliness and scalability.

关键词： Scalability CLOUDS Clouds monitoring systems Monitoring parameters Cloud Computing

来源：评论

学校读者我要写书评

暂无评论

On the potential of NoC virtualization for multicore chips

引用

Scalable Computing 2008年第3期9卷 165-177页

作者： Flich, J. Rodrigo, S. Duato, J. Sødring, T. Solheim, A.G. Skeie, T. Lysne, O. Parallel Architectures Group Technical University of Valencia Spain Networks and Distributed Systems Department Simula Research Laboratory University College Oslo Norway Department of Journalism Library and Information Science University College Oslo Norway Department of Informatics University of Oslo Norway

As the end of Moores-law is on the horizon, power becomes a limiting factor to continuous increases in performance gains for single-core processors. Processor engineers have shifted to the multicore paradigm and many-core processors are a reality. Within the context of these multicore chips, three key metrics point themselves out as being of major importance, performance, fault-tolerance (including yield), and power consumption. A solution that optimizes all three of these metrics is challenging. As the number of cores increases the importance of the interconnection network-on-chip (NoC) grows as well, and chip designers should aim to optimize these three key metrics in the NoC context as well. In this paper we identify and discuss the main properties that a NoC must exhibit in order to enable such optimizations. In particular, we propose the use of virtualization techniques at the NoC level. As a major finding, we identify the implementation of unicast and broadcast routing algorithms to become a key design parameter in order to achieve an effective virtualization of the chip. The intention behind this paper is for it to serve as a position paper on the topic of virtualization for NoC and the challenges that should be met at the routing layer in order to optimize performance, fault-tolerance and power consumption in multicore chips. © 2008 SCPE.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

A non-blocking coordinated checkpointing algorithm for message-passing systems 15

A non-blocking coordinated checkpointing algorithm for messa...

引用

International Conference on Intelligent Information Processing, Security and Advanced Communication, IPAC 2015

作者： Mansouri, Houssem Aliouat, Makhlouf Badache, Nadjib Khan, Al-Sakib Pathan Department of Computer Science Faculty of Exact Sciences University of Bejaia Bejaia06000 Algeria Laboratory of Networks and Distributed Systems Computer Science Department University of Ferhat Abbas Sétif1 Setif19000 Algeria Research Center on Scientific and Technical Information CERIST Ben-Aknoun Algiers16000 Algeria Department of Computer Science International Islamic University Malaysia Kuala Lumpur53100 Malaysia

ISBN: (纸本)9781450334587

This paper proposes an efficient non-blocking coordinated checkpointing algorithm for distributed message passing system which uses transitive dependency information. The processes synchronize their checkpointing activities so that a globally consistent set of checkpoints is always maintained in the system. These algorithms do not require channels to be FIFO (First-In, First-Out) and ensure that each checkpoint taken is part of a consistent global checkpoint. Our scheme also records a minimum number of checkpoints by making sure that only few processes are required to take checkpoints in any execution - it uses very less control-message cost when compared to other related works. © 2015 ACM.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Dynamic Fault Tolerance with Misrouting in Fat Trees

Dynamic Fault Tolerance with Misrouting in Fat Trees

引用

International Conference on Parallel Processing (ICPP)

作者： Frank Olaf Sem-jacobsen Tor Skeie Olav Lysne Jose Duato Department of Informatics University of Oslo Oslo Norway Networks and Distributed Systems Simula Research Laboratory Lysaker Norway Department de Ingenieria de Sistemas Computadores y Automatica Universidad Politecnica de Valencia Valencia Spain

Fault tolerance is critical for efficient utilisation of large computer systems. Dynamic fault tolerance allows the network to remain available through the occurance of faults as opposed to static fault tolerance which requires the network to be halted to reconfigure it. Although dynamic fault tolerance may lead to less efficient solutions than static fault tolerance, it allows for a much higher availability of the system. In this paper we devise a dynamic fault tolerant adaptive routing algorithm for the fat tree, a much used interconnect topology, which relies on misrouting around link faults. We show that we are guaranteed to tolerate any combination of less than (num_switch_ports)/2 link faults without the need for additional network resources for deadlock freedom. There is also a high probability of tolerating an even larger number of link faults. Simulation results show that network performance degrades very little when faults are dynamically tolerated

关键词： Fault tolerance Circuit faults Routing Switches Fault tolerant systems Network topology Computer networks Integrated circuit interconnections Switching circuits distributed computing

来源：评论

学校读者我要写书评

暂无评论

Loss temporal dependency characteristic inference in wireless sensor network

引用

Journal of Computational Information systems 2008年第5期4卷 2303-2308页

作者： Li, Yongjun Ji, Wenli Dai, Yafei Computer Networks and Distributed Systems Laboratory Peking University Beijing 100871 China School of Computer Science Northwestern Polytechnical University Xi'an 710072 China School of Communication Engineering Xi'an University of Science and Technology Xi'an 710075 China State Key Lab. for Adv. Opt. Commun Syst and Networks Beijing 1000871 China

The internal link loss characteristic inference has become an increasingly important issue for operating and evaluating a wireless sensor network. Due to the inherent stringent bandwidth and energy constraints, it is usually impractical to directly collect link loss statistical data from each node in sensor network. Here we consider the problem of inferring the internal link loss characteristics from end-to-end measurement. We use the Gilbert error model to model the sensor link losses, formulate the problem of link loss characteristics estimation as a Bayesian inference problem, and propose a Markov Chain Monte Carlo (MCMC) algorithm to solve it. The simulation shows that the link loss performance parameters can be inferred accurately, and the proposed algorithm scales well according to the sensor network size. © 2008 Binary Information Press.

关键词： Inference engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：