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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Performance analysis of a dual striping strategy for replicated disk arrays

Performance analysis of a dual striping strategy for replica...

引用

international Conference on parallel and distributed Information systems

作者： A. Merchant P.S. Yu IBM Research Division USA C & C Research Laboratory Princeton NJ USA IBM Thomas J. Watson Research Center Yorktown Heights NY USA

Strategies for organizing the two copies of data in the context of database applications are compared. The effects of small and large stripe sizes on the performance of disk arrays with two active copies of data under a mixed workload of queries and transactions with a skewed access pattern are considered. A dual striping strategy which uses different stripe sizes for the two copies is proposed. An analytical performance model is devised for this scheme, and the results are shown to match well with simulation data. Comparison with uniform striping strategies shows that the dual striping scheme yields the most stable performance in a variety of workloads.< >

关键词： Performance analysis Transaction databases Availability Analytical models Delay Laboratories National electric code Memory Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Satisfying response time goals in transaction processing

Satisfying response time goals in transaction processing

引用

international Conference on parallel and distributed Information systems

作者： D. Ferguson L. Georgiadis C. Nikolaou K. Davies IBM Thomas J. Watson Research Center Yorktown Heights NY USA Department of Computer Science Institute of Computer Science University of Crete (FORTH) Crete Greece IBM United Kingdom Laboratories Limited Winchester Hampshire UK

Workload management algorithms for satisfying administration defined response time goals in transaction processing systems are presented. Each arriving transaction belongs to a predefined transaction class, and the system administrator defines an average response time goal for each transaction class. A dynamic transaction priority algorithm and a set of transaction routing algorithms for multiple processor transaction systems are given. These algorithms set priorities and route transactions based on the data objects accessed by the transactions, the current load of each system, and the goal satisfaction of the transaction classes. The algorithms have low overhead, and a detailed simulation study shows that they substantially improve goal satisfaction compared to previous work.< >

关键词： Delay Routing Heuristic algorithms Computer science Relational databases Business Computer aided manufacturing Operating systems Winches Laboratories

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Refinements in Bayesian distributed Detection

Asymptotic Refinements in Bayesian Distributed Detection

引用

IEEE international symposium on Information Theory

作者： A. Papamarcou Po-Ning Chen Electrical Engineering Department and Institute for Systems Research University of Maryland College Park MD USA

The performance of a parallel distributed detection system is investigated as the number of sensors tends to infinity. It is assumed that the i.i.d. sensor data are quantized locally into m-ary messages and transmitted to the fusion center for Bayesian binary hypothesis testing. Large deviations techniques are employed to show that the equivalence of absolutely optimal and best identical-quantizer systems is not limited to error exponents, but extends to the actual Bayes error probabilities up to a multiplicative constant. This is true as long as the two hypotheses are mutually absolutely continuous; no further assumptions, such as boundedness of second moments of the post-quantization log-likelihood ratio, are needed.

关键词： Bayesian methods Sensor fusion Sensor systems Testing Error probability Upper bound Educational institutions H infinity control Performance evaluation Performance loss

来源：评论

学校读者我要写书评

暂无评论

Real time simulation of stiff dynamic systems via distributed memory parallel processors

Real time simulation of stiff dynamic systems via distribute...

引用

IEEE Annual international symposium Virtual Reality

作者： M.C. Stanley J.E. Colgate Department of Mechanical Engineering Northwestern University Evanston IL USA

A class of dynamic systems consisting of constrained planar rigid bodies is considered. This class of environments poses two significant challenges to the development of advanced kinesthetic interfaces. First, the environment structure changes dynamically due to collisions between bodies. Thus, the equations of motion must be formulated and solved in real-time. second, the equations are necessarily stiff due to rigid constraints in the system. Thus, real-time simulation requires extremely high update rates to be stable and present the operator with a realistic "feel".< >

关键词： Real time systems Equations Springs Virtual environment Computational modeling Acceleration Object detection Libraries Numerical stability Mechanical engineering

来源：评论

学校读者我要写书评

暂无评论

