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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

HPCS 2012 preface

HPCS 2012 preface

引用

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

作者： Pérez, María S. Nygård, Mads Peña, José M.

ISBN: (纸本)9781467323598

there have been nine previous conferences in which HPCS community has been consolidating, growing and getting more and more active. Even in such a complicated scenario, bearing a deep economic crisis and struggling against the difficult moments for both academia and industry, we have succeeded in putting together an interesting and representative program, in which the most advanced topics in high-performance, parallel and distributed computing, and simulation and modeling are met. © 2012 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Support for Management of Programming Assignments - Automated Grading

Support for Management of Programming Assignments - Automate...

引用

10th IEEE international conference on Emerging eLearning technologies and applications (ICETA)

作者： Paralic, M. Martoncik, J. Tech Univ Kosice Dept Comp & Informat Kosice Slovakia

ISBN: (纸本)9781467351225;9781467351201

In the paper we deal with question, how the practical skills in programming of complex - possibly distributed - systems can be achieved in an effective way. Based on our previous experience with the highly specialized system ShareMe, the generic system GLab is introduced. It offers learning environment that provides not only the description of the laboratory tasks to be implemented in Java, but also covers electronic submission, automatic grading and online access to grading and test results of any Java-based application. In distinction to ShareMe it is an open learning environment that could be used potentially for any software project implemented in Java. We focus on the subsystem called GLabTest that support automated grading and peer-to-peer system for sharing files ShareMe is used for its validation.

关键词： Automated grading E-learning Framework Programming Skills distributed Systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Allocation of hard real-time periodic tasks for reliability maximization in distributed systems

Allocation of hard real-time periodic tasks for reliability ...

引用

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

作者： Faragardi, Hamid Reza Shojaee, Reza Mirzazad-Barijough, Maziar Nosrati, Roozbeh Univ Tehran Sch Elect & Comp Engn Tehran Iran Anglia Ruskin Univ Fac Sci & Technol Dept Comp & Technol Cambridge Essex England

ISBN: (纸本)9781467351652;9780769549149

A real-time parallel application can be divided into a number of tasks and executed concurrently on distinct nodes of a distributed System (DS). distributed System Reliability (DSR) can be defined as the probability that all the tasks in the system run successfully. Due to different hazard rates of nodes and links, DSR critically depends on the optimal allocation of these tasks onto the available nodes. In this paper, we have presented a mathematical model for analyzing DSR in a DS on which hard real-time periodic tasks are executed. In addition, to maximize reliability besides satisfying the constraints, we have proposed an offline task allocation algorithm. the algorithm is a new swarm intelligence approach based on Ant Colony Optimization (ACO). For evaluating the algorithm, ACO is compared with Honey Bee Mating Optimization (HBMO) and Particle Swarm Optimization (PSO). Simulation results manifest that ACO produces better solutions than PSO and HBMO. Meanwhile, it leads to shorter execution time. the results also reveal the flexibility and scalability of the proposed algorithm.

关键词： distributed system reliability hard real-time system task allocation Ant Colony optimization

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Support for parallel I/O in Java HPC

Towards Efficient Support for Parallel I/O in Java HPC

引用

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

作者： Awan, Ammar Ahmad Ayub, Muhammad Sohaib Shafi, Aamir Lee, Sungyoung Kyung Hee Univ Dept Comp Engn Yongin South Korea Natl Univ Sci & Technol SEECS Islamabad Pakistan

ISBN: (纸本)9780769548791

Modern HPC applications put forward significant I/O requirements. To deal with them, MPI provides the MPI-IO API for parallel file access. ROMIO library implements MPI-IO and provides efficient support for parallel I/O in C and Fortran based applications. On the other hand, Java based MPI-like libraries such as MPJ Express and F-MPJ have emerged but they lack parallel I/O support. Little research has been done to provide Java based ROMIO-like libraries due to the non-availability of MPI-IO-like API for the Java language. In this paper, we take the first step towards the development of parallel I/O API in Java by evaluating the newly introduced Java NIO API versus the legacy Java I/O API. We propose two simple approaches for performing parallel file I/O using NIO and evaluate them on two different computational platforms. the implementation of proposed approaches exploits the view buffers concept of NIO API to perform efficient array based file I/O operations from multiple processes. We report encouraging speedups and suggest that design of a parallel I/O API in Java should be based on the NIO API.

