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

2010 2nd international conference on Computer Engineering and Technology, ICCET 2010

作者： Yi, Deng Hu, Shanqing Long, Teng School of Information and Electronic Beijing Institute of Technology Beijing China

ISBN: (纸本)9781424463503

This paper describes the development of high-speed interconnect networks in high-performance distributed computing systems. We depict three typical interconnect topologies and analyze their characteristics and bisection. After proposing a type of system architecture of processing platform, we briefly discuss the RapidIO protocol and design a novel switching element architecture and describe the constituting of the switching element. In order to verify the performance and application effects of the structure, we implement and establish an actual computing platform. The bandwidth and transmission delay results are shown in experiment results. © 2010 IEEE.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Wireless Sensor networks Modeling as a Probabilistic Combinatorial Optimization Problem 16

Wireless Sensor Networks Modeling as a Probabilistic Combina...

引用

16th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Ghabri, Afef Bellalouna, Monia Univ Manouba Lab RIADI GDL Natl Sch Comp Sci ENSI Manouba 2010 Tunisia Univ Manouba Lab CRISTAL POLE GRIFT Natl Sch Comp Sci ENSI Manouba 2010 Tunisia

ISBN: (纸本)9781479986767

The wireless sensor networks are considered as a new technology that has appeared due to technological advances in the field of development of powerful processors, wireless communication protocols and smart sensors. Because of their sensitivity, several research projects have been conducted for the purpose of finding solutions to wireless sensor networks in the presence of intrusions and failures. In fact, a sensor network must be able to maintain its functionality without interruptions caused by the failures of sensors. This problem of fault tolerance has seen a great significance among various fields of research in these networks. The main idea presented in this paper is that the combinatorial optimization provides applicable methods in the context of wireless sensor networks and the function to be optimized can be the function that calculates the consumed energy during communications, or the covered distance, or the routing path cost during data transmission to the sink. Fault tolerant protocols and approaches must then be employed to ensure reliability and to allow us choosing the best paths in order to route information from the source to the collector. In this paper, a theoretical modeling of a probabilistic combinatorial optimization problem through wireless sensors networks is explored.

关键词： wireless sensor networks intrusions fault tolerance optimization function modeling

来源：评论

学校读者我要写书评

暂无评论

distributed Coverage in Wireless Ad Hoc and Sensor networks by Topological Graph Approaches

Distributed Coverage in Wireless Ad Hoc and Sensor Networks ...

引用

international conference on distributed computing Systems (ICDCS 2010)

作者： Dong, Dezun Liu, Yunhao Liu, Kebin Liao, Xiangke Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China Hong Kong Univ Sci & Technol Kowloon Hong Kong Peoples R China

ISBN: (纸本)9780769540597

Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information or range measurements, which cannot be easily obtained in resource-limited ad hoc and sensor networks. Recently, a method based on algebraic topology has been proposed to achieve coverage verification using only connectivity information. The topological method sheds some light on the issue of location-free coverage. Unfortunately, the needs of centralized computation and rigorous restriction on sensing and communication ranges greatly limit the applicability in practical large-scale distributed sensor networks. In this work, we make the first attempt towards establishing a graph theoretical framework for connectivity-based coverage with configurable coverage granularity. We propose a novel coverage criterion and scheduling method based on cycle partition. Our method is able to construct a sparse coverage set in a distributed manner, using purely connectivity information. Compared with existing methods, our design has a particular advantage, which permits us to configure or adjust the quality of coverage by adequately exploiting diverse sensing ranges and specific requirements of different applications. We formally prove the correctness and evaluate the effectiveness of our approach through extensive simulations and comparisons with the state-of-the-art approaches.

关键词： wireless ad hoc and sensor networks coverage distributed connectivity topological graph cycle partition

来源：评论

学校读者我要写书评

暂无评论

Probabilistic or deterministic QoS guarantees for flows scheduled with FP/DM

Probabilistic or deterministic QoS guarantees for flows sche...

引用

international conference on parallel and distributed computing and networks

作者： Minet, Pascale Martin, Steven Saidane, Leila Azouz Masmoudi, Sahla INRIA Rocquencourt F-78153 Le Chesnay France Univ Paris 11 LRI F-91405 Orsay France ENSI Tunis 2010 Tunisia

ISBN: (纸本)9780889866379

