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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

9,285 篇 会议
362 篇 期刊文献
33 册 图书
1 篇 学位论文

馆藏范围

9,681 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,567 篇 工学
- 4,178 篇 计算机科学与技术...
- 2,157 篇 软件工程
- 847 篇 电气工程
- 629 篇 信息与通信工程
- 313 篇 控制科学与工程
- 226 篇 电子科学与技术（可...
- 83 篇 网络空间安全
- 65 篇 机械工程
- 56 篇 石油与天然气工程
- 55 篇 材料科学与工程（可...
- 52 篇 仪器科学与技术
- 50 篇 生物医学工程（可授...
- 40 篇 动力工程及工程热...
- 34 篇 生物工程
- 32 篇 建筑学
- 31 篇 安全科学与工程
- 29 篇 环境科学与工程（可...
- 28 篇 力学（可授工学、理...
- 27 篇 土木工程
- 26 篇 光学工程
1,073 篇 理学
- 863 篇 数学
- 129 篇 统计学（可授理学、...
- 125 篇 系统科学
- 101 篇 物理学
- 48 篇 生物学
- 33 篇 化学
808 篇 管理学
- 626 篇 管理科学与工程(可...
- 296 篇 工商管理
- 220 篇 图书情报与档案管...
71 篇 经济学
- 68 篇 应用经济学
22 篇 法学
22 篇 医学
18 篇 农学
16 篇 文学
10 篇 教育学
6 篇 军事学
1 篇 艺术学

主题

1,213 篇 distributed data...
993 篇 distributed comp...
954 篇 parallel process...
780 篇 concurrent compu...
778 篇 computer science
693 篇 databases
616 篇 computer archite...
586 篇 application soft...
553 篇 computational mo...
464 篇 parallel process...
369 篇 scalability
359 篇 distributed comp...
352 篇 distributed proc...
327 篇 hardware
325 篇 database systems
296 篇 parallel program...
294 篇 processor schedu...
294 篇 costs
291 篇 resource managem...
269 篇 fault tolerance

机构

32 篇 ibm thomas j. wa...
20 篇 school of comput...
19 篇 oak ridge natl l...
15 篇 college of compu...
13 篇 oak ridge nation...
13 篇 oak ridge nation...
13 篇 pacific northwes...
12 篇 iit dept comp sc...
12 篇 lawrence berkele...
12 篇 argonne national...
12 篇 mathematics and ...
11 篇 department of co...
11 篇 georgia institut...
11 篇 department of co...
11 篇 mathematics and ...
11 篇 department of co...
11 篇 department of co...
11 篇 lawrence berkele...
10 篇 school of comput...
10 篇 lawrence berkele...

作者

21 篇 a. choudhary
15 篇 boukerche azzedi...
13 篇 dongarra jack
13 篇 sun xian-he
11 篇 hoefler torsten
11 篇 s.k. das
11 篇 jack dongarra
11 篇 kurt rothermel
10 篇 choudhary a
9 篇 raicu ioan
9 篇 jun zhang
9 篇 m. takizawa
9 篇 yong chen
9 篇 ciprian dobre
9 篇 l.r. welch
9 篇 welch lonnie r.
9 篇 t. kurc
9 篇 chen haibo
9 篇 florin pop
9 篇 cameron kirk w.

语言

9,597 篇 英文
63 篇 其他
21 篇 中文

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

共 9681 条记录，以下是4811-4820 订阅

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

详细简洁

排序：

Direct-pNFS: Scalable, transparent, and versatile access to parallel file systems 07

Direct-pNFS: Scalable, transparent, and versatile access to ...

引用

16th international symposium on High Performance distributed Computing 2007, HPDC'07 and Co-Located Workshops

作者： Hildebrand, Dean Honeyman, Peter University of Michigan

ISBN: (纸本)1595936734

Grid computations require global access to massive data stores. To meet this need, the GridNFS project aims to provide scalable, high-performance, transparent, and secure wide-area data management as well as a scalable and agile name space. While parallel file systems give high I/O throughput, they are highly specialized, have limited operating system and hardware platform support, and often lack strong security mechanisms. Remote data access tools such as NFS and GridFTP overcome some of these limitations, but fail to provide universal, transparent, and scalable remote data access. As part of GridNFS, this paper introduces Direct-pNFS, which builds on the NFSv4.1 protocol to meet a key challenge in accessing remote parallel file systems: high-performance and scalable data access without sacrificing transparency, security, orportability. Experiments with Direct-pNFS demonstrate I/O throughput that equals or out performs the exported parallel file system across a range of workloads. Copyright 2007 ACM.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

A simulation study of data partitioning algorithms for multiple clusters 07

A simulation study of data partitioning algorithms for multi...

引用

7th IEEE international symposium on Cluster Computing and the Grid

作者： Yu, Chen Marinescu, Dan C. Siegel, Howard Jay Morrison, John P. Univ Cent Florida Sch Engn & Comp Sci Orlando FL 32816 USA Colorado State Univ Ft Collins CO 80523 USA Univ Coll Cork Cork Ireland

ISBN: (纸本)9780769528335

Recently we proposed algorithms for concurrent execution on multiple clusters [11]. In this case, data partitioning is done at two levels;first, the data is distributed to a collection of heterogeneous parallel systems with different resources and startup time, then, on each system the data is evenly partitioned to the available nodes. In this paper we report on a simulation study of the algorithms.

关键词： Clustering algorithms Partitioning algorithms distributed computing Grid computing Processor scheduling Biology computing Computational modeling Computer science Large-scale systems Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed adaptive particle swarm optimizer in dynamic environment

Distributed adaptive particle swarm optimizer in dynamic env...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Cui, Xiaohui Potok, Thomas E. Applied Software Engineering Research Computational Sciences and Engineering Division Oak Ridge National Laboratory Oak Ridge TN 37831-6085

ISBN: (纸本)1424409101

Particle Swarm Optimization (PSO) is a population-based stochastic optimization technique, which can be used to find an optimal, or near optimal, solution to a numerical and qualitative problem. In PSO algorithm, the problem solution emerges from the interactions among many simple individual agents called particles. In the real world, we have to frequently deal with searching and tracking an optimal solution in a dynamical and noisy environment. This demands that the algorithm not only find the optimal solution but also track the trajectory of the non-stationary solution. The traditional PSO algorithm lacks the ability to track the changing optimal solution in a dynamic and noisy environment. In this paper, we present a distributed adaptive PSO (DAPSO) algorithm that can be used to track a non-stationary optimal solution in a dynamically changing and noisy environment. © 2007 IEEE.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Making peer-to-peer anonymous routing resilient to failures

Making peer-to-peer anonymous routing resilient to failures

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Zhu, Yingwu Hu, Yiming Department of CSSE Seattle University Seattle WA 98122 Department of ECECS University of Cincinnati Cincinnati OH 45221

ISBN: (纸本)1424409101

One hurdle to using peer-to-peer networks as anonymizing networks is churn. Node churn makes anonymous paths fragile and short-lived: failures of a relay node disrupt the path, resulting in message loss and communication failures. To make anonymous routing resilient to node failures, we take two steps: (1) we use a simple yet powerful idea based on message redundancy by erasure coding and path redundancy to mask node failures;(2) we base mix choices of a path on node lifetime prediction and choose stable nodes as relay nodes, thereby prolonging single path durability. We present an allocation of erasure-coded message segments among multiple paths that provides a guideline on how to maximize routing resilience upon different node availabilities in real-world systems. Via detailed simulations, we compare routing resilience of our approach and existing anonymity protocols, showing that our approach greatly improves routing resilience while consuming modest bandwidth. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Effects of replica placement algorithms on performance of structured overlay networks

Effects of replica placement algorithms on performance of st...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Alqaralleh, Bassam A. Wang, Chen Zhou, Bing Bing Zomaya, Albert Y. School of Information Technologies University of Sydney NSW 2006 Australia

ISBN: (纸本)1424409101

In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas should be created and where to replicate them in order increase the system performance in the presence of non-uniform data and access distribution. There are many works on replica placement policies;however, the impact of system workload on different replica placement strategies is not well studied. We investigate this problem under the context of content addressable overlay networks. We compare a trace based replica placement algorithm with two of its variations, namely random placement and priority based placement under different workloads. Our experimental results show that the effect of replica placement policy is highly affected by the workload of the system, which indicates that an adaptive replica placement strategy is desirable for content distribution in an overlay network. © 2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Dependability modeling and analysis in dynamic systems

Dependability modeling and analysis in dynamic systems

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： DiStefano, Salvatore Puliafito, Antonio University of Messina Engineering Faculty Contrada di Dio S. Agata 98166 Messina Italy

ISBN: (纸本)1424409101

Dependability evaluation is an important, often indispensable, step in (critical) systems design and analysis processes. The introduction of control and/or computing systems to automate processes increases the overall system complexity and therefore has an impact in terms of dependability. When a system grows, dynamic effects, not present or manifested before, could arise or become significant in terms of reliability/availability: the system could be affected by common cause failures, the system components could interfere, effects due to load sharing arise and therefore should be considered. Moreover it is of interest to evaluate redundancy and maintenance policies. In those cases it is not possible to recur to notations as reliability block diagrams (RBD), fault trees (FT) or reliability graphs (RG) to represent the system, since the statistical independence assumption is not satisfied. Also more enhanced formalisms as dynamic FT (DFT) could result not adequate to the goal. To overcome those problems we developed a new formalism derived from RBD: the dynamic RBD (DRBD). In this paper we explain how to use the DRBD notation in system modeling and analysis, coming inside a methodology that, starting from the system structure, drives to the overall system availability evaluation following modeling and analysis phases. To do this we use an example drawn from literature consisting of a multiprocessor distributed computing system, also comparing our approach with the DFT one. ©2007 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Optimization and evaluation of parallel I/O in BIPS3D parallel irregular application

Optimization and evaluation of parallel I/O in BIPS3D parall...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Filgueira, Rosa Singh, David E. Isaila, Florin Carretero, Jesús Loureiro, Antonio García Departement of Computer Science University Carlos III of Madrid Spain Department of Electronics and Computer Science Universidad de Santiago de Compostela Spain

ISBN: (纸本)1424409101

This paper presents the optimization and evaluation of parallel I/O for the BIPS3D parallel irregular application, a 3-dimensional simulation of BJT and HBT bipolar devices. The parallel version of BIPS3D employs Metis, a library for partitioning graphs, finite element meshes, or sparse matrices. First, we show how the partitioning information provided by Metis can be used in order to improve the performance of parallel I/O. Second, we propose a novel technique, called Interval Data Grouping (IDG), which exploits the data replication of mesh nodes for optimizing the scheduling of the parallel file operations. Finally, we evaluate the parallel I/O version of BIPS3D for various existing parallel I/O techniques and present an in-depth analysis of the IDG performance. © 2007 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

distributed resource selection in grid using decision theory 07

Distributed resource selection in grid using decision theory

引用

7th IEEE international symposium on Cluster Computing and the Grid

作者： Nassif, Lilian Noronha Nogueira, Jose Marcos de Andrade, Flavio Vinicius Univ Fed Minas Gerais Belo Horizonte MG Brazil

ISBN: (纸本)9780769528335

Grid technology allows resource sharing among several entities, but selecting the best resource to run a specific job remains one of its main problems. The challenges for the best resource selection involve analysis of several factors such as prediction time to run a job, access restriction to resources, and cost to use resources. This paper presents a resource selection model using decision theory for combining these influential factors in the resource selection process. The model is based on a multi-attribute utility function that maximizes the user preference. This model forms part of a multi-agent system deploying distributed and parallel processing for job execution prediction, access policy verification, and resource selection models. All models of this paper were verified through experiments using real machines. They have presented appropriate functional behaviors and positive performance results.

关键词： Decision theory Predictive models Multiagent systems Costs Uncertainty Resource management Diversity reception Error probability parallel processing Middleware

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing distributed algorithms for networks

引用

5th international symposium on parallel and distributed Processing and Applications/ISPA 2007 international Workshops

作者： Srimani, Pradip K. Clemson Univ Dept Comp Sci Clemson SC 29631 USA

ISBN: (纸本)9783540747413

Many essential fundamental services for networked distributed systems (ad hoc, wireless or sensor) involve maintaining a global predicate over the entire network (defined by some invariance relation on the global state of the network) by using local knowledge at each of the participating nodes. The participating nodes can no longer keep track of even a small fraction of the knowledge about the global network due to limited storage. We need a new paradigm of localized distributed algorithms, where a node takes simple actions based on local knowledge of only its immediate neighbors and yet the system achieves a global objective. Self-stabilization is a relatively new paradigm for designing such localized distributed algorithms for networks;it is an optimistic way of looking at system fault tolerance and scalable coordination;it provides a cost effective built-in safeguard against transient failures that might corrupt data in a distributed system. We introduce self-stabilizing protocol design with the example of a total dominating set in a network graph and discuss some open problems.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Pipelining tradeoffs of massively parallel SuperCISC hardware functions

Pipelining tradeoffs of massively parallel SuperCISC hardwar...

引用

21st international parallel and distributed Processing symposium, IPDPS 2007

作者： Ihrig, Colin J. Stander, Justin Jones, Alex K. University of Pittsburgh Dept. of Electrical and Computer Engineering Pittsburgh PA 15261 United States

ISBN: (纸本)1424409101

parallel processing using multiple processors is a well-established technique to accelerate many different classes of applications. However, as the density of chips increases, another technique to accelerate these applications is the use of application specific hardware processing blocks in parallel within a chip. SuperCISC hardware blocks utilize this method to accelerate scientific, signal, and image processing applications. By applying pipelining methodologies to SuperCISC functions, the effective amount of parallelism already present can be further increased. Automated register placement within a combinational dataflow graph (DFG) is governed by the desired maximum operating frequency provided as a parameter to the tool flow, as well as the results of static timing analysis of the circuit. Results presented include the design tradeoffs between increased performance, area, and energy. Additionally, benefits of pipelining compared to hardware replication as a means of achieving further parallelism is studied. © 2007 IEEE.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 478 479 480 481 482 483 484 485 486 487 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：