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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,668 篇 会议
194 篇 期刊文献
25 册 图书

馆藏范围

4,887 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,499 篇 工学
- 2,385 篇 计算机科学与技术...
- 1,470 篇 软件工程
- 419 篇 信息与通信工程
- 385 篇 电气工程
- 193 篇 控制科学与工程
- 159 篇 电子科学与技术（可...
- 75 篇 网络空间安全
- 33 篇 材料科学与工程（可...
- 33 篇 生物医学工程（可授...
- 26 篇 机械工程
- 26 篇 安全科学与工程
- 21 篇 光学工程
- 21 篇 动力工程及工程热...
- 21 篇 生物工程
- 20 篇 建筑学
- 19 篇 土木工程
- 17 篇 力学（可授工学、理...
- 17 篇 环境科学与工程（可...
- 15 篇 交通运输工程
792 篇 理学
- 669 篇 数学
- 103 篇 统计学（可授理学、...
- 89 篇 系统科学
- 66 篇 物理学
- 29 篇 生物学
- 19 篇 化学
451 篇 管理学
- 322 篇 管理科学与工程(可...
- 229 篇 工商管理
- 153 篇 图书情报与档案管...
51 篇 经济学
- 51 篇 应用经济学
18 篇 法学
- 17 篇 社会学
15 篇 医学
9 篇 教育学
9 篇 农学
5 篇 文学
4 篇 军事学

主题

564 篇 distributed comp...
540 篇 computer science
490 篇 parallel process...
485 篇 concurrent compu...
410 篇 parallel process...
379 篇 application soft...
342 篇 distributed data...
335 篇 distributed comp...
310 篇 databases
288 篇 computer archite...
249 篇 database systems
222 篇 computational mo...
220 篇 delay
215 篇 hardware
211 篇 costs
188 篇 processor schedu...
172 篇 protocols
170 篇 computer network...
162 篇 large-scale syst...
152 篇 parallel program...

机构

20 篇 ibm thomas j. wa...
11 篇 department of co...
10 篇 department of co...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
7 篇 ieee
7 篇 department of co...
7 篇 department of ee...
7 篇 department of co...
7 篇 college of compu...
7 篇 hewlett packard ...
7 篇 northwestern uni...
6 篇 department of co...
6 篇 syracuse univ sy...
6 篇 department of co...
6 篇 department of co...
6 篇 lawrence berkele...
6 篇 college of compu...
6 篇 univ of californ...

作者

20 篇 a. choudhary
16 篇 a. boukerche
10 篇 s.k. das
10 篇 boukerche azzedi...
10 篇 choudhary a
10 篇 li keqin
9 篇 j. saltz
9 篇 sun xian-he
9 篇 choudhary alok
9 篇 k. schwan
9 篇 das sajal k.
8 篇 l.r. welch
8 篇 a. makinouchi
8 篇 chen haibo
8 篇 anon
8 篇 a.a. chien
7 篇 c. katsinis
7 篇 t. kurc
7 篇 d.k. panda
7 篇 keqin li

语言

4,874 篇 英文
11 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings International Symposium on Databases in Parallel and Distributed Systems"

共 4887 条记录，以下是4631-4640 订阅

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

详细简洁

排序：

Combining rule decomposition and data partitioning in parallel datalog program processing

Combining rule decomposition and data partitioning in parall...

引用

international Conference on parallel and distributed Information systems

作者： J. Shao D.A. Bell M.E.C. Hull Computing Science Department University of Ulster Antrim UK

There are two approaches to processing Datalog programs in parallel. One is to decompose the rules of a program into concurrent modules, and then assign them to processors. The other is to partition data between processors, so that each processor evaluates the same program, but with less data. The authors propose a third approach which combines the two methods in a single framework. In this approach, rules are decomposed into segments and data is partitioned among the segments. There are a number of advantages of this approach. Most importantly, it provides good focus on processing the tuples that are relevant to queries, and allows data to be partitioned and balanced dynamically at different levels. An analytic performance study is also presented to illustrate the usefulness of the proposed approach.< >

关键词： parallel processing Polynomials databases Logic programming

来源：评论

学校读者我要写书评

暂无评论

Compiling control into database queries for parallel execution management

Compiling control into database queries for parallel executi...

引用

international Conference on parallel and distributed Information systems

作者： P. Borla-Salamet C. Chachaty B. Dageville Bull Research Center Les Clayes-sous-Bois France

parallel execution of database queries in a shared nothing multiprocessor environment, needs control mechanisms which guarantee a correct global execution of each query. In the authors system, the control is integrated into the query code at compile time. According to the required schedule for the query, the compilation process combines a set of basic control operations into a control graph mapped on the query graph. This control which allows pipelining between data operations, achieves the dataflow control and enforces the schedule of program. Using fine grain control operations combined into control schemas makes the control flexible, as new strategies could be easily supported. In their prototype the parallel LERA language is used.< >

关键词： Control systems Pipeline processing Relational databases Process control parallel processing Database systems parallel algorithms Scheduling algorithm Processor scheduling High performance computing

来源：评论

学校读者我要写书评

暂无评论

Choosing the interconnect of distributed memory systems by cost and blocking behavior

Choosing the interconnect of distributed memory systems by c...

引用

international symposium on parallel Processing

作者： W.K. Giloi S. Montenegro GMD Research Center for Innovative Computer Systems and Technology Berlin Germany

The paper presents the results of a statistical analysis by which the blocking behavior is investigated of interconnection structures that are major candidates for large distributed memory systems. The analysis answers important questions such as: how many logical connections can exist simultaneously, when will the network saturate, how well are the physical links utilized, and what is the cost of realization of the network. The network topologies considered are the simple 2D-mesh, the hypercube, and an innovative interconnection structure called TICNET. It is shown that the TICNET, which can be realized as a hierarchy of crossbars, is similar in behavior to the hypercube but much more cost-effective. Compared to the 2D-mesh, the TICNET has a much better blocking behavior and is still more cost-effective. The simulation results guide the designer of distributed memory architectures in selecting the most suitable interconnection network.< >

关键词： Costs Memory architecture Bandwidth Delay Hypercubes Operating systems distributed computing Computer architecture Protocols Paper technology

来源：评论

学校读者我要写书评

暂无评论

A divide-and-conquer method of solving tridiagonal systems on hypercube massively parallel computers

A divide-and-conquer method of solving tridiagonal systems o...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Xiaojing Wang Z.G. Mou Computer Science Department Brandeis University Waltham MA USA

The authors present a new parallel algorithm, based on the divide-and-conquer (DC) strategy, for solving tridiagonal systems. Through a comparative study between their DC method and other well known tridiagonal solvers: cyclic odd-even reduction (CR), recursive doubling (RD), and the partition method, they show that for the binary hypercube architecture, the communication complexity of their DC method is the lowest among all, and therefore the most efficient tridiagonal solver for communication-expensive massively parallel hypercube computers.< >

关键词： Hypercubes Concurrent computing Chromium Costs Computer science parallel algorithms Computer architecture Heart Differential equations Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

An efficient protocol for ordering broadcast messages in distributed systems

An efficient protocol for ordering broadcast messages in dis...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A. Acharya B.R. Badrinath Department of Computer Science Rutgers University New Brunswick NJ USA

Presents an efficient protocol to totally order the delivery of broadcast messages in a distributed system with N sites. The protocol exploits a symmetric communication scheme based on finite projective planes and requires N+2 square root N messages to create a total order to broadcast messages, that is consistent across all sites.< >

关键词： Broadcasting Multicast protocols Delay Intersymbol interference Computer science Concurrent computing Failure analysis Context

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms for load balancing in circuit-switched hypercubes

Improved algorithms for load balancing in circuit-switched h...

引用

international symposium on parallel Processing

作者： C.S. Raghavendra S. Chalasani R.V. Boppana Department of EE-Systems University of Southern California Los Angeles CA USA

The authors present efficient parallel algorithms for balancing load in circuit-switched hypercubes, which use the e-cube algorithm to route messages between the processing elements. Performance of the hypercube system can be significantly improved by transferring load, at regular intervals of time, from the overloaded processors to the underloaded processors. A centralized algorithm, based on a minimum-cost network flow model, for balancing load in the hypercube systems was developed by Bokhari. This algorithm requires O(N/sup 2/n/sup 2/) time to balance load in an n-cube with N=2/sup n/ processing elements. The authors develop efficient network models-network models in which every arc has unit capacity-to solve the load balancing problem. They also present distributed algorithms for balancing load in the hypercube systems. They show that the distributed algorithms perform better than the centralized algorithms in most practical situations.< >

关键词： Load management Circuits Hypercubes Routing Load modeling distributed algorithms Multiprocessing systems Degradation Delay Costs

来源：评论

学校读者我要写书评

暂无评论

A high performance barrier synchronizer and its novel applications in highly parallel systems

A high performance barrier synchronizer and its novel applic...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： K. Ghose D.-C. Cheng Department of Computer Science State University of New York Binghamton NY

Conventional approaches for implementing barrier synchronization in large scale systems result in long synchronization times due to memory and network contention. The authors present some applications of a very simple barrier hardware that allows barrier synchronizations to be performed within a few processor cycles. The low latency of this barrier synchronizer and its ability to allow dynamic participation permits several rather unconventional applications like low-latency software combining, scans and determination of extremum values in constant time. This paper presents these applications.< >

关键词： Application software Logic Intelligent networks Hardware Computer science Large-scale systems Delay Zinc Pulse generation Signal generators

来源：评论

学校读者我要写书评

暂无评论

parallelizing datalog: function symbols make a difference

Parallelizing datalog: function symbols make a difference

引用

international Conference on parallel and distributed Information systems

作者： J. Seib Faculty of Mathematics and Computer Science University of Mannheim Mannheim Germany

A Datalog program consists of function-free Horn clause rules. There are, however, some situations described more easily and more naturally by the use of general terms as arguments. A term is built up from variables, constants, and function symbols. A set of rules where the rules may contain function symbols is called a Datalog/sup Fun/ program. The paper discusses parallel processing of decomposable Datalog/sup Fun/ programs to overcome the performance problem. A decomposable program can be evaluated in parallel such that neither a communication nor a synchronization of the processors has to be established. The author and G. Lausen (1991) proposed the concept of generalized pivoting as a sufficient condition for decomposability of arbitrary but function-free Datalog programs. The current paper extends the concept of generalized pivoting to programs which may contain function symbols.< >

关键词： parallel processing Mathematics Computer science Electronic mail Logic Object oriented databases Polynomials Concurrent computing Sufficient conditions

来源：评论

学校读者我要写书评

暂无评论

Bounds on performance of VLSI processor arrays

Bounds on performance of VLSI processor arrays

引用

international symposium on parallel Processing

作者： A. Nayak N. Santoro Center for Parallel & Distributed Computing School of Computer Science Carleton University Ottawa ONT Canada

This paper discusses the effect of processor failures on computation performed on two-dimensional VLSI processor arrays. Previously established properties of catastrophic fault patterns are used to study inherent limits to reconfigurability of these regular architectures. Bounds on number of faults the system can tolerate to provide guaranteed performance are derived. These results are the generalization of the results obtained in the case of one-dimensional processor arrays.< >

关键词： Very large scale integration Circuit faults Systolic arrays distributed computing Computer architecture Fault tolerant systems Fault tolerance Fault detection Joining processes Computer science

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for information dissemination by packets

Parallel algorithms for information dissemination by packets

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A. Bagchi E.F. Schmeichel S.L. Hakimi Bell Communications Research Inc. Department of Mathematics and Computer Science San Jose State University Department of Electrical Engineering and Computer Science University of California Davis USA

Each vertex of an undirected graph possesses a piece of information which must be sent to every other vertex. The method of communication is to send bounded size packets of messages from one vertex to another. We describe parallel algorithms to accomplish the desired tasks for five prominent architectures. The algorithms are optimal, or nearly so, in every case.< >

关键词： parallel algorithms Broadcasting distributed computing Communication system control Time measurement Finishing Mathematics Computer science Computer architecture Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 460 461 462 463 464 465 466 467 468 469 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：