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

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

来源：评论

学校读者我要写书评

暂无评论

Making human connectome faster: GPU acceleration of brain network analysis

Making human connectome faster: GPU acceleration of brain ne...

引用

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

作者： Wu, Di Wu, Tianji Shan, Yi Wang, Yu He, Yong Xu, Ningyi Yang, Huazhong Department of Electronic Engineering Tsinghua National Laboratory for Information Science and Technology Tsinghua University China State Key Laboratory of Cognitive Neuroscience and Learning Beijing Normal University China Microsoft Research Asia Hardware Computing Group China

ISBN: (纸本)9780769543079

The research on complex Brain networks plays a vital role in understanding the connectivity patterns of the human brain and disease-related alterations. Recent studies have suggested a noninvasive way to model and analyze human brain networks by using multi-modal imaging and graph theoretical approaches. Both the construction and analysis of the Brain networks require tremendous computation. As a result, most current studies of the Brain networks are focused on a coarse scale based on Brain Regions. networks on this scale usually consist around 100 nodes. The more accurate and meticulous voxel-base Brain networks, on the other hand, may consist 20K to 100K nodes. In response to the difficulties of analyzing large-scale networks, we propose an acceleration framework for voxel-base Brain Network Analysis based on Graphics Processing Unit (GPU). Our GPU implementations of Brain Network construction and modularity achieve 24x and 80x speedup respectively, compared with single-core CPU. Our work makes the processing time affordable to analyze multiple large-scale Brain networks. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards the efficiency of ontology-based context reasoning in virtual computing environment

Towards the efficiency of ontology-based context reasoning i...

引用

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

作者： Wang, Shanshan Wu, Gang Cao, Xiao Chong School of Software Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769543079

Context-aware computing is one of the key issues in virtual computing environment. This paper aims to compare the ontology-based context modeling and reasoning approach with the traditional non-semantic one. A general scenario of virtual computing is given about the dynamical service aggregation and evolution. And the context of the environment is modeled respectively using an OWL based way and a Markup scheme. Then two sets of experiments are designed to analyze these two approaches from different perspectives like reasoning efficiency, modeling capability and convenience. © 2010 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

23th international conference on Architecture of computing Systems 2010, ARCS 2010 - Workshop Proceedings

23th International Conference on Architecture of Computing S...

引用

23th international conference on Architecture of computing Systems 2010, ARCS 2010

ISBN: (纸本)9783800732227

The proceedings contain 52 papers. The topics discussed include: improved bitonic sorting by wire elimination;parallel join processing on graphics processors for the resource description framework;modeling data distribution for two-phase flow problems by weighted graphs;distributed vision graph update in mobile vision networks;routing based on evolved agents;a block device driver for parallel and fault-tolerant storage;operating system processor scheduler design for future chip multiprocessor;evaluation and refinement of a tuning tool for grid applications;platform-independent modeling of explicitly parallel programs;and delivering guidance information in heterogeneous systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Peer-to-peer networks and collective intelligence: The case for agency

Peer-to-peer networks and collective intelligence: The case ...

引用

5th international conference on P2P, parallel, Grid, Cloud and Internet computing, 3PGCIC 2010

作者： Hill, Richard Antonopoulos, Nikos Distributed and Intelligent Systems Research Group University of Derby Derby United Kingdom

ISBN: (纸本)9780769542379

The vast quantity of data contributed and consumed via the Internet provides an environment where Collective Intelligence (CI) can emerge. This article considers CI in relation to the Peer-to-Peer (P2P) paradigm, an environment that has the necessary conditions for the generation of large data sets through frequent peer interactions. We then examine the characteristics of agency and relate agent computing to the conditions required to facilitate CI in P2P systems. Furthermore, we present a key research challenge for the community and propose an approach to scrutinise CI in a P2P scenario that makes use of local primitive behaviours to infer the likely collective emergent behaviours for a particular system. © 2010 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

A high-level interpreted MPI library for parallel computing in volunteer environments 10

A high-level interpreted MPI library for parallel computing ...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： LeBlanc, Troy P. Subhlok, Jaspal Gabriel, Edgar Department of Computer Science University of Houston Houston TX 77204 United States

ISBN: (纸本)9781424469871

