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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,699 篇 会议
48 册 图书
23 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,364 篇 工学
- 1,234 篇 计算机科学与技术...
- 550 篇 软件工程
- 241 篇 信息与通信工程
- 219 篇 电气工程
- 74 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 15 篇 材料科学与工程（可...
- 15 篇 安全科学与工程
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
213 篇 管理学
- 157 篇 管理科学与工程(可...
- 66 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

108 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
61 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
28 篇 parallel process...
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
10 篇 bogdanov alexand...
10 篇 shen hong
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,704 篇 英文
40 篇 其他
18 篇 中文
9 篇 俄文

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

共 1770 条记录，以下是891-900 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Models to Solve the Duplication Problem in Treaty Systems

Models to Solve the Duplication Problem in Treaty Systems

引用

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

作者： Zhao, Yining Wood, Alan Univ York Dept Comp Sci York YO10 5DD N Yorkshire England

ISBN: (纸本)9780769548791

Capabilities are a more scalable and adaptive access control approach compared with the conventional approaches such as ACLs, due to their being held and managed by users or agents in systems, but not the middleware. this feature makes capabilities more suitable in distributed environments that have dynamic populations. Treaties have been proposed to enhance the capability approach by introducing sequences of actions, such that treaties can capture characteristics of behaviours, and provide finer control over accesses. However there is a new problem brought by the behaviour modeling of treaties which is called duplication problem, which concerns preventing users from gaining unauthorised behaviour by duplicating treaties. In this paper we discuss this problem and propose three models of treaty systems that aim to solve the duplication problem.

关键词： Behaviour Control Access Control Duplication Problem Treaties distributed computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MATRIX: A Message Passing Interface for MPMD(Multiple Program Multiple Data) applications on Heterogeneous distributed Network

MATRIX: A Message Passing Interface for MPMD(Multiple Progra...

引用

9th international conference on Ubiquitous Robots and Ambient Intelligence (URAI)

作者： Lee, Dong-Hyuk Moon, Hyungpil Koo, Ja Choon Choi, Hyouk Ryeol Sungkyunkwan Univ Sch Mech Engn Suwon 440746 South Korea

ISBN: (纸本)9781467331104

this paper presents a message passing interface called MATRIX for the MPMD(Multiple Program Multiple Data) type parallel application running on a distributed network. the proposed interface provides network abstraction and peer-to-peer message transfer method to the application layer. the interface is designed to have scalability for a large-scale application. the concurrent application established on the proposed interface can be applied to a heterogeneous distributed network composed of multi-architectures and multi-OS machines. this paper describes the concepts, protocols and implementations of the message passing interface. Additionally, we present the remote file transfer and execution protocol called FTXP for large-scale applications on the message passing interface. For the verification of the proposed methods, we present an example of parallel application applied to a surveillance robot system composed of multi-architecture and multi-OS.

关键词： Message passing interface distributed robotics

来源：评论

学校读者我要写书评

暂无评论

Experimental Analysis of SMP Scalability in the Presence of Coherence Traffic and Snoop Filtering

Experimental Analysis of SMP Scalability in the Presence of ...

引用

14th IEEE international conference on High Performance computing and Communications (HPCC) / IEEE 9th international conference on Embedded Software and Systems (ICESS)

作者： Al-Mouhamed, Mayez A. Daud, Khaled A. King Fahd Univ Petr & Minerals Dept Comp Engn Dhahran 31261 Saudi Arabia

ISBN: (纸本)9780769547497

Commodity multi-core SMPs may generate an enormous amount of coherency traffic. However, the impact of coherence traffic and snoop filtering on parallel program scalability has not attracted sufficient attention. We experimentally analyze the shared data access patterns of four typical applications having different memory layout. An OpenMp optimized execution model is derived for each application with emphasis on data dependencies and implied coherence messages. Using an 8-core SMP we present the obtained speedups versus change in the number of cores and problem scale. A discussion of potential limitation on scalability due to the application or SMP is presented. To assess the coherence behavior and its impact on scalability of parallel programs, a synthetic benchmark which alternates the data block ownership among two cores of the same or different processors is presented. It is found that coherence overheads including snoop filtering are responsible of significant limitation on parallel program scalability. For 8-core SMPs, speedup can be reduced by factors of 2.5 and 5 for row-major and column-major access patterns as compared to the use of private data, respectively. A truly parallel coherence protocol implementation is needed to provide truly scalable shared-memory model.

关键词： distributed-memory HPC parallel programming performance evaluation and speedup shared-memory system

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Study on Quantum parallel Processing by Adiabatic Quantum Computation in Bernstein-Vazirani Problem

Study on Quantum Parallel Processing by Adiabatic Quantum Co...

引用

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

作者： Nakayama, Shigeru Gang, Peng Iimura, Ichiro Kagoshima Univ Dept Inf Sci & Bio Eng Kagoshima 8900065 Japan Huizhou Univ Dept Comp Sci Huizhou Peoples R China Prefectural Univ Kumamoto Dept Adm Kumamoto Japan

ISBN: (纸本)9780769548791

Adiabatic quantum computation has been proposed as quantum parallel processing with adiabatic evolution by using a superposition state to solve combinatorial optimization problem, then it has been applied to many problems like satisfiability problem. Among them, Deutsch and Deutsch-Jozsa problems have been tried to be solved by using adiabatic quantum computation. In this paper, we modify the adiabatic quantum computation and propose to solve Bernstein-Vazirani problem more efficiently by a method with higher observation probability.

关键词： quantum parallel processing quantum algorithm adiabatic quantum computation Bernstein-Vazirani problem combinatorial optimization problem

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 86 87 88 89 90 91 92 93 94 95 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：