关键词： Performance Evaluation parallel I/O in Java MPJ Express MPI-I/O

来源：评论

学校读者我要写书评

暂无评论

parallel IMPLEMENTATION OF LBP BASED FACE RECOGNITION ON GPU USING OPENCL

PARALLEL IMPLEMENTATION OF LBP BASED FACE RECOGNITION ON GPU...

引用

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

作者： Dwith, C. Y. N. Rathna, G. N. Natl Inst Technol Dept Elect & Commun Engn Warangal Andhra Pradesh India Indian Inst Sci Dept Elect Engn Bangalore Karnataka India

ISBN: (纸本)9780769548791

In this paper, we implement a novel parallelized approach of Local Binary Pattern (LBP) based face recognition algorithm on GPU. High performance rates have been achieved through maximizing the resource exploitation available in the GPU. the launch of GPU programming tools like Open source Computation Language (OpenCL) and (CUDA) have boosted the development of various applications on GPU. In this paper we implement a parallelized LBP algorithm on GPU using OpenCL programming tools. Programs developed under the OpenCL enable us to utilize GPU for general purpose computation with increased performance efficiency in terms of execution time. the experimental results based on the implementation on AMD 6500 GPU processor are observed to increase the computational performance of the system by to 30 folds in case of 1024x1024 images. the relative computational efficiency increases with increase in the size of the Image. this paper addresses several parallelization problems related to memory access and updating, divergent execution paths, understanding and realizing the OpenCL's concurrency and Execution models.

关键词： GPU OpenCL Face recognition Local Binary Patter

来源：评论

学校读者我要写书评

暂无评论

Efficient update of ghost regions using active messages

Efficient update of ghost regions using active messages

引用

19th international conference on High Performance computing (HiPC)

作者： Milthorpe, Josh Rendell, Alistair P. Australian Natl Univ Res Sch Comp Sci Canberra ACT Australia

ISBN: (纸本)9781467323703;9781467323727

the use of ghost regions is a common feature of many distributed grid applications. A ghost region holds local read-only copies of remotely-held boundary data which are exchanged and cached many times over the course of a computation. X10 is a modern parallel programming language intended to support productive development of distributed applications. X10 supports the "active message" paradigm, which combines data transfer and computation in one-sided communications. A central feature of X10 is the distributed array, which distributes array data across multiple places, providing standard read and write operations as well as powerful high-level operations. We used active messages to implement ghost region updates for X10 distributed arrays using two different update algorithms. Our implementation exploits multiple levels of parallelism and avoids global synchronization;it also supports split-phase ghost updates, which allows for overlapping computation and communication. We compare the performance of these algorithms on two platforms: an Intel x86-64 cluster over QDR InfiniBand, and a Blue Gene/P system, using both stand-alone benchmarks and an example computational chemistry application code. Our results suggest that on a dynamically threaded architecture, a ghost region update using only pairwise synchronization exhibits superior scaling to an update that uses global collective synchronization.

关键词： parallel programming models Partitioned Global Address Space (PGAS) X10 language active messages structured grids distributed arrays ghost regions lattice Boltzmann method Smooth Particle Mesh Ewald method

来源：评论

学校读者我要写书评

暂无评论

parallel computations in Java with PCJ library

Parallel computations in Java with PCJ library

引用

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

作者： Nowicki, Marek Bala, Piotr Faculty of Mathematics and Computer Science Nicolaus Copernicus University Chopina 12/18 87-100 Toruń Poland Interdisciplinary Centre for Mathematical and Computational Modelling University of Warsaw Pawińskiego 5a 02-106 Warsaw Poland

