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

Journal of Computational Mathematics 2007年第4期25卷 430-439页

作者： Chao Yang Jiachang Sun Parallel Computing Lab. Institute of Software Chinese Academy of Sciences Beijing 100080 China

In this paper, two new nonconforming hexagonal elements are presented, which are based on the trilinear function space Q1^（3） and are edge-oriented, analogical to the case of the rotated Q1 quadrilateral element. A priori error estimates are given to show that the new elements achieve first-order accuracy in the energy norm and second-order accuracy in the L^2 norm. This theoretical result is confirmed by the numerical tests.

关键词： Nonconforming finite element method Hexagonal element Q1 element.

来源：评论

学校读者我要写书评

暂无评论

A CONSTANT-TIME parallel SORTING ALGORITHM AND ITS OPTICAL IMPLEMENTATION

引用

IEEE MICRO 1995年第3期15卷 60-71页

作者： LOURI, A HATCH, JA NA, JH Opt. Comput. & Parallel Process. Lab. Arizona Univ. Tucson AZ USA Trimble Navigation Texas Optical Computing and Parallel Processing Laboratory University of Arizona

High-speed electronic sorting networks are difficult to implement with VLSI technology because of the dense and global connectivity required. Optics eliminates this bottleneck by offering global interconnections, massive parallelism, and noninterfering communications. We present a parallel sorting algorithm and its efficient optical implementation using currently availab.e optical hardware. The algorithm sorts n data elements in a few steps, independent of the number of elements to be sorted. Thus, it is a constant-time sorting algorithm, that is, O(1) time.

关键词： Sorting parallel Sorting Optical computing parallel Processing

来源：评论

学校读者我要写书评

暂无评论

A soft real-time, parallel GUI Service in Tessellation many-core OS

A soft real-time, parallel GUI Service in Tessellation many-...

引用

27th International Conference on Computers and Their Applications, CATA 2012

作者： Kim, Albert Colmenares, Juan A. Alkaff, Hilfi Kubiatowicz, John Parallel Computing Lab. CS Division UC Berkeley United States

ISBN: (纸本)9781880843840

We discuss the design and implementation of a parallel GUI Service in Tessellation OS and investigate its capability to provide soft service-time guarantees to visual applications. Use of GPU bandwidth reservation permits our GUI service to miss only 0.1% of client deadlines under an overloaded scenario, while a more traditional windowing system misses over 50% of its deadlines. Further, the GUI Service's parallel architecture nicely exploits parallelism to reduce service times for client requests.

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

Sparsifying synchronization for high-performance shared-memory sparse triangular solver

Sparsifying synchronization for high-performance shared-memo...

引用

29th International Supercomputing Conference, ISC 2014

作者： Park, Jongsoo Smelyanskiy, Mikhail Sundaram, Narayanan Dubey, Pradeep Parallel Computing Lab. Intel Corporation Santa Clara CA United States

ISBN: (纸本)9783319075174

The last decade has seen rapid growth of single-chip multiprocessors (CMPs), which have been leveraging Moore's law to deliver high concurrency via increases in the number of cores and vector width. Modern CMPs execute from several hundreds to several thousands concurrent operations per second, while their memory subsystem delivers from tens to hundreds Giga-bytes per second bandwidth. Taking advantage of these parallel resources requires highly tuned parallel implementations of key computational kernels, which form the back-bone of modern HPC. Sparse triangular solver is one such kernel and is the focus of this paper. It is widely used in several types of sparse linear solvers, and it is commonly considered challenging to parallelize and scale even on a moderate number of cores. This challenge is due to the fact that triangular solver typically has limited task-level parallelism and relies on fine-grain synchronization to exploit this parallelism, compared to data-parallel operations such as sparse matrix-vector multiplication. This paper presents synchronization sparsification technique that significantly reduces the overhead of synchronization in sparse triangular solver and improves its scalab.lity. We discover that a majority of task dependencies are redundant in task dependency graphs which are used to model the flow of computation in sparse triangular solver. We propose a fast and approximate sparsification algorithm, which eliminates more than 90% of these dependencies, substantially reducing synchronization overhead. As a result, on a 12-core Intel® Xeon® processor, our approach improves the performance of sparse triangular solver by 1.6x, compared to the conventional level-scheduling with barrier synchronization. This, in turn, leads to a 1.4x speedup in a pre-conditioned conjugate gradient solver. © 2014 Springer International Publishing.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Study of a code comment decision method based on structural features

