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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Statistical performance tuning of parallel Monte Carlo ocean color simulations

Statistical performance tuning of parallel Monte Carlo ocean...

引用

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

作者： Kajiyama, Tamito D'Alimonte, Davide Cunha, Jose C. Univ Nova Lisboa CITI Dept Informat FCT P-1200 Lisbon Portugal Univ Nova Lisboa CENTRIA Dept Informat FCT Lisbon Portugal

ISBN: (纸本)9780769548791

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.

关键词： High-performance computing Adaptive computing Problem-solving environment

来源：评论

学校读者我要写书评

暂无评论

Can We Make It Faster? Efficient May-Happen-in-parallel Analysis Revisited

Can We Make It Faster? Efficient May-Happen-in-Parallel Anal...

引用

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

作者： Chen, Congming Huo, Wei Li, Lung Feng, Xiaobing Xing, Kai Chinese Acad Sci State Key Lab Comp Architecture Beijing Peoples R China Chinese Acad Sci Grad Univ Beijing Peoples R China Univ Sci & Technol China Sch Comp Sci Anhui Peoples R China

ISBN: (纸本)9780769548791

May-Happen-in-parallel (MHP) analysis is a very important and fundamental mechanism to facilitate concurrent program analysis, optimization and even concurrency bug detection. However, the inefficiency in its design and implementation keeps MHP analysis away from being practical and effective. In this paper, we investigate the state-of-art of iterative data flow based (IDFB) MHP analysis and propose a new design and corresponding systematic implementation. Specifically, we address the most severe efficiency problems in node process order of the work-list in the original approach, and resolve them in our design and implementation by using the concept of parallel level to avoid redundant node visits. Our intensive experimental study shows that the proposed design and implementation have a relative speed up of 29.02x compared with the original implementation, moreover, it achieves a relative speed up of 10.00x comparing to the state-of-art of non-IDFB approach which is claimed to be more efficient than the original IDFB approach. Our design and implementation are capable of achieving an order of magnitude efficiency improvement comparing to both IDFB and non-IDFB approaches.

关键词： Concurrent Program Control Flow Analysis Conservative Efficiency Precision

来源：评论

学校读者我要写书评

暂无评论

Breaking weak 1024-bit RSA keys with CUDA

Breaking weak 1024-bit RSA keys with CUDA

引用

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

作者： Scharfglass, Kerry Weng, Darrin White, Joseph Lupo, Christopher Calif Polytech State Univ San Luis Obispo Dept Comp Sci San Luis Obispo CA 93407 USA

ISBN: (纸本)9780769548791

An exploit involving the greatest common divisor (GCD) of RSA moduli was recently discovered [1]. this paper presents a tool that can efficiently and completely compare a large number of 1024-bit RSA public keys, and identify any keys that are susceptible to this weakness. NVIDIA's graphics processing units (GPU) and the CUDA massively-parallel programming model are powerful tools that can be used to accelerate this tool. Our method using CUDA has a measured performance speedup of 27.5 compared to a sequential CPU implementation, making it a more practical method to compare large sets of keys. A computation for finding GCDs between 200,000 keys, i.e., approximately 20 billion comparisons, was completed in 113 minutes, the equivalent of approximately 2.9 million 1024-bit GCD comparisons per second.

关键词： CUDA RSA greatest common divisor parallel computation

来源：评论

学校读者我要写书评

暂无评论

An Implementation of parallel 1-D FFT on the K computer

An Implementation of Parallel 1-D FFT on the K computer

引用

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

作者： Takahashi, Daisuke Uno, Atsuya Yokokawa, Mitsuo Univ Tsukuba Fac Engn Tsukuba Ibaraki 3058573 Japan Next Generat Supercomp R&D Ctr Dev Grp Kobe Hyogo 6500047 Japan

ISBN: (纸本)9780769547497

In this paper, we propose an implementation of a parallel one-dimensional fast Fourier transform (FFT) on the K computer. the proposed algorithm is based on the six-step FFT algorithm, which can be altered into the recursive six-step FFT algorithm to reduce the number of cache misses. the recursive six-step FFT algorithm improves performance by utilizing the cache memory effectively. We use the recursive six-step FFT algorithm to implement the parallel one-dimensional FFT algorithm. the performance results of one-dimensional FFTs on the K computer are reported. We successfully achieved a performance of over 18 TFlops on 8192 nodes of the K computer (82944 nodes, 128 GFlops/node, 10.6 PFlops peak performance) for a 2(41)-point FFT.

关键词： Fast Fourier transform distributed-memory parallel computer all-to-all communication

来源：评论

学校读者我要写书评

暂无评论

Improving Application Availability in Wireless Sensor Networks with Energy-Harvesting Capability

Improving Application Availability in Wireless Sensor Networ...

引用

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

作者： Rentifis, Ilias Tziritas, Nikos Lampsas, Petros Lalis, Spyros Loukopoulos, thanasis Univ Thessaly Comp & Commun Engn Dept Thessaloniki Greece Chinese Acad Sci Shenzhen Inst Adv Technol Beijing Peoples R China Technol Educ Inst Lamia Informat & Comp Technol Dept Lamia Greece

ISBN: (纸本)9780769548791

