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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

161 篇 会议
4 篇 期刊文献

馆藏范围

165 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

143 篇 工学
- 133 篇 计算机科学与技术...
- 66 篇 软件工程
- 24 篇 信息与通信工程
- 13 篇 电气工程
- 10 篇 材料科学与工程（可...
- 8 篇 电子科学与技术（可...
- 8 篇 控制科学与工程
- 6 篇 机械工程
- 6 篇 网络空间安全
- 5 篇 农业工程
- 3 篇 力学（可授工学、理...
- 3 篇 建筑学
- 3 篇 生物医学工程（可授...
- 3 篇 生物工程
- 2 篇 土木工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 冶金工程
- 1 篇 化学工程与技术
57 篇 理学
- 50 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 生物学
- 2 篇 物理学
- 1 篇 化学
14 篇 管理学
- 11 篇 管理科学与工程(可...
- 6 篇 工商管理
- 3 篇 图书情报与档案管...
5 篇 农学
- 5 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学

主题

11 篇 parallel process...
8 篇 parallel process...
8 篇 distributed comp...
7 篇 concurrent compu...
7 篇 grid computing
6 篇 parallel archite...
6 篇 database systems
4 篇 parallel algorit...
4 篇 application soft...
4 篇 fault tolerance
4 篇 parallel program...
4 篇 computer network...
3 篇 computer systems...
3 篇 high performance...
3 篇 distributed comp...
2 篇 memory managemen...
2 篇 encoding (symbol...
2 篇 merging
2 篇 research and dev...
2 篇 graphics process...

机构

2 篇 hong kong polyte...
2 篇 school of comput...
2 篇 illinois institu...
2 篇 tohoku univ info...
2 篇 tohoku univ grad...
2 篇 department of co...
2 篇 ibm corporation ...
2 篇 louisiana state ...
2 篇 national laborat...
2 篇 department of co...
1 篇 department of el...
1 篇 department of in...
1 篇 school of inform...
1 篇 merit technology...
1 篇 pc2-paderborn ce...
1 篇 nanyang technol ...
1 篇 school of comput...
1 篇 acad sinica inst...
1 篇 computer science...
1 篇 univ politecn ca...

作者

4 篇 zheng wm
2 篇 chang zhi-ming
2 篇 wang cho-li
2 篇 lakshmivarahan s...
2 篇 wojcik zbigniew ...
2 篇 bernard t
2 篇 bui a
2 篇 cao jn
2 篇 shu jw
2 篇 wojcik barbara e...
2 篇 ghafoor arif
2 篇 wang tianqi
2 篇 raad peter e.
2 篇 lau francis c. m...
2 篇 olariu s.
2 篇 jiang yan-huang
2 篇 dhall s.k.
2 篇 yang xue-jun
2 篇 zheng s.q.
1 篇 deen sm

语言

165 篇 英文

检索条件"任意字段=2nd IEEE Symposium on Parallel and Distributed Processing, SPDP 1990"

共 165 条记录，以下是21-30 订阅

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

详细简洁

排序：

parallel execution of Lanczos algorithm in a CAM systolic ring 2

Parallel execution of Lanczos algorithm in a CAM systolic ri...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Ko, C. Rutgers University Department of Electrical Computer Engineering College of Engineering P.O.Box 909 PiscatavayNJ08855 United States

ISBN: (纸本)0818620870

We presents an efficient array processing scheme to exploit Lanczos algorithm for solving a large-scale eigenvalue problem. He shows that an array of processing elements with content addressable memories (CAM), connected in a simple ring topology, can solve the problem efficiently. The nonzero elements of a problem matrix are stored in a content addressable memory for an efficient storage and the required operations are executed in a pipeline fashion around the systolic ring. The algorithm consists of two steps: Lanczos triangularisation followed by QR method to obtain full eigenvalues and eigenvectors. It is shown that the speedup obtained in such a system is almost linear with the number of processing elements used when the problem is partitioned to be executed with relatively small number of processing element. © 1990 ieee.

关键词： Associative storage

来源：评论

学校读者我要写书评

暂无评论

Using universe knowledge and arithmetic to get faster parallel algorithms 2

Using universe knowledge and arithmetic to get faster parall...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Tsotras, Vassilis J. Gopinath, B. Hart, George W. Dept. of EE and CS Polytechnic University BrooklynNY11201 United States Dept. of EE and CS Rutgers University New BrunswickNJ08903 United States Dept. of Electr. Engineering Columbia University NY10027 United States

ISBN: (纸本)0818620870

The authors provide algorithms that achieve better upper bounds for three classical parallel problems, i.e., searching, merging and maximum finding. The algorithms assume that the p parallel processors can use arithmetic and that the universe U of the input elements is bounded and known. They show that parallel searching is done in O(loglogU/logp), while parallel merging and maximum finding in O(logloglogU). The results hold for the CRCW and CREW PRAM models. © 1990 ieee.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

On parallel processing in computational fluid dynamics 2

On parallel processing in computational fluid dynamics

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Raad, Peter E. Varghese, Abraham N. Department of Civil and Mechanical Engineering Southern Methodist University DallasTX75275-0335 United States

ISBN: (纸本)0818620870

Two popular finite difference techniques in computational fluid dynamics are parallelized and tested on a Sequent 20-processor Symmetry computer. Several parallel implementations are investigated in the context of the simple heat and the more complicated curvilinear grid mapping equations. Significant speedups are demonstrated with the largest ones resulting from more complex equations, larger size grids, and more stringent convergence criteria. A novel but intuitive approach in which processor loads are balanced between successive major computational tasks is presented, and shown to yield speedups which are closer to theoretical. © 1990 ieee.

关键词： Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Datarol: A massively parallel architecture for functional languages 2

Datarol: A massively parallel architecture for functional la...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Amamiya, Makoto Taniguchi, Rin-Ichiro Department of Information Systems Kyushu University Kasuga-shi Fukuoka816 Japan

ISBN: (纸本)0818620870

Proposes a parallel machine architecture which incorporates an ultra-multiprocessing facility for parallel execution of functional programs. The machine performs parallel executions along a multi-thread control flow called datarol. A datarol program, instead of using a program counter, the instructions to be executed next are explicitly specified in the preceding instructions. The explicitly specified continuation linkage enables the concurrent execution of the instructions of different function instances, as well as the parallel execution of multi-thread control flow within a function instance. Based on a continuation-based execution model, the datarol processor is designed to implement an efficient parallel execution mechanism needed for ultra-multi-processing. First, the datarol concept is discussed in comparison with a dataflow model. Next, the datarol machine architecture and datarol processor design are described. Finally, the evaluation of the datarol architecture is shown. © 1990 ieee.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant distributed shared memory algorithms 2

Fault tolerant distributed shared memory algorithms

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Stumm, Michael Zhou, Songnian University of Toronto TorontoM5S 1A4 Canada

ISBN: (纸本)0818620870

distributed shared memory (DSM) has received increased attention as a mechanism for interprocess communication in loosely-coupled distributed systems because of its perceived advantages over direct use of message passing or remote procedure calls. One problem with most DSM algorithms proposed to date, however, is that they do not tolerate faults. The paper extends four basic DSM algorithms to tolerate single host failures and argues that this degree of fault tolerance is sufficient for most applications. It analyzes the performance behavior of the fault tolerant DSM algorithms and shows that for some algorithms the additional overhead for fault tolerance is quite small, but that for other algorithms the extra overhead can be substantial and even unpredictable. © 1990 ieee.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

A virtual bus for dynamic parallel processing 2

A virtual bus for dynamic parallel processing

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Lee, K.C. Bellcore 445 South Street MRE 2E-241 MorristownNJ07960-1910 United States

ISBN: (纸本)0818620870

One important characteristic ol large parallel database and knowledge base systems is that the communication patterns are dependent on the data and the load of the system. Therefore, the inter-connection network for these systems must be robust to the non-uniform traffic generated by various dynamic data collection and load balancing operations. In this paper, we propose an efficient interconnection network architecture called virtual bus that can sustain non-uniform traffic by dynam-ically allowing time sharing of network bandwidth among processing nodes. The bandwidth sharing is controlled by a fast variable priority arbitration scheme with a round-robin scheduling policy. The virtual bus architecture allows efficient implementation;with current technology, the virtual bus can achieve giga packets and tera bits per second throughputs in less than 5% of the total cost of an eight thousand port system. © 1990 ieee.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

parallel bin packing using first fit and k-delayed best-fit heuristics 2

Parallel bin packing using first fit and k-delayed best-fit ...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Bestavros, Azer Cheatham, Thomas Stefanescu, Dan Department of Computer Science Harvard University United States

ISBN: (纸本)0818620870

The authors describe the development of parallel implementations for the bin packing problem. Bin packing algorithms are studied to understand various resource allocation issues and the impact of the different packing heuristics on the packing efficiency. The seemingly serial nature of the bin packing simulation has prohibited previous experimentations from going beyond sizes of several thousands bins. The authors show that by adopting fairly simple data parallel algorithms a linear speedup is possible. Sizes of up to hundreds of thousands of bins have been simulated for different parameters and heuristics. The authors focussed on the well known first-fit heuristic. They also considered another potentially superior heuristic, k-delayed best fit. © 1990 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed task processing performance on a NUMA shared memory multiprocessor 2

Distributed task processing performance on a NUMA shared mem...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Srinivasan, Pattabiraman Zhang, Xiaodong Division of Mathematics and Computer Science University of Texas at San Antonio San AntonioTX78285-0664 United States

ISBN: (纸本)0818620870

The effects of distributed task processing on a NUMA (nonuniform memory access) shared memory multiprocessor are studied and examined. Several analytical models are given for describing the behavior of different scheduling strategies. The performance of pre-scheduling and self-scheduling on the BBN GP1000, a NUMA shared multiprocessor is measured through several application programs. The experimental results are consistent with the analytical models. The results may be used to determine an optimal scheduling strategy for effective use of a NUMA shared memory multiprocessor in developing an efficient parallel programming environment and running application programs. © 1990 ieee.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Bin-packing adjustable rectangles and applications to task scheduling on partitionable parallel computers 2

Bin-packing adjustable rectangles and applications to task s...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Ji, Jiahuang Jeng, Menkae Computer Science Department University of Houston HoustonTX77204 United States IBM Corporation 5600 Cottle Road San JoseCA95193 United States

ISBN: (纸本)0818620870

The problem of packing adjustable rectangles into a rectangular bin with minimum height is investigated. In this problem, the length and width of each rectangle can be changed, based on certain reshaping rules, before being packed into the bin. The problem is called packing adjustable rectangle (PAR) problem. One application of this problem is scheduling independent tasks on partitionable parallel computers. The paper investigated reshaping rules for reshaping rectangles, which are suitable to the task scheduling problem. Based on these rules, asymptotically optimal algorithms to solve the PAR problem are developed and presented. © 1990 ieee.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

The application of parallel processing to the simplified marker and cell method 2

The application of parallel processing to the simplified mar...

引用

2nd ieee symposium on parallel and distributed processing, spdp 1990

作者： Johnson, David B. Raad, Peter E. Rausch, Randall E. Department of Civil and Mechanical Engineering Southem Methodist University DallasTX75275-0335 United States

ISBN: (纸本)0818620870

Significant improvements in the computational efficiency of the simulation of transient, free surface fluid flow problems by use of the simplified marker and cell method are described. The improvements are due to the replacement of the use of the successive overrelaxation method in a portion of the previous computer program with the use of the preconditioned conjugate gradient method and to the parallelization of major portions of the new program. The actual improvements in computational efficiency associated with the solution of five specific example problems are presented and discussed. © 1990 ieee.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共17页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：