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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
3 册 图书

馆藏范围

505 篇 电子文献
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...
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
3 篇 guoliang chen

语言

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

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

共 505 条记录，以下是261-270 订阅

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

详细简洁

排序：

PCAR: parallelism Based Cache Replacement Scheme to Exploit Inter-disks parallelism and Intra-disk Spatial Locality in parallel Disk Array

PCAR: Parallelism Based Cache Replacement Scheme to Exploit ...

引用

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

作者： Xiaodong Shi Dan Feng Computer College Huazhong University of Science and Technology Wuhan Hubei China Wuhan National Laboratory of Optoelectronics Wuhan Hubei China

For parallel disk array systems, the parallelism among disks is the key factor influencing the performance and the scale of systems. Unfortunately, the parallelism of cached blocks is largely ignored by cache management schemes that focus on reducing the number of cache misses. Therefore, the performance of parallel disks array systems for workloads with a skew access pattern can be seriously degraded. To solve this problem, we propose a parallelism based Cache Replacement scheme (PCAR) for parallel disks array systems, which can exploit both of the inter-disks parallelism and the intra-disk spatial locality. We have implemented the prototype of PCAR algorithm in Linux 2.6.18. And, the experimental results show that PCAR outperforms DULO and LRU by up to 22.8% and 33.1% in terms of the average response time, and by up to 20% and 43.9% in terms of throughput.

关键词： parallel processing Arrays Time factors Throughput Prefetching Strips Correlation

来源：评论

学校读者我要写书评

暂无评论

A parallel PCG Solver for Large-Scale Groundwater Flow Simulation Based on OpenMP

A Parallel PCG Solver for Large-Scale Groundwater Flow Simul...

引用

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

作者： Dandan Li Xiaohui Ji Qun Wang School of Information Engineering China University of Geoscience Beijing China

Groundwater flow simulation has become one of the top international issues in new generation of environmental applications. When managing large-scale groundwater flow problems, the intensive computational ability and large amounts of memory space required for modeling are the main bottlenecks for researchers. In order to solve three-dimensional large-scale groundwater flow problems more rapidly, the Open MP was adopted to parallelize the preconditioned conjugate gradient (PCG) algorithm in this paper. And this paper carried out a numerical experiment of the three-dimensional groundwater flow model on a computer with four cores. Based on the numerical experiment, it is found that the execution time of the original serial PCG program is about 1.74 to 2.86 times of the parallel PCG program executed with different number of threads. The experimental results also demonstrate that the PCG solver based on Open MP is an effective way for solving large-scale three-dimensional groundwater flow problem.

关键词： Mathematical model Instruction sets Vectors Equations Computational modeling Computers Educational institutions

来源：评论

学校读者我要写书评

暂无评论

parallel Optimization of Queries in XML Dataset Using GPU

Parallel Optimization of Queries in XML Dataset Using GPU

引用

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

作者： Xujie Si Airu Yin Xiaocheng Huang Xiaojie Yuan Xiaoguang Liu Gang Wang College of Software Nankai University Tianjin China College of I.T. Nankai University Tianjin China

As XML is playing a crucial role in web services, databases, and document processing, efficient processing of XML queries has become an important issue. On the other hand, due to the increasing number of users, high throughput of XML queries is also required to execute tens of thousands of queries in a short time. Given the great success of GPGPU (General-Purpose computations on the Graphics Processors), we propose a parallel XML query model based on GPU, which mainly consists of two efficient task distribution strategies, to improve the efficiency and throughput of XML queries. We have developed a parallel simplified XPath language using Compute Unified Device Architecture (CUDA) on GPU, and evaluate our model on a recent NVIDIA GPU in comparison with its counterpart on eight-core CPU. The experiment results show that our model achieves both higher throughput and efficiency than CPU-based XML query.

关键词： XML Graphics processing unit Throughput Load modeling Databases Context

来源：评论

学校读者我要写书评

暂无评论

Data parallel programming Model for Many-Core architectures

Data Parallel Programming Model for Many-Core Architectures

引用

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

作者： Yongpeng Zhang North Carolina State University USA

Emerging accelerating architectures, such as GPUs, have proved successful in providing significant performance gains to various application domains. This is done by exploiting data parallelism in existing algorithms. However, programming in a data-parallel fashion imposes extra burdens to programmers, who are used to writing sequential programs. New programming models and frameworks are needed to reach a balance between programmability, portability and performance. We start from stream processing domain and propose GStream, a general-purpose, scalable data streaming framework on GPUs. The contributions of GStream are as follows: (1) We provide powerful, yet concise language abstractions suitable to describe conventional algorithms as streaming problems. (2) We project these abstractions onto GPUs to fully exploit their inherent massive data-parallelism. (3) We demonstrate the viability of streaming on accelerators. Experiments show that the proposed framework provides flexibility, programmability and performance gains for various benchmarks from a collection of domains, including but not limited to data streaming, data parallel problems, numerical codes and text search. This work lays a foundation to our future work to develop more general data parallel programming models for many-core architectures.

关键词： Graphics processing unit parallel processing Benchmark testing Libraries Kernel Computer architecture

来源：评论

学校读者我要写书评

暂无评论

An auto-tuning solution to data streams clustering in OpenCL

An auto-tuning solution to data streams clustering in OpenCL

引用

