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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A Decentralized Load Balancing Approach for parallel Search-Tree Optimization

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

引用

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

作者： F.N. Abu-Khzam A.E. Mouawad Lebanese American University Beirut Beirut LB University of Waterloo Waterloo ON CA

ISBN: (纸本)9781467357043

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.

关键词： Heuristic algorithms Load management Network topology Supercomputers Optimization Topology Scalability

来源：评论

学校读者我要写书评

暂无评论

Models to Solve the Duplication Problem in Treaty Systems

Models to Solve the Duplication Problem in Treaty Systems

引用

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

作者： Yining Zhao Alan Wood Department of Computer Science University of York York UK

ISBN: (纸本)9781467357043

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.

关键词： Kernel Access control Memory management Logic gates distributed computing Computational modeling Computer science

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Performance of a parallel Multiobjective Artificial Bee Colony Algorithm for Inferring Phylogenies on Multicore Architectures

Evaluating the Performance of a Parallel Multiobjective Arti...

引用

international Symposium on parallel and distributed Processing with applications, ISPA

作者： Sergio Santander-Jiménez Miguel A. Vega-Rodríguez Juan A. Gómez-Pulido Juan M. S'nchez-Pérez University of Extremadura Department of Technologies of Computers and Communications ARCO Research Group. Escuela Politecnica Campus Universitario s/n Cáceres SPAIN Universidad de Extremadura Caceres Extremadura ES

A wide variety of optimization problems requires the combination of Bioinspired and parallel computing to address the complexity needed to get optimal solutions in reduced times. the multicore era allows the researcher to exploit modern arqitectures to resolve these NP-Hard problems. Inferring phylogenetic trees which describe a hypothesis of the evolution of species is a well-known example of this kind of problems. As the space of possible tree topologies increases exponentially with the number of species, exhaustive searches cannot be applied. Also, additional difficulties arise when we must consider simultaneously multiple optimality measures to resolve the problem. In this paper, we report a performance study on multicore machines of a parallel multiobjective adaptation of the Artificial Bee Colony algorithm for inferring phylogenies according to the maximum parsimony and maximum likelihood criteria. Experimental results reveal that our proposal can improve other approaches based on advanced High Performance computing techniques on large data sets.

关键词： Phylogeny parallel processing Algorithm design and analysis Optimization Topology Multicore processing Vegetation

来源：评论

学校读者我要写书评

暂无评论

Algorithmic strategies for optimizing the parallel reduction primitive in CUDA

Algorithmic strategies for optimizing the parallel reduction...

引用

2012 10th Annual international conference on High Performance computing and Simulation, HPCS 2012

作者： Martín, Pedro J. Ayuso, Luis F. Torres, Roberto Gavilanes, Antonio Departamento de Sistemas Informáticos Y Computación Universidad Complutense de Madrid Madrid Spain

ISBN: (纸本)9781467323598

Many general-purpose applications exploit Graphics Processing Units (GPUs) by executing a set of well-known dataparallel primitives. those primitives are usually invoked from the host many times, so their throughput has a great impact on the performance of the overall system. thus, the study of novel algorithmic strategies to optimize their implementation on current devices is an interesting topic to the GPU community. In this paper we focus on optimizing the reduction primitive, which merely reduces a data sequence into a single value using a binary associative operator. Although tree-based and sequential-based algorithms have been already implemented on GPUs, a comparison of both algorithm performance had not been carried out yet. thus, our first contribution is to present an experimental study of state-of-the-art reduction algorithms on CUDA. Next we introduce two algorithmic optimizations that are integrated into the fastest solution (a sequential-based algorithm), improving its throughput even more. Finally, we replicate this methodology to the segmented version of the primitive, which applies when the input is composed of several independent segments. In this case, it is not clear which algorithm exhibits the best performance, since throughput deeply depends on the distribution of segments along the input. According to our results, tree-based algorithms run faster for small segments, while sequential methods are better for medium and large ones. © 2012 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A Java Hybrid Compiler for Shared Memory parallel Programming

A Java Hybrid Compiler for Shared Memory Parallel Programmin...

引用

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

作者： Abdourahmane Senghor Karim Konate Department of Mathematics and Informatics Cheikh Anta Diop University Dakar Senegal

ISBN: (纸本)9781467357043

the purpose of this paper is to design and implement a hybrid compiler that combines JOMP's directives with javar's annotations in order to obtain a more performing compiler. this is an original approach and consists of pooling the advantages of those two compilers while fixing some of their issues. However the achievement of this aim is facing the issue of the difference of implementation of these two compilers because JOMP is implemented in Java while javar is implemented in C language. We propose to entirely reimplement javar in Java by using JavaCC. thereafter, we present the implementation of the hybrid compiler. In the experiments, we propose to parallelize the matrix sort program by using this hybrid compiler. the results of experiments and the mathematical demonstration lead us to state that dealing with this hybrid compiler gives performances better or equal to the best one between javar and JOMP.

关键词： Java Synchronization Program processors parallel processing Arrays parallel programming Libraries

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

