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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
225 篇 期刊文献
173 册 图书
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

6,671 篇 工学
- 6,103 篇 计算机科学与技术...
- 2,912 篇 软件工程
- 1,181 篇 电气工程
- 1,066 篇 信息与通信工程
- 478 篇 电子科学与技术（可...
- 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...
570 篇 distributed comp...
536 篇 application soft...
534 篇 computational mo...
528 篇 concurrent compu...
350 篇 hardware
317 篇 graphics process...
310 篇 scalability
309 篇 graphics process...
308 篇 parallel program...
304 篇 computer science
285 篇 runtime
263 篇 big data
263 篇 optimization
260 篇 parallel process...
229 篇 processor schedu...
227 篇 throughput
218 篇 resource managem...
206 篇 bandwidth

机构

31 篇 national laborat...
23 篇 science and tech...
21 篇 department of co...
19 篇 national laborat...
18 篇 university of ch...
18 篇 institute of com...
17 篇 school of comput...
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
16 篇 a. choudhary
15 篇 wang guojun
15 篇 yijie wang
15 篇 kurt rothermel
14 篇 anon
13 篇 jun wang
13 篇 koldehofe boris
13 篇 mencagli gabriel...
13 篇 prodan radu
13 篇 wang yijie
13 篇 hai jin
12 篇 fahringer thomas
12 篇 dongsheng li
12 篇 zomaya albert y.
12 篇 navaux philippe ...
12 篇 yong dou
11 篇 fernandes luiz g...

语言

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

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

共 11322 条记录，以下是3781-3790 订阅

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

详细简洁

排序：

parallel Bin-Occupancy Filter for Image Observation

Parallel Bin-Occupancy Filter for Image Observation

引用

Proceedings of the Digital Image Computing: Technqiues and applications (DICTA)

作者： Ran Zhu Yunli Long Jungang Yang Wei An National University of Defense Technology Changsha Hunan CN

We present a recursive track-before-detect (TBD) algorithm based on the bin-occupancy filter for multi-target tracking from image observations by asking a different question: "Is there a target within a given pixel?" Analytic posterior probability distribution of the bin-state is derived for image measurements under the non-overlapping assumption. Coupled with the intrinsic grid characteristic of its measurement-space, the proposed algorithm can be regarded as a fully discrete version of the traditional probability hypothesis density (PHD) filter for TBD via quantized state-space modeling. parallel grid implementation is also discussed in order to meet the requirement for realtime processing applications. Simulation results are presented to demonstrate the effectiveness of the proposed algorithm for tracking targets with low signal-to- noise ratio (SNR).

关键词： Target tracking Mathematical model Probability distribution Radio frequency Hardware Real-time systems

来源：评论

学校读者我要写书评

暂无评论

A new emigrant creation strategy based on local best sources for parallel Artificial Bee Colony algorithm

A new emigrant creation strategy based on local best sources...

引用

IEEE Signal processing and Communications applications (SIU)

作者： Derviş Karaboğa Selçuk Aslan Erciyes Universitesi Kayseri Kayseri TR

Artificial Bee Colony algorithm, inspired by the foraging behavior of real honey bees, is one of the most important swarm intelligence based optimization algorithms. Like other population based evolutionary computation techniques, Artificial Bee Colony algorithm is suitable for parallelization on distributed architectures. In this paper, we presented a new emigrant creation strategy that is being distributed between subcolonies running simultaneously on the independent compute nodes. The running times and objective function values obtained by the parallelized Artificial Bee Colony algorithm with the proposed model on different number of compute nodes are compared with the sequential counterpart of the algorithm and it is seen that convergence performance of the parallelized Artificial Bee Colony algorithm is significantly improved with the proposed emigrant creation strategy.

关键词： Standards Particle swarm optimization Optimization Sociology Statistics Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Towards fast scalable solvers for charge equilibration in molecular dynamics applications

Towards fast scalable solvers for charge equilibration in mo...

引用

7th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems, ScalA 2016

作者： O'Hearn, Kurt A. Aktulga, Hasan Metin Department of Computer Science and Engineering Michigan State University East LansingMI United States

