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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是401-410 订阅

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

详细简洁

排序：

The interplay between granularity, performance and availability in a replicated Linda tuple space

The interplay between granularity, performance and availabil...

引用

international symposium on parallel Processing

作者： S. Kambhatla J. Walpole Intel Corporation Hillsboro OR USA Oregon Graduate Institute Beaverton OR USA

Replication is a common method for increasing the availability of data in a distributed environment. The authors' interest is in the application of replication techniques in the domain of parallel processing. They explore the issues concerning degree of replication and granularity in the context of a distributed and highly available Linda tuple space. In particular, they study the performance effects of varying the number of replicas and the granularities of replication and concurrency control. Traditionally, when using replication in databases, the granularity of replication and that of concurrency control have been the same (at the file level (D.K. Gifford, 1979), for example). This is not an inherent requirement however. The authors show by detailed simulation of a replicated Linda tuple space that it is useful to separate the two granularities and that it is an important design issue especially in parallel processing systems.< >

关键词： Availability Concurrency control parallel processing Costs Voting databases Context modeling

来源：评论

学校读者我要写书评

暂无评论

Optimal allocation of shared data over distributed memory hierarchies

Optimal allocation of shared data over distributed memory hi...

引用

international symposium on parallel Processing

作者： E. Haddad Computer Science Department Virginia Polytechnic Institute and State University

Nonreplicated shared data of distributed applications is optimally allocated to pre-specified multilevel memory partitions at the sites of a heterogeneous multicomputer network to minimize a weighted combination of systemwide mean time delay performance and mean communication cost per access request. Greedy and fast optimization algorithms are presented for nonqueueing lightly-loaded as well as heavily-loaded multiqueue system models with channel, l/O, and memory hierarchy queues. Extensions to data exhibiting nonuniform access demand rates and distinct query and update statistics are presented.< >

关键词： Cost function Financial advantage program Delay effects Production Computer science Application software Partitioning algorithms Statistical distributions distributed information systems distributed databases

来源：评论

学校读者我要写书评

暂无评论

Complete and efficient methods for supporting side-effects and cuts in And-Or parallel Prolog

Complete and efficient methods for supporting side-effects a...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： G. Gupta V.S. Costa Department of Computer Science New Mexico State University Las Cruces MN USA Department of Computer Science University of Bristol Bristol UK

Practical Prolog programs usually contain extralogical features like cuts, side-effects, and database manipulating predicates. It is noted that, in order to exploit implicit parallelism from real applications, a parallel logic programming system should necessarily support these features. How Prolog's extralogical features can be supported in an And-Or parallel logic programming system is discussed. It is shown that to support extralogical features an And-Or parallel logic programming system should recompute the solutions to independent goals instead of sharing them. An abstraction called the composition tree for representing And-Or parallel execution with recomputation is described. The notion of 'local-leftmostness' in the composition tree is introduced and used for deriving complete and efficient methods for supporting extralogical predicates in And-Or parallel logic programming systems based on the composition tree abstraction.< >

关键词： Logic programming parallel processing Computer science Programming profession Spatial databases Application software Reactive power Runtime

来源：评论

学校读者我要写书评

暂无评论

The Dharma scheduler-definitive scheduling in Aurora on multiprocessors architecture

The Dharma scheduler-definitive scheduling in Aurora on mult...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： R.Y. Sindaha Department of Computer Science University of Bristol Bristol UK

In any Or-parallel system which implements the full Prolog language, such as Aurora, there is the problem of processing time being wasted in regions of the search tree which are later pruned away. The author proposes the Dharma scheduler, which introduces a new concept in scheduling for Aurora. Rather than performing scheduling based on the nodes in the search tree, the Dharma scheduler uses the branches of the tree. The author believes that scheduling at this higher level of abstraction has a number of advantages and will make it possible to tackle the problem of wasted speculative work. Early performance results suggest that the Dharma scheduler is faster than any other existing scheduler for Aurora in applications where only the first solution is required. The author presents the design of the Dharma scheduler and performance results.< >

关键词： Processor scheduling Computer architecture Embryo Engines Computer science Computer languages Natural languages Expert systems Program processors Deductive databases

来源：评论

学校读者我要写书评

暂无评论

A decomposition algorithm for distributed hash join query processing

A decomposition algorithm for distributed hash join query pr...

引用

international Workshop on Research Issues in Data Engineering

作者： S. Spetka SUNY Institute of Technology Utica Rome Italy

Database systems are increasing in importance as stage repositories for applications like CAD and AI. These applications demand efficient support for queries that are more complex than the common business queries that are supported well by most systems. More queries are also of an ad-hoc nature, limiting the utility of precompilation approaches. The need for fast response to make AI and CAD applications feasible also has further motivated research into techniques for exploiting resources in a distributed system for improved performance. This paper explores query decomposition techniques for complex query processing in distributed database systems and exposes the deficiencies associated with current algorithms.< >

关键词： Query processing Database systems Pipeline processing Artificial intelligence Algorithm design and analysis distributed databases parallel processing Computer networks Concurrent computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

Allocation of computations with dynamic structures on hypercube based distributed systems

Allocation of computations with dynamic structures on hyperc...

引用

international symposium on High Performance distributed Computing

