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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

983 篇 会议
24 篇 期刊文献
13 册 图书

馆藏范围

1,020 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

791 篇 工学
- 761 篇 计算机科学与技术...
- 488 篇 软件工程
- 216 篇 信息与通信工程
- 97 篇 电气工程
- 78 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 18 篇 机械工程
- 15 篇 生物工程
- 13 篇 仪器科学与技术
- 13 篇 生物医学工程（可授...
- 12 篇 动力工程及工程热...
- 11 篇 安全科学与工程
- 10 篇 测绘科学与技术
- 9 篇 建筑学
- 8 篇 光学工程
- 7 篇 土木工程
- 7 篇 环境科学与工程（可...
- 6 篇 力学（可授工学、理...
- 6 篇 化学工程与技术
244 篇 理学
- 186 篇 数学
- 29 篇 系统科学
- 29 篇 统计学（可授理学、...
- 25 篇 生物学
- 21 篇 物理学
- 11 篇 化学
201 篇 管理学
- 154 篇 管理科学与工程(可...
- 89 篇 工商管理
- 56 篇 图书情报与档案管...
10 篇 经济学
- 10 篇 应用经济学
7 篇 教育学
- 7 篇 教育学
6 篇 法学
5 篇 农学
5 篇 医学
3 篇 文学
1 篇 军事学

主题

96 篇 distributed comp...
71 篇 cloud computing
68 篇 parallel process...
34 篇 parallel process...
33 篇 computational mo...
31 篇 grid computing
29 篇 servers
27 篇 distributed comp...
24 篇 fault tolerance
23 篇 peer to peer com...
21 篇 computer archite...
21 篇 distributed syst...
18 篇 parallel computi...
18 篇 distributed data...
16 篇 graphics process...
15 篇 mapreduce
15 篇 synchronization
14 篇 parallel algorit...
14 篇 parallel program...
13 篇 resource managem...

机构

5 篇 school of automa...
5 篇 national cims en...
5 篇 academic center ...
5 篇 department of in...
5 篇 school of mechat...
4 篇 school of comput...
4 篇 institute of com...
3 篇 a*star institute...
3 篇 school of comput...
3 篇 topic committee ...
2 篇 disca univ. poli...
2 篇 abou bekr belkai...
2 篇 department of co...
2 篇 national institu...
2 篇 hong kong polyte...
2 篇 institute of par...
2 篇 chinese acad sci...
2 篇 institute of par...
2 篇 ibnu sina instit...
2 篇 tsinghua univ de...

作者

5 篇 tianyuan xiao
5 篇 nakashima hirosh...
5 篇 kondo toshio
5 篇 sasaki takahiro
5 篇 lin zhang
5 篇 rothermel kurt
5 篇 ohno kazuhiko
5 篇 gonzalez teofilo...
5 篇 li xiaorong
4 篇 matsumoto masaki
4 篇 beferull-lozano ...
4 篇 akl selim g.
4 篇 andresen daniel
3 篇 jakovits pelle
3 篇 dongarra jack
3 篇 kawamura takao
3 篇 shu jiwu
3 篇 vlassov vladimir
3 篇 rajkumar buyya
3 篇 tziritas nikos

语言

1,000 篇 英文
19 篇 其他
1 篇 中文

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2012"

共 1020 条记录，以下是91-100 订阅

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

详细简洁

排序：

Solving the longest common subsequence (LCS) problem using the associative ASC processor with reconfigurable 2D mesh

Solving the longest common subsequence (LCS) problem using t...

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Virdi, Sabegh Singh Wang, Hong Walker, Robert A. Kent State Univ Dept Comp Sci Kent OH 44242 USA

ISBN: (纸本)9780889866386

As new genes are sequenced, it is common for molecular biologists to compare the new gene's DNA to known sequences. One simple form of DNA sequence comparison is done by solving the Longest Common Subsequence (LCS) problem. In this paper, we propose a parallel algorithm and specialized FPGA-based processor (the associative ASC Processor with reconfigurable 2D mesh) to solve the exact and approximate match LCS problems. This solution uses inexpensive hardware and can be reconfigured as new analysis techniques are developed, making it particularly attractive for processing biosequences.

关键词： SIMD associative computing processor array longest common subsequence sequence analysis biosequences

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for disjoint paths in star networks

A distributed algorithm for disjoint paths in star networks

引用

20th iasted international conference on parallel and distributed computing and systems, pdcs 2008

作者： Hamad, Ahmad Karaata, Mehmet Hakan Department of Computer Engineering Kuwait University P.O. Box 5969 Safat 13060 Kuwait

ISBN: (纸本)9780889867741

A stabilizing system guarantees that, regardless of the current configuration, the system reaches a legal configuration in a bounded number of steps and the system configuration remains legal thereafter. Whereas, a stabilizing system that maintains no explicit variables in the processes of the system is referred to as an inherently stabilizing system, and hence all system states are legal by construction. Due to this attribute, inherently stabilizing systems are immune to transient faults and do not experience any delay due arbitrary system initialization. We view a fault that perturbs the system configuration but not the program as transient fault. Due to these features, inherently stabilizing distributed protocols for peer-to-peer, sensor and mobile networks are desirable. Hypercube, star networks and their variations that provide an increased degree of scalability have been initially design for parallel networks. However, their scalability and the presence of multiple disjoint paths in these topologies make them viable alternatives to existing peer-to-peer and sensor networks topologies. In this paper, we proposed an inherently stabilizing algorithm for delivering messages over all node-disjoint paths from a process to another in star networks. The proposed algorithm has numerous applications including VLSI layout, reliable networks routing, secure message transmission, and network survivability. The proposed routing algorithm is optimal with respect to its state space and lengths of the node-disjoint paths.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Energy consumption of GPU with molecular dynamics

Energy consumption of GPU with molecular dynamics

引用

iasted international conference on parallel and distributed computing and systems, pdcs 2010

作者： Udagawa, Takuro Sekijima, Masakazu Department of Computer Science Tokyo Institute of Technology 2-12-1-I7-5 Oookayama Meguro-ku Tokyo Japan Global Scientific Information and Computing Center Tokyo Institute of Technology 2-12-1-I7-5 Oookayama Meguro-ku Tokyo Japan

ISBN: (纸本)9780889868786

Molecular dynamics simulations are widely used for sim- ulating the motion of molecules in order to gain a deeper understanding of chemical reactions, fluid flow, phase tran- sitions, and other physical phenomena due to molecular in- teractions. However, these simulations require huge com- puter resources. In addition, the problem of energy con- sumption must be solved. Recently, GPGPU has attracted attention as a possible solution to these problems. In this paper, we performed molecular dynamics simulations on a CPU and GPU, and compare calculation time, power con- sumption and energy consumption results between them.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

A decentralised synchronisation approach for complex hierarchical models of virtual worlds

A decentralised synchronisation approach for complex hierarc...

引用

iasted international conference on parallel and distributed computing and systems, pdcs 2010

作者： Farooq, Umar Glauert, John School of Computing Sciences University of East Anglia Norwich NR4 7TJ United Kingdom

ISBN: (纸本)9780889868786

Splitting and executing different parts of a system with the help of a set of dedicated servers is the most widely used technique for making it scalable. However, it introduces synchronisation issues and requires special attention. Synchronisation is extensively investigated for parallel and distributed systems and generally centralised or distributed approaches are used to obtain a consistent view of a system. Centralised methods are easy to implement and achieve precise synchronisation but are not scalable. On the other hand, distributed methods are difficult to manage and introduce potential communication overhead. They also introduce longer delays due to dependencies among components at different levels when used with conservative strategies and complex hierarchical models. In this paper, we propose a fully decentralised synchronisation mechanism to maintain a consistent view of a virtual world. It greatly reduces communication overhead by restricting a server simulating a region to synchronise itself with the servers executing regions sharing boundaries (we define them as adjacent regions) with it. It maintains traditional synchronisation constraints. The proposed mechanism is illustrated with the help of simple scenarios and an abstract model is used to compare it with traditional approaches. It is demonstrated that number of intermediate points among servers and thus complexity and delay in traditional approaches increase significantly with an increase in number of levels in a hierarchy.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Automated dynamic redistribution of virtual operating systems under the xen virtual machine monitor

Automated dynamic redistribution of virtual operating system...

引用

international conference on parallel and distributed computing and Networks

作者： Vachon, Travis F. Teresco, James D. Williams Coll Dept Comp Sci Williamstown MA 01267 USA

ISBN: (纸本)9780889866379

Operating system virtualization has recently become a popular technique to achieve better resource utilization in so-called '' server farm '' environments. This technique provides a virtual hardware interface on top of which one can run multiple instances of popular operating systems. The Xen Virtual Machine Monitor is an implementation of operating system virtualization that supports live migration, the transfer of a virtual operating system from one physical machine to another with minimal down time. We have utilized this capability to implement a monitoring and dynamic reconfiguration daemon that attempts to equalize the load on all host nodes in a group of machines running Xen. We have also implemented a simulator for testing balancing algorithms. Experiments using these tools have provided insight into the redistribution of virtualized operating systems and how this differs from the more thoroughly-studied problem of process-level load balancing.

关键词： parallel computing systems virtual operating systems dynamic load balancing

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of the implicitly restarted Arnoldi/Lanczos method

Parallel implementation of the implicitly restarted Arnoldi/...

引用

21st iasted international conference on parallel and distributed computing and systems, pdcs 2009

作者： Ainsworth Jr., George O. Ribeiro, Fernando L.B. Magluta, Carlos Programa de Engenharia Civil - COPPE Universidade Federal Do Rio de Janeiro Av. Brigadeiro Trompowsky CT I-216 Ilha do Fundão 91445-970 Rio de Janeiro - RJ Brazil

ISBN: (纸本)9780889868113

This work presents a parallel implementation of the implicitly restarted Arnoldi/Lanczos method for the solution of eigenproblems approximated by the finite element method. The implicitly restarted Arnoldi/Lanczos uses a restart scheme in order to improve the convergence of the desired portion of the spectrum, maintaining the orthogonality of the Krylov basis. The presented implementation is suitable for distributed memory architectures, specially PC clusters. In the parallel solution, a subdomain by subdomain approach was implemented and overlapping and non-overlapping mesh partitions were used. Compressed data structures in the formats CSRC and CSRC/CSR were used to store the global matrices coefficients. The parallelization of numerical linear algebra operations presented in both Krylov and implicitly restarted methods are discussed. In order to point out the efficiency and applicability of the proposed algorithms, a numerical example is shown.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

RAS and Job log data analysis for failure prediction for the IBM Blue Gene/L

RAS and Job log data analysis for failure prediction for the...

引用

20th iasted international conference on parallel and distributed computing and systems, pdcs 2008

作者： Solano-Quinde, Lizandro D. Bode, Brett M. Scalable Computing Laboratory Ames Laboratory 312 Wilhelm Hall Ames IA United States

ISBN: (纸本)9780889867741

Currently, the computational needs of scientific applications have grown to levels where it is necessary to have computers with a very high degree of parallelism. The IBM Blue Gene/L can hold in excess of 200K processors and it has been designed for high performance. However, failures in this large system are a major concern, since it has been demonstrated that a failure will drastically decrease the performance of the system. Checkpointing and log schemes have been utilized to overcome these failures, however, it has been shown that these techniques are not as effective as desired. Therefore, proactive failure detection and prediction has gained interest in the research community. In this study, we have collected the RAS event and Job logs from a large IBM Blue Gene/L over a three-month period. We have investigated the relationship among fatal and non-fatal events with the aim of proactive failure prediction. Based on our observations, we have developed a scheme for predicting fatal events based on the spatial and temporal relation among fatal and nonfatal events. We will show that with our scheme up to 84% of fatal events could be effectively predicted.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Investigating the 2-way semijoin for distributed query optimization

Investigating the 2-way semijoin for distributed query optim...

引用

iasted international conference on parallel and distributed computing and systems, pdcs 2010

作者： Subhani, Numanul Morrissey, Joan University of Windsor Windsor ON N9B 3P4 Canada

ISBN: (纸本)9780889868786

With increased globalization, most databases are now highly distributed. Thus, there is a need to reduce the cost of queries that require data from several locations. In the literature, the semijoin is the most commonly used operation for the reduction phase of any distributed query optimization strategy. In [7] an improvement, called the 2-way semijoin, is proposed. The authors conclude that the 2-way semijoin has greater reduction power than the traditional semijoin and has a greater propagation of reduction effects on other relations. However, they were comparing their 2-way semijoin to a single semijoin. In this paper, we decided to compare the 2-way semijoin with 2 separate semijoins. This seems to be a better comparison. We designed an algorithm and performed some experiments to investigate the claims made about the 2-way semijoin. We conclude that the 2-way semijoin is better than two separate semijoins under certain conditions. We also comment on the propagation effects of reductions made by using two separate semijoins.

关键词： Separation

来源：评论

学校读者我要写书评

暂无评论

Self-tuned passive testers for grey-box distributed systems with indefinite communication delays

Self-tuned passive testers for grey-box distributed systems ...

引用

international conference on parallel and distributed computing and Networks

作者： Brzezinski, Krzysztof M. Malinski, Norbert Warsaw Univ Technol Inst Telecommun Nowowiejska 15-19 PL-00665 Warsaw Poland

ISBN: (纸本)9780889866379

Passive testing is a technique suitable for continuous, non-intrusive, autonomous testing of qualitative behavioural properties (correctness) of a deployed distributed system. A real passive tester has to face observational uncertainty, which may lead to false verdicts. We submit the novel idea of a self-tuned passive tester, which is able to adapt to a priori unknown, and possibly changing delays in communication channels. We propose the structure and algorithms of a passive tester that "tunes itself" basing solely on its own, locally issued verdicts. This seemingly counter-intuitive principle is shown by simulation to be viable and effective.

关键词： protocols algorithms modelling and simulation testing

来源：评论

学校读者我要写书评

暂无评论

Service-aware virtual machine placement mechanism for utility computing

Service-aware virtual machine placement mechanism for utilit...

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Kawato, Masahiro Machida, Fumio Maeno, Yoshiharu NEC Corp Ltd Internet Syst Res Labs Nakahara Ku 1753 Shimonumabe Kawasaki Kanagawa 2118666 Japan

ISBN: (纸本)9780889866386

Dynamic server resource allocation to services on networks, or utility computing, is a powerful technology to provide required computer resources for multiple service providers at low cost. Virtual machine (VM) technology can be combined with utility computing to further improve server resource utilization. An important technical issue about VM-based utility computing is optimal placement of VMs on physical server nodes, because performance of services may be seriously affected by VM placement. We address this issue by introducing an on-line placement algorithm on the basis of performance influence among services. We have implemented this algorithm and evaluated on a simulated environment. The results have shown that the proposed mechanism can get roughly 25% better score calculated by the placement rules compared with a random placement algorithm.

关键词： virtual machine utility computing resource allocation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共102页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：