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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,921 篇 会议
224 篇 期刊文献
173 册 图书
3 篇 学位论文

馆藏范围

11,321 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

6,670 篇 工学
- 6,102 篇 计算机科学与技术...
- 2,912 篇 软件工程
- 1,181 篇 电气工程
- 1,066 篇 信息与通信工程
- 479 篇 电子科学与技术（可...
- 358 篇 控制科学与工程
- 175 篇 仪器科学与技术
- 151 篇 机械工程
- 116 篇 动力工程及工程热...
- 112 篇 生物医学工程（可授...
- 101 篇 生物工程
- 87 篇 光学工程
- 87 篇 建筑学
- 69 篇 土木工程
- 68 篇 网络空间安全
- 65 篇 化学工程与技术
- 59 篇 材料科学与工程（可...
- 58 篇 安全科学与工程
1,465 篇 理学
- 975 篇 数学
- 310 篇 物理学
- 156 篇 系统科学
- 140 篇 统计学（可授理学、...
- 135 篇 生物学
- 83 篇 化学
898 篇 管理学
- 648 篇 管理科学与工程(可...
- 307 篇 图书情报与档案管...
- 290 篇 工商管理
144 篇 医学
- 120 篇 临床医学
- 62 篇 基础医学(可授医学...
62 篇 经济学
- 62 篇 应用经济学
55 篇 法学
34 篇 农学
26 篇 教育学
18 篇 文学
11 篇 军事学

主题

1,465 篇 parallel process...
583 篇 computer archite...
553 篇 distributed comp...
536 篇 application soft...
533 篇 computational mo...
528 篇 concurrent compu...
343 篇 hardware
318 篇 graphics process...
310 篇 scalability
307 篇 parallel program...
306 篇 graphics process...
304 篇 computer science
285 篇 runtime
263 篇 big data
263 篇 optimization
254 篇 parallel process...
227 篇 throughput
225 篇 processor schedu...
214 篇 resource managem...
209 篇 bandwidth

机构

31 篇 national laborat...
23 篇 science and tech...
21 篇 department of co...
19 篇 national laborat...
18 篇 university of ch...
17 篇 school of comput...
17 篇 institute of com...
16 篇 school of comput...
15 篇 college of compu...
15 篇 georgia inst tec...
15 篇 barcelona superc...
15 篇 department of co...
15 篇 intel corporatio...
14 篇 school of comput...
14 篇 chinese acad sci...
13 篇 tsinghua univ de...
13 篇 ibm thomas j. wa...
13 篇 cent s univ sch ...
13 篇 college of compu...
13 篇 ohio state univ ...

作者

21 篇 jack dongarra
16 篇 badia rosa m.
16 篇 liu jie
15 篇 wang guojun
15 篇 yijie wang
15 篇 a. choudhary
14 篇 anon
14 篇 kurt rothermel
13 篇 jun wang
13 篇 koldehofe boris
13 篇 mencagli gabriel...
13 篇 prodan radu
13 篇 wang yijie
12 篇 fahringer thomas
12 篇 dongsheng li
12 篇 zomaya albert y.
12 篇 navaux philippe ...
12 篇 yong dou
11 篇 fernandes luiz g...
11 篇 guangwen yang

语言

11,019 篇 英文
267 篇 其他
36 篇 中文
2 篇 俄文
2 篇 土耳其文
1 篇 德文

检索条件"任意字段=International Conference on Parallel and Distributed Processing Techniques and Applications"

共 11321 条记录，以下是3701-3710 订阅

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

详细简洁

排序：

Structural Clustering: A New Approach to Support Performance Analysis at Scale

Structural Clustering: A New Approach to Support Performance...

引用

international Symposium on parallel and distributed processing (IPDPS)

作者： Matthias Weber Ronny Brendel Tobias Hilbrich Kathryn Mohror Martin Schulz Holger Brunst Technische Universitat Dresden Germany

ISBN: (纸本)9781509021413

The increasing complexity of high performance computing systems creates high demands on performance tools and human analysts due to an unmanageable volume of data gathered for performance analysis. A promising approach for reducing data volume is classification of data from multiple processes into groups of similar behavior to aid in analyzing application performance and identifying hot spots. However, existing approaches for structural and temporal classification of performance data suffer from lack of scalability or produce misleading results. To address this problem, we present a novel and effective structural similarity measure to efficiently classify data from parallel processes and introduce a method for efficient storage of the classified data. Using four examples, we show how existing performance analysis techniques benefit from our structural classification. Finally, we present a case study with 15 applications on up to 65,536 parallel processes that demonstrates the generality and scalability of our classification approach.

关键词： Graphics processing units Performance analysis Scalability Instruction sets Lattices Atmospheric measurements

来源：评论

学校读者我要写书评

暂无评论

Efficient semantic-aware coflow scheduling for data-parallel jobs

Efficient semantic-aware coflow scheduling for data-parallel...

引用

IEEE international conference on Cluster Computing

作者： Ziyang Li Yiming Zhang Yunxiang Zhao Dongsheng Li National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology

ISBN: (纸本)9781509036547

This paper studies the communication pattern of data-parallel applications from the perspective of job execution, and discovers multiple inter-coflow dependencies. These inter-coflow dependencies, collectively named as semantic flow (seflow), can expose job-level semantics. It is observed that most distributed computing frameworks describe their job execution as directed acyclic graphs (DAG). So a seflow comprises not only all the coflows of a job but also the DAG-based relationship between them. Seflow, coflow and flow can be viewed as the top-down abstractions for communication of jobs.

关键词： Semantics distributed computing Sparks Scheduling algorithms Scheduling Schedules

来源：评论

学校读者我要写书评

暂无评论

Using HPX and OP2 for Improving parallel Scaling Performance of Unstructured Grid applications

Using HPX and OP2 for Improving Parallel Scaling Performance...

引用

international conference on parallel processing Workshops (ICPPW)

作者： Zahra Khatami Hartmut Kaiser J. Ramanujam The STE∥AR Group Baton Rouge Louisiana USA Center for Computation and Technology Louisiana State University

ISBN: (纸本)9781509028269

Computer scientists and programmers face the difficultly of improving the scalability of their applications while using conventional programming techniques only. As a base-line hypothesis of this paper we assume that an advanced runtime system can be used to take full advantage of the available parallel resources of a machine in order to achieve the highest parallelism possible. In this paper we present the capabilities of HPX - a distributed runtime system for parallel applications of any scale - to achieve the best possible scalability through asynchronous task execution [1]. OP2 is an active library which provides a framework for the parallel execution for unstructured grid applications on different multi-core/many-core hardware architectures [2]. OP2 generates code which uses OpenMP for loop parallelization within an application code for both single-threaded and multi-threaded machines. In this work we modify the OP2 code generator to target HPX instead of OpenMP, i.e. port the parallel simulation backend of OP2 to utilize HPX. We compare the performance results of the different parallelization methods using HPX and OpenMP for loop parallelization within the Airfoil application. The results of strong scaling and weak scaling tests for the Airfoil application on one node with up to 32 threads are presented. Using HPX for parallelization of OP2 gives an improvement in performance by 5%-21%. By modifying the OP2 code generator to use HPX's parallel algorithms, we observe scaling improvements by about 5% as compared to OpenMP. To fully exploit the potential of HPX, we adapted the OP2 API to expose a future and dataflow based programming model and applied this technique for parallelizing the same Airfoil application. We show that the dataflow oriented programming model, which automatically creates an execution tree representing the algorithmic data dependencies of our application, improves the overall scaling results by about 21% compared to OpenMP. Our results show

关键词： Automotive components parallel processing Scalability Programming Instruction sets Runtime Hardware

来源：评论

学校读者我要写书评

暂无评论

Unified weighted label propagation algorithm using connection factor 1

引用

12th international conference on Advanced Data Mining and applications, ADMA 2016

作者： Wang, Xin Jian, Songlei Lu, Kai Wang, Xiaoping College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (数字)9783319495866

ISBN: (纸本)9783319495859

With the social networks getting increasingly larger, fast community detection algorithms like the label propagation algorithm, are attracting more attention. But the label propagation algorithm deals vertices with no proper weight, which leads to the loss in the performance. We propose the connection factor of the vertex to measure its influence on the local connectivity. The connection factor can reveal the topological structure feature, and we propose a unified weight to modify the original label propagation algorithm. Experiments show that our Unified Weighted LPA has an average performance promotion from 5% to 10 %, in the best case more than 30%. © Springer international Publishing AG 2016.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

RPL: A Domain-Specific Language for Designing and Implementing parallel C++ applications

RPL: A Domain-Specific Language for Designing and Implementi...

引用

Euromicro conference on parallel, distributed and Network-Based processing

作者： V. Janjic C. Brown K. Mackenzie K. Hammond M. Danelutto M. Aldinucci J. Daniel Garcia Uni. of St Andrews UK Uni. of Pisa Italy Uni. of Torino Italy Uni. Carlos III Madrid Spain

parallelising sequential applications is usually a very hard job, due to many different ways in which an application can be parallelised and a large number of programming models (each with its own advantages and disadvantages) that can be used. In this paper, we describe a method to semi-automatically generate and evaluate different parallelisations of the same application, allowing programmers to find the best parallelisation without significant manual reengineering of the code. We describe a novel, high-level domain-specific language, Refactoring Pattern Language (RPL), that is used to represent the parallel structure of an application and to capture its extra-functional properties (such as service time). We then describe a set of RPL rewrite rules that can be used to generate alternative, but semantically equivalent, parallel structures (parallelisations) of the same application. We also describe the RPL Shell that can be used to evaluate these parallelisations, in terms of the desired extra-functional properties. Finally, we describe a set of C++ refactorings, targeting OpenMP, Intel TBB and FastFlow parallel programming models, that semi-automatically apply the desired parallelisation to the application's source code, therefore giving a parallel version of the code. We demonstrate how the RPL and the refactoring rules can be used to derive efficient parallelisations of two realistic C++ use cases (Image Convolution and Ant Colony Optimisation).

关键词： Skeleton Libraries parallel processing Pipelines parallel programming Writing

来源：评论

学校读者我要写书评

暂无评论

An OpenACC Optimizer for Accelerating Histogram Computation on a GPU

An OpenACC Optimizer for Accelerating Histogram Computation ...

引用

Euromicro conference on parallel, distributed and Network-Based processing

作者： Kei Ikeda Fumihiko Ino Kenichi Hagihara Graduate School of Information Science and Technology Osaka University Suita Osaka Japan

This paper presents a source-to-source OpenACC optimizer that automatically optimizes a histogram computation code for a graphics processing unit (GPU). parallel histogram computation codes typically deploy multiple copies of histograms and update them with atomic operations. This duplication method can be implemented as an OpenACC code. However, the structure of sequential code blocks must be manually rewritten owing to the limitation on OpenACC directives. Such a rewritten code does not always achieve the highest performance on arbitrary platforms, and thus, the duplication method degrades the performance portability of the code. To tackle this issue, we propose an optimizer that identifies histogram-related blocks in a naive OpenACC code and automatically rewrites the detected blocks such that multiple copies of histograms can be exploited for acceleration. In experiments, we apply our optimizer to three practical applications and investigate their performance on three platforms: an NVIDIA GPU, an AMD GPU and an Intel CPU. Experimental results show that our automated approach is useful for OpenACC codes to maximize the performance of histogram computation, and thereby enhancing the performance portability of the code.

关键词： Histograms Graphics processing units Instruction sets Acceleration Arrays Programming Tuning

来源：评论

学校读者我要写书评

暂无评论

Improving the performance of heterogeneous Hadoop cluster

Improving the performance of heterogeneous Hadoop cluster

引用

international conference on parallel distributed and Grid Computing (PDGC)

作者： Ch. Bhaskar Vishnu Vardhan Pallav Kumar Baruah Sri Sathya Sai Institute of Higher Learning Prasanthi Nilayam Andhra Pradesh IN Department of Mathematics and Computer Science Sri Sathya Sai Institute of Higher Learning Puttaparthi Anatapur India

ISBN: (纸本)9781509036707

With the development of information Technology, we can see an exponential growth in the amount of data that is being generated and used over the last decade. The need for storing the data and processing them in order to extract value from skew data has paved way for parallel, distributed processing applications like Hadoop. The current Hadoop implementation assumes that the compute capacity of all the nodes in a cluster are homogeneous in nature, but looking at the cloud infrastructure, we can see that different hardware configurations systems are being used which is logical. Hence, it is necessary to study the data placement policy where we can distribute the data based on the processing power of a node. In this paper, we propose a dynamic block placement strategy in Hadoop to distribute the input data blocks to the nodes based on the computing capacity of each node. The proposed algorithm which can adapt and balance data dynamically and reorganize the input data in HDFS according to the compute capability of each node in hadoop heterogeneous enviornment. The proposed method reduces the data transfer time to achieve improved performance. We ran benchmark applications against the proposed block placement strategy and original HDFS blocks placement strategy. The experimental results show that the dynamic data placement strategy can decrease the execution time and improve performance of hadoop heterogeneous cluster. Hadoop is designed to handle Big files and with less frequent updates. But nowadays many applications need to handle small files, which has become a pertinent issue for degradation of performance of an application on hadoop platform. Our proposed methods have shown good improvement of performance in these cases. we are able to see a speedup of 25.7x and 20x compared to the original Hadoop when ran on wordcount and grep benchmark applications.

关键词： Hardware Clustering algorithms distributed databases Containers Benchmark testing File systems Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Programming Model for distributed Infrastructures

Energy-Aware Programming Model for Distributed Infrastructur...

引用

Euromicro conference on parallel, distributed and Network-Based processing

作者： Francesc Lordan Jorge Ejarque Raül Sirvent Rosa M. Badia Universitat Politècnica de Catalunya (UPC) Barcelona Supercomputing Center Barcelona Spain Artificial Intelligence Research Institute (IIIA) Spanish National Research Council (CSIC)

Day after day, cloud technologies are more and more adopted by very diverse types of stakeholders, and this success creates a side-effect problem: the energy spent by this kind of infrastructures is growing bigger every day. With the objective of reducing energy consumption when programming applications for cloud infrastructures, we have implemented energy-aware mechanisms in the COMPSs Programming Model, inside the context of the ASCETiC Project. In this paper, we demonstrate that application-level scheduling can have a big impact on the energy consumed by an application when executed in a heterogeneous cloud. We have implemented an energy-aware scheduling mechanism in COMPSs, together with a versioning technique, and we have run experiments with a use case coming from the real estate sector that proves our hypotheses.

关键词： Energy consumption Runtime Cloud computing Programming profession Processor scheduling Green products

来源：评论

学校读者我要写书评

暂无评论

Refactoring Conventional Task Schedulers to Exploit Asymmetric ARM *** Architectures in Dense Linear Algebra

Refactoring Conventional Task Schedulers to Exploit Asymmetr...

引用

IEEE international Symposium on parallel and distributed processing Workshops and Phd Forum (IPDPSW)

作者： Luis Costero Francisco D. Igual Katzalin Olcoz Sandra Catalán Rafael Rodríguez-Sánchez Enrique S. Quintana-Ortí Dept. Arquitectura de Computadores y Automática Universidad Complutense de Madrid Madrid Spain Dept. Ingeniería y Ciencia de los Computadores Universidad Jaume I de Castellón Castellón Spain

ISBN: (纸本)9781509036837

Dealing with asymmetry in the architecture opens a plethora of questions from the perspective of scheduling task-parallel applications for which there exist early ad-hoc strategies embedded into an asymmetry-conscious runtimes. In this paper we take a different path that addresses the complexity of the problem at the library level, via a few asymmetry-aware fundamental kernels, hiding the architecture heterogeneity from the task scheduler. For the specific domain of dense linear algebra, we show that this elegant solution delivers much higher performance than a naive approach based on an asymmetry-oblivious scheduler. Furthermore, this solution also outperforms an ad-hoc asymmetry-aware scheduler furnished with sophisticated scheduling techniques.

关键词： Runtime Kernel Multicore processing parallel processing Program processors Linear algebra

来源：评论

学校读者我要写书评

暂无评论

Massively parallel technologies based on microelectromechanical systems for improving effective functioning of the aircraft

Massively parallel technologies based on microelectromechani...

引用

IEEE international conference on Methods and Systems of Navigation and Motion Control (MSNMC)

作者： Tovkach Serhii National Aviation University Kyiv Ukraine

ISBN: (纸本)9781509010547

The problem of development adaptive control systems based on microelectromechanical systems for reduce turbulent flow of the aircraft has been considered. Complex solution based on microelectromechanical systems and graphic processing platform NVIDIA Tegra, which includes massively parallel technology, has been proposed. It develops parallel processing software based on algorithms that delivers scaling and speed up on distributed memory systems for high performance applications. The distributed microelectromechanical systems technique involves spreading integrated sense-compute-act modules over areas to sense the physical world and act upon it. Tiny elements can reduce drag by sensing vortices and interacting with them. It will help to reach better maneuverability, increase the range of aircraft payload and capability.

关键词： Mathematical model Graphics processing units Aerospace control Computational modeling Aircraft Acceleration Aircraft navigation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 367 368 369 370 371 372 373 374 375 376 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：