作者： I. Ahmed A. Ghafoor G.C. Fox Northeast Parallel Architect. Center Syracuse Univ. NY USA School of Electrical Engineering Purdue University West Lafayette IN USA Northeast Parallel Architectures Cente Syracuse University Syracuse NY USA

A dual-level dynamic load distribution strategy is proposed for allocating parallel computations with unpredictable structures to hypercube based distributed systems. Computations with dynamic structures represent a wide range of recursive and divide/conquer algorithms. The allocation strategy supports dynamic partitioning of these computations into communicating sub-tasks. Using the topological characteristics of hypercube networks, the system is divided into multiple regions of processors. The first level allocation is done by the central computer that spreads out the initial computations into these regions to reduce processor contention. The second level allocation is done by the median processors of these regions which enable the processors of their regions to optimally balance the dynamically created load and to communicate with each other with reduced overhead. The results of a simulation study are presented illustrating numerous examples that exhibit the performance of the proposed strategy under different loading conditions, varying degrees of depth and parallelism in the task graphs. The proposed allocation strategy is shown to outperform distributed load distribution.< >

关键词： distributed computing Hypercubes Load management Processor scheduling Concurrent computing Computational modeling parallel architectures Distribution strategy Computer architecture distributed processing

来源：评论

学校读者我要写书评

暂无评论

A more efficient message-optimal algorithm for distributed termination detection

A more efficient message-optimal algorithm for distributed t...

引用

international symposium on parallel Processing

作者： T.-H. Lai Y.-C. Tseng X. Dong Department of Computer and Information Science Ohio State Uinversity Columbus OH USA

Termination detection is a fundamental problem in distributed computing. Many algorithms have been proposed, but only the S. Chandrasekaran and S. Venkatesan (CV) algorithm (1990) is known to be optimal in worst-case message complexity. This optimal algorithm, however, has several undesirable properties. First, it always requires M'+2* mod E mod +n-1 control messages, whether it is worst case or best case, where M' is the number of basic messages issued by the underlying computation after the algorithm starts, mod E mod is the number of channels in the system, and n is the number of processes. second, its worst-case detection delay is O(M'). In a message-intensive computation, that might not be tolerable. Third, the maximum amount of space needed by each process is O(M'), a quantity not known at compile time, making it necessary to use the more expensive dynamic memory allocation. Last, it works only for FIFO channels. This paper remedies these drawbacks, while keeping its strength. The authors propose an algorithm that requires M'+2(n-1) control messages in the worst case, but much fewer on the average, and in the best case, it uses only 2(n-1) control messages, no matter how large M' is.< >

关键词： IEL Delay Control systems Detection algorithms Information science Switches Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Limits of Control Flow on parallelism

Limits of Control Flow on Parallelism

引用

Annual international symposium on Computer Architecture, ISCA

作者： M.S. Lam R.P. Wilson Computer Systems Laboratory University of Stanford CA USA

This paper discusses three techniques useful in relaxing the constraints imposed by control flow on parallelism: control dependence analysis, executing multiple flows of control simultaneously, and speculative execution. We evaluate these techniques by using trace simulations to find the limits of parallelism for machines that employ different combinations of these techniques. We have three major results. First, local regions of code have limited parallelism, and control dependence analysis is useful in extracting global parallelism from different parts of a program. second, a superscalar processor is fundamentally limited because it cannot execute independent regions of code concurrently. Higher performance can be obtained with machines, such as multiprocessors and dataflow machines, that can simultaneously follow multiple flows of control. Finally, without speculative execution to allow instructions to execute be- fore their control dependences are resolved, only modest amounts of parallelism can be obtained for programs with complex control flow.

关键词： parallel processing Permission Upper bound Concurrent computing Laboratories Computational modeling distributed computing Machinery Hardware Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast parallel algorithms for solving triangular systems of linear equations on the hypercube 5

Fast parallel algorithms for solving triangular systems of l...

引用

5th international parallel Processing symposium, IPPS 1991

作者： Ibarra, Oscar H. Kim, Myung Hee Department of Computer Science University of California Santa BarbaraCA93106 United States

ISBN: (纸本)0818691670

This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the second stage of Gauss elimination. Thus, the triangular matrix is distributed by columns (or rows) in a wrap fashion since it is likely that the matrix is distributed this way after an LU decomposition has been done on the matrix. However, the efficiency of the algorithms is low. Our motivation is to develop various data partitioning and mapping schemes for hypercube algorithms by treating the triangular solver as an independent problem. Performance of the algorithms are analyzed theoretically and empirically by implementing diem on a commercially available hypercube. © 1991 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive protocols for managing replicated distributed databases

Adaptive protocols for managing replicated distributed datab...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A. El Abbadi Department of Computer Science University of California Santa Barbara CA USA

The author proposes a family of adaptive protocols for managing replicated databases. Adaptive protocols use information about the system configuration to determine how operations are executed. Special system transactions are executed to maintain this information in view objects. The author proposes using static as well as dynamic methods to execute both system and user transactions. This results in a modular methodology for designing four different protocols. Two of these protocols are new and present the system designer with several alternatives when compared with the previously known protocols.< >

关键词： distributed databases Access protocols Costs Database systems Transaction databases Fault tolerant systems Concurrency control Control systems Computer science Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：