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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是241-250 订阅

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

详细简洁

排序：

A case study of the interplay between conflict management and version management in hardware Transactional Memory systems

A case study of the interplay between conflict management an...

引用

2011 4th international symposium on parallel architectures, algorithms and programming, PAAP 2011

作者： Yan, Zhichao Feng, Dan Tan, Yujuan Wuhan National Laboratory for Optoelectronics School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9780769545752

As one of the most potential solution to parallel programming on the future many-core platforms, Transactional Memory (TM) systems have attracted a great deal of attention from both the industry and academic since the first TM was proposed in 1993. Various design and implementation proposals have been proposed to improve the performance while reducing the overheads. Recent investigations of the high-contention and coarse-grained transactional workloads on TMs reveal various pathologies that will offset the performance benefits. In this paper, we analysis the advantages and disadvantages of the existing conflict management and version management schemes, make a case study in the interplay between conflict management and version management in hardware transactional memory systems, to learn its impact on performance and find some interesting appearance that can guide the future design. In particular, apply software runtime environment to support recognize application's dynamic behaviors and resolve transactional conflicts can obtain an average speedup of 11.7% across the 8 applications selected from the STAMP benchmark suite on DynTM, which is regarded as one of the most latest progress in hardware transactional memory systems. © 2011 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

TMbox: A Flexible and Reconfigurable 16-core Hybrid Transactional Memory System

TMbox: A Flexible and Reconfigurable 16-core Hybrid Transact...

引用

IEEE 19th Annual international symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Sonmez, Nehir Arcas, Oriol Pflucker, Otto Unsal, Osman S. Cristal, Adrian Hur, Ibrahim Singh, Satnam Valero, Mateo Barcelona Supercomp Ctr Barcelona Spain Univ Politecn Cataluna E-08028 Barcelona Spain CSIC Spanish Natl Res Council Madrid Spain Microsoft Res Cambridge Cambridge England

ISBN: (纸本)9780769543017

In this paper we present the design and implementation of TMbox: An MPSoC built to explore trade-offs in multicore design space and to evaluate parallel programming proposals such as Transactional Memory (TM). Our flexible system, comprised of MIPS R3000-compatible cores is easily modifiable to study different architecture, library and operating system extensions. For this paper we evaluate a 16-core Hybrid Transactional Memory implementation based on the TinySTM-ASF proposal on a Virtex-5 FPGA and we accelerate three benchmarks written to investigate TM.

关键词： Field programmable gate arrays Hardware MIPS R3000-compatible core MPSoC Multicore processing Proposals Registers Software TMbox TinySTM-ASF Virtex-5 FPGA electronic engineering computing field programmable gate arrays flexible 16-core hybrid transactional memory system flexible system logic design multicore design space multicore prototyping multiprocessing systems parallel programming parallel programming reconfigurable 16-core hybrid transactional memory system reconfigurable architectures reconfigurable computing system-on-chip transactional memory

来源：评论

学校读者我要写书评

暂无评论

QR factorization on a multicore node enhanced with multiple GPU accelerators

QR factorization on a multicore node enhanced with multiple ...

引用

25th IEEE international parallel and Distributed Processing symposium, IPDPS 2011

作者： Agullo, Emmanuel Augonnet, Cédric Dongarra, Jack Faverge, Mathieu Ltaief, Hatem Thibault, Samuel Tomov, Stanimire INRIA LaBRI University of Bordeaux France Innovative Computing Laboratory University of Tennessee Knoxville TN 37996 United States

ISBN: (纸本)9780769543857