作者： Zunce Wei Dhrubajyoti Goswami Department of Computer Science and Software Engineering Concordia University Montreal QUE Canada

ISBN: (纸本)9781467357043

Group check pointing is a fix between global check pointing 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 check pointing, 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.

关键词： Synchronization Delays Checkpointing Protocols Pipelines Runtime Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Cross Stratum Optimization (CSO) Enabled PCE Architecture

Cross Stratum Optimization (CSO) Enabled PCE Architecture

引用

international Symposium on parallel and distributed Processing with applications, ISPA

作者： Dhruv Dhody Young Lee Hui Yang USA Innovation Center Huawei Technologies Company Limited Plano TX USA India R&D Center Huawei Technol. Bangalore India State Key Laboratory of Information Photonics and Optical Communications Beijing University of Posts and Telecommunications Beijing China

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.

关键词： Optimization Computer architecture Servers Protocols Centralized control Joints Logic gates

来源：评论

学校读者我要写书评

暂无评论

Towards big linked data: A large-scale, distributed semantic data storage

Towards big linked data: A large-scale, distributed semantic...

引用

14th international conference on Information Integration and Web-Based applications and Services, iiWAS 2012

作者： Hu, Bo Carvalho, Nuno Laera, Loredana Matsutsuka, Takahide Fujitsu Laboratories of Europe Hayes Park Central Middlesex UB4 8FE United Kingdom

ISBN: (纸本)9781450313063

In light of the challenges of effectively managing Big Data, we are witnessing a gradual shift towards the increasingly popular Linked Open Data (LOD) paradigm. LOD aims to impose a machine-readable semantic layer over structured as well as unstructured data and hence automate some data analysis tasks that are not designed for computers. the convergence of Big Data and LOD is, however, not straightforward: the semantic layer of LOD and the Big Data large scale storage do not get along easily. Meanwhile, the sheer data size envisioned by Big Data denies certain computationally expensive semantic technologies, rendering the latter much less efficient than their performance on relatively small data sets. In this paper, we propose a mechanism allowing LOD to take advantage of existing large-scale data stores while sustaining its "semantic" nature. We demonstrate how RDF-based semantic models can be distributed across multiple storage servers and we examine how a fundamental semantic operation can be tuned to meet the requirements on distributed and parallel data processing. Our future work will focus on stress test of the platform in the magnitude of tens of billions of triples, as well as comparative studies in usability and performance against similar offerings. © 2012 ACM.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Adaptive Computation Offloading from Mobile Devices into the Cloud

Adaptive Computation Offloading from Mobile Devices into the...

引用

international Symposium on parallel and distributed Processing with applications, ISPA

作者： Dejan Kovachev Tian Yu Ralf Klamma Information Systems and Database Technologies RWTH Aachen University Aachen Germany

the inherently limited processing power and battery lifetime of mobile phones hinder the possible execution of computationally intensive applications like content-based video analysis or 3D modeling. Offloading of computationally intensive application parts from the mobile platform into a remote cloud infrastructure or nearby idle computers addresses this problem. this paper presents our Mobile Augmentation Cloud Services (MACS) middleware which enables adaptive extension of Android application execution from a mobile client into the cloud. applications are developed by using the standard Android development pattern. the middleware does the heavy lifting of adaptive application partitioning, resource monitoring and computation offloading. these elastic mobile applications can run as usual mobile application, but they can also reach transparently remote computing resources. Two prototype applications using the MACS middleware demonstrate the benefits of the approach. the evaluation shows that applications, which involve complicated algorithms and large computations, can benefit from offloading with around 95% energy savings and significant performance gains compared to local execution only.

关键词： Mobile communication Middleware Smart phones Hardware Computational modeling Androids

来源：评论

学校读者我要写书评

暂无评论

Statistical Performance Tuning of parallel Monte Carlo Ocean Color Simulations

Statistical Performance Tuning of Parallel Monte Carlo Ocean...

引用

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

作者： Tamito Kajiyama Davide D'Alimonte José C. Cunha CITI Department Informática FCT Universidade Nova de Lisboa Portugal CITI FCT Universidade Nova de Lisboa

ISBN: (纸本)9781467357043

Statistical performance tuning of a parallel Monte Carlo (MC) radiative transfer code for ocean color (OC) applications is presented. A low observed-to-peak performance ratio due to highly sparse computations is compensated by online and offline tuning techniques based on a statistical indicator of products accuracy. Run-time adaptive control employs the accuracy indicator to set up two complementary tuning criteria: one general to MC computations and the other specific to OC applications. the same accuracy indicator is also used for pre-execution tuning of a threshold parameter. Numerical simulations of real case scenarios showed that the proposed methods consistently led to faster runs, while satisfying application accuracy requirements. Specifically, speed-ups range from 2.17 to 7.44 times when compared with the un-optimized version of the MC code. the applied techniques are orthogonal to parallelization, so that the reported performance gains are further amplified by parallel speed-ups.

关键词： Photonics Radiometry Tuning Accuracy Adaptation models Trajectory Sea surface

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 90 91 92 93 94 95 96 97 98 99 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：