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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,645 篇 会议
54 篇 期刊文献
12 册 图书

馆藏范围

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

日期分布

学科分类号

1,164 篇 工学
- 1,105 篇 计算机科学与技术...
- 417 篇 软件工程
- 162 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
86 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,674 篇 英文
33 篇 其他
4 篇 中文
1 篇 土耳其文

检索条件"任意字段=2nd International Symposium on Parallel and Distributed Processing and Applications"

共 1711 条记录，以下是1671-1680 订阅

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

详细简洁

排序：

Restructuring wafers for maximum yield and some applications of WSI 2

Restructuring wafers for maximum yield and some applications...

引用

2nd IEEE symposium on parallel and distributed processing, SPDP 1990

作者： Bhatia, Dinesh Department of Computer Science and Engineering School of Engineering and Applied Science Southern Methodist University DallasTX75275-0122 United States

ISBN: (纸本)0818620870

The paper studies the problem of restructuring two dimensional wafers in the presence of faults. It constructs arrays of size as much as the size of the original faulty wafer. Obviously this is done at the cost of increased load factor. Later it shows how to construct small FFT machines on a two dimensional wafer. The FFT machines are constructed by embedding a butterfly graph in a two dimensional array in such a fashion that all the I/O nodes of a FFT graph are restricted to the periphery nodes of the mesh. It also minimizes the maximum wire length which is an important cost factor in such wafer scale designs. © 1990 IEEE.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

TOWARDS AN EFFICIENT MANAGEMENT OF OBJECTS IN A distributed ENVIRONMENT 90

引用

2nd international SYMP ON DATABASES IN parallel And distributed SYSTEMS ( DPDS 90 )

作者： ELHABBASH, A GRIMSON, J HORN, C Department of Computer Science Trinity College Dublin Ireland

ISBN: (纸本)0818620528

A prototype of an object-oriented system implemented in C_Prolog is described. Its main objective is to demonstrate system features that would support efficient management of objects and object-oriented databases in a persistent and distributed environment. Mechanisms at the low level of the system were considered to support object distribution, mobility control, and configuration management in a simple and uniform way. Objects exist in clusters, which are transparent to the applications. The prototype is a framework for a self-organizing object-oriented distributed system.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

USING JOIN OPERATIONS AS REDUCERS IN distributed QUERY-processing 90

引用

2nd international SYMP ON DATABASES IN parallel And distributed SYSTEMS ( DPDS 90 )

作者： CHEN, MS YU, PS IBM Thomas J. Watson Research Center P.O. Box 704 Yorktown Heights New York

ISBN: (纸本)0818620528

Semijoin has traditionally been relied upon for reducing the communication cost required for distributed query processing. However, judiciously applying join operations as reducers can lead to further reduction in the communication cost. In view of this fact, we explore in this paper the approach of using join operations, in addition to semijoins, as reducers in distributed query processing. We first show that the problem of determining a sequence of join operations for a query graph can be transformed to that of finding a set of cuts to that graph, where a cut to a graph is a partition of the nodes in that graph. In light of the mapping we develop an efficient heuristic algorithm to determine an effective sequence of join reducers for a query. The algorithm using the concept of divide-and-conquer is shown to have polynomial time complexity. Examples are also given to illustrate our results.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

AN EXPERIMENTAL PERFORMANCE STUDY OF A PIPELINED RECURSIVE QUERY-processing STRATEGY 90

引用

2nd international SYMP ON DATABASES IN parallel And distributed SYSTEMS ( DPDS 90 )

作者： SHAO, J BELL, DA HULL, MEC Department of Computing Science University of Ulster at Jordanstown Co. Antrim N. Ireland U.K.

ISBN: (纸本)0818620528

In [16] a pipelined strategy is presented for processing recursive queries in deductive database systems. As a follow-up, this paper studies the run-time performance of the proposed strategy. The algorithm, introduced informally by examples in this paper, is coded in occam2 and runs on a network of transputers. A wide range of recursive queries and database structures are used as benchmarks in this study. Both the speedup factors achieved and the elapsed time spent by the strategy in answering recursive queries are analysed. Experimental results show that it is possible to achieve significant performance improvement when queries are evaluated in parallel, and provide insights into the success of this strategy in meeting the primary objective of focusing on relevant data.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel algorithms for solving set recurrence equations and applications 2

