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

10th International Conference on Algorithms and Architectures for parallel processing

作者： Liu, Feng Tan, Qingping Song, Xiaoyu Chen, Gang National Lab. of Parallel Distributed Processing Hunan China ECE Department Portland State University Portland OR United States Lingcore Lab. Portland OR United States

ISBN: (纸本)9783642131189

In this paper, we present a general architecture of hybrid prefix/carry-select adder. Based on this architecture, we formalize the hybrid adder's algorithm using the first-order recursive equations and develop a proof framework to prove its correctness. Since several previous adders in the literature are special cases of this general architecture, our methodology can be used to prove the correctness of different hybrid prefix/carry-select adders. The formal proof for a special hybrid prefix/carry-select adder shows the effectiveness of the algebraic structures built in this paper.

关键词： Adders

来源：评论

学校读者我要写书评

暂无评论

A high efficient in-place transposition scheme for multidimensional arrays

A high efficient in-place transposition scheme for multidime...

引用

3rd International Conference on Information and Computing, ICIC 2010

作者： Yuan, Jie Wu, Jian-Ping Wang, Zheng-Hua National Lab. of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computer Science National University of Defense Changsha China

ISBN: (纸本)9780769540474

This paper presents a in-place cycle-reducing method for multidimensional arrays transposition in local memory to reduce the memory R/W operations. The resulting method can significantly reduce the number of subcycles (also called following-cycles) and that of memory operations for square arrays. Taking square array 256 by 256 for example, the number of subcycles used by current available best algorithm can be reduced from 32894 to only 574, using our new method, and the memory operation number can be reduced by about 32.58%, from 98430 to 66366. Taking advantage of this new method, the elapsed time can be reduced as a result. The number of cycles and operations can also be reduced for 2D rectangle arrays with 2m rows and 2n column stored in column-major, especially n=2m, even though the improvement is not as significant as that for square arrays. The improved 2D in-place algorithm has been extended to 3D arrays, and some theoretic and numerical results are also provided. Furthermore, we develop a new in-place 3D arrays transposition algorithm. This algorithm is very important for a deep research for multidimensional arrays. Experimental results show that our algorithm can improve efficiency significantly, compared to some other 3D array transposition schemes. © 2010 IEEE.

关键词： Multidimensional array Memory operation Cycle-reducing Transposition In-place transposition Transposition arrays three-dimensional array Local Memory MULTIDIMENSIONAL

来源：评论

学校读者我要写书评

暂无评论

parallel transposing and communication strategies for FFT on cluster of SMP architectures with multicore processors

Parallel transposing and communication strategies for FFT on...

引用

Congress on Image and Signal processing, CISP

ISBN: (纸本)9781424465149

This paper presents a high performance parallel formulation for 1-D FFT based on transpose algorithm. The parallel scheme of FFT trades off some efficiency for a more consistent level of parallel performance. It involves matrix transposition, and a new in-place transposing algorithm is introduced into the parallel matrix transposition to improve the efficiency. Depending on the size of the input n, the number of processes p, and the memory or network bandwidth, this method can achieve better parallel performance than the other on cluster of SMP architectures. Test shows us that our scheme can achieve a good speedup. ©2010 IEEE.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Coverage problem in wireless sensor network: A survey

引用

Journal of Networks 2010年第9期5卷 1033-1040页

作者： Fan, Gao Jun Jin, Shi Yao National Lab of Parallel and Distributed Processing National University of Defense Technology Chang Sha China

Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. The coverage of WSN has answered the questions about quality of service (surveillance) which can be provided by WSN. Therefore, maximizing coverage using the resource constrained nodes is a non-trivial problem. The coverage problem for wireless sensor network (WSN) has been studied extensively in recent years, especially when combined with connectivity and energy efficiency. In this paper we present a survey of coverage problem. And besides some basic design considerations in coverage of WSN we describe two challenges, namely, maximizing network lifetime and network connectivity. We also provide a brief summary and comparison of existing coverage schemes. © 2010 ACADEMY PUBLISHER.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Reducing cache contention in a multi-core processor via a scheduler

Reducing cache contention in a multi-core processor via a sc...

引用

International Conference on Advanced Computer Theory and Engineering

作者： Shekofteh, S. Kazem Deldari, Hossein Khalkhali, Maryam Baradaran Parallel and Distributed Processing Lab. Department of Computer Engineering Ferdowsi University of Mashhad Mashhad Iran Department of Computer Engineering Islamic Azad University Mashhad Branch Mashhad Iran

ISBN: (纸本)9781424465408

