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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

distributed multi-level recovery in main-memory databases

Distributed multi-level recovery in main-memory databases

引用

4th international Conference on parallel and distributed Information systems

作者： Rastogi, R Bohannon, P Parker, J Silberschatz, A Seshadri, S Sudarshan, S AT&T Bell Labs Murray Hill NJ 07974 USA Indian Inst Technol Bombay 400076 Maharashtra India

ISBN: (纸本)081867475X

In this paper we present recovery techniques for distributed main-memory databases, specifically for client-server and shared-disk architectures. We present a recovery scheme for client-server architectures which is based on shipping log records to the server, and two recovery schemes for shared-disk architectures-one based on page shipping, and the other based on broadcasting of the log of updates. The schemes offer different tradeoffs, based on factors such as update rates. Our techniques are extensions to a distributed-memory setting of a centralized recovery scheme for main-memory databases, which has been implemented in the Dali main-memory database system. Our centralized as well as distributed-memory recovery schemes have several attractive features-they support an explicit multi-level recovery abstraction for high concurrency, reduce disk I/O by writing only redo log records to disk during normal processing, and use per-transaction redo and undo logs to reduce contention on the system log. Further, the techniques use a fuzzy checkpointing scheme that writes only dirty pages to disk, yet minimally interferes with normal processing-all but one of our recovery schemes do not require updaters to even acquire a latch before updating a page. Our log shipping/broadcasting schemes also support concurrent updates to the same page at different sites.

关键词： distributed systems transactions logging locking concurrency control recovery

来源：评论

学校读者我要写书评

暂无评论

Optimal Node Selection for Data Regeneration in Heterogeneous distributed Storage systems 44

Optimal Node Selection for Data Regeneration in Heterogeneou...

引用

44th Annual international Conference on parallel Processing Workshops (ICPPW)

作者： Gong, Qingyuan Wang, Jiaqi Wei, Dongsheng Wang, Jin Wang, Xin Fudan Univ Sch Comp Sci Shanghai Peoples R China Soochow Univ Dept Comp Sci & Technol Suzhou Peoples R China

ISBN: (纸本)9781467375887

distributed storage systems introduce redundancy to protect data from node failures. After a storage node fails, the lost data should be regenerated at a replacement storage node as soon as possible to maintain the same level of redundancy. Minimizing such a regeneration time is critical to the reliability of distributed storage systems. Existing work commits to reduce the regeneration time by either minimizing the regenerating traffic, or adjusting the regenerating traffic patterns, whereas nodes participating the regeneration are generally assumed to be given beforehand. However, real-world distributed storage systems usually exhibit heterogeneous link capacities, and the regeneration time is highly related to the selection of the participating nodes. In this paper, we consider the minimization of the regeneration time by selecting the participating nodes in heterogeneous networks. We propose optimal node selection algorithms respectively for two cases: 1) the newcomer is not given;2) both the newcomer and the providers are not given. Analysis shows that the optimal regeneration time can be achieved in each case. We then consider the effect of flexible amount of data blocks from each provider on the regeneration time, and apply this observation to enhance our schemes. Experiment results show that our node selection schemes can significantly reduce the regeneration time, especially in practical networks with heterogeneous link capacities, compared with the scheme based on random node selection.

关键词： Bandwidth distributed databases Maintenance engineering Network topology Redundancy Servers Topology Data Regeneration distributed Storage System Node Selection Cache Memory System redundancy distributed databases Maintenance engineering Network topology Servers Regeneration Line of nodes Bandwidth topology

来源：评论

学校读者我要写书评

暂无评论

TurboBLAST®: A parallel implementation of blast built on the turbohub 16

TurboBLAST®: A parallel implementation of blast built on th...

引用

16th international parallel and distributed Processing symposium, IPDPS 2002

作者： Bjornson, R.D. Sherman, A.H. Weston, S.B. Willard, N. Wing, J. TurboGenomics Inc. United States

ISBN: (纸本)0769515738

BLAST (Basic Local Alignment Search Tool) is by far the most widely used application for rapid screening of large sequence databases. This paper describes TurboBLAST, a parallel implementation of BLAST suitable for execution on networked clusters of heterogeneous PCs, workstations, or Macintosh computers. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

distributed processor allocation in large PC clusters 9

Distributed processor allocation in large PC clusters

引用

9th IEEE international symposium on High Performance distributed Computing

作者： De Rose, CAF Heiss, HU Navaux, PAO Univ Fed Rio Grande Sul Dept Comp Sci Porto Alegre RS Brazil

ISBN: (纸本)0769507840

Current processor allocation techniques for highly parallel systems are based on centralized front-end based algorithms. As a result, the applied strategies are restricted to static allocation, low parallelism and weak fault tolerance. To lift these restrictions we are investigating a distributed approach to the processor allocation problem in large distributed memory machines. A contiguous and a noncontiguous version of a distributed dynamic processor allocation strategy are proposed and studied in this paper Simulations compare the performance of the proposed strategies with that of well-known centralized algorithms. We also present the results of experiments on a Simens hpcLine Primergy Sewer with 96 nodes that show distributed allocation is feasible with current technologies.

关键词： Computer science Data structures Fault tolerance Hypercubes parallel machines parallel processing Partitioning algorithms Resource management Shape Throughput

来源：评论

学校读者我要写书评

暂无评论

TOP-C: A task-oriented parallel C interface

TOP-C: A task-oriented parallel C interface

引用

5th IEEE international symposium on High Performance distributed Computing

