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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,149 篇 会议
72 篇 期刊文献
63 册 图书

馆藏范围

3,283 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,335 篇 工学
- 2,055 篇 计算机科学与技术...
- 1,034 篇 软件工程
- 414 篇 电气工程
- 326 篇 信息与通信工程
- 310 篇 电子科学与技术（可...
- 111 篇 控制科学与工程
- 69 篇 机械工程
- 67 篇 光学工程
- 67 篇 生物工程
- 62 篇 生物医学工程（可授...
- 35 篇 动力工程及工程热...
- 33 篇 仪器科学与技术
- 32 篇 建筑学
- 30 篇 材料科学与工程（可...
- 29 篇 化学工程与技术
- 25 篇 土木工程
- 21 篇 力学（可授工学、理...
721 篇 理学
- 482 篇 数学
- 174 篇 物理学
- 79 篇 生物学
- 65 篇 系统科学
- 60 篇 统计学（可授理学、...
- 36 篇 化学
244 篇 管理学
- 157 篇 管理科学与工程(可...
- 101 篇 图书情报与档案管...
- 70 篇 工商管理
62 篇 医学
- 53 篇 临床医学
- 21 篇 基础医学(可授医学...
22 篇 农学
- 19 篇 作物学
21 篇 法学
- 19 篇 社会学
15 篇 经济学
12 篇 文学
11 篇 教育学
4 篇 军事学

主题

327 篇 parallel process...
204 篇 graphics process...
203 篇 computer archite...
157 篇 parallel archite...
135 篇 parallel process...
123 篇 parallel algorit...
121 篇 graphics process...
115 篇 hardware
113 篇 image processing
86 篇 concurrent compu...
86 篇 computational mo...
76 篇 signal processin...
72 篇 parallel program...
71 篇 field programmab...
68 篇 instruction sets
68 篇 multicore proces...
67 篇 parallel computi...
65 篇 algorithm design...
58 篇 throughput
57 篇 gpu

机构

9 篇 college of compu...
9 篇 natl univ def te...
8 篇 carleton univ sc...
8 篇 national laborat...
6 篇 hosei univ dept ...
6 篇 st francis xavie...
5 篇 chinese acad sci...
5 篇 univ aizu dept c...
5 篇 polish japanese ...
5 篇 computer science...
5 篇 college of compu...
5 篇 city university ...
4 篇 shanghai jiao to...
4 篇 charles univ pra...
4 篇 rwth aachen univ...
4 篇 hainan internati...
4 篇 department of co...
4 篇 inria rennes
4 篇 chinese acad sci...
4 篇 polish acad sci ...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
8 篇 dongarra jack
7 篇 liu jie
7 篇 konrad karczewsk...
7 篇 quintana-orti en...
6 篇 hannig frank
6 篇 li dongsheng
6 篇 teich juergen
6 篇 li chao
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 krulis martin
5 篇 zhang lei
5 篇 ito yasuaki
5 篇 li kenli
5 篇 wanlei zhou
5 篇 tudruj marek

语言

3,238 篇 英文
35 篇 其他
14 篇 中文

检索条件"任意字段=5th International Conference on Algorithms and Architectures for Parallel Processing"

共 3284 条记录，以下是391-400 订阅

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

详细简洁

排序：

parallel algorithm for quadtree medial axis transform 5

Parallel algorithm for quadtree medial axis transform

引用

5th international conference on Computing and Information, ICCI 1993

作者： Doctor, D.P. Sudborough, H. Dept. of Comput. Sci. Texas Univ. As Dallas RichardsonTX75083-0688 United States

ISBN: (纸本)0818642122

the quadtree medial axis transform (QMAT) representation of a binary image is a very useful scheme for computer graphics and image processing applications. We present an efficient algorithm for QMAT on the shared memory EREW-PRAM model. For an image of size n×n, using n×n processors, we compute QMAT in O(log n) time. Since image sensors provide image data as a two-dimensional array, a mesh connected computer (MCC) is a popular architecture for image processing applications. Previously known parallel algorithms for QMAT require O(log2 n) and O(log n) time on a pyramid model, and a simulation of these two algorithms takes O(n log n) time on an MCC. However, our algorithm can be executed on an MCC in O(n) time, which is optimal for that model due to the size of its diameter. © 1993 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel query processing in databases on multicore architectures

Parallel query processing in databases on multicore architec...

引用

8th international conference on algorithms and architectures for parallel processing

作者： Acker, Ralph Roth, Christian Bayer, Rudolf Transact Software Willy Brandt Allee 2 D-81829 Munich Germany Tech Univ Munich Inst Informat D-85747 Garching Germany

ISBN: (纸本)9783540695004

In this paper we present a novel and complete approach on how to encapsulate parallelism for relational database query execution that strives for maximum resource utilization for both CPU and disk activities. Its simple and robust design is capable of modeling intra- and inter-operator parallelism for one or more parallel queries in a most natural way. In addition, encapsulation guarantees that the bulk of relational operators can remain unmodified, as long as their implementation is thread-safe. We will show, that with this approach, the problem of scheduling parallel tasks is generalized, so that it can be safely entrusted to the underlying operating system (OS) without suffering any performance penalties. On the contrary, relocation of all scheduling decisions from the DBMS to the OS guarantees a centralized and therefore near-optimal resource allocation (depending on the OS's abilities) for the complete system that is hosting the database server as one of its tasks. Moreover, with this proposal, query parallelization is fully transparent on the SQL interface of the database system. Configuration of the system for effective parallel query execution can be adjusted by the DB administrator by setting two descriptive tuning parameters. A prototype implementation has been integrated into the Transbase (R) relational DBMS engine.

关键词： relational DBMS parallel query processing encapsulation intraoperator inter-operator scheduling optimization

来源：评论

学校读者我要写书评

暂无评论

Creating Distributed Execution Plans with BobolangNG 16th

Creating Distributed Execution Plans with BobolangNG

引用

16th international conference on algorithms and architectures for parallel processing (ICA3PP)

作者： Bednarek, David Krulis, Martin Yaghob, Jakub Zavoral, Filip Charles Univ Prague Fac Math & Phys Parallel Architectures Algorithms Applicat Res Gr Malostranske Nam 25 Prague Czech Republic

ISBN: (纸本)9783319495835;9783319495828

Execution plans constitute the traditional interface between DBMS front-ends and back-ends;similar networks of interconnected operators are found also outside database systems. Tasks like adapting execution plans for distributed or heterogeneous runtime environments require a plan transformation mechanism which is simple enough to produce predictable results while general enough to express advanced communication schemes required for instance in skew-resistant partitioning. In this paper, we describe the BobolangNG language designed to express execution plans as well as their transformations, based on hierarchical models known from many environments but enhanced with a novel compile-time mechanism of component multiplication. Compared to approaches based on general graph rewriting, the plan transformation in BobolangNG is not iterative;therefore the consequences and limitations of the process are easier to understand and the development of distribution strategies and experimenting with distributed plans are easier and safer.

关键词： Execution plan Distributed computing Partitioning Distributed database Datalog Modeling language

来源：评论

学校读者我要写书评

暂无评论

A debugger for parallel Haskell dialects

A debugger for parallel Haskell dialects

引用

8th international conference on algorithms and architectures for parallel processing

作者： de la Encina, Alberto Rodriguez, Ismael Rubio, Fernando Univ Complutense Madrid Fac Informat E-28040 Madrid Spain

ISBN: (纸本)9783540695004

Due to its high-level nature, parallel functional languages provide some advantages for the programmer. Unfortunately, the functional programming community has not paid much attention to some important practical problems, like debugging parallel programs. In this paper we introduce the first debugger that works with any parallel extension of the functional language Haskell, the de facto standard in the (lazy evaluation) functional programming community. the debugger is implemented as an independent library. thus, it can be used with any Haskell compiler. Moreover, the debugger can be used to analyze how much speculative work has been done in any program.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of or-parallel logic programming systems on distributed shared-memory architectures

Performance evaluation of or-parallel logic programming syst...

引用

5th international conference on parallel processing, Euro-Par 1999

作者： Calegario, Vanusa Menditi De Castro Dutra, Inês Empresa Municipal de Informática S/A Rio de Janeiro Brazil COPPE - Systems Engineering and Computer Science Federal University of Rio de Janeiro Brazil

ISBN: (纸本)3540664432

In this work we investigate how Distributed Shared Memory (DSM) architectures affect performance of or-parallel logic programming systems and how this performance approaches that of conventional C systems. Our work concentrates on basic performance, scalability, and programmability. We use execution-driven simulation of a hardware DSM (DASH) to investigate the access patterns and caching behaviour exhibited by parallel C programs and by Aurora, a parallel logic programming system capable of exploiting implicit parallelism in Prolog programs. Aurora was originally written to run on bus-based shared-memory platforms. © Springer-Verlag Berlin Heidelberg 1999.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Data parallel algorithm for boolean function manipulation

Data parallel algorithm for boolean function manipulation

引用

Proceedings of the 5th Symposium on the Frontiers of Massively parallel Computation

作者： Gai, S. Rebaudengo, M. Reorda, M.Sonza Politecnico di Torino Torino Italy

this paper describes a data-parallel algorithm for boolean function manipulation. the algorithm adopts Binary Decision Diagrams (BDDs), which are the state-of-the-art approach for representing and handling boolean functions. the algorithm is well suited for SIMD architectures and is based on distributing BDD nodes to the available processing Elements and traversing BDDs in a breadth-first manner. An improved version of the same algorithm is also presented, which does not use virtual processors. A prototypical package has been implemented and its behavior has been studied with two different applications. In both cases the results show that the approach exploits well the parallel hardware by effectively distributing the load;thanks to the limited CPU time required and to the great amount of memory available, it can solve problems that can not be faced with by conventional architectures.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

CUDA Grid-Level Task Progression algorithms 17

CUDA Grid-Level Task Progression Algorithms

引用

2015 IEEE 17th international conference on High Performance Computing and Communications (HPCC)

作者： Kartsaklis, Christos Joubert, Wayne Hernandez, Oscar R. Eisenbach, Markus Elwasif, Wael R. Bernholdt, David E. Oak Ridge Natl Lab Oak Ridge TN 37831 USA

ISBN: (纸本)9781479989379

Tasking is a prominent parallel programming model. In this paper we conduct a first study into the feasibility of task-parallel execution at the CUDA grid, rather than the stream/kernel level, for regular, fixed in-out dependency task graphs, similar to those found in wavefront computational patterns, making the findings broadly applicable. We propose and evaluate three CUDA task progression algorithms, where threadblocks cooperatively process the task graph, and argue about their performance in terms of tasking throughput, atomics and memory IO overheads. Our initial results demonstrate a throughput of 38 million tasks/second on a Kepler K20X architecture.

关键词： parallel architectures parallel programming CUDA grid-level task progression algorithm CUDA task progression algorithm Kepler K20X architecture parallel programming model wavefront computational pattern Computational modeling Graphics processing units Instruction sets Kernel parallel processing Radiation detectors Runtime

来源：评论

学校读者我要写书评

暂无评论

CUDA: Scalable parallel programming for high-performance scientific computing

CUDA: Scalable parallel programming for high-performance sci...

引用

5th IEEE international Symposium on Biomedical Imaging

作者： Luebke, David NVIDIA Corporation

ISBN: (纸本)9781424420025

Graphics processing units (GPUs) originally designed for computer video cards have emerged as the most powerful chip in a high-performance workstation. Unlike multicore CPU architectures, which currently ship with two or four cores, GPU architectures are "manycore" with hundreds of cores capable of running thousands of threads in parallel. NVIDIA's CUDA is a co-evolved hardware-software architecture that enables high-performance computing developers to harness the tremendous computational power and memory bandwidth of the GPU in a familiar programming environment - the C programming language. We describe the CUDA programming model and motivate its use in the biomedical imaging community.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A comparative performance study of distributed mutual exclusion algorithms with a class of extended Petri nets 1

引用

6th international conference on algorithms and architectures for parallel processing

作者： Kostin, A Ilushechkina, L Basri, E Easten Mediterranean Univ Dept Comp Engn Magusa Turkey Moscow Inst Elect Technol Dept Software Engn Moscow Russia

ISBN: (数字)9783540320715

ISBN: (纸本)3540292357

A few algorithms of distributed mutual exclusion are discussed, their unified model in terms of a finite-population queuing system is proposed, and their simulation performance study is presented with the assumption that they use multicast communication if possible. To formally represent the algorithms for simulation, a class of extended Petri nets is used. the simulation was done in the simulation system Winsim based on this class of Petri nets.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Conflict-free data access for multi-bank memory architectures using padding

Conflict-free data access for multi-bank memory architecture...

引用

20th international conference on High Performance Computing (HiPC)

作者： Sohl, Joar Wang, Jian Karlsson, Andreas Liu, Dake Linkoping Univ Dept Comp Engn Linkoping Sweden

ISBN: (纸本)9781479907298

For high performance computation memory access is a major issue. Whether it is a supercomputer, a GPGPU device, or an Application Specific Instruction set Processor (ASIP) for Digital Signal processing (DSP) parallel execution is a necessity. A high rate of computation puts pressure on the memory access, and it is often non-trivial to maximize the data rate to the execution units. Many algorithms that from a computational point of view can be implemented efficiently on parallel architectures fail to achieve significant speed-ups. the reason is very often that the speed-up possible with the available execution units are poorly utilized due to inefficient data access. this paper shows a method for improving the access time for sequences of data that are completely static at the cost of extra memory. this is done by resolving memory conflicts by using padding. the method can be automatically applied and it is shown to significantly reduce the data access time for sorting and FFTs. the execution time for the FFT is improved with up to a factor of 3.4 and for sorting by a factor of up to 8.

关键词： Access to Information information retrieval PADDING Memory architecture sorting programs parallel architectures Storage access times execution time Data transfer rates Memory Memory Fast Fourier transform Digital signal processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共329页 << < 36 37 38 39 40 41 42 43 44 45 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：