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

Pacific-Asia Workshop on Computational Intelligence and Industrial Application, PACIIA

作者： Wei Zhang Hangjun Zhou Yuxing Peng Sikun Li Min Xi National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China Department of Computer Science Xi'an Jiaotong University Xi'an China

distributed Virtual Environment (DVE) systems have become more and more important both in academic communities and the industries. To guarantee the load constrain, the physical world integrity and the virtual world integrity, the virtual environment should be divided into several parts and mapped to multiple servers, which are located in geographically different places. Many centralized algorithms based on regular cutting method are proposed to solve this problem. However, the dynamic property of clients and distributed property of the system make the existing algorithms unable to undertake it. In this paper, we propose a metric to measure the cutting quality and design a distributed mapping algorithm based on an irregular cutting. Simulation results show that our algorithm greatly decreases the costs of DVE systems for migration of clients and effectively improves the satisfaction degree of users.

关键词： Defense industry Virtual environment computer industry computer science Algorithm design and analysis Delay Partitioning algorithms Industrial training Computational intelligence Application software

来源：评论

学校读者我要写书评

暂无评论

A Multi-agent Simulation of Escape Panic

A Multi-agent Simulation of Escape Panic

引用

International Joint Conference on Computational Sciences and Optimization, CSO

作者： Chuanjun Ren Chenghui Yang Shiyao Jin National Laboratory for Parallel & Distributed Processing College of Computer Science National University of Defense Technology Changsha China National Laboratory for Parallel & Distributed Processinz National University of Defense Technology Changsha China National University of Defense Technology Changsha Hunan CN

The modeling and simulation on evacuation has recently become a topic of great interest. We present an agent-based model to construct crowd evacuations for emergency response from an area under an explosion. Various types of agents are designed as well as the interactions of them are concerned in contrast to traditional models in which the total populations are considered to be consisted of identical individuals and the interactions between them are omitted. Different cases are taken into account to test the effect of our model by iterative simulations. At last, plenty simulation results suggest several effective ways to minimize the harmful consequences of such life-threaten events.

关键词： Explosions Computational modeling computer simulation Testing Accidents Humans Analytical models Concurrent computing distributed computing distributed processing

来源：评论

学校读者我要写书评

暂无评论

Balancing parallel Applications on Multi-core Processors Based on Cache Partitioning

Balancing Parallel Applications on Multi-core Processors Bas...

引用

International Symposium on parallel and distributed processing with Applications, ISPA

作者： Guang Suo Xue-jun Yang Parallel and Distribute Processing Laboratory School of Computer National University of Defense Technology Changsha China

Load balancing is an important problem for parallel applications. Recently, many super computers are built on multi-core processors which are usually sharing the last level cache. On one hand different accesses from different cores conflict each other, on the other hand different cores have different work loads resulting in load unbalancing. In this paper, we present a novel technique for balancing parallel applications for multi-core processors based on cache partitioning which can allocate different part of shared caches to different cores exclusively. Our intuitive idea is partitioning shared cache to different cores based on their workloads. That is to say, a heavy load core will get more shared caches than a light load core, so the heavy load core runs faster. We give 2 algorithms in this paper, initial cache partitioning algorithm (ICP) and dynamical cache partitioning algorithm (DCP). ICP is used to determine the best partition when application starting while DCP is used to adjust the initial partition based on the changes of load balancing. Our experiment results show that the running time can be reduced by 7% on average when our load balancing mechanism based on cache partitioning is used.

关键词： Multicore processing Application software Concurrent computing Frequency synchronization Partitioning algorithms Load management Laboratories distributed computing Heuristic algorithms Iterative closest point algorithm

来源：评论

学校读者我要写书评

暂无评论

An Optimal Mapping Algorithm Based on Balanced Load Cutting for DVE Systems

An Optimal Mapping Algorithm Based on Balanced Load Cutting ...

引用

International Symposium on Intelligent Information Technology Application, IITA