ISBN: (纸本)9781467323598

In this paper we present PCJ - a new library for parallel computations in Java inspired by the partitioned global address space approach. We present design details together with the examples of usage for basic operations such as a point-point communication, synchronization or broadcast. the PCJ library is easy to use and allows for a fast development of the parallel programs. It allows to develop distributed applications in easy way, hiding communication details which allows user to focus on the implementation of the algorithm rather than on network or threads programming. the objects and variables are local to the program threads however some variables can be marked shared which allows to access them from different nodes. For shared variables PCJ offers one-sided communication which allows for easy access to the data stored at the different nodes. the parallel programs developed with PCJ can be run on the distributed systems with different Java VM running on the nodes. In the paper we present evaluation of the performance of the PCJ communication on the state of art hardware. the results are compared with the native MPI implementation showing good performance and scalability of the PCJ. © 2012 IEEE.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Simulated Annealing with Coarse Graining and distributed computing

引用

10th Nordic international conference on Applied parallel computing - State of the Art in Scientific and parallel computing (PARA)

作者： Pedersen, Andreas Berthet, Jean-Claude Jonsson, Hannes Univ Iceland Inst Sci IS-107 Reykjavik Iceland

ISBN: (纸本)9783642281440;9783642281457

EON is a software package that uses distributed computing, systematic coarse graining and bookkeeping of minima and first order saddle points too speed up adaptive kinetic Monte Carlo simulations. It can be used to optimize continuously differentiable functions of a large number of variables. the approach is based on finding minima of the cost function by traversing low-lying, first-order saddle points from one minimum to another. A sequence of minima is thus generated in a path through regions of low values of the cost function with the possibility of 'temperature' controlled acceptance of higher lying saddle points. Searches of first order saddle points are carried out using distributed computing and the minimum-mode following method. Coarse graining which involves merging local minima into composite states and the recognition of previous search paths and saddle points are used to accelerate the exploration of the cost function. In addition to obtaining an estimate of the global minimum, a simulation using this approach gives information about the shape of the cost function in the regions explored. Example applications to the simulated annealing of a cluster of water molecules on a platinum metal surface and grain boundary in copper are presented.

关键词： optimization distributed computing coarse graining water cluster grain boundary

来源：评论

学校读者我要写书评

暂无评论

Implementation of 3D FFTs Across Multiple GPUs in Shared Memory Environments

Implementation of 3D FFTs Across Multiple GPUs in Shared Mem...

引用

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

作者： Nandapalan, Nimalan Jaros, Jiri Rendell, Alistair P. Treeby, Bradley Australian Natl Univ ANU Coll Engn & Comp Sci Res Sch Comp Sci Canberra ACT 0200 Australia

ISBN: (纸本)9780769548791

In this paper, a novel implementation of the distributed 3D Fast Fourier Transform (FFT) on a multi-GPU platform using CUDA is presented. the 3D FFT is the core of many simulation methods, thus its fast calculation is critical. the main bottleneck of the distributed 3D FFT is the global data exchange which must be performed. the latest version of CUDA introduces direct GPU-to-GPU transfers using a Unified Virtual Address space (UVA) that provides new possibilities for optimising the communication part of the FFT. Here, we propose different implementations of the distributed 3D FFT, investigate their behaviour, and compare their performance with the single GPU CUFFT and CPU-based FFTW libraries. In particular, we demonstrate the advantage of direct GPU-to-GPU transfers over data exchanges via host main memory. Our preliminary results show that running the distributed 3D FFT with four GPUs can bring a 12% speedup over the single node (CUFFT) while also enabling the calculation of 3D FFTs of larger datasets. Replacing the global data exchange via shared memory with direct GPU-to-GPU transfers reduces the execution time by up to 49%. this clearly shows that direct GPU-to-GPU transfers are the key factor in obtaining good performance on multi-GPU systems.

关键词： GPU UVA unified-virtual-address multi-GPU FFT distributed shared-memory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 84 85 86 87 88 89 90 91 92 93 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：