Study of a code comment decision method based on structural ...

引用

2019 International Conference on Intelligent computing, Automation and Systems, ICICAS 2019

作者： Wang, Renmin Wang, Tao Wang, Huaimin Key Lab. of Parallel and Distributed Computing National University of Defense Technology Changsha China

ISBN: (纸本)9781728161068

Code comment is one of the most effective ways to help programmers to understand the source code. High-quality comment decisions can not only cover the core code snippets in the software system but also avoid generating redundant code comments. However, in actual development, there is no uniform comment specification, and most of the comment decisions depend on personal experience and domain knowledge. This paper has learned a common comment decision specification from a large number of code comment examples to assist programmers in making appropriate comment decisions during code development. This paper proposes a method to extract the code structure from the context code of the current code line, and use the machine learning algorithm to determine the possibility that the current code needs to add comments. The proposed method was evaluated on 8 well-known open-source Python projects in GitHub and the experimental results show the feasibility and effectiveness of the method in some code types. © 2019 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Lattice QCD on Intel® Xeon Phi™ coprocessors

Lattice QCD on Intel® Xeon Phi™ coprocessors

引用

28th International Supercomputing Conference on Supercomputing, ISC 2013

作者： Joó, Bálint Kalamkar, Dhiraj D. Vaidyanathan, Karthikeyan Smelyanskiy, Mikhail Pamnany, Kiran Lee, Victor W. Dubey, Pradeep Watson III, William Thomas Jefferson National Accelerator Facility Newport News VA United States Parallel Computing Lab. Intel Corporation Bangalore India Parallel Computing Lab. Intel Corporation Santa Clara CA United States

ISBN: (纸本)9783642387494

Lattice Quantum Chromodynamics (LQCD) is currently the only known model independent, non perturbative computational method for calculations in the theory of the strong interactions, and is of importance in studies of nuclear and high energy physics. LQCD codes use large fractions of supercomputing cycles worldwide and are often amongst the first to be ported to new high performance computing architectures. The recently released Intel Xeon Phi architecture from Intel Corporation features parallelism at the level of many x86-based cores, multiple threads per core, and vector processing units. In this contribution, we describe our experiences with optimizing a key LQCD kernel for the Xeon Phi architecture. On a single node, using single precision, our Dslash kernel sustains a performance of up to 320 GFLOPS, while our Conjugate Gradients solver sustains up to 237 GFLOPS. Furthermore we demonstrate a fully 'native' multi-node LQCD implementation running entirely on KNC nodes with minimum involvement of the host CPU. Our multi-node implementation of the solver has been strong scaled to 3.9 TFLOPS on 32 KNCs. © 2013 Springer-Verlag.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

Blackout: Speeding up recurrent neural network language models with very large vocabularies 4

Blackout: Speeding up recurrent neural network language mode...

引用

4th International Conference on Learning Representations, ICLR 2016

作者： Ji, Shihao Vishwanathan, S.V.N. Satish, Nadathur Anderson, Michael J. Dubey, Pradeep Parallel Computing Lab. Intel India Univ. of California Santa Cruz United States

We propose BlackOut, an approximation algorithm to efficiently train massive recurrent neural network language models (RNNLMs) with million word vocabularies. BlackOut is motivated by using a discriminative loss, and we describe a weighted sampling strategy which significantly reduces computation while improving stability, sample efficiency, and rate of convergence. One way to understand BlackOut is to view it as an extension of the DropOut strategy to the output layer, wherein we use a discriminative training loss and a weighted sampling scheme. We also establish close connections between BlackOut, importance sampling, and noise contrastive estimation (NCE). Our experiments, on the recently released one billion word language modeling benchmark, demonstrate scalab.lity and accuracy of BlackOut;we outperform the state-of-the art, and achieve the lowest perplexity scores on this dataset. Moreover, unlike other established methods which typically require GPUs or CPU clusters, we show that a carefully implemented version of BlackOut requires only 1-10 days on a single machine to train a RNNLM with a million word vocabulary and billions of parameters on one billion words. Although we describe BlackOut in the context of RNNLM training, it can be used to any networks with large softmax output layers. © ICLR 2016: San Juan, Puerto Rico. All Rights Reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Memory Access Complexity Analysis of SpMV in RAM (h) Model

