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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,713 篇 会议
29 册 图书
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,298 篇 工学
- 1,197 篇 计算机科学与技术...
- 536 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
165 篇 管理学
- 116 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

155 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
68 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 grid computing

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 shen hong
11 篇 rothermel kurt
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,724 篇 英文
30 篇 俄文
9 篇 其他
4 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1767 条记录，以下是851-860 订阅

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

详细简洁

排序：

An Algorithm for Partitioning a Tree into Sibling Subtree Clusters Weighted in a Given Range

An Algorithm for Partitioning a Tree into Sibling Subtree Cl...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Chen, Hao Luo, GuangCun Qin, Ke Peng, NingDuo Hao, Wen Univ Elect Sci & Technol China Chengdu Peoples R China Air force Command Automat Stn Chengdu Peoples R China

ISBN: (纸本)9780769548791

Assume that each vertex of an arbitrary n-vertex tree T is assigned a nonnegative integer weight. this paper considers partitioning the vertices of tree T into p disjoint clusters such that the total weight of each cluster is at least l and at most u, where l and u are given integers with lthms for trees only allow that a cluster corresponds to a subtree, our algorithm also considers clusters containing several subtrees as long as these subtrees have the same parent node or their root vertices are adjacent siblings. We call this [l, u] sibling partitioning. We deal with two problems of [l, u] sibling partitioning for a given tree: the minimal partition problem is to find an [l, u] sibling partitioning with the minimum number of clusters;the p-partition problem is to find an [l, u] sibling partitioning with a given number p of clusters. In this paper, we present the first polynomial-time algorithm to solve the two problems.

关键词： Tree partition Sibling Subtrees Dynamic Programming distributed computing

来源：评论

学校读者我要写书评

暂无评论

Mechanised verification of distributed state-space algorithms for security protocols

Mechanised verification of distributed state-space algorithm...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Gava, Frederic Hidalgo, Arthur Fortin, Jean Univ Paris East Paris France

ISBN: (纸本)9780769548791

Explicit model-checking (MC) is a classical solution to find flaws in a security protocol. But it is well-known that for non trivial protocols, MC may enumerate state-spaces of astronomical sizes-the famous state-space explosion problem. distributed model checking is a solution but complex and subject to bugs: a MC can validate a model but miss an invalid state. In this paper, we focus on using a verification condition generator that takes annotated distributed algorithms and ensures their termination and correctness. We study five algorithms (one sequential and four distributed where three of them are dedicated and optimised for security protocol) of state-space construction as a first step towards mechanised verification of distributed model-checkers.

关键词： BSP Mechanized proof Security protocol

来源：评论

学校读者我要写书评

暂无评论

Programming models based on data versioning for dependency-aware task-based parallelisation

Programming models based on data versioning for dependency-a...

引用

15th IEEE international conference on Computational Science and Engineering (CSE) / 10th IEEE/IFIP international conference on Embedded and Ubiquitous computing (EUC)

作者： Zafari, Afshin Tillenius, Martin Larsson, Elisabeth Uppsala Univ Dept Informat Technol SE-75105 Uppsala Sweden

ISBN: (纸本)9781467351652;9780769549149

By using task-based programming models, application developers who are not necessarily experts in parallel programming get access to the potentially high performance of multi-core based computer systems. We have derived a family of task parallel programming models where data dependencies are represented through data versioning. Benefits of using this type of model are that it is easy to represent different types of dependencies and that scheduling decisions can be made locally. Experiments show that a thread parallel shared memory implementation as well as a hybrid thread/MPI distributed memory implementation scale well on a system with 64 cores. Comparing the hybrid implementation with a pure MPI version, the results are comparable for small numbers of cores, but for larger numbers of cores the gain of using the hybrid model is substantial.

关键词： data dependency data versioning distributed memory hybrid multi-core task parallel data dependency distributed memory HYBRID parallel programming core Hybrid modes Hybrid electric vehicles HIGH-PERFORMANCE application developer Programming Core samples Computer systems

来源：评论

学校读者我要写书评

暂无评论

REST: A Redundancy-based Energy-efficient Cloud Storage System

REST: A Redundancy-based Energy-efficient Cloud Storage Syst...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Li, Hongyan Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)9780769548791