ISBN: (纸本)9781509052226

Including atom polarizability in molecular dynamics (MD) simulations is important for high-fidelity simulations. Solvers for charge models that are used to dynamically determine atom polarizations constitute significant bottlenecks in terms of time-to-solution and the overall scalability of polarizable and reactive force fields. The objective of this work is to improve the performance of the charge equilibration (QEq) method on shared memory architectures. A number of parallel incomplete LU-based preconditioning techniques are explored to enhance the performance of the Krylov subspace methods used in the QEq model. Detailed analysis of how these techniques effect convergence rate and the overall solver performance is presented. ILU-based schemes which produce good quality factors with relatively low number of nonzeros have been observed to yield significant speedups over the diagonal inverse baseline preconditioner. These results are significant as they can enable efficient simulations of moderate-sized systems on a single node with several cores, and also because they can constitute the future building blocks for distributed memory parallel solvers. © 2016 IEEE.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Exploiting Maximal Overlap for Non-Contiguous Data Movement processing on Modern GPU-Enabled Systems

Exploiting Maximal Overlap for Non-Contiguous Data Movement ...

引用

international Symposium on parallel and distributed processing (IPDPS)

作者： C-H. Chu K. Hamidouche A. Venkatesh D. S. Banerjee H. Subramoni Dhabaleswar K. Panda Department of Computer Science and Engineering The Ohio State University Columbus OH USA

ISBN: (纸本)9781509021413

GPU accelerators are widely used in HPC clusters due to their massive parallelism and high throughput-per-watt. Data movement continues to be the major bottleneck on GPU clusters, more so when data is non-contiguous, which is common in scientific applications. CUDA-Aware MPI libraries optimize the non-contiguous data movement processing using latency oriented techniques such as using GPU kernels to accelerate the packing/unpacking operations. Although they optimize the latency of a single operation, the inherent restrictions of the designs limit their efficiency for throughput oriented patterns. Indeed, none of the existing designs fully exploit the massive parallelism of the GPUs to provide high throughput and efficient resources utilization by enabling maximal overlap. In this paper, we propose novel designs for CUDA-Aware MPI libraries to achieve efficient GPU resource utilization and maximal overlap between CPUs and GPUs for non-contiguous data processing and movement. The proposed designs take advantage of several CUDA features, such as Hyper-Q/multi-streams and callback function, to deliver high performance and efficiency. To the best of our knowledge, this is the first such study to provide high throughput and efficient resource utilization for non-contiguous MPI data processing and movement to/from GPUs. The performance evaluation with the proposed designs using DDTBench shows up to 54%, 67%, 61% performance improvement on the SPECFEM3D_oc, SPECFEM3D_cm and WRF_y_sa benchmarks respectively for intra-node inter-GPU ping-pong experiments. The proposed designs also deliver up to 33% improvement on the total execution time over the existing designs for the HaloExchange-based application kernel that models the communication pattern of the MeteoSwiss weather forecasting model over 32 GPU nodes on Wilkes GPU cluster.

关键词： Graphics processing units Kernel Programming parallel processing Synchronization Throughput Data processing

来源：评论

学校读者我要写书评

暂无评论

Towards Resource Disaggregation — Memory Scavenging for Scientific Workloads

Towards Resource Disaggregation — Memory Scavenging for Sci...

引用

IEEE international conference on Cluster Computing

作者： Alexandru Uta Ana-Maria Oprescu Thilo Kielmann Amsterdam Department of Informatics The Netherlands Computer Science Institute Vrije Universiteit Amsterdam The Netherlands

ISBN: (纸本)9781509036547

Compute clusters, consisting of many, uniformly built nodes, are used to run a large spectrum of different workloads, like tightly coupled (MPI) jobs, MapReduce, or graph-processing data-analytics applications, each of which with their own resource requirements. Many studies consistently highlight two types of under-utilized cluster resources: memory (up to 50%) and network. In this work, we take a step towards (software) resource disaggregation, and therefore increased resource utilization, by designing a memory scavenging technique that makes unused memory available to applications on other cluster nodes. We implement this technique in MemFSS, an in-memory distributed file system. The scavenging MemFSS extends its storage space by taking advantage of the unused memory and bandwidth of cluster nodes already running other tenants' applications. Our experiments show that our memory scavenging approach incurs negligible overhead (below 10%) for most tenant applications, while the compute resource comsumption of MemFSS applications is largely reduced (by 17%-74%).