Memory Access Complexity Analysis of SpMV in RAM (h) Model

引用

10th IEEE International Conference on High Performance computing and Communications

作者： Yuan E Zhang Yun-quan Sun Xiangzheng Lab. of Parallel Computing ISCAS 100190 China Graduate University of Chinese Academy of Sciences 100190 China State Key Lab. of Computer Science CAS 100190 China

ISBN: (纸本)9780769533520

Sparse Matrix-Vector Multiplication is an important computational kernel in scientific applications, and CSR storage algorithm often performs poorly on modern computer systems. But the register-level blocking algorithm can optimize memory hierarchy access, reduce memory access time, and then improve the performance. RAM (h) is a computation model that has h-level memory hierarchies. It indicates that different implementation forms of the same algorithm can have different memory access complexity. In this paper, we try to analyze memory access compelxity of two implementation forms of SpMV(which are CSR storage algorithm and register-level blocking algorithm) and to predict the performance of SpMV through combining the memory access complexity analysis and the data movement/floating point operation ratio analysis. The performance data of two forms and Statistical results of miss number of L1, L2 and TLB on Pentium IV platform are listed. Model analytical results matched well with experimental results.

关键词： SpMV sparse matrix-vector multiplication RAM (h) model memory access complexity

来源：评论

学校读者我要写书评

暂无评论

A supervised approach for tag hierarchy construction in open source communities 15

A supervised approach for tag hierarchy construction in open...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Gu, Chongming Yin, Gang Wang, Tao Yang, Cheng Wang, Huaimin Key Lab. of Parallel and Distributed Computing Colledge of Computer National University of Defence Technology ChangSha Hunan China

ISBN: (纸本)9781450336413

The massive amounts of open source software provide sufficient reusable resources for software development. Most of the OSS communities adopt a kind of categorization or tagging mechanism to organize the software. However, the categorization often too coarse, while the tags are flat and fail to capture the inter-relation among them. In this paper, we propose a novel approach to reveal the latent relations between tags and build a tag hierarchy to help locate resources. We firstly build a co-occurrence network, based on which we compare the connotations of tags and construct a preliminary hierarchy. Then we leverage the domain knowledge of category in SourceForge to optimize and improve the relations between tags. At the end, we demonstrate the effectiveness of the constructed tag hierarchy with quantitative evaluation, which suggest the validation of our approach. © 2015 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Personalized mobile application discovery 1

Personalized mobile application discovery

引用

1st International Workshop on Crowd-Based Software Development Methods and Technologies, CrowdSoft 2014

作者： Yang, Cheng Wang, Tao Yin, Gang Wang, Huaimin Wu, Ming Xiao, Ming Key Lab. of Parallel and Distributed Computing Colledge of Computer National University of Defence Technology ChangSha Hunan China

ISBN: (纸本)9781450332248

With the dramatic growing of mobile application markets, users can find apps with any function they desire in these markets. However, the huge amounts of apps make it quite a challenge for users to discover good applications efficiently. Previous studies recommend applications based on the download history, user ratings or app usage records. Most of these studies fail to capture users' personal interests in mobile applications precisely. In this paper, we leverage apps as features for describing user's personal interests and propose a novel approach to do personalized recommendation. We introduce a Small-Crowd model to distinguish apps at reflecting users' personal interests, and design a weighting method to rank the installed apps for users by combining the global download information with fine-grained app usage records. The extensive experiments validate the effectiveness of our approach which outperforms state-of-the-art method. Copyright 2014 ACM.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：