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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

511 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

508 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 511 条记录，以下是381-390 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A parallel object-oriented framework for stencil algorithms

A parallel object-oriented framework for stencil algorithms

引用

international symposium on High Performance Distributed Computing

作者： J.F. Karpovich M. Judd W.T. Strayer A.S. Grimshaw Department of Computer Science University of Virginia USA

The authors present an object-oriented framework for constructing parallel implementations of stencil algorithms. This framework simplifies the development process by encapsulating the common aspects of stencil algorithms in a base stencil class so that application-specific derived classes can be easily defined via inheritance and overloading. In addition, the stencil base class contains mechanisms for parallel execution. The result is a high-performance, parallel, application-specific stencil class. The authors present the design rationale for the base class and illustrate the derivation process by defining two subclasses, an image convolution class and a PDE solver. The classes have been implemented in Mentat, an object-oriented parallel programming system that is available on a variety of platforms. Performance results are given for a network of Sun SPARCstation IPCs.< >

关键词： Convolution Iterative algorithms parallel programming Sun Workstations Computer science Partial differential equations Concurrent computing parallel architectures Investments

来源：评论

学校读者我要写书评

暂无评论

BSP Pro: a Java-based BSP performance profiling system

BSP Pro: a Java-based BSP performance profiling system

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Weiqun Zheng Shamim Khan Hong Xie School of Information Technology Murdoch University Perth WA Australia

The paper introduces a new parallel performance profiling system for the Bulk Synchronous parallel (BSP) model. The profiling system, called BSP Pro, consists of a performance profiling tool, BSP Profiler and a performance visualisation tool, BSP Visualiser. The aim of BSP Pro is to assist in the analysis and improvement of BSP program performance by minimising load imbalance among processes. BSP Pro is different from other systems, such as the profiling tools within the Oxford BSP toolset, in terms of both its features and its implementation. It uses BSP Profiler to trace and generate more comprehensive profiling information resulting from BSP program executions. The profiling information is then visualised and shown as performance profiling graphs using BSP Visualiser. The visualising component of BSP Pro is fully developed in Java and utilises Java graphics to expose and highlight process load imbalance in both computation and interprocess communication.

关键词： Java Performance analysis Visualization Australia parallel programming Predictive models Costs Information technology Graphics Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Do Not Have Enough Data? An Easy Data Augmentation for Code Summarization

Do Not Have Enough Data? An Easy Data Augmentation for Code ...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Zixuan Song Xiuwei Shang Mengxuan Li Rong Chen Hui Li Shikai Guo Dalian Maritime University The College of Information Science and Technology Dalian China

ISBN: (纸本)9781665452199

Code comments improve the readability and intelligibility of codes, which can help developers understand programs and improve the efficiency of the software maintenance and evolution process. Unfortunately, code comments are often mismatched, missing, or outdated in software projects, which negatively affects the efficiency of developers to infer the functionality from source code and affect the efficiency of software maintenance and evolution. To solve this problem, many source code summarization algorithms have been proposed. However, these methods usually try to collect a large data set which contains the mapping between code comments and source code to train models. Hence, the effectiveness of the models often rely on the quality of the training data. There are two limitations for the training sets: the insufficient data collection limitation (i.e., generate a large amount of noises-free training data) and data distribution bias limitation (i.e., generate training data for infrequently used methods). To address this issues, we have proposed a data augmentation method for code comments, named CDA-CS. Extensive experiments on Java and Python projects collected from GitHub are conducted to evaluate the performance of CDA-CS. Training models on the augmented dataset, the state-of-the-art algorithms can easily get a further 1.37% to 2.24% improvement in terms of different evaluation metrics (i.e., BLEU-4, METEOR, ROUGH_L) with no additional cost.

关键词： Training Software maintenance Codes Source coding Software algorithms Training data programming

来源：评论

学校读者我要写书评

暂无评论

Autonomic management of non-functional concerns in distributed & parallel application programming

Autonomic management of non-functional concerns in distribut...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Marco Aldinucci Marco Danelutto Peter Kilpatrick Department Computer Science University of Torino Torino Italy Department Computer Science University of Pisa Pisa Italy Department Computer Science Queen''s University Belfast Belfast UK