Energy consumption has increasingly become a serious problem in contemporary data centers. the electricity bill contributes a significant fraction of the Total Cost of Ownership (TCO), and it has been predicted to increase at an even faster pace in the following years. In an attempt to reduce the energy consumption in cloud infrastructures, we propose REST, an energy-efficient cloud storage built upon an open source cluster-based object store similar to GFS. It achieves high energy-efficiency by cleverly exploiting the redundancy and its asymmetric accesses existing in the system without compromising inherent well-established mechanisms, while maintaining reasonable performance level. By slightly altering the data-layout policy, REST can safely keep a large amount of redundant storage nodes in standby mode or even powered off most of the time. Deploying a sophisticated real-time workload monitor, it provides flexibility to power up standby or powered down nodes to accommodate the variations in workloads. In addition, trade-offs between energy and performance can be conveniently made by simply adjusting a trade-off metric in REST. the FileBench experimental results have demonstrated that power savings can be as high as 29%, still providing comparable or even better performance.

关键词： cloud storage data centre distributed storage energy efficient power saving

来源：评论

学校读者我要写书评

暂无评论

Cross Stratum Optimization (CSO) enabled PCE architecture

Cross Stratum Optimization (CSO) enabled PCE architecture

引用

2012 10th IEEE international Symposium on parallel and distributed Processing with applications, ISPA 2012

作者： Dhody, Dhruv Lee, Young Yang, Hui India R and D Center Huawei Technologies Bangalore India USA Innovation Center Huawei Technologies Plano TX United States Beijing China

ISBN: (纸本)9780769547015

applications like cloud computing, video gaming, HD Video streaming, Live Concerts, Remote Medical Surgery and other applications are offered by Data Centers. these data centers are geographically distributed and connected via a network. Many decisions are made in the Application space without any concern of the underlying network. Cross stratum application/network optimization focuses on the challenges and opportunities presented by data center based applications and carriers networks together [1]. Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. [2] explains the architecture for a Path Computation Element (PCE)-based model to address this problem space. this paper presents Cross Stratum Optimization (CSO) enabled Path Computation Element (PCE) architecture as a building block to achieve Cross Stratum application/network optimization. © 2012 IEEE.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of a Massively parallel ESB-Oriented Architecture

Performance Evaluation of a Massively Parallel ESB-Oriented ...

引用

5th IEEE international conference on Service-Oriented computing and applications (SOCA)

作者： Benosman, Ridha Albrieux, Yves Barkaoui, Kamel CNAM CEDRIC Lab F-75141 Paris France

ISBN: (纸本)9781467347754;9781467347730

Enterprise Service Bus (ESB) is an SOA-based software architecture for business application integration in distributed and heterogeneous environments. Most of open-source or commercial solutions offer the same set of basic services such as message transformation, message routing, security, etc... however, none of them take advantage of the multicore/multiprocessor technologies which make possible the massively parallel processing. this work concerns performance evaluation of a massively parallel ESB oriented architecture (denoted MPAB). After a brief description of its main components, we present the results of this evaluation based on operational analysis.

关键词： ESB-Oriented Architecture Performance Evaluation Multithreading Massively parallel Processing

来源：评论

学校读者我要写书评

暂无评论

Network Load Analysis and Provisioning of MapReduce applications

Network Load Analysis and Provisioning of MapReduce Applicat...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Rizvandi, Nikzad Babaii Taheri, Javid Moraveji, Reza Zomaya, Albert Y. Univ Sydney Sch Informat Technol Ctr Distributed & High Performance Comp Sydney NSW 2006 Australia

ISBN: (纸本)9780769548791

In this paper, we study the dependency between MapReduce configuration parameters and network load of fixed-size MapReduce jobs during the shuffle phase;then we propose an analytical method to model this dependency. Our approach consists of three key phases: profiling, modeling, and prediction. In the first stage, an application is run several times with different sets of MapReduce configuration parameters (here number of map tasks and number of reduce tasks) to profile the network load of an application in the shuffle phase on a given cluster. then, the relation between these parameters and the network load is modeled by multivariate linear regression. For evaluation, three applications (WordCount, Exim Mainlog parsing, and TeraSort) are utilized to evaluate our technique on a 5-node MapReduce private cluster.

关键词： MapReduce Configuration parameters network load analysis provisioning multivariate linear regression number of map tasks number of reduce tasks

