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

International Conference on parallel and distributed Systems (ICPADS)

作者： Yongquan Fu Yijie Wang National Key Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology China

Predicting network latencies between Internet hosts can efficiently support large-scale Internet applications, e.g., file sharing service and the overlay construction. Several study use the hyperbolic space to model the Internet dense-core and many-tendril structure. However, existing hyperbolic space based embedding approaches are not designed for accurate latency estimation in the distributed context. We present HyperSpring, which estimates latency by modelling a mass spring system in the hyperbolic similar with Vivaldi. HyperSpring adopts coordinate initialization to speed up the convergence of coordinate computation, uses multiple-round symmetric updates to escape from bad local minima, and stabilizes coordinates by compensating RTT measurements to reduce the coordinate drifts. Evaluation results based on a network trace of 226 PlanetLab nodes indicate that, compared to Euclidean-space based Vivaldi, hyperspring provides performance improvements for most nodes, and incurs slightly higher distortions for a small number of nodes.

关键词： Delay IP networks Web and internet services Large-scale systems Peer to peer computing Springs Convergence Coordinate measuring machines Distortion measurement Extraterrestrial measurements

来源：评论

学校读者我要写书评

暂无评论

Optimization techniques of on-chip memory system based on UltraSPARC architecture

Optimization techniques of on-chip memory system based on Ul...

引用

Asia Pacific Conference on Postgraduate Research in Microelectronics & Electronics (PrimeAsia)

作者： Anwen Huang Jun Gao Chaochao Feng Minxuan Zhang Key Laboratory of Science and Technology of National Defense of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

It is of great significance to optimize the design of on-chip memory system for improving the performance of multi-core processor. This paper describes the organization of on-chip memory hierarchy in UltraSPARC T2, analyzes the procedure of dealing with the memory access request from multi-core processor in detail. To get the basic parameters of timing characteristic and area consumption, the primary element of on-chip memory system is simulated by ModelSim and synthesized by Synopsys Design Complier with 90 nm standard cell library. Aimed at the potential limiting factor of improving the performance of memory hierarchy, corresponding optimization techniques of critical elements in memory system are explored finally.

关键词： System-on-a-chip Elliptic curve cryptography Hardware Costs Algorithm design and analysis Random access memory Clocks Registers Elliptic curves Protection

来源：评论

学校读者我要写书评

暂无评论

Providing Responsiveness Requirement Based Consistency in DVE

Providing Responsiveness Requirement Based Consistency in DV...

引用

International Conference on parallel and distributed Systems (ICPADS)

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

Consistency and responsiveness are two important factors in providing the sense of reality in distributed Virtual Environment (DVE). However, it is not easy to optimize both aspects because of the trade-off between these two factors. As a result, most existing consistency maintenance methods ignored the responsiveness requirements, or just assumed a simple responsiveness requirement model which cannot meet the real need of DVE systems. In this paper, we first present a new responsiveness requirement model. The model can describe requirement satisfaction situation of each node. Base on this model, we propose a responsiveness requirement based consistency method. The method can adjust the utilization of time resource according to the requirements of different nodes and improve the overall responsiveness performance by at least 20%. Therefore, it provides a good support to increase the applicability of DVE systems.

关键词： Delay effects Virtual environment distributed processing computer science Games Distance learning Electronic commerce Safety Research and development Real time systems

来源：评论

学校读者我要写书评

暂无评论

Anode-ALM: An Aggregation-Based Application Level Multicast for Media Streaming

Anode-ALM: An Aggregation-Based Application Level Multicast ...

引用

International Symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： Feng Liu Yuxing Peng Xicheng Lu Parallel and Distributed Processing Laboratory School of Computer Science and Technology National University of Defense Technology Changsha China

Building application level multicast (ALM) for media streaming, we had better keep the invariability of source to-end delay (S2EDelay) of any node on the tree, so as to avoid delay jitter problem. In this paper, we proposed an aggregation-based ALM architecture, which aggregates the unstable nodes within a local area into a relative stable aggregation node Anode, and then builds tree by Anodes. Anode shields node's dynamicity inside and behaves as a stable one outside. To build the architecture, we first proposed an Anode structure by n-dimension anti-cube, and proposed a distributed algorithm to bind the logic view and physical view of an Anode dynamically by the differentiation and assimilation operations, which maintain the integrality of the logic view while the physical view changes dynamically. Experiment results indicate that our algorithm can keep the S2EDelay invariability of the built ALM tree effectively.

关键词： Streaming media Anodes Delay Stability Application software Jitter distributed algorithms Logic Internet Network topology

来源：评论

学校读者我要写书评

