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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是821-830 订阅

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

详细简洁

排序：

Energy Analysis of Hadoop Cluster Failure Recovery

Energy Analysis of Hadoop Cluster Failure Recovery

引用

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

作者： Xu, Weiyue Lu, Ying Univ Nebraska Dept Comp Sci & Engn Lincoln NE 68588 USA

ISBN: (纸本)9781479924189

Energy efficiency is now used as an important metric for evaluating a computing system. However, saving energy is a big challenge due to many constraints. For example, in one of the most popular distributed processing frameworks, Hadoop, three replicas of each data block are randomly distributed in order to improve performance and fault tolerance. But such a mechanism limits the largest number of machines that can be turned off to save energy without affecting the data availability. To overcome this limitation, previous research introduces a new mechanism called covering subset which maintains a set of active nodes to ensure the immediate availability of data, even when all other nodes are turned off. this covering subset based mechanism works smoothly if no failure happens. However, a node in the covering subset may fail. In this paper, we study the energy-efficient failure recovery in Hadoop clusters. Rather than only using the replication as adopted by a Hadoop system by default, we investigate both replication and erasure coding as possible redundancy mechanisms. We develop failure recovery algorithms for both systems and analytically compare their energy efficiency.

关键词： Data transfer Decoding distributed databases Encoding Energy consumption Fault tolerance Fault tolerant systems Fault tolerant systems distributed databases Fault tolerance data transmission failure recovery DECODING energy consumption data availability Energy efficiency active nodes ENERGY ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

uOS : A resource rerouting middleware for ubiquitous games

uOS : A resource rerouting middleware for ubiquitous games

引用

IEEE 10th international conference on Ubiquitous Intelligence and computing (UIC) / IEEE 10th international conference on Autonomic and Trusted computing (ATC)

作者： Buzeto, Fabricio N. Capretz, Miriam A. M. Castanho, Carla D. Jacobi, Ricardo P. Univ Brasilia UnB Dept Ciencias Comp BR-70910900 Brasilia DF Brazil Univ Western Ontario Dept Elect Engn & Comp London ON N6A 5B9 Canada

ISBN: (纸本)9781479924813

Ubiquitous computing (ubicomp) relies on the computation distributed over the environment to simplify the tasks performed by its users. A smart space is an instance of a ubiquitous environment, composed of a dynamic and heterogeneous set of devices that interact to support the execution of distributed smart applications. In this context, mobile devices provide new resources when they join the environment, which disappear when they leave it. this introduces the challenge of self-adaptation, in which smart applications may either include new resources as they become available or replace them when they become unavailable. Ubiquitous games combine ubicomp and computer game technologies to enrich user's experience and fun. Such games may benefit from different input and output resources offered by mobile devices. To support the development and deployment of ubiquitous games, this work presents the uOS middleware. Using a DSOA (Device Service Oriented Architecture) based architecture and lightweight service discovery protocols, uOS ensures compatibility among resources, providing resource rerouting between heterogeneous and limited software and hardware platforms. the uMoleHunt game is presented to illustrate the practical application of uOS.

关键词： games middleware ubigames ubiquitous computing Ubiquitous computing Game theory Middleware Building construction ARCHITECTURE Environments setting device

来源：评论

学校读者我要写书评

暂无评论

Organizing of parallel Processing User-Friendly Dataflow-Oriented Environment for User Tasks Execution on Cluster

引用

12th international conference on parallel computing technologies (PaCT)

作者： Levin, Vladimir Kharitonov, Dmitry Odyakova, Daria FEBRAS Inst Automat & Control Proc Vladivostok 690041 Russia

ISBN: (纸本)9783642399572;9783642399589

In the paper we propose an approach for organizing user tasks on high performance computing systems of cluster type based on dataflow control. this mechanism helps to represent clusters as data file manipulation automata so every user task on remote supercomputers may be described from the point of their input and output files and meta data of these files. Also we present a particular description of a user task file processing mechanism for the system review both from metainformation point of view and dataflow point of view.

关键词： cloud computing distributed systems Petri nets high-performance systems dataflow workflow

来源：评论

学校读者我要写书评

暂无评论