In this paper, we consider flows requiring quantitative end-to-end QoS guarantees. We focus more particularly on the end-to-end response times of flows and their probability of meeting their end-to-end deadlines. We assume that packets are scheduled according to their fixed priority, reflecting the importance degree of the flow. If on a node two packets have the same fixed priority, the packet with the smallest relative deadline on the node considered is scheduled first. Therefore, this non-preemptive scheduling, called FP/DM, takes into account the deadline constraint. The deterministic approach, based on a worst case analysis, may lead to a bound on the flow end-to-end response times that can be reached infrequently. A network dimensioning based on this bound can be expensive in terms of resources. That is why we are interested in probabilistic QoS guarantees. We then evaluate the benefits brought by FP/DM with regard to FP/FIFO. With the deterministic approach, we compare the worst case response times and the laxities of the flows considered. With the probabilistic approach, we compare the probabilities of meeting the deadlines for the flows considered as well as the p-schedulabibility of the flow set.

关键词： scheduling queueing system QoS distributed real-time systems

来源：评论

学校读者我要写书评

暂无评论

A HIGH PERFORMANCE 3D EXACT EUCLIDEAN DISTANCE TRANSFORM ALGORITHM FOR distributed computing

引用

international JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2010年第6期24卷 897-915页

作者： Torelli, Julio Cesar Fabbri, Ricardo Travieso, Gonzalo Bruno, Odemir Martinez Univ Sao Paulo ICMC Sao Carlos SP Brazil Brown Univ Providence RI 02912 USA Univ Sao Paulo IFSC Sao Carlos SP Brazil

The Euclidean distance transform (EDT) is used in various methods in pattern recognition, computer vision, image analysis, physics, applied mathematics and robotics. Until now, several sequential EDT algorithms have been described in the literature, however they are time- and memory-consuming for images with large resolutions. Therefore, parallel implementations of the EDT are required specially for 3D images. This paper presents a parallel implementation based on domain decomposition of a well-known 3D Euclidean distance transform algorithm, and analyzes its performance on a cluster of workstations. The use of a data compression tool to reduce communication time is investigated and discussed. Among the obtained performance results, this work shows that data compression is an essential tool for clusters with low-bandwidth networks.

关键词： Euclidean distance transform parallel computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

Localized algorithm for connected set cover partitioning in wireless sensor networks

Localized algorithm for connected set cover partitioning in ...

引用

2010 1st international conference on parallel, distributed and Grid computing, PDGC - 2010

作者： Pervin, Nargis Layek, Dipankar Das, Nabanita School of Computing National University of Singapore 15 Computing Drive Singapore 117418 Singapore ACM Unit Indian Statistical Institute Kolkata 700108 India

ISBN: (纸本)9781424476725

In this paper, given a random distribution of sensor nodes, we pose the problem of finding maximum number of connected set covers such that each set can guarantee the required coverage of the region of interest. It requires just a one-time computation during initialization. Once the connected set covers are known, the sets may remain active in a round robin fashion to cover the region enhancing the life time of the network significantly. Firstly, two centralized greedy algorithms have been proposed to solve the problem from two different view points. But since centralized algorithms are not suitable for large self-organized sensor networks, a localized algorithm has been proposed finally that uses only local information at individual nodes to find a solution. Simulation studies show that these algorithms can enhance the network lifetime manifold, and most interestingly the performance of the distributed algorithm is comparable with the centralized ones in terms of number of partitions though it requires much less computation and communication overhead. © 2010 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Cost-effective congestion management for Interconnection networks using distributed deterministic routing

Cost-effective congestion management for Interconnection net...

引用

16th IEEE international conference on parallel and distributed Systems, ICPADS 2010

作者： Escudero-Sahuquillo, J. Garcia, P.J. Quiles, F.J. Flich, J. Duato, J. Computer Systems Department University of Castilla-La Mancha Albacete Spain Computer Engineering Department Technical University of Valencia Valencia Spain

ISBN: (纸本)9780769543079

The Interconnection networks are essential elements in current computing systems. For this reason, achieving the best network performance, even in congestion situations, has been a primary goal in recent years. In that sense, there exist several techniques focused on eliminating the main negative effect of congestion: the Head of Line (HOL) blocking. One of the most successful HOL blocking elimination techniques is RECN, which can be applied in source routing networks. FBICM follows the same approach as RECN, but it has been developed for distributed deterministic routing networks. Although FBICM effectively eliminates HOL blocking, it requires too much resources to be implemented. In this paper we present a new FBICM version, based on a new organization of switch memory resources, that significantly reduces the required silicon area, complexity and cost. Moreover, we present new results about FBICM, in network topologies not yet analyzed. From the experiment results we can conclude that a far less complex and feasible FBICM implementation can be achieved by using the proposed improvements, while not losing efficiency. © 2010 IEEE.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