关键词： Bandwidth Memory management Resource management parallel processing Protocols Servers Scalability

来源：评论

学校读者我要写书评

暂无评论

On a Pipeline-Based Architecture for parallel Visualization of Large-Scale Scientific Data

On a Pipeline-Based Architecture for Parallel Visualization ...

引用

international conference on parallel processing Workshops (ICPPW)

作者： Dongliang Chu Chase Q. Wu Department of Computer Science New Jersey Institute of Technology Newark NJ USA

ISBN: (纸本)9781509028269

Many extreme-scale scientific applications generate colossal amounts of data that require a large number of processors for parallel visualization. Among the three well-known visualization schemes, i.e. sort-first/middle/last, sort-last, which is comprised of two stages, i.e. image rendering and composition, is often preferred due to its adaptability to load balance. We propose a very-high-speed pipeline-based architecture for parallel sort-last visualization of big data by developing and integrating three component techniques: i) a fully parallelized per-ray integration method that significantly reduces the number of iterations required for image rendering, ii) a real-time over operator that not only eliminates the restriction of pre-sorting and order-dependency, but also facilitates a high degree of parallelization for image composition, and iii) a novel sort-last visualization pipeline that overlaps rendering and composition to completely avoid waiting time between these two stages. The performance superiority of the proposed parallel visualization architecture is evaluated through rigorous theoretical analyses and further verified by extensive experimental results from the visualization of various real-life scientific datasets on a high-performance visualization cluster.

关键词： Data visualization Rendering (computer graphics) Computer architecture Big data parallel processing Real-time systems Pipelines

来源：评论

学校读者我要写书评

暂无评论

BRPS: A Big Data Placement Strategy for Data Intensive applications

BRPS: A Big Data Placement Strategy for Data Intensive Appli...

引用

IEEE international conference on Data Mining Workshops (ICDM Workshops)

作者： Lihui Liu Junping Song Haibo Wang Pin Lv Institute of Software Chinese Academy of Science University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781509059119

The Market of Data is an environment where data are reasonably deal with. Some data in the market of data are large and hard to analyze. How to efficiently analyze and organize such large scale data in the market of data is a difficult problem. When using Hadoop to analyze these massive data, if input data of a data mining task are not locally available in a processing node, data have to be migrated via network interconnects to node that performs the data processing operations. These data movement obviously has a bad effect on system performance. In this paper, we propose BRPS (Big data Replicas Placement Strategy), a strategy that improves data intensive tasks parallel execution performance by reducing data movement across multiple machines. The simulation results show that BRPS can greatly reduce the data movement cost and promote workload balance slightly.

关键词： Data mining distributed databases System performance parallel processing conferences Big data

来源：评论

学校读者我要写书评

暂无评论

Exploiting Longer SIMD Lanes in Dynamic Binary Translation

Exploiting Longer SIMD Lanes in Dynamic Binary Translation

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Ding-Yong Hong Sheng-Yu Fu Yu-Ping Liu Jan-Jan Wu Wei-Chung Hsu Institute of Information Science Academia Sinica Department of Computer Science and Information Engineering National Taiwan University

ISBN: (纸本)9781509053827

Recent trends in SIMD architecture have tended toward longer vector lengths and more enhanced SIMD features have been introduced in the newer vector instruction sets. However, legacy or proprietary applications compiled with short-SIMD ISA cannot benefit from the long-SIMD architecture, which supports improved parallelism and enhanced vector primitives, and thus only achieve a small fraction of potential peak performance. This paper presents a dynamic binary translation technique that enables short-SIMD binaries to exploit the benefits of the new SIMD architecture by rewriting short-SIMD loop code. We propose a general approach that translates loops consisting of short-SIMD instructions to machine-independent IR, conducts SIMD loop transformation/optimization at this IR level, and finally translates to long-SIMD instructions. Two solutions are presented to enforce SIMD load/store alignment, one for the problem caused by the binary translator's internal translation condition and one general approach using loop peeling optimization. The benchmark results show that an average speedup of 1.45X is achieved for NEON to AVX2 loop transformation.