Solving Quadratic Assignment Problem in parallel Using Local Search with Simulated Annealing Elements

Solving Quadratic Assignment Problem in Parallel Using Local...

引用

9th international conference on Digital technologies (DT)

作者： Kovac, Marian Univ Zilina Fac Management Sci & Informat Dept Math Methods Zilina Slovakia

ISBN: (纸本)9781479909247;9781479909230

the Quadratic Assignment Problem (QAP) is one of the hardest among the combinatorial optimization problems with wide practical applications. It is impossible to solve it by exact methods, since it is a NP-hard problem. this paper presents a parallel algorithm for solving the QAP based on well-known meta-heuristics, which are combined and improved, to reach the best possible results. there is detailed description of whole algorithm with explanation of impact of individual steps. Outcomes of the algorithm are compared with several other algorithms on some instances of QAPLIB. As it is obvious from summary, proposed algorithm achieves better results than other algorithms.

关键词： QAP meta-heuristics algorithm local search solving

来源：评论

学校读者我要写书评

暂无评论

Slot Selection Algorithms in distributed computing with Non-dedicated and Heterogeneous Resources

引用

12th international conference on parallel computing technologies (PaCT)

作者： Toporkov, Victor Toporkova, Anna Tselishchev, Alexey Yemelyanov, Dmitry Natl Res Univ MPEI Ul Krasnokazarmennaya 14 Moscow 111250 Russia Natl Res Univ Higher Sch Econom Moscow State Inst Elect & Math Moscow 109028 Russia European Org Nucl Res CERN CH-1211 Geneva Switzerland

ISBN: (纸本)9783642399572;9783642399589

In this work, we introduce slot selection and co-allocation algorithms for parallel jobs in distributed computing with non-dedicated and heterogeneous resources (clusters, CPU nodes equipped with multicore processors, networks etc.). A single slot is a time span that can be assigned to a task, which is a part of a job. the job launch requires a co-allocation of a specified number of slots starting synchronously. the challenge is that slots associated with different resources of distributed computational environments may have arbitrary start and finish points that do not match. Some existing algorithms assign a job to the first set of slots matching the resource request without any optimization (the first fit type), while other algorithms are based on an exhaustive search. In this paper, algorithms for effective slot selection of linear complexity on an available slots number are studied and compared with known approaches. the novelty of the proposed approach consists of allocating alternative sets of slots. It provides possibilities to optimize job scheduling.

关键词： distributed computing economic scheduling resource management slot job task batch

来源：评论

学校读者我要写书评

暂无评论

Cliff-Edge Consensus: Agreeing on the Precipice

引用

12th international conference on parallel computing technologies (PaCT)

作者： Taiani, Francois Porter, Barry Coulson, Geoff Raynal, Michel Univ Rennes 1 IRISA F-35014 Rennes France Inst Univ France Paris France Univ St Andrews Sch Comp Sci St Andrews KY16 9AJ Fife Scotland Univ Lancaster Sch Comp & Commun Lancaster LA1 4YW England

ISBN: (纸本)9783642399572;9783642399589

this paper presents a new form of consensus that allows nodes to agree locally on the extent of crashed regions in networks of arbitrary size. One key property of our algorithm is that it shows local complexity, i.e. its cost is independent of the size of the complete system, and only depends on the shape and extent of the crashed region to be agreed upon. In this paper, we motivate the need for such an algorithm, formally define this new consensus problem, propose a fault-tolerant solution, and prove its correctness.

关键词： distributed computing fault-tolerance failure detection consensus scalability

来源：评论

学校读者我要写书评

暂无评论

Topic 9: parallel and distributed Programming (Introduction)

Topic 9: Parallel and Distributed Programming (Introduction)

引用

19th international conference on Euro-Par

作者： Cunha, Jose Philippsen, Michael Talia, Domenico Varbanescu, Ana Lucia Universidade Nova de Lisboa Portugal Friedrich-Alexander-Universität Erlangen-Nürnberg Germany University of Calabria ICAR-CNR Italy Delft University of Technology Netherlands

ISBN: (纸本)9783642400476

