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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

SCALABILITY OF parallel algorithms FOR MATRIX MULTIPLICATION

SCALABILITY OF PARALLEL ALGORITHMS FOR MATRIX MULTIPLICATION

引用

1993 international conference on parallel processing

作者： GUPTA, A KUMAR, V UNIV MINNESOTA DEPT COMP SCIMINNEAPOLISMN 55455

ISBN: (纸本)0849389860

A number of parallel formulations of dense matrix multiplication algorithm have been developed. For arbitrarily large number of processors, any of these algorithms or their variants can provide near linear speedup for sufficiently large matrix sizes and none of the algorithms can be clearly claimed to be superior than the others. In this paper we analyze the performance and scalability of a number of parallel formulations of the matrix multiplication algorithm and predict the conditions under which each formulation is better than the others. We present a parallel formulation for *** and related architectures thai performs better than any of the schemes described in the literature so far for a wide range of matrtx sizes and number of processors. the superior performance and the analytical scalability expressions for this algorithm are verified through experiments on the thinking Machines Corporation's CM-5TM' parallel computer for up to 512 processors. © 1993 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

A parallel architecture for motion estimation and DCT computation in MPEG-2 encoder

A parallel architecture for motion estimation and DCT comput...

引用

7th international conference on algorithms and architectures for parallel processing

作者： Huang, Jian Li, Hao Univ North Texas Dept Comp Sci & Engn POB 311366 Denton TX 76203 USA

ISBN: (纸本)9783540729044

this paper presents a parallel architecture that can simultaneously perform block-matching motion estimation (ME) and discrete cosine transform (DCT). Because DCT and ME are both processed block by block, it is preferable to put them in one module for resource sharing. Simulation results performed using Simulink demonstrate that the parallel fashioned architecture improves the performance in terms of running time by 18.6% compared to the conventional sequential fashioned architecture.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for Solving Markov Decision Process

引用

9th international conference on algorithms and architectures for parallel processing

作者： Zhang, Qi Sun, Guangzhong Xu, Yinlong Univ Sci & Technol China Dept Comp Sci Hefei 230027 Anhui Peoples R China

ISBN: (纸本)9783642030949

Markov decision process (MDP) provides the foundations for a number of problems, such as artificial intelligence Studying, automated planning and reinforcement learning. MDP can be solved efficiently in theory. However, for large scenarios, more investigations are needed to reveal practical algorithms. algorithms for solving MDP have a natural concurrency. In this paper, we present parallel algorithms based on dynamic programming Meanwhile, the cost of computation and communication complexity of this method is analyzed. Moreover, experimental results demonstrate excellent speedups and scalability.

关键词： Markov Decision Process (MDP) parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

Mimer and Schedeval: Tools for Comparing Static Schedulers for Streaming Applications on Manycore architectures 44

Mimer and Schedeval: Tools for Comparing Static Schedulers f...

引用

44th Annual international conference on parallel processing Workshops (ICPPW)

作者： Melot, Nicolas Janzen, Johan Kessler, Christoph Linkoping Univ Linkoping Sweden Uppsala Univ Uppsala Sweden

ISBN: (纸本)9781467375894

Scheduling algorithms published in the scientific literature are often difficult to evaluate or compare due to differences between the experimental evaluations in any two papers on the topic. Very few researchers share the details about the scheduling problem instances they use in their evaluation section, the code that allows them to transform the numbers they collect into the results and graphs they show, nor the raw data produced in their experiments. Also, many scheduling algorithms published are not tested against a real processor architecture to evaluate their efficiency in a realistic setting. In this paper, we describe Mimer, a modular evaluation tool-chain for static schedulers that enables the sharing of evaluation and analysis tools employed to elaborate scheduling papers. We propose Schedeval that integrates into Mimer to evaluate static schedules of streaming applications under throughput constraints on actual target execution platforms. We evaluate the performance of Schedeval at running streaming applications on the Intel Single-Chip Cloud computer (SCC), and we demonstrate the usefulness of our tool-chain to compare existing scheduling algorithms. We conclude that Mimer and Schedeval are useful tools to study static scheduling and to observe the behavior of streaming applications when running on manycore architectures.