Efficient parallel algorithms for solving set recurrence equ...

引用

2nd IEEE symposium on parallel and distributed processing, SPDP 1990

作者： Ibarra, Oscar H. Wang, Hui Jiang, Too Department of Computer Science University of California Santa BarbaraCA93106 United States Department of Computer Sciences and Systems McMaster University HamiltonONL8S 4K1 Canada

ISBN: (纸本)0818620870

The authors present two EREW PRAM algorithms and one CREW PRAM algorithm for solving set recurrence equations of the type commonly used in dynamic programming solutions to many problems in pattern matching, sequence comparison, and language recognition. All three algorithms run in O(log2n) time. The first EREW PRAM algorithm uses O(M(n/log n)log2n) processors, where M(n) is the number of processors needed to multiply two n n Boolean matrices in O(log n) time on an EREW PRAM. The second algorithm uses O(M'(n/(log n square root loglog n))log2n) processors, where M'(n) is the number of processors needed to multiply two n n matrices over an arbitrary ring in O(log n) time on an EREW PRAM. The CREW PRAM algorithm uses O(M»(n/log/sup 1.5/n)log2n) processors, where M»(n) is the number of processors needed to multiply two n n matrices over an arbitrary ring in O(log n) time on a CREW PRAM. The authors show that linear context-free languages can be recognized in O(log2n) time using o(M(n)) processors on an EREW PRAM. They give applications to other problems such as string shuffling, recognition of languages accepted by two-head nondeterministic finite automata, and transductions defined by two-tape nondeterministic finite transducers. © 1990 IEEE.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

CORRECTING EXECUTION OF distributed QUERIES 90

引用

2nd international SYMP ON DATABASES IN parallel And distributed SYSTEMS ( DPDS 90 )

作者： BODORIK, P PYRA, J RIORDON, JS School of Computer Science Technical University of Nova Scotia P.O. Box 1000 Halifax Nova Scotia B3J 2X4 Canada Dept. of Systems and Computer Engineering Carleton University Ottawa Ontario K1S 5B6 Canada

ISBN: (纸本)0818620528

Algorithms for processing distributed queries require a priori estimates of the size of intermediate relations. Most such algorithms take a “static” approach in which the algorithm is completely determined before processing begins. If size estimates are found to be inaccurate at some intermediate stage, there is no opportunity to re-schedule, and the result may be far from optimal. Adaptive query execution may be used to alleviate the problem. Care is necessary, though, to ensure that the delay associated with re-scheduling does not exceed the time saved through the use of a more efficient strategy. This paper presents a low overhead delay method to decide when to correct a strategy. Sampling is used to estimate the size of relations, and alternative heuristic strategies prepared in a background mode are used to decide when to correct. Correction is made only if lower overall delay is achieved, including correction time. Evaluation using a model of a distributed data base indicates that the heuristic strategies are near optimal. Moreover, it also suggests that it is usually correct to abort creation of an intermediate relation which is much larger than predicted.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

The embedding kernel on the IBM victor multiprocessor for program mapping and network reconfiguration

The embedding kernel on the IBM victor multiprocessor for pr...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： E. Ma D.G. Shea IBM Thomas J. Watson Research Center Yorktown Heights NY USA

The design of a functional embedding kernel (E-kernel) to support automatic mapping of parallel programs having higher dimensional mesh or torus task graphs onto the 2D mesh network of Victor is described. E-kernel supports two levels of embeddings: in the first level, the mapping of a parallel program onto the system network; and in the second level, the mapping of a network topology onto the 2D mesh. The first level of embeddings corresponds to the support of automatic program mapping, and the second level the support of network reconfiguration.< >

关键词： Kernel Monitoring Mesh networks Network topology Multiprocessor interconnection networks Shape Hypercubes Computer applications Computer networks Ducts

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel algorithms for solving set recurrence equations and applications

Efficient parallel algorithms for solving set recurrence equ...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： O.H. Ibarra Hui Wang Tao Jiang Department of Computer Sciences University of California Santa Barbara CA USA

The authors present two EREW PRAM algorithms and one CREW PRAM algorithm for solving set recurrence equations of the type commonly used in dynamic programming solutions to many problems in pattern matching, sequence comparison, and language recognition. All three algorithms run in O(log/sup 2/n) time. The first EREW PRAM algorithm uses O(M(n/log n)log/sup 2/n) processors, where M(n) is the number of processors needed to multiply two n*n Boolean matrices in O(log n) time on an EREW PRAM. The second algorithm uses O(M'(n/(log n square root loglog n))log/sup 2/n) processors, where M'(n) is the number of processors needed to multiply two n*n matrices over an arbitrary ring in O(log n) time on an EREW PRAM. The CREW PRAM algorithm uses O(M"(n/log/sup 1.5/n)log/sup 2/n) processors, where M"(n) is the number of processors needed to multiply two n*n matrices over an arbitrary ring in O(log n) time on a CREW PRAM. The authors show that linear context-free languages can be recognized in O(log/sup 2/n) time using o(M(n)) processors on an EREW PRAM. They give applications to other problems such as string shuffling, recognition of languages accepted by two-head nondeterministic finite automata, and transductions defined by two-tape nondeterministic finite transducers.< >

关键词： parallel algorithms Difference equations Phase change random access memory Application software Dynamic programming Pattern matching Pattern recognition Computer science Automata Transducers

来源：评论

学校读者我要写书评

暂无评论

An improved least squares solution technique for multi-processor architecture

An improved least squares solution technique for multi-proce...

引用

IEEE international symposium on Circuits and Systems (ISCAS)

作者： K.K. Dhar Institute for Communication Technology Zurich Switzerland

An approach is suggested to map the solution of the least-square (LS) problem, using Gram-Schmidt (GS) orthogonalization, on a distributed memory parallel processing (DMPP) architecture. Using algorithmic partitioning, the resulting lower-order problems are mapped concurrently on the architecture concerned so that the computational loads are more evenly balanced than when the conventional method is applied. This results in much higher multiprocessor efficiencies. Specific implementation advantages are seen to exist for the partitioning factors which are a power of 2. DMPP architectures are very useful for future implementation of high speed digital processing (DSP) applications because of the excellent potential they offer for being able to be implemented in the form of VLSIs. The solution of the problem concerned on the ring and torus topologies is discussed.< >

关键词： Least squares methods Computer architecture Signal processing algorithms Digital signal processing Topology Spectral analysis Iterative algorithms Geophysics computing Equations Communications technology

来源：评论

学校读者我要写书评

暂无评论

Supporting systolic and memory communication in iWarp

Supporting systolic and memory communication in iWarp

引用

Annual international symposium on Computer Architecture, ISCA

作者： S. Borkar R. Cohn G. Cox T. Gross H.T. Kung M. Lam M. Levine B. Moore W. Moore C. Peterson J. Susman J. Sutton J. Urbanski J. Webb School of Computer Science Carnegie Mellon University Pittsburgh PA USA Intel Corporation Hillsboro OR USA

The iWarp communication system supports two widely used interprocessor communication styles: memory communication and systolic communication. A description is given of the rationale, architecture, and implementation for the iWarp communication system. Memory communication is flexible and well suited for general computing, whereas systolic communication is efficient and well suited for speed-critical applications. The iWarp design is made possible by two important innovations in communication: (1) program access to communication and (2) logical channels. The former allows programs to access data as they are transmitted and to redirect portions of messages to different destinations efficiently. The latter increases the connectivity between the processors and guarantees communication bandwidth for classes of messages. These innovations have provided a focus for the iWarp architecture. The result is a communication system that provides a total bandwidth of 320 MBytes/sec and that is integrated on a single VLSI component with a 20 MFLOPS plus 20 MIPS long instruction work computation engine.< >

关键词： Computer architecture Message passing Technological innovation Bandwidth Computer aided instruction Engines parallel processing Concurrent computing distributed computing Wire

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共172页 << < 163 164 165 166 167 168 169 170 171 172 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：