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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

548 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

564 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

542 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

检索条件"任意字段=19th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 564 条记录，以下是191-200 订阅

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

详细简洁

排序：

A distributed Approach to Constructing k-Hop Connected Dominating Set in Ad Hoc Networks

A Distributed Approach to Constructing k-Hop Connected Domin...

引用

19th IEEE international conference on parallel and distributed systems (ICPADS)

作者： Wang, Jiahong Yonamine, Yuhiro Kodama, Eiichiro Takata, Toyoo Iwate Prefectural Univ Fac Software & Informat Sci Takizawa Japan

ISBN: (纸本)9781479920815

Since ad hoc networks do not have fixed or predefined infrastructures, nodes need to frequently flood control messages to discover and maintain routes, which causes performance problems in terms of unnecessary traffic and energy consumption, contention, and collision. A general solution is to construct a virtual backbone as the basis of routing and broadcasting, and the Connected Dominating Set (CDS) has been widely used. this paper gives a distributed approach to constructing k-Hop CDS with three unique characteristics: (1) the limitation on the range of k has been removed;(2) a token-based conflict avoidance mechanism has been introduced which can make the construction process faster and more effective;(3) a tree-type CDS can be constructed in bottom-up processing. Simulation experiments have been conducted to demonstrate the effectiveness of the proposed approach.

关键词： ad hoc network virtual backbone k-hop CDS distributed construction tree-type CDS

来源：评论

学校读者我要写书评

暂无评论

Automatic Tuning of Computation-Communication Overlap for parallel 1-D FFT 19

Automatic Tuning of Computation-Communication Overlap for Pa...

引用

19th IEEE international conference on Computational Science and Engineering, 14th IEEE international conference on Embedded and Ubiquitous computing and 15th international Symposium on distributed computing and Applications to Business, Engineering and Science, CSE-EUC-DCABES 2016

作者： Takahashi, Daisuke Center for Computational Sciences University of Tsukuba Tsukuba Ibaraki305-8577 Japan

ISBN: (纸本)9781509035939

this paper presents a method for the automatic tuning of the computation-communication overlap for a parallel one-dimensional fast Fourier transform (FFT). parallel FFTs require intensive all-to-all communication, which affects their performance. therefore, in the present study, an automatic tuning facility for selecting the optimal parameters of the computationcommunication overlap, the radices, and the block size is implemented. the performance results demonstrate that the proposed implementation of a parallel one-dimensional FFT with automatic tuning provides superior performance. © 2016 IEEE.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Towards Scalable Optimal Sequence Homology Detection

Towards Scalable Optimal Sequence Homology Detection

引用

19th international conference on High Performance computing (HiPC)

作者： Daily, Jeff Krishnamoorthy, Sriram Kalyanaraman, Ananth Pacific NW Natl Lab Richland WA 99352 USA

ISBN: (纸本)9781467323703;9781467323727

the field of bioinformatics and computational biology is experiencing a data revolution - experimental techniques to procure data have increased in throughput, improved in accuracy and reduced in costs. this has spurred an array of high profile sequencing and data generation projects. While the data repositories represent untapped reservoirs of rich information critical for scientific breakthroughs, the analytical software tools that are needed to analyze large volumes of such sequence data have significantly lagged behind in their capacity to scale. In this paper, we address homology detection, which is a fundamental problem in large-scale sequence analysis with numerous applications. We present a scalable framework to conduct large-scale optimal homology detection on massively parallel super-computing platforms. Our approach employs distributed memory work stealing to effectively parallelize optimal pairwise alignment computation tasks. Results on 120,000 cores of the Hopper Cray XE6 supercomputer demonstrate strong scaling and up to 2.42 x 10(7) optimal pairwise sequence alignments computed per second (PSAPS), the highest reported in the literature.

关键词： Cray computers DNA bioinformatics distributed memory systems mainframes parallel machines pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Summary Creation for Information Discovery in distributed systems

Summary Creation for Information Discovery in Distributed Sy...

引用

19th international Euromicro conference on parallel, distributed and Network-Based Processing (PDP)

作者： Caminero, Agustin C. Huedo, Eduardo Rana, Omer Llorente, Ignacio M. Caminero, Blanca Carrion, Carmen Univ Nacl Educ Distancia Madrid Spain Univ Complutense Madrid Madrid Spain Univ Cardiff Cardiff S Glam Wales Univ Castilla La Mancha Castilla La Mancha Spain

ISBN: (纸本)9780769543284

In current distributed systems, such as Grids, Clouds, or P2P systems, the amount of information to handle influences the way the system is managed. In P2P systems containing large quantities of data, or in Grid systems containing a large number of (often heterogeneous) resources, information about data or resources must be spread through the system in an efficient way in order to allow them to be found. An information discovery technique based on data summarization, via clustering, is presented. these summaries can be used to classify information to provide users with greater insight about documents or computing resources compared to raw data. Also, meta-schedulers or brokers would benefit from the proposed technique due to the fact that they would have to deal with less data from resources, thus aiding to the scalability of the system. An evaluation of the approach is subsequently provided to identify the impact of choosing particular parameters to be used as part of the summary.

关键词： summary creation classification information discovery distributed systems

来源：评论

学校读者我要写书评

暂无评论

Survivability models and implementations in large distributed environments

Survivability models and implementations in large distribute...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Park, Joon S. Chandramohan, Pratheep Giordano, Joseph Lab. for Info. Secty. and Applic. School of Information Studies Syracuse University NY United States Information Directorate Air Force Research Laboratory Rome NY United States