关键词： Benchmark testing Energy consumption Processor scheduling Schedules Switches throughput Time-frequency analysis benchmark crown scheduling energy frequency many-core scaling scc scheduling streaming voltage Benchmark testing scheduling of multiprocessor Streaming Time frequency analysis throughput Scheduling algorithms Switches energy consumption BENCHMARKS Stress corrosion cracking Scale formation VOLTAGE Scaling

来源：评论

学校读者我要写书评

暂无评论

A parallel ARCHITECTURAL IMPLEMENTATION OF thE FAST thREE STEP SEARCH ALGORIthM FOR BLOCK MOTION ESTIMATION

A PARALLEL ARCHITECTURAL IMPLEMENTATION OF THE FAST THREE ST...

引用

5th international Multi-conference on Systems, Signals and Devices

作者： Srinivasarao, B. K. N. Chakrabarti, Indrajit Indian Inst Technol Dept Elect & Elect Commun Engn Kharagpur 721302 W Bengal India

ISBN: (纸本)9781424422050

this paper proposes a parallel architecture for a fast three step search (FTSS) algorithm, which is used in motion estimation. FTSS algorithm involves reduced number of search points and is thus less computationally expensive compared to the standard three step search (TSS) algorithm. Degradation of performance while applying the FTSS algorithm to several standard images has been shown to be insignificant compared to the standard TSS algorithm. the proposed architecture uses only three processing elements accompanied with use of intelligent data arrangement and memory configuration. A technique for reducing external memory accesses has also been developed. the proposed architecture for FTSS provides an efficient solution for applications requiring real-time motion estimations, because it requires smaller area and power than what would be required to implement TSS. the proposed architecture provides the solution for low bit-rate video applications like video telephony and teleconferencing.

关键词： parallel architectures Teleconferencing Video processing

来源：评论

学校读者我要写书评

暂无评论

Boosting an Embedded Relational Database Management System with Graphics processing Units 5

Boosting an Embedded Relational Database Management System w...

引用

5th international conference on Data Management Technologies and Applications (DATA)

作者： Cremer, Samuel Bagein, Michel Mahmoudi, Said Manneback, Pierre Univ Mons Dept Comp Sci Rue Houdain 9 B-7000 Mons Belgium

ISBN: (纸本)9789897581939

Concurrently, with the rise of Big Data systems, relational database management systems (RDBMS) are still widely exploited in servers, client devices, and even embedded inside end-user applications. In this paper, it is suggest to improve the performance of SQLite, the most deployed embedded RDBMS. the proposed solution, named CuDB, is an "In-Memory" Database System (IMDB) which attempts to exploit specificities of modern CPU / GPU architectures. In this study massively parallel processing was combined with strategic data placement, closer to computing units. According to content and selectivity of queries, the measurements reveal an acceleration range between 5 to 120 times

关键词： In-memory Database Systems Embedded Databases Relational Database Management Systems GPU

来源：评论

学校读者我要写书评

暂无评论

5th international conference on parallel processing and Applied Mathematics, PPAM 2003

引用

5th international conference on parallel processing and Applied Mathematics, PPAM 2003

ISBN: (纸本)3540219463