this topic provides a forum for presentation of new results and practical experience in the development of parallel and distributed programs. the development of high-performance, correct, portable, and scalable parallel programs is a hard task, requiring advanced algorithms, realistic modeling, adequate programming abstractions and models, efficient design tools, high performance languages and libraries, and experimental evaluation. Current challenges in this topic are concerned with improved solutions for conciliating the transparency and expressiveness of the programming abstractions and models, with new issues arising in modern applications with increasing problem size and complexity, and in heterogeneous computing infrastructures with varying performance, scalability, failure and dynamic behaviors. this motivates for example, abstractions for handling concurrency, parallelism and distribution, and support for predictable performance, self-adaptation, fault-tolerance, and large-scale deployment.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Timed Resource Driven Automata Nets for distributed Real-Time Systems Modelling

引用

12th international conference on parallel computing technologies (PaCT)

作者： Bashkin, Vladimir A. Lomazova, Irina A. Novikova, Yulia A. Yaroslavl State Univ Yaroslavl 150000 Russia Natl Res Univ Higher Sch Econ Moscow 101000 Russia Russian Acad Sci Program Syst Inst Pereslavl Zalesskii 152020 Russia

ISBN: (纸本)9783642399572;9783642399589

the paper presents a formalism and a tool for modelling and analysis of distributed real-time systems of mobile agents. For that we use a time extension of our Resource Driven Automata Nets (TRDA-nets) formalism. A TRDA-net is a two-level system. the upper level represents distributed environment locations with a net of active resources. On the lower level agents are modeled by extended finite state machines, asynchronously consuming/producing shared resources through input/output system ports (arcs of the system net). We demonstrate modelling facilities of the formalism and show that specific layers of TRDA-nets can be translated into Timed Automata, as well as into Time Petri nets, thus TRDA-nets integrate merits of both formalisms.

关键词： distributed systems modeling Petri nets real-time systems timed automata verification

来源：评论

学校读者我要写书评

暂无评论

Developing and Optimizing parallel Programs with Algebra-Algorithmic and Term Rewriting Tools

Developing and Optimizing Parallel Programs with Algebra-Alg...

引用

9th international conference on Information and Communication technologies in Education, Research, and Industrial applications, ICTERI 2013

作者： Doroshenko, Anatoliy Zhereb, Kostiantyn Yatsenko, Olena Institute of Software Systems National Academy of Sciences of Ukraine Glushkov prosp. 40 03187 Kyiv Ukraine

ISBN: (纸本)9783319039978

An approach to program design and synthesis using algebra-algorithmic specifications and rewriting rules techniques is proposed. An algebra-algorithmic toolkit based on the approach allows building syntactically correct and easy-to-understand algorithm specifications. the term rewriting system supplements the algebra-algorithmic toolkit with facilities for transformation of the sequential and parallel algorithms, enabling performance improvement. We demonstrate the usage of the proposed tools with a simple example of parallelizing sequential program and improving performance of a parallel program, and also discuss possible applications in larger real-world projects. © Springer international Publishing Switzerland 2013.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Enhanced Differential Evolution Entirely parallel Method for Biomedical applications

引用

12th international conference on parallel computing technologies (PaCT)

作者： Kozlov, Konstantin Ivanisenko, Nikita Ivanisenko, Vladimir Kolchanov, Nikolay Samsonova, Maria Samsonov, Alexander M. State Polytech Univ Dept Computat Biol St Petersburg 195251 Russia SB RAS Inst Cytol & Genet Novosibirsk 630090 Russia Russian Acad Sci AF Ioffe Phys Tech Inst St Petersburg 194021 Russia

ISBN: (纸本)9783642399572;9783642399589

A considerable enhancement is proposed for the Differential Evolution Entirely parallel (DEEP) method developed recently. A new selection rule was implemented in order to increase the robustness of DEEP. To simplify the approach a population is not divided now into branches, instead of it, several oldest individuals are substituted with the same number of the best ones after the predefined number of iterations. the individuals are selected on the basis of the number of generations, in which they survived without any change. We demonstrate how the enhanced DEEP provides new solutions to problems with several objective functions.

关键词： differential evolution optimization biomedical applications

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 79 80 81 82 83 84 85 86 87 88 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：