ISBN: (纸本)9781424437511

An approach to the management of non-functional concerns in massively parallel and/or distributed architectures that marries parallel programming patterns with autonomic computing is presented. The necessity and suitability of the adoption of autonomic techniques are evidenced. Issues arising in the implementation of autonomic managers taking care of multiple concerns and of coordination among hierarchies of such autonomic managers are discussed. Experimental results are presented that demonstrate the feasibility of the approach.

关键词： parallel programming Skeleton Clouds Environmental management Computer science Computer architecture programming profession Distributed computing Clustering algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal architecture-independent scheduling of fine-grain tree-sweep computations

Optimal architecture-independent scheduling of fine-grain tr...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Lixin Gao A.L. Rosenberg R.K. Sitaraman Department of Computer Science University of Massachusetts Amherst MA USA

We present algorithms for optimally scheduling computations that comprise a sequence of complete up- and/or down-sweeps on a complete binary tree, on a parallel architecture in which the communication delay between any two processors is uniform. Such computations include, for instance, those that implement broadcast, accumulation, and the parallel-prefix operator; such architectures include, for instance, networks of workstations. Our schedules are optimal in the sense of having the actual minimum time-to-completion-not just on approximation thereof-considering the time for both computation and communication. We concentrate on schedules for fine-grain tree-sweep computations-wherein communication costs are rather large relative to per-task computation cost.

关键词： Processor scheduling Concurrent computing Computational efficiency Scheduling algorithm Binary trees parallel architectures Delay Computer networks Broadcasting Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A Comparison of High-Level programming Choices for Incomplete Sparse Factorization Across Different architectures

A Comparison of High-Level Programming Choices for Incomplet...

引用

IEEE international symposium on parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Joshua Dennis Booth Kyungjoo Kim Sivasankaran Rajamanickam Center for Computing Research Sandia National Laboratories Albuquerque NM USA

ISBN: (纸本)9781509036837

All many-core systems require fine-grained shared memory parallelism, however the most efficient way to extract such parallelism is far from trivial. Fine-grained parallel algorithms face various performance trade-offs related to tasking, accesses to global data-structures, and use of shared cache. While programming models provide high level abstractions, such as data and task parallelism, algorithmic choices still remain open on how to best implement irregular algorithms, such as sparse factorizations, while taking into account the trade-offs mentioned above. In this paper, we compare these performance trade-offs for task and data parallelism on different hardware architectures such as Intel Sandy Bridge, Intel Xeon Phi, and IBM Power8. We do this by comparing the scaling of a new task-parallel incomplete sparse Cholesky factorization called Tacho and a new data-parallel incomplete sparse LU factorization called Basker. Both solvers utilize Kokkos programming model and were developed within the ShyLU package of Trilinos. Using these two codes we demonstrate how high-level programming changes affect performance and overhead costs on multiple multi/many-core systems. We find that Kokkos is able to provide comparable performance with both parallel_for and task/futures on traditional x86 multicores. However, the choice of which high-level abstraction to use on many-core systems depends on both the architectures and input matrices.

关键词： parallel processing Sparse matrices programming Multicore processing Program processors Hardware

来源：评论

学校读者我要写书评

暂无评论

A tensor product formulation of Strassen's matrix multiplication algorithm with memory reduction

A tensor product formulation of Strassen's matrix multiplica...

引用

international symposium on parallel Processing

作者： B. Kumar C.-H. Huang R.W. Johnson P. Sadayappan Departmentof Computer and Information Science Ohio State Uinversity Columbus OH USA Departmentof Computer Science Cloud State University Saint Cloud MN USA

A programming methodology based on tensor products has been used for designing and implementing block recursive algorithms for parallel and vector multiprocessors. A previous tensor product formulation of Strassen's matrix multiplication algorithm requires working arrays of size O(7/sup n/) for multiplying 2/sup n/*2/sup n/ matrices. The authors present a modified tensor product formulation of Strassen's algorithm in which the size of working arrays can be reduced to O(4/sup n/). The modified formulation exhibits sufficient parallel and vector operations for efficient implementation. Performance results on the Cray Y-MP are presented.< >