proceedings. second international symposium on databases in parallel and distributed systems

引用

proceedings of the second international symposium on databases in parallel and distributed systems

The following topics are dealt with: parallel processing of database operations;parallel machines;parallel joins;parallel algorithms;distributed systems;and distributed query processing.

ISBN: (纸本)0818620528

The following topics are dealt with: parallel processing of database operations;parallel machines;parallel joins;parallel algorithms;distributed systems;and distributed query processing.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

New concurrency control algorithm for distributed databases

New concurrency control algorithm for distributed databases

引用

proceedings of the IMACS/IFAC international symposium on parallel and distributed Computing in Engineering systems

作者： Apostolopoulos, T. Vlahos, P.

来源：评论

学校读者我要写书评

暂无评论

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

Interplay between granularity, performance and availability ...

引用

proceedings of the 6th international parallel Processing symposium

作者： Kambhatla, Srikanth Walpole, Jonathan Intel Corp Hillsboro United States

ISBN: (纸本)0818626720

Replication is a common method for increasing the availability of data in a distributed environment. Our interest is in the application of replication techniques in the domain of parallel processing. This paper explores the issues concerning degree of replication and granularity in the context of a distributed and highly available Linda tuple space. In particular, we 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, for example). This is not an inherent requirement however. In this paper we 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.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Allocation of computations with dynamic structures on hypercube based distributed systems 1

Allocation of computations with dynamic structures on hyperc...

引用

1st international symposium on High-Performance distributed Computing, HPDC 1992

作者： Ahmad, Ishfaq Ghafoor, Arif Fox, Geoffrey C. Northeast Parallel Architectures Center Syracuse University SyracuseNY13244 United States School of Electrical Engineering Purdue University West LafayetteIN47907 United States

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 dividel 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 medianprocessors 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. © 1992 IEEE.

关键词： Hypercube networks

来源：评论

学校读者我要写书评

暂无评论

Register traffic analysis for streamlining inter-operation communication in fine-grain parallel processors

引用

proceedings of the 25th Annual international symposium on Microarchitecture

作者： Franklin, Mano Sohi, Gurindar S. Univ of Wisconsin-Madison Madison WI United States

ISBN: (纸本)0818631759

Traditionally, register files have been the primary agent for inter-operation communication in load/store architectures. As processors start issuing multiple instructions per cycle, a centralized register file can easily become a bottleneck. This paper analyzes the register file traffic in a load/store architecture with a view to motivate the development of alternate inter-operation communication mechanisms that reduce the bandwidth demanded of a centralized register file. We first provide metrics to characterize the register traffic. These metrics deal with the degree and locality of use of the register instances created. We then present the results of a simulation study that uses the MIPS R2000 architecture and the SPEC benchmark programs. We have two major results. First, a large number of the register instances are used only once, and the average degree of use of register instances is about 2. second, most of the register instances are used up soon after they are created (within about 30-40 instructions). This suggests that alternate inter-operation communication mechanisms that exploit the temporal locality of use of register instances are likely to be effective in reducing the traffic burden on the centralized register file. The second result was pivotal in the design of the distributed register file for the multiscalar processing paradigm.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

More efficient message-optimal algorithm for distributed termination detection

More efficient message-optimal algorithm for distributed ter...

引用

proceedings of the 6th international parallel Processing symposium

作者： Lai, Ten-Hwang Tseng, Yu-Chee Dong, Xuefeng Ohio State Univ Columbus United States

ISBN: (纸本)0818626720

Termination detection is a fundamental problem in distributed computing. Many algorithms have been proposed, but only the Chandrasekaran and Venkatesan (CV) algorithm is known to be optimal in worst-case message complexity. This optimal algorithm, however, has several undesirable properties. First, it always requires M′+2*|E|+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, |E| 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. The purpose of this paper is to remedy these drawbacks, while keeping its strength. We 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. The worst-case detection delay is O(n), as compared to the CV-algorithm's O(M′);and the space complexity is Θ(n) for each process, a compile-time known quantity. The algorithm works equally well for both FIFO and Non-FIFO channels.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：