作者： Cooperman, G NORTHEASTERN UNIV COLL COMP SCIBOSTONMA 02115

ISBN: (纸本)0818675829

TOP-C is a task-oriented parallel C interface. It presents a master-slave task architecture that greatly eases the parallelization of code. It is intended for applications where a compiler would have difficulty recognizing opportunities for data-parallelism. The model has been implemented for both shared memory processors and networks of workstations. There is also a sequential version useful during development, which runs the same application code. Ease-of-use has been a strong motivation behind its design. For this reason, TOP-C is organized in a SPMD style, with one primary subroutine call to invoke it. Its main features are: (a) task-parallelism, (b) a single shared, global data structure, and (c) restricted master-slave communication.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

An Improved parallel Algorithm for Computing Approximate Inverses by Reducing Synchronizations

An Improved Parallel Algorithm for Computing Approximate Inv...

引用

7th international symposium on parallel and distributed Computing

作者： Gravvanis, George A. Giannoutalcis, Konstantinos M. Democritus Univ Thrace Dept Elect & Comp Engn GR-67100 Xanthi Greece

ISBN: (纸本)9780769534725

A new parallel algorithm, based on the concept of antidiagonal wave pattern, for computing approximate inverses, is introduced for symmetric multiprocessor systems. The parallel normalized approximate inverses are used in conjunction with parallel normalized preconditioned conjugate gradient-type schemes, for the efficient solution of sparse finite element linear systems. The parallel implementation issues of the new algorithm are discussed and the parallel performance is presented, using OpenMP.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploratory Visualization of distributed computations: A case study

Exploratory Visualization of distributed computations: A cas...

引用

5th international symposium on Software Engineering for parallel and distributed systems (PDSE 2000)

作者： Gupta, N Kraemer, E Hart, D Chinwala, M Miller, D Univ Georgia Dept Comp Sci Athens GA 30606 USA

ISBN: (纸本)0769506348

Exploratory Visualization is an approach for helping users learn about distributed computations without requiring users to examine source code. Instead visualizations provide intuition about the program's behavior and serve as an interface through which the programs are controlled. We have developed an exploratory visualization system with the goals of providing an intuitive and user-friendly user interface and developing an infrastructure that minimizes perturbation. We present a case-study to describe how a naive user can interact with the system to learn about and experiment with the running computation.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A Consensus-Based Approach to the distributed Learning

A Consensus-Based Approach to the Distributed Learning

引用

IEEE international Conference on systems, Man and Cybernetics (SMC)

作者： Czarnowski, Ireneusz Jedrzejowicz, Piotr Gdynia Maritime Univ Dept Informat Syst PL-81225 Gdynia Poland Gdynia Maritime Univ Chair Informat Syst PL-81225 Gdynia Poland

ISBN: (纸本)9781457706530

The paper deals with the distributed learning. distributed learning from data is considered to be an important challenge faced by researchers and practice in the domain of the distributed data mining and distributed knowledge discovery from databases. An effective approach to learning from a geographically distributed data is to select, from the local databases, relevant local patterns, called also prototypes. Such a selection can be based on results of the data reduction process. The paper proposes to carry-out prototype selection at local sites in parallel, independently at each site, employing specialized software agents. To assure obtaining homogenous prototypes at a global level the consensus-based method is proposed and applied. The paper includes a detailed description of the proposed approach and a discussion of the computational experiment results.

关键词： distributed data mining data reduction consensus method

来源：评论

学校读者我要写书评

暂无评论

Using coalitions and services for implementing sharing in a large network of databases

Using coalitions and services for implementing sharing in a ...

引用

proceedings of the 2nd international symposium on Autonomous Decentralized systems

作者： Bouguettaya, Athman Queensland Univ of Technology Brisbane

The establishment of one logical database that spans countries and continents is increasingly becoming a realistic goal to achieve. This conceptual database would potentially consist of an ever growing number of component databases. In this paper, we propose a scheme to build a Worldwide Database using a two-level approach. In particular, we describe how conglomerations (small and large) of databases are formed, modified, and evolved.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

A Performance Study of Epoch-based Commit Protocols in distributed OLTP databases 41

A Performance Study of Epoch-based Commit Protocols in Distr...

引用

41st international symposium on Reliable distributed systems (SRDS)

作者： Waudby, Jack Ezhilchelvan, Paul Mitrani, Isi Webber, Jim Newcastle Univ Newcastle Upon Tyne Tyne & Wear England Neo4j San Mateo CA USA

ISBN: (纸本)9781665497534

distributed OLTP systems execute the high-overhead, two-phase commit (2PC) protocol at the end of every distributed transaction. Epoch-based commit proposes that 2PC be executed only once for all transactions processed within a time interval called an epoch. Increasing epoch duration allows more transactions to be processed before the common 2PC. It thus reduces 2PC overhead per transaction, increases throughput but also increases average transaction latency. Therefore, required is the ability to choose the right epoch size that offers the desired trade-off between throughput and latency. To this end, we develop two analytical models to estimate throughput and average latency in terms of epoch size taking into account load and failure conditions. Simulations affirm their accuracy and effectiveness. We then present epoch-based multi-commit which, unlike epoch-based commit, seeks to avoid all transactions being aborted when failures occur, and also performs identically when failures do not occur. Our performance study identifies workload factors that make it more effective in preventing transaction aborts and concludes that the analytical models can be equally useful in predicting its performance as well.

关键词： distributed databases Transactions Two-Phase Commit Epochs Analytical solutions Simulations Performance Evaluation Throughput Latency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：