A space-efficient parallel algorithm for computing betweenness centrality in distributed memory

A space-efficient parallel algorithm for computing betweenne...

引用

17th international conference on High Performance computing, HiPC 2010

作者： Edmonds, Nick Hoefler, Torsten Lumsdaine, Andrew Open Systems Laboratory Indiana University Bloomington IN 47405 United States National Center of Supercomputing Applications University of Illinois at Urbana-Champaign Urbana IL 61801 United States

ISBN: (纸本)9781424485185

Betweenness centrality is a measure based on shortest paths that attempts to quantify the relative importance of nodes in a network. As computation of betweenness centrality becomes increasingly important in areas such as social network analysis, networks of interest are becoming too large to fit in the memory of a single processing unit, making parallel execution a necessity. parallelization over the vertex set of the standard algorithm, with a final reduction of the centrality for each vertex, is straightforward but requires Ω(|V|2) storage. In this paper we present a new parallelizable algorithm with low spatial complexity that is based on the best known sequential algorithm. Our algorithm requires O(|V| + |E|) storage and enables efficient parallel execution. Our algorithm is especially well suited to distributed memory processing because it can be implemented using coarse-grained parallelism. The presented time bounds for parallel execution of our algorithm on CRCW PRAM and on distributed memory systems both show good asymptotic performance. Experimental results with a distributed memory computer show the practical applicability of our algorithm. ©2010 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Improving Orchestra using distributed parallel genetic algorithm

Improving Orchestra using distributed parallel genetic algor...

引用

2010 international conference on Apperceiving computing and Intelligence Analysis, ICACIA 2010

作者： Peng, Yong-Xiang Zhan, Si-Yu Lu, Xian-Liang School of Computer Science and Engineering University of Electronic Science and Technology of China China

ISBN: (纸本)9781424480265

Orchestra is proposed to change the traditional design process of routing protocols and it firstly introduces the concept of evolution into routing design. The disadvantage of traditional genetic algorithm, such as the bad searching quality and long computation time, makes the Orchestra has a bad performance and can not be applied to large scale network routing design. To improve Orchestra, a distributed parallel genetic algorithm is proposed. It adopts the improved genetic simulated annealing algorithm and uses distributed parallel technique to implement the distributed computing. With the distributed parallel genetic algorithm, the Orchestra will be more practical. © 2010 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Using parallel distributed Reasoning for Monitoring computing networks

Using Parallel Distributed Reasoning for Monitoring Computin...

引用

MILCOM Military Communications conference

作者： Musman, S. Mitre Corp Mclean VA 22215 USA

ISBN: (纸本)9781424481804

We describe a distributed reasoning system called Otto-Mate that is used to detect, reason about, and respond to incidents on a computing network. Events for monitoring computing networks occur at different system levels. Some information might relate to data, some might be operating system specific, some application or service related, some could be network related, and from each there will be compound events that describe incident effects and information about the situation context. All together there can be thousands of events per second. Today's approaches to monitoring networks are typically centralized, sending events over the network to a single engine for analysis. Centralized monitoring ultimately cannot scale to address the volume of events that one would ideally like to be able to monitor, so techniques of today often make severe compromises relating to the events that they ingest. Centralized monitoring creates a single point of failure and also generates significant network load. To overcome these deficiencies we have developed a more distributed, approach: our reasoner agents can (in theory) be installed on every monitored resources and the reasoner language (used for programming the reasoners) enables knowledge in a reasoner's working memory to be synchronized over multiple reasoners enabling them to implement parallel distributed reasoning algorithms that are able detect event patterns irrespective of whether the events are local or remote. Distributing the reasoning makes the system extremely resilient. Additionally, since the knowledge shared between the reasoning agents represents summary information, and because many on-line event correlation algorithms often suppress reporting once an incident has been reported, the amount of network load needed to support the distributed monitoring can actually be reduced. To demonstrate our approach we describe its application to the monitoring of a computing network that has been instrumented to protect it ag

关键词： network and security monitoring event correlation distributed reasoning parallel programs autonomic response intelligent agents

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：