We assume a wireless sensor and actuator network with nodes that can harvest energy from the environment, and an application deployed in this network, which is structured as a set of cooperating mobile components that can be placed on any node that provides the required sensor and actuator resources. We propose algorithms that take into account the energy consumption rate of agents as well as energy reserves and harvesting rate of nodes, and decide about the migration of agents in order to improve application availability. Initial evaluation results via simulation show that application availability can be greatly improved compared to having a static application placement.

关键词： placement algorithms energy-awareness mobile agents wireless sensor networks distributed systems

来源：评论

学校读者我要写书评

暂无评论

A Java hybrid compiler for shared memory parallel programming

A Java hybrid compiler for shared memory parallel programmin...

引用

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

作者： Senghor, Abdourahmane Konate, Karim Cheikh Anta Diop Univ Dakar Dept Math & Informat Dakar Senegal

the purpose of this paper is to design and implement a hybrid compiler that combines JOMP9;s directives with javar9;s annotations in order to obtain a more performing compiler. this is an original approach and c... 详细信息

ISBN: (纸本)9780769548791

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 re-implement 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.

关键词： JOMP javar JavaCC directive annotation hybrid compiler

来源：评论

学校读者我要写书评

暂无评论

Non-Clairvoyant Assignment of Bag-of-Tasks applications Across Multiple Clouds

Non-Clairvoyant Assignment of Bag-of-Tasks Applications Acro...

引用

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

作者： HoseinyFarahabady, M. Lee, Young Choon Zomaya, Albert Y. Univ Sydney Sch Informat Technol Ctr Distributed & High Performance Comp Sydney NSW 2006 Australia

ISBN: (纸本)9780769548791

Bag-of-Tasks applications are often composed of a large number of independent tasks;hence, they can easily scale out. With public clouds, the (dynamic) expansion of resource capacity in private clouds is much facilitated. Clearly, cost efficiently running BoT applications in a multi-cloud environment is of great practical importance. In this paper, we investigate how efficiently multiple clouds can be exploited for running BoT applications and present a fully polynomial time randomized approximation scheme (FPRAS) as a novel task assignment algorithm for BoT applications. the resulting task assignment can be optimized in terms of cost, makespan or the tradeoff between them. the objective function incorporated into our algorithm is devised in the way the optimization objective is tunable based on user preference. Our task assignment decisions are made without any prior knowledge of the processing time of tasks, i.e., non-clairvoyant task assignment. We adopt a Monte Carlo sampling method to estimate unknown task running time. the experimental results shows our algorithm approximates the optimal solution with little overhead.

关键词： Non-clairvoyant task assignment scalability cloud computing Bag of Task application cost efficiency

来源：评论

学校读者我要写书评

暂无评论

HADAB: Enabling Fault Tolerance in parallel applications Running in distributed Environments 1

引用

9th international conference on parallel Processing and Applied Mathematics (PPAM)

作者： Boccia, Vania Carracciuolo, Luisa Laccetti, Giuliano Lapegna, Marco Mele, Valeria Univ Naples Federico II Dept Appl Math Complesso Univ Monte S AngeloVia Cintia I-80126 Naples Italy Italian Natl Res Council Rome Italy

ISBN: (数字)9783642314643

ISBN: (纸本)9783642314636;9783642314643

the development of scientific software, reliable and efficient, in distributed computing environments, requires the identification and the analysis of issues related to the design and the deployment of algorithms for high-performance computing architectures and their integration in distributed contexts. In these environments, indeed, resources efficiency and availability can change unexpectedly because of overloading or failure i.e. of both computing nodes and interconnection network. the scenario described above, requires the design of mechanisms enabling the software to "survive" to such unexpected events by ensuring, at the same time, an effective use of the computing resources. Although many researchers are working on these problems for years, fault tolerance, for some classes of applications is an open matter still today. Here we focus on the design and the deployment of a checkpointing/migration system to enable fault tolerance in parallel applications running in distributed environments. In particular we describe details about HADAB, a new hybrid checkpointing strategy, and its deployment in a meaningful case study: the PETSc Conjugate Gradient algortithm implementation. the related testing phase has been performed on the University of Naples distributed infrastructure (***.P.E. infrastructure).

关键词： Fault tolerance checkpointing PETSc library HPC and distributed environments

来源：评论

学校读者我要写书评

暂无评论

A QoS Scheduling Scheme with Availability Constraint in distributed Systems

A QoS Scheduling Scheme with Availability Constraint in Dist...

引用

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

作者： Tong, Zhao Li, Kenli Xiao, Zheng Qin, Xiao Hunan Univ Coll Informat Sci & Engn Changsha 410082 Hunan Peoples R China Auburn Univ Dept Comp Sci & Software Engn Auburn AL USA

ISBN: (纸本)9780769548791

An efficient resource management mechanism is important in a heterogeneous system to discover available resources, to allocate an appropriate subset of resources to applications, and to map data or tasks onto selected resources. the key component, tasks scheduling, draws our attention. Makespan is the principal concern many existing researches. But, other QoS requirements are also important in more and more realistic applications. Like Grid service it is expected that the service provider be reliable, robust, or highly available. In this study, an existing availability-aware scheduling model called SSAC is investigated first. then, we proposed an optimization approach to increase the availability and to reduce the makespan of tasks running in heterogeneous systems. three quantitative conditions are used to guide the optimization. Our experimental results show that compared with three existing solutions (Minmin, SSAC and ACO), our algorithm significantly improves the availability and performance of multiclass tasks running in heterogeneous systems.

关键词： Heterogeneous systems Task scheduling QoS Scheduling Availability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：