the proceedings contain 149 papers. the special focus in this conference is on parallel, Distributed architectures, Scheduling and Load Balancing. the topics include: Session guarantees to achieve pram consistency of replicated shared objects;an extended atomic consistency protocol for recoverable DSM systems;hyper-threading technology speeds clusters;configurable microprocessor array for DSP applications;on generalized moore digraphs;RDMA communication based on rotating buffers for efficient parallel fine-grain computations;communication on the fly in dynamic SMP clusters;accelerated diffusion algorithms on general dynamic networks;suitability of load scheduling algorithms to workload characteristics;minimizing time-dependent total completion time on parallel identical machines;diffusion based scheduling in the agent-oriented computing system;approximation algorithms for scheduling jobs with chain precedence constraints;combining vector quantization and ant-colony algorithm for mesh-partitioning;wavelet-neuronal resource load prediction for multiprocessor environment;fault-tolerant scheduling in distributed real-time systems;online scheduling of multiprocessor jobs with idle regulation;predicting the response time of a new task on a beowulf cluster;space decomposition solvers and their performance in pc-based parallel computing environments;evaluation of execution time of mathematical library functions based on historical performance information;empirical modelling of parallel linear algebra routines;efficiency of divisible load processing;gray box based data access time estimation for tertiary storage in grid environment;performance modeling of parallel fem computations on clusters;asymptotical behaviour of the communication complexity of one parallel algorithm and analytical modeling of optimized sparse linear code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Periodically regular chordal ring networks for massively parallel architectures

Periodically regular chordal ring networks for massively par...

引用

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

作者： Parhami, Behrooz Univ of California Santa Barbara United States

Chordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are node-symmetric;i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In this paper, the periodically regular chordal ring network is proposed as a compromise for combining low node degree with small diameter. Discussion is centered on the basic structure, derivation of topological properties, routing algorithms, optimization of parameters, and comparison to competing architectures such as meshes and PEC networks.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Comparison of three parallel Point-Multiplication algorithms on Conic Curves

Comparison of Three Parallel Point-Multiplication Algorithms...

引用

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

作者： Li, Yongnan Xiao, Limin Qin, Guangjun Li, Xiuqiao Lei, Songsong Beihang Univ State Key Lab Software Dev Environm Beijing 100191 Peoples R China

ISBN: (纸本)9783642246685

this paper makes a comparison of three parallel point-multiplication algorithms on conic curves over ring Zn. We propose one algorithm for paralleling point-multiplication by utilizing Chinese Remainder theorem to divide point-multiplication over ring Zn into two different point-multiplications over finite field and to compute them respectively. Time complexity and speedup ratio of this parallel algorithm are computed on the basis of our previous research about the basic parallel algorithms in conic curves cryptosystem. A quantitative performance analysis is made to compare this algorithm with two other algorithms we designed before. the performance comparison demonstrates that the algorithm presented in this paper can reduce time complexity of point-multiplication on conic curves over ring Zn and it is more efficient than the preceding ones.

关键词： conic curves ring Zn finite field Fp point-addition point-double point-multiplication Chinese Remainder theorem

来源：评论

学校读者我要写书评

暂无评论

An efficient compilation of coarse-grained reconfigurable architectures utilizing pre-optimized sub-graph mappings 30

An efficient compilation of coarse-grained reconfigurable ar...

引用

30th Euromicro international conference on parallel, Distributed and Network-Based processing (PDP)

作者： Ohwada, Ayaka Kojima, Takuya Amano, Hideharu Keio Univ Yokohama Kanagawa Japan Univ Tokyo Bunkyo Ku Tokyo Japan

ISBN: (纸本)9781665469586

In recent years, IoT devices have become widespread, and energy-efficient coarse-grained reconfigurable architectures (CGRAs) have attracted attention. CGRAs comprise several processing units called processing elements (PEs) arranged in a two-dimensional array. the operations of PEs and the interconnections between them are adaptively changed depending on a target application, and this contributes to a higher energy efficiency compared to general-purpose processors. the application kernel executed on CGRAs is represented as a data flow graph (DFG), and CGRA compilers are responsible for mapping the DFG onto the PE array. thus, mapping algorithms significantly influence the performance and power efficiency of CGRAs as well as the compile lime. this paper proposes POCOCO, a compiler framework for CGRAs that can use pre-optimized subgraph mappings. this contributes to reducing the compiler optimization task. To leverage the subgraph mappings, we extend an existing mapping method based on a genetic algorithm. Experiments on three architectures demonstrated that the proposed method reduces the optimization lime by 48%, on an average, for the best case of the three architectures.

关键词： Program processors throughput Energy efficiency Libraries Reconfigurable architectures Arrays Task analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共329页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：