来源：评论

学校读者我要写书评

暂无评论

A Synchronization-Induced Checkpoint Protocol for Group-Synchronous parallel Programs

A Synchronization-Induced Checkpoint Protocol for Group-Sync...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Wei, Zunce Goswami, Dhrubajyoti Concordia Univ Dept Comp Sci & Software Engn Montreal PQ Canada

ISBN: (纸本)9780769548791

Group checkpointing is a fix between global checkpointing and log-based recovery. It features both reduced runtime overhead and localized recovery effect for improving the fault-tolerance performance of large-scale distributed systems. However, parallel programs cannot efficiently benefit from this strategy, as they often involve synchronous or semi-synchronous interactions that incur extra idling delays between processes as well as between process groups. this paper presents an analytical study on such delays and the corresponding delay optimization strategies. Observing that certain parallel programs exhibit patterns of "synchronization groups", we develop a Synchronization-Induced Checkpoint protocol that manages checkpoints around such groups. the protocol keeps advantages of ordinary group checkpointing, and meanwhile minimizes the costs of synchronization-induced delays. We also broadly categorize the known synchronization patterns and establish their relations with suitable checkpoint strategies for parallel programs.

关键词： Fault tolerance checkpoint and recovery group checkpoint delay dependency synchronization group synchronization-induced checkpoint

来源：评论

学校读者我要写书评

暂无评论

A load balanced distributed algorithm to solve the permutation flow shop problem using the Grid

A load balanced distributed algorithm to solve the permutati...

引用

15th IEEE international conference on Computational Science and Engineering (CSE) / 10th IEEE/IFIP international conference on Embedded and Ubiquitous computing (EUC)

作者： Kouki, Samia Jemni, Mohamed Ladhari, Talel Univ Tunis High Sch Sci & Tech Tunis Res Lab LATICE Tunis Tunisia Polytechn Sch Tunisia ROI Combinatorial Optimizat Res Grp La Marsa Tunisia King Saud Univ Coll Engn Dept Ind Engn Princess Fatimah Al Nijriss Res Chair Adv Mfg Tec Riyadh 11421 Saudi Arabia

ISBN: (纸本)9781467351652;9780769549149

this paper deals with solving the permutation flow shop problem (PFSP) which is an NP-hard scheduling problem using grid computing. As the sequential resolution of this problem can be sometimes impossible on a single machine and especially for instances of large data, we are interested in this work by solving the PFSP using parallel programming. In a previous paper, we presented a parallel algorithm for solving the PFSP on the grid called GAUUB. the GAUUB algorithm uses the Branch and Bound method to find optimal solutions of the problem and distributes the tasks among all processors. In this paper, we present a new algorithm called GALB, based on a parallelization strategy ensuring better load balancing between the processors and therefore, better efficiency of the algorithm. Computational results of our new algorithm performed on the grid showed good results and significant improvements of our initial algorithm thanks to our load balancing technique.

关键词： Grid computing distributed algorithms Load balancing parallel algorithms PROCESSOR Branch and bound methods grids shopping mall Permutation PROBLEM SOLUTION parallel programming Grid algorithm efficiency optimal solution

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Load Balancing Approach for parallel Search-Tree Optimization

A Decentralized Load Balancing Approach for Parallel Search-...

引用

13th international conference on parallel and distributed computing, applications, and technologies (PDCAT)

作者： Abu-Khzam, F. N. Mouawad, A. E. Lebanese Amer Univ Sch Arts & Sci Dept Comp Sci & Math Beirut Lebanon Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9780769548791

Current generation supercomputers have over one million cores awaiting highly demanding computations and applications. An area that could largely benefit from such processing capabilities is naturally that of exact algorithms for NP-hard problems. We propose a general implementation framework that targets highly scalable parallel exact algorithms for NP-hard graph problems. We tackle the problems of efficiency and scalability by combining a fully decentralized dynamic load balancing strategy with special implementation techniques for exact graph algorithms. As a case-study, we use our framework to implement parallel algorithms for the VERTEX COVER and DOMINATING SET problems. We present experimental results that show notable improved running times on all types of input instances.

关键词： parallel Algorithms Exact Algorithms Vertex Cover Dominating Set Dynamic Load Balancing Recursive Backtracking

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：