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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,505 篇 会议
106 篇 期刊文献

馆藏范围

1,611 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,169 篇 工学
- 1,112 篇 计算机科学与技术...
- 557 篇 软件工程
- 118 篇 电气工程
- 75 篇 信息与通信工程
- 46 篇 控制科学与工程
- 37 篇 电子科学与技术（可...
- 13 篇 材料科学与工程（可...
- 13 篇 农业工程
- 11 篇 机械工程
- 11 篇 光学工程
- 8 篇 化学工程与技术
- 8 篇 生物工程
- 7 篇 建筑学
- 7 篇 生物医学工程（可授...
- 6 篇 动力工程及工程热...
- 5 篇 土木工程
- 3 篇 力学（可授工学、理...
580 篇 理学
- 558 篇 数学
- 55 篇 统计学（可授理学、...
- 16 篇 物理学
- 9 篇 生物学
- 9 篇 系统科学
- 8 篇 化学
73 篇 管理学
- 64 篇 管理科学与工程(可...
- 40 篇 工商管理
- 10 篇 图书情报与档案管...
16 篇 农学
- 16 篇 作物学
6 篇 经济学
- 6 篇 应用经济学
3 篇 法学
- 3 篇 社会学
3 篇 教育学
- 3 篇 教育学
2 篇 医学
1 篇 文学
1 篇 军事学

主题

237 篇 parallel algorit...
173 篇 parallel process...
80 篇 computer archite...
74 篇 parallel process...
57 篇 parallel program...
56 篇 algorithms
47 篇 parallel archite...
41 篇 hardware
30 篇 scheduling
27 篇 computer program...
21 篇 graph algorithms
20 篇 computer systems...
18 篇 approximation al...
18 篇 processor schedu...
18 篇 computational mo...
18 篇 field programmab...
17 篇 parallel computi...
16 篇 computer science
16 篇 performance
16 篇 delay

机构

32 篇 carnegie mellon ...
15 篇 swiss fed inst t...
15 篇 carnegie mellon ...
11 篇 univ maryland de...
11 篇 stanford univ st...
10 篇 univ maryland co...
10 篇 mit 77 massachus...
10 篇 univ calif berke...
8 篇 eth zurich
7 篇 georgetown univ ...
7 篇 mit cambridge ma...
7 篇 univ texas austi...
6 篇 penn state univ ...
6 篇 mit csail cambri...
5 篇 univ calif river...
5 篇 princeton univer...
5 篇 university of ma...
5 篇 microsoft res re...
5 篇 carnegie mellon ...
5 篇 harvard univ cam...

作者

38 篇 blelloch guy e.
20 篇 gu yan
18 篇 gibbons phillip ...
18 篇 shun julian
18 篇 goodrich michael...
16 篇 fineman jeremy t...
15 篇 sun yihan
14 篇 dhulipala laxman
13 篇 vishkin uzi
12 篇 agrawal kunal
11 篇 leiserson charle...
10 篇 ballard grey
10 篇 hoefler torsten
10 篇 anon
10 篇 miller gary l.
10 篇 harris david g.
9 篇 ghaffari mohsen
9 篇 tangwongsan kana...
9 篇 reif john h.
9 篇 demmel james

语言

1,570 篇 英文
41 篇 其他

检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"

共 1611 条记录，以下是881-890 订阅

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

详细简洁

排序：

Distributed electric field approximation

Distributed electric field approximation

引用

IEEE International symposium on High Performance Computing Systems and Applications (HPCS)

作者： D. Trybus Z. Kucerovsky A. Ieta T.E. Doyle University of Western Ontario ONT Canada

Grid or mesh techniques are frequently used to approximate continuous entities that behave in a wave or fluid-like fashion. Partial Differential Equations (PDEs) are usually involved in the description of such entities or processes. Distributed parallel computation was used in various computer cluster configurations to calculate PDE solutions of electrostatic field. The study of the efficacy of the selected architecture using mesh techniques was intended. The match between the algorithm and the architecture in achieving maximum computational performance was also investigated. The developed architectures, algorithms, and findings are presented in the paper.

关键词： Grid computing Clustering algorithms Concurrent computing Distributed computing Computer architecture Linux Partitioning algorithms Partial differential equations Electrostatics parallel processing

来源：评论

学校读者我要写书评

暂无评论

Coarse-grain pipelining on multiple FPGA architectures

Coarse-grain pipelining on multiple FPGA architectures

引用

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

作者： H. Ziegler Byoungro So M. Hall P.C. Diniz University of Southern California/Information Sciences Institute Marina del Rey CA USA

Reconfigurable systems, and in particular, FPGA-based custom computing machines, offer a unique opportunity to define application-specific architectures. These architectures offer performance advantages for application domains such as image processing, where the use of customized pipelines exploits the inherent coarse-grain parallelism. In this paper we describe a set of program analyses and an implementation that map a sequential and un-annotated C program into a pipelined implementation running on a set of FPGAs, each with multiple external memories. Based on well-known parallel computing analysis techniques, our algorithms perform unrolling for operator parallelization, reuse and data layout for memory parallelization and precise communication analysis. We extend these techniques for FPGA-based systems to automatically partition the application data and computation into custom pipeline stages, taking into account the available FPGA and interconnect resources. We illustrate the analysis components by way of an example, a machine vision program. We present the algorithm results, derived with minimal manual intervention, which demonstrate the potential of this approach for automatically deriving pipelined designs from high-level sequential specifications.

关键词： Pipeline processing Field programmable gate arrays Computer architecture Algorithm design and analysis parallel processing Performance analysis Partitioning algorithms Image processing Computer applications Machine vision

来源：评论

学校读者我要写书评

暂无评论

The waveform ICGS technique for parallel transient simulation of semiconductor devices

The waveform ICGS technique for parallel transient simulatio...

引用

IEEE International symposium on High Performance Computing Systems and Applications (HPCS)

作者： L.T. Yang Department of Computer Science Saint Francis Xavier University Antigonish NS Canada

In this paper, the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on parallel distributed memory computers are studied. These methods are competitive with standard pointwise methods on serial architectures, but are significantly faster on parallel computers. We make use of an improved parallel version of the conjugate gradient squared method (ICGS) combining elements of numerical stability and parallel algorithm design, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems arising at each linearization step with waveform Newton. We reorganize the algorithm such that all the inner products, matrix-vector multiplications and vector updates of a single iteration step are independent and communication time required for inner product can be overlapped efficiently with computation time of vector updates. Therefore, the bottleneck of the performance, namely the cost of global communication on parallel distributed memory computers can be significantly reduced. The resulting ICGS algorithm maintains the favorable properties of the original algorithm while not increasing the computational costs.

关键词： Semiconductor devices Concurrent computing Computational modeling Distributed computing Vectors Acceleration Computer simulation Computer architecture Numerical stability parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms 02

Minimizing randomness in minimum spanning tree, parallel con...

引用

Proceedings of the thirteenth annual acm-SIAM symposium on Discrete algorithms

作者： Seth Pettie Vijaya Ramachandran The Univ. of Texas at Austin Austin TX

ISBN: (纸本)9780898715132

There are several fundamental problems for which there are optimal randomized algorithms, but whose deterministic complexity remains unresolved. Among such problems are the minimum spanning tree problem, the set maxima problem, the problem of computing connected components and (minimum) spanning trees in parallel and the problem of performing sensitivity analysis on shortest path trees and minimum spanning trees. For each of these problems there is an optimal randomized algorithm which uses a linear number of random bits. We propose new algorithms (or adapt old ones) for these problems which preserve optimality while saving an exponential number of random bits. In the case of computing minimum spanning trees and MST/SSSP sensitivity analysis, we reduce the dependence on randomness to log* n random *** also consider the problem of selection, for which we give two algorithms which make an expected 1.5n + o(n) comparisons; one uses O(log n) random bits and is uniform, the other uses O(log log n) random bits and is non-uniform.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Characterizing and predicting value degree of use

Characterizing and predicting value degree of use

引用

IEEE/acm International symposium on Microarchitecture (MICRO)

作者： J.A. Butts G.S. Sohi Computer Science Department University of Wisconsin Madison USA

A value's degree of use - the number of dynamic uses of that value $provides the most essential information needed to optimize its communication. We present simulation results demonstrating the properties of degree of use of values, including their predictability: most static instructions generate values with few degrees of use and these exhibit temporal locality. We use these results to guide the design of a degree of use predictor. The development and detailed characterization of this predictor is the focus of this paper. Our predictor leverages future control flow information (e.g., branch predictions) to select among different possible degrees of use. We study the effects of several optimizations and variations in the predictor's algorithms to tune the predictor for maximum performance. The resulting predictor generates correct degree of use predictions for over 92% of all dynamic values and has a misprediction rate below 2.5%. Such a predictor has a wide range of potential applications in optimizing value communication.

关键词： Design optimization Computer science Computational modeling Predictive models Prediction algorithms parallel processing Registers Logic Bandwidth Delay

来源：评论

学校读者我要写书评

暂无评论

Fast and guaranteed C compilation onto the PACT-XPP/spl trade/ reconfigurable computing platform

Fast and guaranteed C compilation onto the PACT-XPP/spl trad...

引用

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

作者： J.M.P. Cardoso M. Weinhardt PACT Informationstechnologie AG Munich Germany

We introduce the XPP-VC high-level compiler, which maps C programs to the coarse-grained XPP architecture. XPP-VC's main feature is the integration of pipeline vectorization and temporal partitioning techniques. The former provides high-throughput inner loop computations and the later allows the compilation of large programs or the use of fewer XPP processing elements. Although the preliminary results are very encouraging, improvements on the generation of configurations are still required. The evaluation we have conducted shows that only a few seconds are required to generate, from algorithms in C, the binaries to program the XPP. To our knowledge this compilation performance is unmatched by any other compiler targeting reconfigurable architectures. Moreover the compiler still achieves high-performance implementations. Since the XPP is delivered as an IP core or device to be coupled to a host processor, a future version of XPP-VC will consider co-compilation, i.e., compilation to hybrid microprocessor/XPP architectures.

关键词： Computer architecture Field programmable gate arrays Concurrent computing High performance computing Roads parallel processing Adaptive arrays Array signal processing LAN interconnection Frequency synchronization

来源：评论

学校读者我要写书评

暂无评论

Towards practical deterministic Write-All algorithms

Towards practical deterministic Write-All algorithms

引用

13th annual symposium on parallel algorithms and architectures (SPAA 2001)

作者： Chlebus, B.S. Malewicz, G. Dobrev, S. Shvartsman, A. Kowalski, D.R. Vrto, I. Instytut Informatyki Uniwersytet Warszawski Banacha 2 Warszawa 02-097 Poland

A family of deterministic asynchronous Write-All algorithms were studied to analyze the properties of the set of permutations proposed by Kanellakis and Shvartsman. The efficiency of the algorithms was measured in terms of work acounted for all machine instructions executed by processors. It was found that the analytical results covered only a subset of the possible adversarial patterns of asynchrony. The analysis suggested that the proposed method yielded a faster construction of the Write-All algorithms compared to other methods.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A parallel block algorithm for exact triangularization of rectangular matrices

A parallel block algorithm for exact triangularization of re...

引用

13th annual symposium on parallel algorithms and architectures (SPAA 2001)

作者： Dumas, J.-G. Roch, J.-L. Lab. Informatique et Distribution ENSIMAG - antenne de'Montbonnot ZIRST - 51 av. Jean Kuntzmann 38330 Montbonnot Saint-Martin France

A new block algorithm for triangularization of regular or singular matrices with dimension m × n, is proposed. Taking benefit of fast block multiplication algorithms, it achieves the best known sequential complexity O(mω-1n) for any sizes and any rank. Moreover, the block strategy enables to improve locality with respect to previous algorithms as exhibited by practical performances.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

On tiling space-time mapped loop nests 01

On tiling space-time mapped loop nests

引用

13th annual symposium on parallel algorithms and architectures (SPAA 2001)

作者： Griebl, M. University of Passau FMI Passau Germany

ISBN: (纸本)9781581134094

Automatic parallelization of loop programs based on space-time mapping typically aims at maximal parallelism. In order to obtain reasonable performance, the granularity of the parallelism must be coarsened, e.g., by applying tiling techniques. In contrast to others, we suggest to apply tiling after the computation of a space-time mapping. This extends the applicability of existing tiling methods and significantly improves efficiency of parallelized loop programs.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems

Pursuit and evasion on a ring: An infinite hierarchy for par...

引用

13th annual symposium on parallel algorithms and architectures (SPAA 2001)

作者： Bruda, S.D. Akl, S.G. Dept. of Computing and Info. Science Queen's University Kingston Ont. K7L 3N6 Canada

A parallel real-time complexity theory was presented to study infinity hierarchy for parallel real-time systems. Set of timed ω-languages was closed under intersection, union, complement, concatenation and Kleene closure. The proposed real-time algorithm consisted of an input tape containing timed ω-word and an output tape containing symbols from alphabet δ in finite control. The analysis suggested that the hierarchy of real-time algorithms with respect to number of processors was infinite.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共162页 << < 85 86 87 88 89 90 91 92 93 94 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：