关键词： Neon Computer architecture parallel processing Indexes Runtime Androids Humanoid robots

来源：评论

学校读者我要写书评

暂无评论

EmSBoT: A lightweight modular software framework for networked robotic systems

EmSBoT: A lightweight modular software framework for network...

引用

international conference on Advances in Computational Tools for Engineering applications, ACTEA

作者： Long Peng Fei Guan Luc Perneel Hasan Fayyad-Kazan Martin Timmerman Department of Electronics and Informatics Vrije Universiteit Brussel (VUB) Brussel-Belgium National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781467385244

Developing applications for modern complex networked robotic systems is more challenging due to the introduction of possibly sophisticated communication and coordination aspects. In this paper, we propose EmSBoT, a lightweight embedded component-based software framework targeting resource-constrained networked robotic systems. EmSBoT provides a unified Application Program Interface (API) that hides the heterogeneous distributed environment from applications. Its OS abstraction layer endows it with OS independence and portability. A port-based communication mechanism is adopted to exchange message between loosely coupled components, making the system with fault-tolerance capability. By isolating the communication channels as separate agents, the framework provides uniform and transparent message-passing for agents over node boundaries. We describe the architecture, programming model and core features of EmSBoT in this paper, together with the performance evaluation and behavior validation to demonstrate its efficiency and feasibility.

关键词： Ports (Computers) Robot kinematics Real-time systems Programming Operating systems

来源：评论

学校读者我要写书评

暂无评论

Evaluating Online Global Recovery with Fenix Using Application-Aware In-Memory Checkpointing techniques

Evaluating Online Global Recovery with Fenix Using Applicati...

引用

international conference on parallel processing Workshops (ICPPW)

作者： Marc Gamell Daniel S. Katz Keita Teranishi Michael A. Heroux Rob F. Van der Wijngaart Timothy G. Mattson Manish Parashar Rutgers Discovery Informatics Institute Rutgers University Piscataway NJ USA NCSA ECE and GSLIS University of Illinois Urbana-Champaign IL USA Scalable Modeling and Analysis Department Sandia National Laboratories Livermore CA USA Scalable Algorithms Sandia National Laboratories Albuquerque NM USA Intel Corp Santa Clara CA US Intel Labs Intel Corp Santa Clara CA USA

ISBN: (纸本)9781509028269

Exascale systems promise the potential for computation at unprecedented scales and resolutions, but achieving exascale by the end of this decade presents significant challenges. A key challenge is due to the very large number of cores and components and the resulting mean time between failures (MTBF) in the order of hours or minutes. Since the typical run times of target scientific applications are longer than this MTBF, fault tolerance techniques will be essential. An important class of failures that must be addressed is process or node failures. While checkpoint/restart (C/R) is currently the most widely accepted technique for addressing processor failures, coordinated, stable-storage-based global C/R might be unfeasible at exascale when the time to checkpoint exceeds the expected MTBF. This paper explores transparent recovery via implicitly coordinated, diskless, application-driven checkpointing as a way to tolerate process failures in MPI applications at exascale. The discussed approach leverages User Level Failure Mitigation (ULFM), which is being proposed as an MPI extension to allow applications to create policies for tolerating process failures. Specifically, this paper demonstrates how different implementations of application-driven in-memory checkpoint storage and recovery compare in terms of performance and scalability. We also experimentally evaluate the effectiveness and scalability of the Fenix online global recovery framework on a production system -the Titan Cray XK7 at ORNL- and demonstrate the ability of Fenix to tolerate dynamically injected failures using the execution of four benchmarks and mini-applications with different behaviors.

关键词： Checkpointing Fault tolerant systems Redundancy Runtime Resilience

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 375 376 377 378 379 380 381 382 383 384 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：