Idle desktops have been successfully used to run sequential and master-slave task parallel codes on a large scale in the context of volunteer computing. However, execution of message passing parallel programs in such environments is challenging because a pool of nodes to execute an application may have architectural and operating system heterogeneity, can include widely distributed nodes across security domains, and nodes may become unavailable for computation frequently and without warning. The VolPEx (parallel Execution on Volatile Nodes) tool set is building MPI support in such environments based on selective use of process redundancy and message logging. However, addressing this challenge requires tradeoffs between performance, portability, and usability. The paper introduces a robust MPI library that is designed to be highly portable across heterogeneous architectures and operating systems. This VolpexPyMPI library is built with Python, works with Linux and Windows platforms and accepts user level MPI programs written in C or FORTRAN. The performance of VolpexPyMPI is compared with a traditional C based implementation of MPI. The paper examines in detail the tradeoffs of these usability focused and performance focused approaches. © 2010 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient distributed Algorithm for Minimum-Latency Aggregation Scheduling in Wireless Sensor networks

An Energy-Efficient Distributed Algorithm for Minimum-Latenc...

引用

international conference on distributed computing Systems (ICDCS 2010)

作者： Li, Yingshu Guo, Longjiang Prasad, Sushil K. Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9780769540597

Data aggregation is an essential yet time-consuming task in wireless sensor networks (WSNs). This paper studies the well-known Minimum-Latency Aggregation Schedule (MLAS) problem and proposes an energy-efficient distributed scheduling algorithm named Clu-DDAS based on a novel cluster-based aggregation tree. Our approach differs from all the previous schemes where Connected Dominating Sets or Maximal Independent Sets are employed. We prove that Clu-DDAS has a latency bound of 4R' + 2 Delta - 2, where. is the maximum degree and R' is the inferior network radius which is smaller than the network radius R. Clu-DDAS has comparable latency as the previously best centralized algorithm E-PAS, while Clu-DDAS consumes 78% less energy as shown by the simulation results. Clu-DDAS outperforms the previously best distributed algorithm DAS whose latency bound is 16R' + Delta - 14 on both latency and energy consumption. On average, Clu-DDAS transmits 67% fewer total messages than DAS does. We also propose an adaptive strategy for updating the schedule to accommodate dynamic network topology.

关键词： Cluster-based Aggregation Tree MLAS Inferior Network Radius Maximum Degree

来源：评论

学校读者我要写书评

暂无评论

Coordinated selective rejuvenation for distributed services

Coordinated selective rejuvenation for distributed services

引用

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

作者： Tian, Guanhua Meng, Dan Institute of Computing Technology Chinese Academy of Science China Graduate University Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9780769543079

Service availability and QoS, in terms of customer affecting performance metrics, is crucial for service systems. However, the increasing complexity in distributed service systems introduce hidden space for software faults, which undermine system availability, leading to fault or even down time. In this paper, we introduce a composition technique, Coordinated Selective Rejuvenation, to automate the whole procession of fault component identification and rejuvenation arbitration, in order to guarantee distributed service system's customer-affecting metrics. We take evaluation with fault injection experiment on RUBiS, which simulates distributed eCommerce of ***. The results indicate that our request path analysis approach and system model technique are effective for fault component's location, Bayesian network technique is feasible for fault pinpointing, in terms of request tracing context. Meanwhile, the arbitration scheme, can effectively guarantee system QoS, by identifying and rejuvenating most likely performance fault tier, before the degradation of customer affecting performance metric become severe. © 2010 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

A cooperative intrusion detection system framework for cloud computing networks

A cooperative intrusion detection system framework for cloud...

引用

international Workshop on Scheduling and Resource Management for parallel and distributed Systems

作者： Lo, Chi-Chun Huang, Chun-Chieh Ku, Joy Institute of Information Management National Chiao Tung University Hsinchu Taiwan

ISBN: (纸本)9780769541570

Cloud computing provides a framework for supporting end users easily attaching powerful services and applications through Internet. To provide secure and reliable services in cloud computing environment is an important issue. One of the security issues is how to reduce the impact of denial-of-service (DoS) attack or distributed denial-of-service (DDoS) in this environment. To counter these kinds of attacks, a framework of cooperative intrusion detection system (IDS) is proposed. The proposed system could reduce the impact of these kinds of attacks. To provide such ability, IDSs in the cloud computing regions exchange their alerts with each other. In the system, each of IDSs has a cooperative agent used to compute and determine whether to accept the alerts sent from other IDSs or not. By this way, IDSs could avoid the same type of attack happening. The implementation results indicate that the proposed system could resist DoS attack. Moreover, by comparison, the proposed cooperative IDS system only increases little computation effort compared with pure Snort based IDS but prevents the system from single point of failure attack. © 2010 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：