作者： Wei Zhang Min Xi Hangjun Zhou Yuxing Peng Sikun Li National Laboratory for Parallel and Distributed Processing National University of Defense Technology ChangSha China Department of Computer Science Xi'an Jiaotong University Xi'an China

In distributed virtual environment (DVE) systems, a distributed server infrastructure is often used to reduce the latency between servers and clients. Under this infrastructure, mapping clients to proper servers is one of the key issues for improving the interactivity and overall performance. Most traditional methods of mapping the clients to servers only consider the load balancing problem. However, there are two other important aspects that should be involved: the physical world integrity and the virtual world integrity. In this work, we propose a novel mapping algorithm which takes care of all three aspects at the same time. The algorithm converts the mapping problem into cutting stage and matching stage to get optimal result with polynomial complexity. The experimental results show that our algorithm improves the overall performance of DVE systems significantly.

关键词： Delay Network servers computer science Virtual environment Load management Polynomials Quality of service Information technology Application software distributed processing

来源：评论

学校读者我要写书评

暂无评论

MEASURING THE INFLUENCE OF SOCIAL NETWORKS ON INFORMATION DIFFUSION ON BLOGSPHERES

MEASURING THE INFLUENCE OF SOCIAL NETWORKS ON INFORMATION DI...

引用

2009 International Conference on Machine Learning and Cybernetics(2009机器学习与控制论国际会议)

作者： TING WANG JIN-TAO TANG JI WANG School of Computer National University of Defense Technology.Changsha Hunan 410073 P.R.China National Laboratory for Parallel and Distributed Processing ChangSha Hunan 410073 China

As a typical social media in web2.0 era, blogs have become more and more important to information diffusion. Different from the traditional news, the information spread on blogs is primarily driven by users and their relations. According to this phenomenon, this paper addresses the novel problem of measuring the influence of social structures on information diffusion. This paper extracts the hidden communities and information diffusion networks on blogs, and proposes a novel quantitative measurement to investigate the influence of social networks structure on diffusion networks. The proposed methods measure the influence by utilizing a simple but effective graph similarity measuring method. The experiments demonstrate the effectiveness of the proposed algorithms and measurements, and discover the correlation between social networks and the diffusion of the "interest" topics, which indicates the necessity of using social structures for information detection and tracking on blogs.

关键词： Blogs information diffusion social networks graph similarity correlation measurement

来源：评论

学校读者我要写书评

暂无评论

Optimizing Reference Gene Set for Inter-Chip Normalization Using Genetic Algorithm

Optimizing Reference Gene Set for Inter-Chip Normalization U...

引用

International Conference on BioMedical Engineering and Informatics (BMEI)

作者： Fei Li Wenjian Xu Peng Li XiaoChen Bo Yuxing Peng Department of Computer Science National Laboratory of Parallel & Distributed Processing National University of Defense Technology Changsha China Beijing Institute of Radiation Medicine Beijing China

Due to the existence of systematic bias in the measurements, inter-chip normalization is required before integrated data analysis of multiple microarray datasets. Current inter-chip normalization methods rely on some assumptions, which can rarely be verified by experiments, such as the invariant expression level of housekeeping genes or the stability of statistical data distribution. In this paper, we present a highly verifiable inter-chip normalization method using genetic optimization algorithm, which depends only on a small number of housekeeping genes, and therefore facilitates experimental validation without any accuracy lost.

关键词： Genetic algorithms Gene expression Laboratories Data analysis Optimization methods Genomics Bioinformatics Statistical distributions Probes computer science

来源：评论

学校读者我要写书评

暂无评论

Reliability Speedup: An Effective Metric for parallel Application with Checkpointing

Reliability Speedup: An Effective Metric for Parallel Applic...

引用

IEEE International Conference on parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Zhiyuan Wang National Laboratory for Paralleling and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

