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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,815 篇 会议
182 篇 期刊文献
83 册 图书
1 篇 学位论文

馆藏范围

4,081 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,093 篇 工学
- 1,908 篇 计算机科学与技术...
- 1,023 篇 软件工程
- 368 篇 电气工程
- 154 篇 信息与通信工程
- 137 篇 电子科学与技术（可...
- 75 篇 控制科学与工程
- 30 篇 机械工程
- 30 篇 生物工程
- 25 篇 材料科学与工程（可...
- 24 篇 生物医学工程（可授...
- 22 篇 仪器科学与技术
- 20 篇 光学工程
- 19 篇 建筑学
- 17 篇 测绘科学与技术
- 16 篇 土木工程
- 13 篇 动力工程及工程热...
- 12 篇 农业工程
526 篇 理学
- 417 篇 数学
- 50 篇 物理学
- 39 篇 系统科学
- 33 篇 生物学
- 30 篇 统计学（可授理学、...
- 16 篇 化学
- 16 篇 地球物理学
207 篇 管理学
- 154 篇 管理科学与工程(可...
- 61 篇 工商管理
- 54 篇 图书情报与档案管...
19 篇 农学
- 14 篇 作物学
18 篇 法学
- 18 篇 社会学
15 篇 经济学
- 15 篇 应用经济学
13 篇 医学
3 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 艺术学
1 篇 哲学

主题

647 篇 parallel process...
545 篇 parallel program...
527 篇 computer archite...
462 篇 parallel archite...
448 篇 concurrent compu...
358 篇 parallel algorit...
320 篇 programming
313 篇 hardware
283 篇 computer science
276 篇 algorithm design...
263 篇 computational mo...
214 篇 programming prof...
165 篇 parallel process...
164 篇 dynamic programm...
154 篇 application soft...
138 篇 program processo...
138 篇 costs
138 篇 distributed comp...
136 篇 libraries
133 篇 runtime

机构

9 篇 stanford univ st...
9 篇 intel corporatio...
8 篇 barcelona superc...
8 篇 oak ridge natl l...
8 篇 univ calif berke...
7 篇 school of comput...
7 篇 oak ridge nation...
7 篇 carnegie mellon ...
7 篇 college of compu...
7 篇 oak ridge nation...
7 篇 univ texas austi...
6 篇 school of comput...
6 篇 sandia national ...
6 篇 department of co...
6 篇 department of co...
6 篇 school of comput...
6 篇 department of co...
5 篇 department of co...
5 篇 nvidia corporati...
5 篇 pacific northwes...

作者

15 篇 jack dongarra
12 篇 dongarra jack
11 篇 hong shen
10 篇 hoefler torsten
9 篇 zhong cheng
9 篇 olukotun kunle
9 篇 gu yan
8 篇 chapman barbara
7 篇 garcia i.
7 篇 forsell martti
7 篇 sun yihan
7 篇 jigang wu
7 篇 nakano koji
7 篇 danelutto marco
6 篇 cheng zhong
6 篇 v.k. prasanna
6 篇 blelloch guy e.
6 篇 h.j. siegel
6 篇 lumsdaine andrew
6 篇 tsigas philippas

语言

4,044 篇 英文
29 篇 其他
11 篇 中文

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

共 4081 条记录，以下是3531-3540 订阅

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

详细简洁

排序：

A detailed analysis of random polling dynamic load balancing

A detailed analysis of random polling dynamic load balancing

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： P. Sanders LS Informatik für lngenieure und Naturwissenschaftler Universität Karlsruhe Germany

Dynamic load balancing is crucial for the performance of many parallel algorithms. Random polling, a simple randomized load balancing algorithm, has proved to be very efficient in practice for applications like parallel depth first search. This paper presents a detailed analysis of the algorithm taking into account many aspects of the underlying machine and the application to be load balanced. It derives tight scalability bounds which are for the first time able to explain the superior performance of random polling analytically. In some cases, the algorithm even turns out to be optimal. Some of the proof-techniques employed might also be useful for the analysis of other parallel algorithms.< >

关键词： Load management parallel algorithms Algorithm design and analysis Performance analysis Scalability parallel processing Tree data structures Broadcasting Artificial intelligence Computer languages

来源：评论

学校读者我要写书评

暂无评论

A shortest path algorithm for banded matrices by a mesh connection without processor penalty

A shortest path algorithm for banded matrices by a mesh conn...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： A. Mei Y. Igarashi Department of Computer Science Gunma University Kiryu Japan

We give an efficient shortest path algorithm on a mesh-connected processor array for n/spl times/n banded matrices with bandwidth b. We use a [b/2]/spl times/[b/2] semisystolic processor array. The input data is supplied to the processors array from the host computer. The output from the processor array can be also supplied to itself through the host computer. This algorithm computes all pair shortest distances within the band in 7n-4[b/2]-1 steps.< >

关键词： Phase change random access memory Bandwidth Clocks Computer science parallel algorithms Shortest path problem Pipeline processing parallel architectures Computational modeling Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for solving the token distribution problem on k-ary d-cube networks

An efficient algorithm for solving the token distribution pr...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： C.G. Diderich M. Gengler S. Ubeda Computer Science Theory Laboratory Swiss Federal Institute of Technology Lausanne Switzerland Laboratoire de Traitement du Signal Université de Saint Etienne Saint Etienne France

In parallel programs where the problem data is dynamically generated, it is very useful to be able to rely on an efficient load balancing algorithm. The token distribution problem (TDP) is a generalization of the static load balancing problem. The paper describes a novel algorithm for solving the TDP for k-ary d-cube topology networks. Compared to other algorithms, our method is more general and does not rely on every processor knowing the exact number of tokens associated to each processor. The correctness of the algorithm is proved and its complexity is informally studied.< >

关键词： Load management Network topology Concurrent computing Computer science Laboratories Signal generators Heuristic algorithms Algorithm design and analysis Polynomials parallel architectures

来源：评论

学校读者我要写书评

暂无评论

An O(log N log log N) time RMESH algorithm for the simple polygon visibility problem

An O(log N log log N) time RMESH algorithm for the simple po...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Sung-Ryul Kim Kunsoo Park Yoo-Kun Cho Department of Computer Engineering Seoul National University Seoul South Korea

ISBN: (纸本)0818665076

In this paper we consider the simple polygon visibility problem: Given a simple polygon P with N vertices and a point z in the interior of the polygon, find all the boundary points of P that are visible from z. We present an O(logN loglogN) time algorithm that solves the simple polygon visibility problem on a /spl radic/N/spl times//spl radic/N RMESH. Previously, the best known algorithm for the problem on a /spl radic/N/spl times//spl radic/N RMESH takes O(log/sup 2/ N) time.< >

关键词： Switches Phase change random access memory Computer science Very large scale integration Computational modeling parallel algorithms Bandwidth parallel architectures

来源：评论

学校读者我要写书评

暂无评论

A massively parallel implementation of pattern classifiers on SIMD and MIMD architectures

A massively parallel implementation of pattern classifiers o...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： K.P. Lam Computing Laboratory University of Kent Canterbury Kent UK

parallel multi-layer classifier architectures with an increasing hierarchical order have offered much flexibility in design to deal with a wide variety of properties. The model of pipeline processing is especially appropriate for realising such architectures. This has provided hierarchical classifiers a distinct advantage in real-time applications to cope with the important demand for high operating speed, in addition to a potentially better classification performance. An example application of a cascaded form of the BWS and FWS networks, both of which are representatives of the array memory based statistical classifier is described in this paper. As with most pipelined architectures, the complex interactions between successive processing layers of the cascaded network represent a major drawback, and they impose performance bottlenecks which challenge the use of a highly parallel realisation of the classifier. This paper describes an efficient data parallel implementation of the BWS-FWS. For completeness, a brief review of the multi-layer classifiers is first presented. The new algorithm for combining the BWS and FWS networks is described and implemented on two distributed memory processor arrays, the MasPar MP-1 and a network of transputers. An analysis of the performance obtained is also presented.< >

关键词： Computer architecture Concurrent computing High performance computing Laboratories parallel architectures Pipeline processing Performance analysis Image processing Array signal processing Computer vision

来源：评论

学校读者我要写书评

暂无评论

parallel maximal cliques algorithms for interval graphs with applications

Parallel maximal cliques algorithms for interval graphs with...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Chi Su Wang Ruay Shiung Chang Department of Information Management National Taiwan Institute of Technology Taipei Taiwan

ISBN: (纸本)0818665076

In this paper, an O(n log n) time algorithm for finding all the maximal cliques of an interval graph is proposed. This algorithm can also be implemented in parallel in O(log n) time using O(n/sup 2/) processors. The maximal cliques of an interval graph contain important structural information. Many problems on interval graphs can be solved after all the maximal cliques are known. It is shown that cut vertices, bridges, and vertex connectivities can all be determined easily after the maximal cliques are known. Finally, the all-pair shortest path problem for interval graphs is solved based on the relationship between maximal cliques. The all-pair shortest path algorithm can also be parallelized in O(log n) time using O(n/sup 2/) processors.< >

关键词： Shortest path problem Mathematical model Information management Bridge circuits NP-complete problem Polynomials parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Strategy and simulation of adaptive RID for distributed dynamic load balancing in parallel systems

Strategy and simulation of adaptive RID for distributed dyna...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Lin Chengjiang Li Sanli Department of Computer Science and Technology Tsinghua University China

ISBN: (纸本)0818665076

Dynamic load balancing schemes are essentially significant for efficiently executing non-uniform problems in highly parallel multicomputer systems. Their objective is to minimize the total execution time of single applications. This paper proposes adaptive receiver initiated diffusion (ARID) strategy for distributed dynamic load balancing. Its principle and control protocol are described. The communication overhead and the effect on system stability and performance efficiency are analyzed. Finally simulation experiments are carried out to compare the adaptive strategy with other dynamic load balancing scheme.< >

关键词： Load management parallel processing Communication system control Control systems Processor scheduling Computational modeling Computer science Application software Protocols Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Panel: program portability across parallel architectures SIMD/MIMD/SPMD/shared/distributedspl hellip/

Panel: program portability across parallel architectures SIM...

引用

international symposium on parallel Processing

作者： M. Wolfe Oregon Graduate Institute USA

How can a user write a program to be portable and efficient across widely different parallel architectures, such as SIMD, MIMD, shared-memory, distributed memory, workstation clusters, etc.? The following issues are considered: what language should be used; how appropriate is one language for different applications; how efficient can a portable program be; and how will efficiency be achieved.< >

关键词： parallel architectures Optimizing compilers Libraries High level languages Lifting equipment parallel programming Message passing Workstations Assembly Process design

来源：评论

学校读者我要写书评

暂无评论

Contention sensitive fault-tolerant routing algorithms for hypercubes

Contention sensitive fault-tolerant routing algorithms for h...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： R. Srinivasan V. Chaudhary S.M. Mahmud Parallel and Distributed Computing Laboratory Department of Electrical and Computer Engineering Wayne State University Detroit MI USA

We present two new fault tolerant routing algorithms for hypercubes. The first algorithm requires only local knowledge of the faults whereas the second algorithm requires global knowledge. Unlike previous fault tolerant routing algorithms, our algorithms take into consideration the dynamic conditions (link contention) of the network. We have shown that checking for dynamic conditions in fault tolerant algorithms is essential. Performance evaluation by extensive simulation of our algorithms and other fault tolerant routing algorithms show that ours are better than previous algorithms by as much as 50%; and 500%; in time and space, respectively. We also observed that global information about the location of faults does not give us additional benefit. This observation is true regardless of the consideration of the dynamic conditions in the network.< >

关键词： Fault tolerance Routing Hypercubes Telecommunication traffic Distributed computing Laboratories Network topology Scalability Hardware Adaptive algorithm

来源：评论

学校读者我要写书评

暂无评论

Increase analysis in the total execution time of a parallel program

Increase analysis in the total execution time of a parallel ...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Dingchao Li H. Takagi N. Ishii Educational Center for Information Processing Nagoya Institute of Technology Nagoya Japan Department of Intelligence and Computer Science Nagoya Institute of Technology Nagoya Japan

Lower bound on the finishing time of optimal schedules is used as an absolute performance measure of static scheduling heuristics. This paper presents an efficient method of computing such a bound based on estimating overlaps among the execution ranges of tasks in a given task graph and analyzing the delays of tasks on the critical paths of the graph. The computation performed by this method is shown to be of higher quality than that of other known methods. The future work and directions on this topic are also indicated.< >

关键词： Optimal scheduling Processor scheduling Delay estimation Finishing Scheduling algorithm Information analysis Information processing Computer science Electronic mail Time measurement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共409页 << < 350 351 352 353 354 355 356 357 358 359 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：