关键词： Tensile stress parallel programming Computerized monitoring NIST Algorithm design and analysis Vectors Linear algebra parallel machines Cloud computing Information science

来源：评论

学校读者我要写书评

暂无评论

A Multi-object Detection Sampling Algorithm For Large Scenes

A Multi-object Detection Sampling Algorithm For Large Scenes

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Liang Jin Xiaochuan Li Baoyu Fan Zhenhua Guo Ruidong Li Li Wang Yanwei Wang Yaqian Zhao Rengang Li Inspur Electronic Information Industry Co.Ltd. Jinan China Shandong Yunhai Guochuang Cloud Computing Equipment Industry Innovation Center Co.Ltd. Jinan China

ISBN: (纸本)9781665452199

Multi-object detection in large scenes aims to find objects in images, which usually contain more than one billion pixels. Based on the concept of dividing and conquering, the state-of-the-art (SOTA) methods slice the super-resolution image into patches first and then lower the image solution to detect objects later. The advantage of this method is that it can adapt quickly to regular detection algorithms. However, a set of parameters needs to be set manually, such as the size of sliding windows and overlap, which is quite hard to fit all scenarios. It may result in a loss of samples located at the boundary of the sliding window and the oversampling of inefficient samples that appear within the overlap. In this paper, we propose a object-oriented image sampling algorithm based on anchor boxes during training and multi-scale pyramids during inference. Inspired by the mature object detection baseline Scale-YOLOv4, we present more tricks to fit large scenes. The accuracy can reach 66%, which is 24 points higher than the CascadeRCNN model of the official backbone network ResNet50. Finally, we have won first place in the PANDA object detection tracking using this method.

关键词： Training Object oriented modeling Superresolution Object detection programming Image sampling Inference algorithms

来源：评论

学校读者我要写书评

暂无评论

High-Performance Graph Analytics on Manycore Processors

High-Performance Graph Analytics on Manycore Processors

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： George M. Slota Sivasankaran Rajamanickam Kamesh Madduri Computer Science and Engineering The Pennsylvania State University University Park PA Scalable Algorithms Department Sandia National Laboratories Albuquerque NM

The divergence in the computer architecture landscape has resulted in different architectures being considered mainstream at the same time. For application and algorithm developers, a dilemma arises when one must focus on using underlying architectural features to extract the best performance on each of these architectures, while writing portable code at the same time. We focus on this problem with graph analytics as our target application domain. In this paper, we present an abstraction-based methodology for performance-portable graph algorithm design on manicure architectures. We demonstrate our approach by systematically optimizing algorithms for the problems of breadth-first search, color propagation, and strongly connected components. We use Kokkos, a manicure library and programming model, for prototyping our algorithms. Our portable implementation of the strongly connected components algorithm on the NVIDIA Tesla K40M is up to 3.25× faster than a state-of-the-art parallel CPU implementation on a dual-socket Sandy Bridge compute node.

关键词： Instruction sets Silicon Optimization Synchronization Color Arrays parallel processing

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of an environment APE for automatic parallelization of programs

Design and evaluation of an environment APE for automatic pa...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： V. Chaudhary Chengzhong Xu S. Roy Jialin Ju V. Sinha Laiwu Luo Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University MI USA

In this paper, we present the design and evaluation of a compiler system, called APE, for automatic parallelization of scientific and engineering applications on distributed memory computers. APE is built on top of SUIF compiler. It extends SUIF with capabilities in parallelizing loops with non-uniform cross-iteration dependencies, and in handling loops that have indirect access patterns. We have evaluated the effectiveness of SUIF with several CFD test codes, and found that SUIF handles uniform loops over dense and regular data structures very well. For non-uniform loops, an innovative and efficient parallelization approach based on convex theory have been proposed and is being implemented. We have also presented a class of scalable algorithms for parallel distribution and redistribution of unstructured data structures during parallelizing irregular loops.

关键词： Program processors Distributed computing Concurrent computing Computational fluid dynamics Data structures Quantum computing programming profession parallel processing Design engineering Optimizing compilers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共52页 << < 35 36 37 38 39 40 41 42 43 44 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：