One of the major trends in the design of exascale architectures is the use of multicore nodes enhanced with GPU accelerators. Exploiting all resources of a hybrid accelerators-based node at their maximum potential is thus a fundamental step towards exascale computing. In this article, we present the design of a highly efficient QR factorization for such a node. Our method is in three steps. The first step consists of expressing the QR factorization as a sequence of tasks of well chosen granularity that will aim at being executed on a CPU core or a GPU. We show that we can efficiently adapt high-level algorithms from the literature that were initially designed for homogeneous multicore architectures. The second step consists of designing the kernels that implement each individual task. We use CPU kernels from previous work and present new kernels for GPUs that complement kernels already available in the MAGMA library. We show the impact on performance of these GPU kernels. In particular, we present the benefits of new hybrid CPU/GPU kernels. The last step consists of scheduling these tasks on the computational units. We present two alternative approaches, respectively based on static and dynamic scheduling. In the case of static scheduling, we exploit the a priori knowledge of the schedule to perform successive optimizations leading to very high performance. We, however, highlight the lack of portability of this approach and its limitations to relatively simple algorithms on relatively homogeneous nodes. Alternatively, by relying on an efficient runtime system, Star PU, in charge of ensuring data availability and coherency, we can schedule more complex algorithms on complex heterogeneous nodes with much higher productivity. In this latter case, we show that we can achieve high performance in a portable way thanks to a fine interaction between the application and the runtime system. We demonstrate that the obtained performance is very close to the theoretical upper bo

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

An extended work-stealing Framework for mixed-mode parallel applications

An extended work-stealing Framework for mixed-mode parallel ...

引用

25th IEEE international parallel and Distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Wimmer, Martin Träff, Jesper Larsson Department of Scientific Computing Faculty of Computer Science University of Vienna Nordbergstrasse 15/3C A-1090 Vienna Austria

ISBN: (纸本)9780769543857

parallelizing complex applications even for well-behaved parallel systems often calls for different parallelization approaches within the same application. In this paper we discuss three applications from the literature that for both reasons of efficiency and expressive convenience benefit from a mixture of task and more tightly coupled data parallelism. These three applications, namely Quicksort, list ranking, and LU factorization with partial pivoting, are paradigms for recursive, mixed-mode parallel algorithms that can neither easily nor efficiently be expressed in either a purely data-parallel or a purely task-parallel fashion. As a solution we present a shared-memory programming framework that allows tasks to dynamically spawn subtasks with a given degree of parallelism for implementing tightly coupled parallel parts of the algorithm. All three paradigmatic applications can naturally be expressed in this framework, which in turn can be supported by an extended, non-conventional work-stealing scheduler, which we also briefly sketch. Using our new algorithm for work-stealing with deterministic team-building we are able to show, beyond the improved, more natural implementability, in many cases better scalability and sometimes absolute performance than with less natural implementations based on pure task-parallelism executed with conventional work-stealing. Detailed performance results using an Intel 32-core system substantiate our claims. © 2011 IEEE.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph

A Local Search Approximation Algorithm for Max-k-Cut of Grap...

引用

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

作者： Wenxing Zhu Chuanyin Guo Center of Discrete Mathematics and Theoretical Computer Science Fuzhou University Fuzhou China

Given a graph or hyper graph, the graph or hyper graph Max-k-Cut problem is to partition the vertices into k nonempty sets such that the sum of weights of edges across different sets is maximized. We present a deterministic local search algorithm for the problem, which has a performance ratio 1 - 1/k for Max-k-Cut of graph, and has a similar result for Max-k-Cut of hyper graph.

关键词： Approximation algorithms Approximation methods Partitioning algorithms programming Search problems Optimized production technology Polynomials

来源：评论

学校读者我要写书评

暂无评论

A parallel Subspace Iteration Method for Generalized Eigenvalue Problems Based on Multi-core Platform

A Parallel Subspace Iteration Method for Generalized Eigenva...

引用

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

作者： Shunxu Wang School of Science Huaihai Institute of Technology Lianyungang Jiangsu China

A parallel subspace iteration method for solving eigenvalue problem of based on multi-core platform is presented, which can solve several extreme eigenpair in parallel. Compared with Jacobi-Davidson method, the dimension number of the subspace in the method keeps unchanged, which makes it easier for the programming implementation. Numerical experiments are performed with a quad-core computer under the joint programming environment of Intel Fortran and OpenMp. The computation of the plane wing frequency and aircraft pylon for a real model airplane is taken as an example. As a result, the first 10 frequencies of a plane wing and an aircraft pylon are provided which shown the efficiency and applicability of our parallel computation algorithm.

