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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

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

共 660 条记录，以下是211-220 订阅

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

详细简洁

排序：

Improving graph coloring on distributed-memory parallel computers

Improving graph coloring on distributed-memory parallel comp...

引用

18th international conference on High Performance computing, HiPC 2011

作者： Sariyüce, Ahmet Erdem Saule, Erik Çataryürek, Ümit V. Department of Biomedical Informatics Ohio State University United States Department of Computer Science and Engineering Ohio State University United States Department of Electrical and Computer Engineering Ohio State University United States

ISBN: (纸本)9781457719516

Graph coloring is a combinatorial optimization problem that classically appears in distributed computing to identify the sets of tasks that can be safely performed in parallel. Despite many existing efficient sequential algorithms being known for this NP-Complete problem, distributed variants are challenging. Building on an existing distributed-memory graph coloring framework, we investigate two techniques in this paper. First, we investigate the application of two different vertex-visit orderings, namely Largest First and Smallest Last, in a distributed context and show that they can help to significantly decrease the number of colors, on small-to medium-scale parallel architectures. Second, we investigate the use of a distributed post-processing operation, called recoloring, which further drastically improves the number of colors while not increasing the runtime more than twofold on large graphs. We also investigate the use of multicore architectures for distributed graph coloring algorithms. © 2011 IEEE.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

An improvement for the dynamic distributed double guided genetic algorithm for MAX-CSPs

An improvement for the dynamic distributed double guided gen...

引用

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

作者： Nisrine, Zaier Sadok, Bouamama Khaled, Ghedira SOIE Laboratory University of TUNIS Tunisia

ISBN: (纸本)9780889867048

this paper propose a new approach to improve the Dynamic distributed Double Guided Genetic Algorithm (D3G2A) dealing with Maximal Constraint Satisfaction Problems. Inspired by the NEO-DARWINISM theory and the nature laws, D3G2A consists in creating agents cooperating together to solve problems. In D3G2A, It was proved that the spent CPU time could be improved. the new approach Inspired by the D 3G2A for CSOP and ΣCSPs, will redistribute the load of species agents more equally in order to better the CPU time. this improvement allows not only reduction in species agent's number but also decrease communications agents cost. thus, a sub-population is composed of chromosomes violating a number of constraints in the same interval. In the present paper, the new approach is first described and then compared with the old one. Results of experimentations are analyzed and discussed.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimization for instruction level parallelism by adding, spilling and rematerialization

Optimization for instruction level parallelism by adding, sp...

引用

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

作者： Ishii, Naohiro Sumiyoshi, Kazunari Ogi, Hiroaki Iwata, Kazunori Aichi Institute of Technology Toyota 470-0392 Japan Aichi University Aichi 470-0296 Japan

On the instruction-level parallel architecture such as VLIW, the performance is affected by the compiler technique. In this paper, we propose an integrated optimization technique which cooperates register reusing, spilling and rematerialization First, we develop a register allocation method that can be decided, whether the register must be reusing or spilled or rematerialized by the prediction of the execution timing of the instruction in the program, when registers are insufficient. We evaluate our method in comparison with conventional compiler technique for blocks of programs. Second, the spilling and the rematerialization are also applied to the software pipelining to improve the parallelism in the loops. It was shown that the spilling and the rematerialization adopted in the scheduling, improves the parallelism in the loop executions.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimizing Change Detection in distributed Digital Collections An Architectural Perspective of Change Detection 18

Optimizing Change Detection in Distributed Digital Collectio...

引用

18th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Meegahapola, Lakmal Alwis, Roshan Nimalarathna, Eranga Mallawaarachchi, Vijini Meedeniya, Dulani Jayarathna, Sampath Univ Moratuwa Dept Comp Sci & Engn Moratuwa Sri Lanka Calif State Polytech Univ Pomona Dept Comp Sci Pomona CA 91768 USA

ISBN: (纸本)9781509055043

Digital documents are likely to have problems associated with the persistence of links, especially when dealing with references to external resources. People keep track of various webpages of their interest using distributed digital collections and without possession of these documents;the curator cannot control how they change. In the current context, managing these distributed digital collections and getting notifications about various changes have become a significant challenge. In this paper, we address the architectural aspects of change detection systems and present optimized change detection architecture, including a web service and a browser plugin, along with an email notification service. We have performed an experimental study on our hybrid architecture for change detection in a distributed digital collection. the proposed method introduces a preliminary framework that can serve as a useful tool to mitigate the impact of unexpected change in documents stored in decentralized collections in the future.

关键词： Change detection change notification distributed digital collections

来源：评论

学校读者我要写书评

暂无评论

Topic 8: distributed systems and Algorithms

引用

18th international conference on Euro-Par parallel Processing

作者： Goscinski, Andrzej Mavronicolas, Marios Shi, Weisong Meng, Teo Yong Topic Committee United States

ISBN: (纸本)9783642328206

the increasing significance of distributed computing becomes more and more crucial with the prevail of technological advances that make Global computing a reality in modern world. Indeed, it is hard to imagine some application or computational activity and process that falls outside distributed computing. With the large advent of distributed systems, we are faced with the real challenges of distributed computation: How do we cope with asynchrony and failures? How (and how well) do we achieve load balancing? How do we model and analyze malicious and selfish behavior? How do we address mobility, heterogeneity and the dynamic nature of participating processes? What can we achieve in the presence of disconnecting operations that cause network partitioning?

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

DASH: A C++ PGAS library for distributed data structures and parallel algorithms

DASH: A C++ PGAS library for distributed data structures and...

引用

18th IEEE international conference on High Performance computing and Communications, 14th IEEE international conference on Smart City and 2nd IEEE international conference on Data Science and systems, HPCC/SmartCity/DSS 2016

作者： Fuerlinger, Karl Fuchs, Tobias Kowalewski, Roger Munich Computer Science Department MNM Team Oettingenstr. 67 Munich80538 Germany

ISBN: (纸本)9781509042968

We present DASH, a C++ template library that offers distributed data structures and parallel algorithms and implements a compiler-free PGAS (partitioned global address space) approach. DASH offers many productivity and performance features such as global-view data structures, efficient support for the owner-computes model, flexible multidimensional data distribution schemes and interoperability with STL (standard template library) algorithms. DASH also features a flexible representation of the parallel target machine and allows the exploitation of several hierarchically organized levels of locality through a concept of Teams. We evaluate DASH on a number of benchmark applications and we port a scientific proxy application using the MPI two-sided model to DASH. We find that DASH offers excellent productivity and performance and demonstrate scalability up to 9800 cores. © 2016 IEEE.

关键词： Productivity

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 18 19 20 21 22 23 24 25 26 27 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：