暂无评论

A Two-Phase Mapping Method for parallel Applications Simulation

A Two-Phase Mapping Method for Parallel Applications Simulat...

引用

International Conference on Computational Intelligence and Software Engineering (CiSE)

作者： Jianbin Fang Chuanfu Xu Yonggang Che Yufen Weng Zhenghua Wang National Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

Efficient mapping of logical processes to physical processes is one of key technologies to accelerate parallel performance simulation. Aiming at minimizing the communications between SMP nodes and between host physical processes, this paper presents a novel method named TPsmp-LP 3 M. It automatically extracts communication pattern of logical processes from trace and then generates a two-phase mapping from logical processes to SMP clusters. Experimental results show that TPsmp-LP 3 M can outperform the regular mapping method by up to 20.2%.

关键词： Computational modeling computer simulation Bandwidth Predictive models Discrete event simulation Concurrent computing parallel processing Application software Laboratories distributed processing

来源：评论

学校读者我要写书评

暂无评论

Matrix Inversion on the Cell/B.E. Processor

Matrix Inversion on the Cell/B.E. Processor

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Shodai Yokoyama Kazuya Matsumoto Stanislav Sedukhin Distributed Parallel Processing Laboratory Graduate School of Computer Science and Engineering University of Aizu Japan

The problem of inverting matrices is one that occurs in some problems of practical importance. This paper introduces and evaluates the block algorithm for high performance matrix inversion on the Cell Broadband Engine (Cell/B.E.) processor. The Cell/B.E. is a heterogeneous multi-core processor on a single-chip jointly developed by Sony, Toshiba and IBM, which has a very high speed of the single precision floating-point arithmetic. The discussed matrix inversion algorithm is a combination of the block algebraic path problem algorithm and the well-known block matrix inversion algorithm based on the LU decomposition. For relatively big matrices, this combined block algorithm spends the most time in computing matrix-matrix multiplication of blocks and achieves 149.4 Gflop/s on Cell/B.E., when PPE and six SPEs of PlayStation3 are used, or 93.4% of the aggregated double (PPE) and single (SPEs) precision peak performance, which is 160.0 Gflop/s.

关键词： Matrix decomposition Partitioning algorithms Floating-point arithmetic Engines Multicore processing Microprocessors Reduced instruction set computing High performance computing parallel processing computer science

来源：评论

学校读者我要写书评

暂无评论

Laser-driven inertial ion focusing

引用

Physical Review E 2009年第1期79卷 015401(R)-015401(R)页

作者： H. B. Zhuo Wei Yu M. Y. Yu H. Xu X. Wang B. F. Shen Z. M. Sheng J. Zhang National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany Department of Physics Jiaotong University Shanghai 200240 China

A Hohlraum-like configuration is proposed for realizing a simple compact source for neutrons. A laser pulse enters a tiny thin-shelled hollow-sphere target through a small opening and is self-consistently trapped in the cavity. The electrons in the inner shell-wall region are expelled by the light pressure. The resulting space-charge field compresses the local ions into a thin layer that becomes strongly heated. An inward expansion of ions into the shell cavity then occurs, resulting in the formation at the cavity center of a hot spot of ions at high density and temperature, similar to that in inertial electrostatic confinement.

关键词： laser fusion neutron sources particle beam focusing ELECTROSTATIC CONFINEMENT FUSION DEVICE

来源：评论

学校读者我要写书评

暂无评论

An Irregular cutting based distributed mapping algorithm for DVE systems

An Irregular cutting based distributed mapping algorithm for...

引用

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

来源：评论

学校读者我要写书评

暂无评论

SCQR - A P2P Query Routing Algorithm Based on Semantic Cluster

SCQR - A P2P Query Routing Algorithm Based on Semantic Clust...

引用

International Symposium on Intelligent Ubiquitous Computing and Education

作者： Shiyao Jin Gui-Ming Zhu School of Computer Science National University of Defense Technology Changsha China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

The low efficiency and uncertainty routing is correct is a problem for resource location of an unstructured p2p network. It is hard to achieve high query hit with small cost and low latency for such kind of network. In this paper, we present a p2p query routing algorithm which is based on semantic cluster (SCQR). SCQR makes nodes clustered according to their semantic, and each cluster elects a super-node as cluster computing node which is responsible for computing cluster semantic and establishing links with all neighbor cluster computing nodes. Query is routed among cluster computing nodes. SCQR achieves high query hit with small routing latency and query cost in both analytical theoretical and experimental studies.

关键词： Query processing Clustering algorithms Peer to peer computing Routing Delay Costs computer networks Frequency Floods Intelligent networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：