14th IEEE Int. Conf. on Computational Science and Engineering, CSE 2011, the 11th international symposium on Pervasive Systems, algorithms, and Networks, I-SPAN 2011, and the 10th IEEE Int. Conf. on Ubiquitous Computing and Communications, IUCC 2011

作者： Fang, Jianbin Varbanescu, Ana Lucia Sips, Henk Parallel and Distributed Systems Group Delft University of Technology Delft Netherlands

ISBN: (纸本)9780769544779

Due to its applicability to numerous types of data, including telephone records, web documents, and click streams, the data stream model has recently attracted attention. For analysis of such data, it is crucial to process the data in a single pass, or a small number of passes, using little memory. This paper provides an OpenCL implementation for data streams clustering, and then presents several optimizations for it, which make it more efficient in terms of memory usage. In order to maximize performance for different problem sizes and architectures, we also propose an auto-tuning solution. Experimental results show that our fully optimized implementation can perform 2.1x and 1.4x faster than the native OpenCL implementation on NVIDIA GTX480 and AMD HD5870, respectively, it can also achieve 1.4x to 3.3x speedup relative to the original CUDA implementation solution on GTX480. © 2011 IEEE.

关键词： Auto-tuning Clustering Data Streams OpenCL Performance Optimizations

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 3rd international symposium on parallel architectures, algorithms and programming, PAAP 2010

Proceedings - 3rd International Symposium on Parallel Archit...

引用

3rd international symposium on parallel architectures, algorithms and programming, PAAP 2010

ISBN: (纸本)9780769543123

The proceedings contain 54 papers. The topics discussed include: an efficient video program delivery algorithm in tree networks;an efficient content delivery algorithm for intermittently connected mobile ad hoc networks;one-hop neighbor transmission coverage information based distributed algorithm for connected dominating set;a novel P2P identification algorithm based on genetic algorithm and particle swarm optimization;accelerating reconfiguration for degradable mesh-connected processor arrays;a novel approach for multilevel fixed outline floorplanning;scheduling multiple multithreaded applications on asymmetric and symmetric chip multiprocessors;a hybrid fault tolerance model for reliable scheduling of critical real-time applications on grid systems;GTFTTS: a generalized tit-for-tat based corporative game for temperature-aware task scheduling in multi-core systems;and a scheduling strategy on load balancing of virtual machine resources in cloud computing environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

programming Real-Time Autofocus on a Massively parallel Reconfigurable Architecture Using Occam-pi

Programming Real-Time Autofocus on a Massively Parallel Reco...

引用

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

作者： Zain-ul-Abdin Anders Ahlander Bertil Svensson Centre for Research on Embedded Systems (CERES) Halmstad University Halmstad Sweden Business Area Electronic Defence Systems Saab AB Gothenburg Sweden

Recently we proposed occam-pi as a high-level language for programming massively parallel reconfigurable architectures. The design of occam-pi incorporates ideas from CSP and pi-calculus to facilitate expressing parallelism and reconfigurability. The feasability of this approach was illustrated by building three occam-pi implementations of DCT executing on an Ambric. However, because DCT is a simple and well-studied algorithm it remained uncertain whether occam-pi would also be effective for programming novel, more complex algorithms. In this paper, we demonstrate the applicability of occam-pi for expressing various degrees of parallelism by implementing a significantly large case-study of focus criterion calculation in an auto focus algorithm on the Ambric architecture. Auto focus is a key component of synthetic aperture radar systems. Two implementations of focus criterion calculation were developed and evaluated on the basis of performance. The comparison of the performance results with a single threaded software implementation of the same algorithm show that the throughput of the two implementations are 11x and 23x higher than the sequential implementation despite a much lower (9x) clock frequency. The two designs are, respectively, 29x and 40x more energy efficient.

关键词： Mobile communication Pixel Semantics Interpolation parallel processing Hardware Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 3rd international symposium on parallel architectures, algorithms and programming, PAAP 2010: Message from the PAAP 2010 general co-chairs

Proceedings - 3rd International Symposium on Parallel Archit...

引用

Proceedings - 3rd international symposium on parallel architectures, algorithms and programming, PAAP 2010 2010年 xi页

作者： Shen, Hong Luo, Zhongxuan

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 3rd international symposium on parallel architectures, algorithms and programming, PAAP 2010: Message from the PAAP 2010 program co-chairs

Proceedings - 3rd International Symposium on Parallel Archit...

引用

Proceedings - 3rd international symposium on parallel architectures, algorithms and programming, PAAP 2010 2010年 xii页

作者： Zhang, Xianchao Zhong, Cheng Tian, Ye

来源：评论

学校读者我要写书评

暂无评论

Computation Oriented parallel FFT algorithms on distributed computer

Computation Oriented Parallel FFT algorithms on distributed ...

引用

international symposium on parallel architectures, algorithms, and programming

作者： Li, Pengzhen Dong, Weiqing Department of Computer Science and Technology Xi'an Jiaotong University Xi'an China

ISBN: (纸本)9780769543123

FFT is a widely used algorithm, of which parallelization is a very important topic. There were a lot of works for this field and many parallel algorithms were published in several decades. In this paper, an algorithm named Computation Oriented parallel FFT (COPF) is proposed. COPF which dates from the classic parallel radix-2 FFT focuses on the butterfly structure in FFT and adopts a proper strategy in parallel phrase on distributed system. In the serial phrase, COPF takes FFTW3 to accelerate the serial process and extends the application. © 2010 IEEE.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共51页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：