关键词： Eigenvalues and eigenfunctions Multicore processing Poles and towers Vectors Equations Software Aircraft

来源：评论

学校读者我要写书评

暂无评论

Thread-Level parallel Algorithm for Sorting Integer Sequence on Multi-core Computers

Thread-Level Parallel Algorithm for Sorting Integer Sequence...

引用

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

作者： Zhong Cheng Ke Qi Liu Jun Huang Yi-Ran School of Computer and Electronics and Information Guangxi University Nanning Guangxi China School of Information and Statistics Guangxi University for Finance and Economics Nanning Guangxi China

According to the characteristics of multi-core architectures and binary storage property of integer sequence, this paper proposes an efficient thread-level parallel algorithm for sorting integer sequence on multi-core computers. The algorithm divides the input integer sequence to several data blocks in main memory and distributes these blocks into the shared L2 cache and private L1 cache respectively, implements dynamically load balance among the processing cores, and utilizes data-level parallel SIMD instructions and thread-binding technique to speed up the sorting procedure. Experiment results show that the algorithm can obtain high speedup and good scalability, and its execution efficiency will not be affected by the data distribution of input integer sequence.

关键词： Instruction sets Algorithm design and analysis Sorting Partitioning algorithms Computers Multicore processing Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel Efficiency and Parametric Optimization in CASTEP

Parallel Efficiency and Parametric Optimization in CASTEP

引用

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

作者： Jun Chen Liangjie Fu Huaming Yang High Performance Computing Center Central South University Changsha China School of Resources Processing and Bioengineering Central South University Changsha China

parallel efficiency is always a fundamental research field in high performance computing. This paper focuses on parallel computing at high performance computing cluster with CASTEP program, discusses multi-core parallel efficiency in CASTEP, and analyses the influence of the main calculation parameters upon total CPU time and memory usage in case study, such as CPU cores(CPUs), cutoff energy, k-point, and supercell size. The paper also rationalizes and optimizes in detail the better use of limited computing resources under special circumstances.

关键词： High performance computing Discrete Fourier transforms Materials parallel processing Software Electronic mail Optimization

来源：评论

学校读者我要写书评

暂无评论

Research on Disk Array parallel Test

Research on Disk Array Parallel Test

引用

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

作者： Qinlu He Zhanhuai Li Le Xiaowang Hui Fengwang Jian Sun Department of Computer Science Northwestern Polytechnical University Xi'an China

Researches on technologies about testing IOPS and data transfer speed of disk arrays in mass storage systems. We propose a parallel testing technology towards the high performance disk array and realize the testing work on the newest developed disk array. By taking researches on many factors which effect disk performance seriously and quantifying them through experiments, so we realize evaluations on the whole disk array. Finally, we take researches on bottlenecks of the disk arrays and prove the results to be correct.

关键词： Arrays Hard disks Testing Drives Bandwidth Size measurement Control systems

来源：评论

学校读者我要写书评

暂无评论

A Novel Elastic Resource Allocation Strategy of Virtual Cluster

A Novel Elastic Resource Allocation Strategy of Virtual Clus...

引用

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

作者： Feifei Liu Xiaoshe Dong Department of Computer Science and Technology Xi'an Jiaotong University Xi'an China

Aiming at the problem on how to effectively allocate HPC resources to improve the efficiency of system, this paper presents a novel elastic resources allocation strategy. Within the changing range the users have assigned, the strategy permits the system to dynamically adjust the resource distribution of virtual clusters so that the efficiency of the system can be improved and users' costs can be reduced. To better implement the strategy, this paper provides a detailed description about the issue of resource allocation, and then proposes a algorithm named Mixed Bin Packing Algorithm. Experimental results indicate that the Mixed Bin Packing Algorithm is more effective than the previous algorithms, especially in a large application scale background.

关键词： Resource management Virtual machining Clustering algorithms Algorithm design and analysis Greedy algorithms Linear programming Pricing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：