With parallel computing system scaling up, the system reliability drastically decreases, so parallel applications running on such system must tolerate hardware failures. Checkpointing is widely used in the domain of large-scale parallel computing, which periodically saves the state of computation to stable storage. This produces in negligible fault tolerance overhead. The traditional speedup only measures the performance of failure-free system. In this paper, we firstly propose the speedup metric taking into account checkpointing overhead. The new metric unifies the performance and reliability measures, and evaluates the practical speedup of parallel application with checkpointing. Furthermore, this paper classifies and analyzes existing parallel systems according to the proposed speedup metric, and makes suggestions on system design and fault tolerance techniques improvement. Finally, we validate the analysis of this new speedup metric by experiment. The experimental results indicate that the proposed speedup for parallel application with checkpointing is an effective metric.

关键词： Checkpointing parallel processing Velocity measurement Reliability Hardware Large-scale systems Concurrent computing Fault tolerance System analysis and design Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

Cache Partitioning on Chip Multi-Processors for Balanced parallel Scientific Applications

Cache Partitioning on Chip Multi-Processors for Balanced Par...

引用

IEEE International Conference on parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Guang Suo National Laboratory for Paralleling and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

Nowadays, more and more supercomputers are built on multi-core processors with shared caches. However, the conflict accesses to shared cache from different threads or processes become a performance bottleneck for parallel applications. Cache partitioning can be used to allocate cache resources for different processes exclusively according to the demands of the processes. Conflicted accesses are avoided by restricting cache accesses to distinct private part of shared caches. This paper studies the problem of shared cache partition for balanced MPI parallel applications in CMP architecture, presenting the performance oriented cache partitioning framework, including Spatial-Level Cache Partitioning (SLCP), Time-level Cache Partitioning (TLCP) and the evaluation of them. We evaluate SLCP and TLCP based on a quad-core simulator. Experiment shows that the SLCP and TLCP outperforms traditional LRU cache replacement policy in IPC throughput and miss rate metric. Specifically, for large workloads, TLCP outperforms LRU by up to 20% and on average 8.7%.

关键词： Application software Yarn Supercomputers Multicore processing Predictive models distributed computing Concurrent computing Resource management Throughput Cache memory

来源：评论

学校读者我要写书评

暂无评论

Scheduling algorithm for long duration transaction based on cost of compensation

引用

Ruan Jian Xue Bao/Journal of Software 2009年第3期20卷 744-753页

作者： Zhu, Rui Guo, Chang-Guo Wang, Huai-Min School of Computer National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

Transaction of service composition has long-lived feature which a global-transaction is divided into several distributed sub-transactions. Atomicity property is preserved by using compensating transactions, which semantically undo the effects of the completed sub-transactions, in case of global-transaction abort. However, the cost of compensation may be expensive and methods may be complex. To overcome this limitation, a novel scheduling algorithm named STCD (SubTransaction committing delay) is presented based on analysis of compensation. Different from traditional methods, sub-transactions determine the time of committing according to both the cost of compensation and the state of execution dynamically. The correctness of proposed algorithm is proved. Simulations show that STCD algorithm can confine the compensation sphere and reduce the cost of compensation. © by Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Scalable unbiased sampling method based on multi-peer adaptive random walk

引用

Ruan Jian Xue Bao/Journal of Software 2009年第3期20卷 630-643页

作者： Fu, Yong-Quan Wang, Yi-Jie Zhou, Jing National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China Staff Room of Computer Command Academy of the Corps of Engineers Xuzhou 221000 China

To deal with the scalable and fast unbiased sampling problems in unstructured P2P systems, a sampling method based on multi-peer adaptive random walk (SMARW) is proposed. In the method, based on the multi-peer random walk process, a set of provisional peers are selected as agents which start the sampling processes, by which the sampling process is speeded up with receiving a set of tunable number samples each time;Meanwhile, after receiving new samples earlier agents are replaced with these new samples which repeat the sampling process. With this simple replacement, it can be guaranteed with high probability that the system can reach the optimal load balance;furthermore, SMARW adopts an adaptive distributed random walk adjustment process to increase the convergence rate of the sampling process. A detailed theorical analysis and performance evaluation confirm that SMARW has a high level of unbiased sampling and near-optimal load balancing capability. © by Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：