As information systems have become ever more complex, the interdependence of these systems has increased;consequently, the issue of survivability has also become increasingly complicated. the need for survivability is most pressing for mission-critical systems, especially when they are integrated with commercial off-the-shelf (COTS) products or services. In the paper, we identify two survivability models - static and dynamic - and we discuss their trade-offs. the comparison of these trade-offs between the models resulted in the creation of a new hybrid survivability model that provides more robust survivability services than the static or dynamic models can provide by themselves. To prove the feasibility of our ideas, we describe our implementation of each of the three survivability models in the context of a mission-critical banking system in a distributed computing environment. Finally, we discuss the lessons we learned from our implementations.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Deployment of parallel direct sparse linear solvers within a parallel finite element code

Deployment of parallel direct sparse linear solvers within a...

引用

iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

作者： Klimowicz, A.N.F. Mihajlović, M.D. Heil, M. School of Computer Science University of Manchester Oxford Road Manchester United Kingdom School of Mathematics University of Manchester Lamb Building Manchester United Kingdom

ISBN: (纸本)0889865701

In this paper we present and evaluate the performance of two different strategies for the deployment of parallel multifrontal and multiple frontal sparse linear solvers in the context of a parallel finite element code. Direct sparse linear solvers are based on sophisticated reorganisation of the standard Gaussian elimination algorithm with the aim of exploring matrix sparsity and reducing the amount of fill-in. Such codes can be successfully applied to very large linear systems, and are especially effective when a sparse linear system needs to be solved for multiple right-hand sides. Unfortunately, many important applications, such as finite element solutions of non-linear, transient problems, require repeated factorisation of the coefficient matrix. In such cases the only way of achieving good performance is parallelisation of both the computation of the finite element matrices and the linear system solution phase. We have developed two different designs for deployment of parallel multifrontal and multiple frontal sparse linear solvers in this context, each deploying three different strategies for the assembly of the global data. these designs are suitable for parallel and heterogeneous architectures. Experiments confirm high efficiency, low communication cost, and reduced initial memory requirements of our deployment designs, compared to a standard deployment strategy.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Effects of processing delay on function-parallel firewalls

Effects of processing delay on function-parallel firewalls

引用

iasted international conference on parallel and distributed computing and Networks, as part of the 24th iasted international Multi-conference on APPLIED INFORMATICS

作者： Farley, Ryan J. Fulp, Errin W. Department of Computer Science Wake Forest University Winston-Salem NC 27109 United States

ISBN: (纸本)0889865701

Comprehensive security policies are an integral part of creating a secure network and commonly firewalls are used to accomplish this. Firewalls inspect and filter traffic arriving or departing a network by comparing packets to a set of rules and performing the matching rule action, which is accept or deny. Unfortunately, traffic inspection of this type can impose significant delays on traffic due to the complexity and size of policies. therefore, improving firewall performance is important, given the next generation of high-speed networks. this paper investigates the performance of a function parallel firewall architecture that distributes the original policy across an array of firewalls. A packet is processed by all the firewalls simultaneously and a gate then makes a final decision (accept or deny) based on the results of the individual firewalls. Since the individual firewalls have fewer rules to process (only a portion of the original policy), the function parallel system has lower delays (e.g. 74% lower for a four firewall array) and a higher throughput than other data parallel (load-balancing) firewalls. However, the performance increase is dependent on the speed of the gate. the potential speed increase and the impact of the gate will be demonstrated empirically.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel gauss-seidel on a torus NOC architecture

Parallel gauss-seidel on a torus NOC architecture

引用

11th iasted international conference on parallel and distributed computing and Networks, PDCN 2013

作者： Day, Khaled Al-Towaiq, Mohammad H. Sultan Qaboos University P.O. Box 36 Al-Khod 123 Oman Jordan University of Science and Technology B. O. Box 3030 Irbid 22110 Jordan

ISBN: (纸本)9780889869431

We propose a parallel Gauss-Seidel (GS) iterative algorithm for solving large systems of linear equations on a 2D torus network-con-chip (NoC) architecture. the proposed parallel algorithm is of O(Nn2/k2) time complexity for solving a system with matrix of order n on a k×k torus NoC architecture requiring N iterations assuming n and N are large compared to k (i.e. for large linear systems that require a large number of iterations). We show that under these conditions the proposed parallel GS algorithm has near optimal speedup and efficiency.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Auction-based resource allocation protocols in grids

Auction-based resource allocation protocols in grids

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Grosu, Daniel Das, Anubhav Department of Computer Science Wayne State University 5143 Cass Avenue Detroit MI 48202

In this paper, we study the auction model for resource management using the SimGrid simulation framework. We investigate three types of auction allocation protocols: (i) First-Price Auction, (ii) Vickrey Auction and (iii) Double Auction. the goal is to find which one is best suitable for the grid environment from users' perspective as well as from resources' perspective. the results showed that when we consider a mix of risk-averse and risk-neutral users First-Price Auction favors resources while Vickrey Auction favors users. On the other hand the Doubly Auction favors both users and resources.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

A constant time shortest-path routing algorithm for pyramid networks

A constant time shortest-path routing algorithm for pyramid ...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Hsieh, Hsien-Jone Duh, Dyi-Rong Shiau, Jing-Shiuh Dept. of Comp. Science Engineering National Chi Nan University 1 University Rd. Puli Nantou Hsien 545 Taiwan

For interconnection networks, designing shortest path routing algorithms is in general more difficult than designing simple routing algorithms. In this paper, we derive a shortest path routing algorithm for pyramid networks. the proposed algorithm takes O(l) time to determine a shortest path between any two nodes in a pyramid network. We also design a distributed routing algorithm such that an intermediate node takes O(1) time to confirm the next node along the shortest path without any centralized controller.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：