Multi-core architectures, which have multiple processing units on a single chip, are widely viewed as a way to achieve higher processor performance. Well scheduling of running threads on these processors will result in achieving higher performance. Modern multi-core systems are designed to allow clusters of cores to share various hardware structures, such as last-level caches, memory controllers, and interconnections, as well as prefetching hardware. Without considering these shared resources, scheduling the threads will cause serious degradation in overall performance of the system. In this paper we propose a novel algorithm to schedule the threads that considers these potential contentions to keep away from. The simulation results showed that the proposed scheduler would avoid from lots of contentions between threads on various resources especially on shared caches. © 2010 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

AOP-based high-level power estimation in SystemC 10

AOP-based high-level power estimation in SystemC

引用

20th Great Lakes Symposium on VLSI, GLSVLSI 2010

作者： Liu, Feng Tan, Qingping Song, Xiaoyu Abbasi, Naeem National Lab. of Parallel Distributed Processing China ECE Dept. Portland State University Portland OR United States ECE Dept. Concordia University Montreal QC Canada

The paper presents a novel high-level power modeling and estimation framework. The approach is based on a synergic integration of aspect-oriented programming(AOP) and SystemC. Macro module modeling and power estimatio... 详细信息

ISBN: (纸本)9781450300124

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

An Improved Independent Set Ordering Algorithm for Solving Large-scale Sparse Linear Systems

An Improved Independent Set Ordering Algorithm for Solving L...

引用

2010 Second International Conference on Intelligent Human-Machine Systems and Cybernetics(第二届智能人机系统与控制论国际学术会议 IHMSC 2010)

作者： Lu Yao Wei Cao Zongzhe Li Yongxian Wang Zhenghua Wang National Key Lab for Parallel and Distributed Processing National Univ.of Defense TechnologyChangshaChina

The independent set ordering algorithm is a heuristic algorithm based on finding maximal independent sets of vertices in the matrix adjacency graph, which is commonly used for parallel matrix factorization. However, Disadvantages appear when it is applied to large-scale sparse linear systems. In this paper, we propose an improved algorithm by finding an optimal size of independent set in each elimination step rather than find a maximal independent set, which is proved to be effective by both theoretical analysis and parallel implementation.

关键词： independent set parallel LU decomposition large-scale sparse linear systems matrix ordering

来源：评论

学校读者我要写书评

暂无评论

A virtual machine server aggregation algorithm based on hierarchical clustering

A virtual machine server aggregation algorithm based on hier...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Huang, Feng Li, Dongsheng National Lab for Parallel and Distributed Processing College of Computer Changsha China

ISBN: (纸本)9780769539003

Combining virtual machine technology and network computing technology will be able to effectively aggregate the widely distributed heterogeneous and autonomous resources in the Internet. This paper proposes a virtual machine server aggregation algorithm, called DVSA, based on hierarchical clustering method for virtual computing environment. According to network latencies, the algorithm clusters virtual machine servers into groups. If servers in the same group are scheduled, the latencies between virtual machines which host on these servers will be small, and the performance and stability of the distributed execution environment could be improved. © 2009 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Creating virtual networks for distributed virtual computing environment

Creating virtual networks for distributed virtual computing ...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Li, Dongsheng Chen, Yixin Huang, Feng National Lab. for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha City Hunan Province China

ISBN: (纸本)9780769539003

Virtual network is an important approach to support multiple legacy applications running unmodified in distributed virtual computing environments. A virtual networking approach called VirNet is proposed in this paper. VirNet can build multiple customized and isolated virtual networks simultaneously on the same physical hosts in the network, and it enables existing distributed applications written for LANs to run seamlessly on Internet. VirNet is designed completely in user space and requires no change to the kernel of operating systems. Experimental evaluation performed by a reference implementation shows that VirNet is efficient. The latency overhead caused by VirNet is very small and the bandwidth of VirNet is more than 85% of the available physical network bandwidth in both the LAN and emulated WAN environments. © 2009 IEEE.

关键词： Taps

来源：评论

学校读者我要写书评

暂无评论

A Case Study on System-Level Modeling by Aspect-Oriented Programming

A Case Study on System-Level Modeling by Aspect-Oriented Pro...

引用

10th International Symposium on Quality Electronic Design

作者： Liu, Feng Mohamed, Otmane Ait Song, Xiaoyu Tan, Qingping National Lab of Parallel Distributed Processing Hunan China ECE department Concordia University Montreal QC Canada ECE department Portland State University Portland OR United States

ISBN: (纸本)9781424429523

The paper presents a novel and synergistic system-level modeling approach based on aspect-oriented programming (AOP) and SystemC. A case study on a 128-bit binary floating-point adder is performed to demonstrate the modeling strength of the approach. The validation experiment shows the effectiveness of the proposed approach. This work constitutes a first attempt to employ AOP in modeling digital systems.

关键词： System-Level Modeling AOP SystemC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：