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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

497 篇 会议
10 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

197 篇 工学
- 185 篇 计算机科学与技术...
- 96 篇 软件工程
- 37 篇 信息与通信工程
- 26 篇 电气工程
- 13 篇 控制科学与工程
- 10 篇 材料科学与工程（可...
- 9 篇 电子科学与技术（可...
- 4 篇 网络空间安全
- 3 篇 安全科学与工程
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 冶金工程
54 篇 理学
- 48 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 1 篇 地质学
34 篇 管理学
- 28 篇 管理科学与工程(可...
- 14 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
1 篇 军事学

主题

93 篇 computer science
79 篇 concurrent compu...
71 篇 distributed comp...
67 篇 application soft...
65 篇 database systems
62 篇 parallel process...
59 篇 databases
57 篇 distributed data...
43 篇 transaction data...
42 篇 delay
39 篇 computer archite...
37 篇 algorithm design...
36 篇 costs
36 篇 relational datab...
35 篇 hardware
30 篇 processor schedu...
30 篇 large-scale syst...
27 篇 computational mo...
27 篇 performance anal...
27 篇 computer network...

机构

7 篇 ibm thomas j. wa...
4 篇 department of co...
3 篇 ieee
3 篇 king saud univer...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 toyohashi univer...
2 篇 center for paral...
2 篇 department of co...
2 篇 school of comput...
2 篇 computer science...
2 篇 department of el...
2 篇 university of el...
2 篇 school of comput...
2 篇 department of bi...
2 篇 school of comput...
2 篇 eth zurich
2 篇 computer science...
2 篇 computer science...

作者

6 篇 a. choudhary
5 篇 j. saltz
4 篇 t. kurc
4 篇 a. boukerche
4 篇 a. el abbadi
3 篇 f. dehne
3 篇 p.s. yu
3 篇 wan maseri wan m...
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 jasni mohamad za...
3 篇 eyas el-qawasmeh
3 篇 d. agrawal
2 篇 a. burger
2 篇 a. rau-chaplin
2 篇 a. ghafoor
2 篇 s. bandyopadhyay
2 篇 hoefler torsten
2 篇 o. wolfson

语言

512 篇 英文
1 篇 其他

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

共 513 条记录，以下是441-450 订阅

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

详细简洁

排序：

An effective fault-tolerant technique for circular butterfly parallel systems

An effective fault-tolerant technique for circular butterfly...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Nian-Feng Tzeng Center for Adv. Comput. Studies Univ. of Southwestern Louisiana Lafayette LA USA

The butterfly parallel system has a regular and simple interconnection pattern, making it suitable for VLSI/WSI implementation. The authors propose an effective fault-tolerant technique for the circular butterfly parallel system to ensure its rigid full butterfly structure even in the presence of failures. A resulting butterfly system with L levels involves (1/log/sub 2/L)% spare PEs and roughly 50% additional links. Reconfiguration in response fault is easy and can be performed in a distributed manner. The analytic results show that the proposed design exhibits significantly improved reliability.< >

关键词： Fault tolerant systems Topology Very large scale integration Concurrent computing Process design Wafer scale integration Reliability Environmental economics parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Deterministic load balancing in computer networks

Deterministic load balancing in computer networks

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Xiaotie Deng Hai-Ning Liu Bing Xiao University of California San Diego USA School of Computing Science Simon Fraser University Burnaby BC Canada Department of Computer Sciences University of California San Diego La Jolla CA USA Department of Mathematics University of California San Diego La Jolla CA USA

ISBN: (纸本)0818620870

The paper presents theoretical analysis of the deterministic complexity of the load balancing problem (LBP). Because of difficulty of the general problem, research in the area mostly restricts itself to probabilistic or approximation algorithms, or to the average behavior of a network. The paper provides deterministic analysis of the problem for general networks. It focuses on the worst-case complexity analysis of the problem. It shows certain cases of the LBP to be NP-complete. The paper also discusses situations closely related to computer networks, where there is a global view of load distribution in the network; it provides a polynomial algorithm for solving the load balancing problem in this network.< >

关键词： Load management Intelligent networks Computer networks Decision making distributed computing Centralized control Polynomials Computer science distributed databases Network topology

来源：评论

学校读者我要写书评

暂无评论

distributed, dynamic, and efficient testing of large scale multiple processor systems

Distributed, dynamic, and efficient testing of large scale m...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： S.H. Hosseini N. Jamal Department of Electrical Engineering & Computer Sciences University of Wisconsin Milwaukee Milwaukee WI USA

The authors propose a distributed test algorithm for multiple processor systems where a central fault-free entity such as a host computer does not exist for any purpose such as control, fault-diagnosis, and system reconfiguration. The proposed algorithm is dynamic, i.e. testing assignments are not fixed ahead of time but rather are made as processors or interprocessor links fail. This dynamic property of the algorithm improves system performance by reducing the number of testers assigned to every processor while allowing the existence of multiple faulty processors and interprocessor communication links at every round of testing. Simulation results verify the effectiveness of the given approach.< >

关键词： System testing Large-scale systems Performance evaluation Tree graphs distributed computing Centralized control Control systems Heuristic algorithms System performance Fault diagnosis

来源：评论

学校读者我要写书评

暂无评论

An asymptotically 100% efficient parallel implementation of the nonsymmetric QR algorithm

An asymptotically 100% efficient parallel implementation of ...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D.G. Hudson R.A. van de Geijn Department of Computer Sciences University of Texas Austin Austin TX USA

The QR algorithm has proven to be the most successful sequential algorithm for finding all eigenvalues of a dense nonsymmetric matrix. Recently, several parallel implementations of the QR algorithm have been proposed. These implementations have all been based on the column-wrapped storage scheme. While column-wrapped storage has been used to obtain asymptotically 100% efficiency for many algorithms for solving linear systems, eigenvalue algorithms using such storage have achieved, at best, asymptotically constant efficiency. The authors present a parallel implementation of the QR algorithm that makes use of an alternate storage scheme that allows them to achieve asymptotically 100% efficiency. They also present a technique, which they call bundling, that further improves the observed efficiency of the parallel implementation.< >

关键词： Eigenvalues and eigenfunctions distributed computing parallel algorithms Jacobian matrices Arithmetic Concurrent computing Linear systems parallel architectures Timing Performance analysis

来源：评论

学校读者我要写书评

暂无评论

High-speed propagation of link status routing control information

High-speed propagation of link status routing control inform...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D.E. Comer R. Yavatkar Department of Computer Sciences Purdue University West Lafayette IN USA Department of Computer Sciences University of Kentucky Lexington KY USA

A link status routing algorithm required each node to know the current status of all the links in the network. Nodes use a link status update protocol that helps in keeping the database at each node up-to-date. The authors describe a link status update protocol designed for a highspeed network. The protocol uses the best-effort model of packet delivery, but is fault-tolerant. It uses an algorithm for fast propagation of link status updates that is optimized for the expected case when no update packets are lost, and no link or node failures occur. The protocol uses a separate mechanism to detect and recover from errors caused by loss of updates and failure of nodes or links.< >

关键词： databases Tellurium Computer science Error correction ARPANET Intelligent networks Fault tolerance Routing protocols Computer errors Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant distributed shared memory algorithms

Fault tolerant distributed shared memory algorithms

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M. Stumm Songnian Zhou University of Toronto Toronto Canada

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.< >

关键词： Fault tolerance Message passing Clustering algorithms Costs Performance analysis Algorithm design and analysis Fault tolerant systems Read-write memory Application software Workstations

来源：评论

学校读者我要写书评

暂无评论

parallel join processing using nonclustered indexes for a shared memory multiprocessor

Parallel join processing using nonclustered indexes for a sh...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： E. Omiecinski R. Shonkwiler College of Computing Georgia Institute of Technology Atlanta GA USA School of Mathematics Georgia Institute of Technology Atlanta GA USA

Examines the problem of efficient join processing on a shared memory multiprocessor, when the available access paths that are chosen (by the query optimizer) are nonclustered indexes on the joining attributes. Two algorithms based on simple heuristics and a third algorithm based on the Monte Carlo optimization technique called simulated annealing are given. Experiments are performed to compare the various algorithms with an algorithm that recently appeared in the literature.< >

关键词： parallel processing Buffer storage Educational institutions Concurrent computing Database systems Monte Carlo methods Simulated annealing Context Message passing Mathematics

来源：评论

学校读者我要写书评

暂无评论

parallel distributed robot navigation in the presence of obstacles

Parallel distributed robot navigation in the presence of obs...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： E. Prassler E. Milios Res. Inst. for Appl. Knowledge Processing Ulm Germany Department of Computer Sciences University of Toronto Toronto Canada

The authors present a parallel distributed processing approach to robot navigation and path planning in unknown terrains. The method is based on massively parallel computations in a grid of simple processing elements, called cells. In the course of a relaxation process a potential distribution is created in the grid with exhibits a monotonous slope from a start cell to a cell corresponding to the robot's destination position. A shortest path is determined by means of a gradient descent criterion which settles on the steepest descent in the potential distribution. Like high-level path planning algorithms the approach is capable of planning shortest paths through an arbitrary large-scale terrain on the basis of its current internal map. Unlike these algorithms, the approach is also high responsive to new obstacles encountered in the terrain. Obstacles immediately affect the ongoing relaxation process and cause distortions in the potential distribution which are free of local minima and lead the robot on safe detours around obstacles.< >

关键词： parallel robots Navigation Path planning Robot sensing systems Real time systems Control systems Computer science distributed processing Concurrent computing Grid computing

来源：评论

学校读者我要写书评

暂无评论

An approach to study performance properties of distributed simulation

An approach to study performance properties of distributed s...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D. Kumar S. Harous Department of Computer Engineering and Science Case Western Reserve University Cleveland OH USA

The authors present the results of an experimental performance study of distributed simulation of a particular queuing network using a minor variation of the NULL message based algorithm of Chandy and Misra. One major part of this study is to determine the effect of overhead on distributed simulation. The authors present a simple and novel approach to study the relationship between amount of overhead and performance. They define and measure certain refined notions of 'ideal speed up ratio'-these ratios are more refined (as opposed to just the number of processors) in the sense that they capture the potentially achievable speed ups of distributed simulation more closely.< >

关键词： Computational modeling Delay Computer simulation Concurrent computing Clocks Computer networks distributed computing Velocity measurement Uninterruptible power systems Communication system control

来源：评论

学校读者我要写书评

暂无评论

Analysis of parallel algorithms using continuous job profiles

Analysis of parallel algorithms using continuous job profile...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： M.L. Weems N. Ullah M.J. Gonzalez Computer Engineering Research Center Department of Electrical and Computer Engineering University of Texas Austin Austin TX USA

The increased use of parallelism in computer systems has created the need for models which can be used to evaluate the performance of jobs executing on multiple processor systems. The paper proposes a geometric model, referred to as the continuous job profile, which reflects the allocation of resources needed to process a job. Continuous job profiles are geometric models of a job which can be used to determine how a job's structure limits its potential speedup when executed on a multiple processor system. Job classes are analyzed and shown to provide additional information which is specific to certain classes of problems.< >

关键词： Algorithm design and analysis parallel algorithms parallel processing Concurrent computing Power engineering computing Resource management Solid modeling Computer architecture Shape Information analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 41 42 43 44 45 46 47 48 49 50 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：