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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,778 篇 会议
59 册 图书
47 篇 期刊文献

馆藏范围

2,882 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

2,016 篇 工学
- 1,781 篇 计算机科学与技术...
- 944 篇 软件工程
- 296 篇 信息与通信工程
- 292 篇 电气工程
- 246 篇 电子科学与技术（可...
- 95 篇 控制科学与工程
- 52 篇 机械工程
- 49 篇 生物工程
- 44 篇 光学工程
- 41 篇 生物医学工程（可授...
- 37 篇 仪器科学与技术
- 28 篇 动力工程及工程热...
- 27 篇 化学工程与技术
- 21 篇 土木工程
- 20 篇 力学（可授工学、理...
- 19 篇 材料科学与工程（可...
- 18 篇 建筑学
541 篇 理学
- 385 篇 数学
- 106 篇 物理学
- 56 篇 生物学
- 48 篇 系统科学
- 32 篇 化学
- 32 篇 统计学（可授理学、...
197 篇 管理学
- 121 篇 管理科学与工程(可...
- 81 篇 图书情报与档案管...
- 56 篇 工商管理
51 篇 医学
- 42 篇 临床医学
- 16 篇 基础医学(可授医学...
19 篇 文学
17 篇 经济学
- 17 篇 应用经济学
15 篇 法学
- 14 篇 社会学
12 篇 农学
4 篇 教育学
3 篇 军事学

主题

344 篇 parallel process...
200 篇 parallel process...
193 篇 computer archite...
157 篇 graphics process...
153 篇 parallel archite...
113 篇 parallel algorit...
109 篇 graphics process...
106 篇 hardware
86 篇 image processing
80 篇 computational mo...
75 篇 signal processin...
71 篇 concurrent compu...
66 篇 instruction sets
65 篇 algorithm design...
65 篇 multicore proces...
63 篇 field programmab...
60 篇 parallel program...
59 篇 parallel computi...
53 篇 gpu
50 篇 optimization

机构

10 篇 natl univ def te...
8 篇 college of compu...
6 篇 hosei univ dept ...
6 篇 college of compu...
5 篇 univ aizu dept c...
5 篇 inria rennes
5 篇 national univers...
5 篇 natl univ def te...
5 篇 city university ...
5 篇 science and tech...
4 篇 chinese acad sci...
4 篇 school of comput...
4 篇 carleton univ sc...
4 篇 univ chinese aca...
4 篇 school of comput...
4 篇 charles univ pra...
4 篇 department of co...
4 篇 school of comput...
4 篇 hainan internati...
4 篇 purple mountain ...

作者

10 篇 liu jie
9 篇 jack dongarra
8 篇 roman wyrzykowsk...
7 篇 wang qinglin
7 篇 konrad karczewsk...
7 篇 quintana-orti en...
6 篇 gepner pawel
6 篇 peng shietung
6 篇 li kuan-ching
6 篇 li yamin
6 篇 chu wanming
6 篇 prasanna viktor ...
6 篇 rothermel kurt
6 篇 yang chao-tung
5 篇 dongarra jack
5 篇 olas tomasz
5 篇 hannig frank
5 篇 wanlei zhou
5 篇 qian depei
5 篇 ewa deelman

语言

2,847 篇 英文
26 篇 其他
13 篇 中文
1 篇 俄文

检索条件"任意字段=8th International Conference on Algorithms and Architectures for Parallel Processing"

共 2884 条记录，以下是1631-1640 订阅

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

详细简洁

排序：

Adaptive parallel Interval Global Optimization algorithms Based on their Performance for Non-dedicated Multicore architectures

Adaptive Parallel Interval Global Optimization Algorithms Ba...

引用

Euromicro conference on parallel, Distributed and Network-Based processing

作者： J.F. Sanjuan Estrada L.G. Casado I. García Universidad de Almeria Almeria AndalucÃa ES Department of Computer Architecture and Electronics University of Almeria Almería Spain Department of Computer Architecture University of Mälaga Mälaga Spain

Branch and Bound (B&B) algorithms are highly parallelizable but they are irregular and dynamic load balancing techniques have been used to avoid idle processors. In previous work, authors use a dynamic number of threads at run time, which depends on the measured performance of the application for just one interval B&B algorithm running on the system. In this way, load balancing is achieved by thread generation decisions. In this work, we extend the study of these models to non-dedicated systems. In order to have a controlled test bed and comparable results, several instances of the interval global optimization algorithm are executed in the system, with the same model and problem to solve. therefore, a non-dedicated system is simulated because the execution of one application affects the execution of the other instances. this paper discusses different methods and models to decide when a thread should be created. Experiments show which of the proposed methods performs best in terms of maximum running time per application, using the fewest running threads. Following this parallel programming methodology, which is well suited for other B&B codes, applications can adapt their parallelism level to their performance and load of the system(at run time). this work represents a step forward towards increasing the performance of parallel algorithm running in non-dedicated and heterogeneous systems. the adaptive model discussed in this work is able to reduce the overall execution time for a set of instances of the same application running simultaneously. It also exempts the user from specifying the number of threads each application should use.

关键词： Instruction sets Kernel Computational modeling Adaptation model Load modeling parallel processing

来源：评论

学校读者我要写书评

暂无评论

P2G: A Framework for Distributed Real-Time processing of Multimedia Data

P2G: A Framework for Distributed Real-Time Processing of Mul...

引用

international conference on parallel processing Workshops (ICPPW)

作者： Havard Espeland Paul B. Beskow Hakon K. Stensland Preben N. Olsen Stale Kristoffersen Carsten Griwodz Pal Halvorsen Department of Informatics Norway Simula Research Laboratory University of Oslo Norway

the computational demands of multimedia data processing are steadily increasing as consumers call for progressively more complex and intelligent multimedia services. New multi-core hardware architectures provide the required resources, but writing parallel, distributed applications remains a labor-intensive task compared to their sequential counter-part. For this reason, Google and Microsoft implemented their respective processing frameworks MapReduce and Dryad, as they allow the developer to think sequentially, yet benefit from parallel and distributed execution. An inherent limitation in the design of these batch processing frameworks is their inability to express arbitrarily complex workloads. the dependency graphs of the frameworks are often limited to directed acyclic graphs, or even pre-determined stages. this is particularly problematic for video encoding and other algorithms that depend on iterative execution. With the Nornir runtime system for parallel programs, which is a Kahn Process Network implementation, we addressed and solved several of these limitations. However, it is more difficult to use than other frameworks due to its complex programming model. In this paper, we build on the knowledge gained from Nornir and present a new framework, called P2G, designed specifically for developing and processing distributed real-time multimedia data. P2G supports arbitrarily complex dependency graphs with cycles, branches and deadlines, and provides both data- and task-parallelism. the framework is implemented to scale transparently with available (heterogeneous) resources, a concept familiar from the cloud computing paradigm. We have implemented an (interchangeable) P2G kernel language to ease development. In this paper, we present a proof of concept implementation of a P2G execution node and some experimental examples using complex workloads like Motion JPEG and K-means clustering. the results show that the P2G system is a feasible approach to multimedia proce

关键词： Kernel Multimedia communication parallel processing Runtime Streaming media Batch production systems Pipelines

来源：评论

学校读者我要写书评

暂无评论

Pre-computing Function Results in Multi-Core and Many-Core Processors

Pre-computing Function Results in Multi-Core and Many-Core P...

引用

international conference on parallel processing Workshops (ICPPW)

作者： Edward C. Herrmann Prudhvi Janga Philip A. Wilsey Experimental Computing Laboratory School of Electronic and Computing Systems Cincinnati OH USA

In recent years, the number of hardware supported threads in desktop processors has increased dramatically. All but the very lowest cost net books and embedded processors now have at least dual cores and soon systems supporting upwards of 8 to 16 hardware threads are likely to be commonplace. Unfortunately, it will be difficult to take full advantage of the parallelism emerging processors will be able to provide. To help address this issue, we are investigating mechanisms to pre-compute function results in separate threads running concurrently with the main program thread. the concurrent threads are forked automatically and without program modification. A critical component for the success of this idea is an ability to build a background thread that can pre-compute usable results in some effective manner. For some support functions (dynamic memory) exact arguments predictions for the function pre-computation are not necessary, for others (trigonometric functions) they are. In work with dynamic memory, we are able to pre-compute memory blocks and show modest speedup: saving approximately 25% of the dynamic memory costs. In studies with predicting argument values to trigonometric functions, we show that learning algorithms are able to successfully predict the next argument values approximately 44% of the time.

关键词： Instruction sets Libraries Prediction algorithms parallel processing Resource management Context

来源：评论

学校读者我要写书评

暂无评论

Optimizing multicore performance with message driven execution: A case study

Optimizing multicore performance with message driven executi...

引用

international conference on High Performance Computing

作者： Pritish Jetley Laxmikant V. Kale Department of Computer Science University of Illinois Urbana-Champaign Urbana IL USA

With the growing amount of parallelism available on today's multicore processors, achieving good performance at scale is challenging. We approach this issue through an alternative to traditional thread-based paradigms for writing shared memory programs, namely message driven multicore programming. We study a number of optimizations that improve the efficiency of message driven programs on multicore architectures. In particular, we focus on the following runtime system-enabled optimizations: (i) grainsize control to effect a good concurrency-overhead tradeoff, (ii) dynamic balancing of processor load, (iii) low-overhead, asynchronous communication for lock-free and message-driven execution and (iv) communication-reduction through a novel chunked shared array abstraction. the practical impact of these optimizations is quantified through a parallel kd-tree construction program written in the message-driven paradigm. A comparison of the optimized code with a state-of-the-art parallel kd-tree construction program is also presented.

关键词： Multicore processing Program processors Runtime Optimization Arrays Partitioning algorithms Message systems

来源：评论

学校读者我要写书评

暂无评论

algorithms and architectures for parallel processing - 8th international conference, 2008, Proceedings

Algorithms and Architectures for Parallel Processing - 8th I...

引用

8th international conference on algorithms and architectures for parallel processing, ICA3PP 2008

ISBN: (纸本)9783540695004

the proceedings contain 33 papers. the topics discussed include: smart content delivery on the Internet;parallel query processing in databases on multicore architectures;evaluation of a novel load-balancing algorithm with variable granularity;a static multiprocessor scheduling algorithm for arbitrary directed task graphs in uncertain environments;architecture aware partitioning algorithms;a simple and efficient fault-tolerant adaptive routing algorithm for meshes;fault tolerance in the biswapped network;a general approach to predict the performance order of TSP family problems;examining the feasibility of reconfigurable models for molecular dynamics simulation;parallel simulated annealing for materialized view selection in data warehousing environments;an optimization service for DSP multicomputers;and a non-blocking multithreaded architecture with support for speculative threads.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Multi-science applications with single codebase — GAMER — For massively parallel architectures

Multi-science applications with single codebase — GAMER — ...

引用

Supercomputing conference

作者： Hemant Shukla Tak-Pong Woo Hsi-Yu Schive Tzihong Chiueh Lawrence Berkeley National laboratory Berkeley USA Department of Physics National Taiwan University Taipei Taiwan Department of Physics Soochow University Taipei Taiwan

the growing need for power efficient extreme-scale high-performance computing (HPC) coupled with plateauing clock-speeds is driving the emergence of massively parallel compute architectures. Tens to many hundreds of cores are increasingly made available as compute units, either as the integral part of the main processor or as coprocessors designed for handling massively parallel workloads. In the case of many-core graphics processing units (GPUs) hundreds of SIMD cores primarily designed for image and video rendering are used for high-performance scientific computations. the new architectures typically offer ANSI standard programming models such as CUDA (NVIDIA) and OpenCL. However, the wide-ranging adoption of these parallel architectures is steeped in difficult learning curve and requires reengineering of existing applications that mostly leads to expensive and error prone code rewrites without prior guarantee and knowledge of any speedups. Broad range of complex scientific applications across many domains use common algorithms and techniques, such as adaptive mesh refinements (AMR), advanced hydrodynamics partial differential equation (PDE) solvers, Poisson-Gravity solvers etc, that have demonstrably performed highly efficiently on GPU based systems. Taking advantage of the commonalities, we use GPU-aware AMR code, GAMER [1], to examine the unique approach of solving multi-science problems in astrophysics, hydrodynamics and particle physics with single codebase. We demonstrate significant speedups in disparate class of scientific applications on 3 separate clusters, viz., Dirac, Laohu and Mole 8.5. By extensively reusing the extendable single codebase we mitigate the impediments of significant code rewrites. We also collect performance and energy consumption benchmark metrics on 50-nodes NVIDIA C2050 GPU and Intel 8-core Nehalem CPU on Dirac cluster at the National Energy Research Supercomputing Center (NERSC). In addition, we propose a strategy and framework for

关键词： Graphics processing unit Kernel Computational modeling Instruction sets Mathematical model Memory management

来源：评论

学校读者我要写书评

暂无评论

Rheology and processing of Ni based Nano-Composite Pastes for Electronic Assembly

Rheology and Processing of Ni based Nano-Composite Pastes fo...

引用

8th international conference on Composite Science and Technology

作者： Durairaja, R. Chiawea, L. Leong, Kau Chee Chu, Wong Mee Suan, Liang Meng UTAR Dept Mech & Mat Engn Kuala Lumpur 53300 Malaysia

ISBN: (纸本)9783037850596

Lead-free solder paste printing process accounts for majority of the assembly defects in the electronic manufacturing industry. In the stencil printing process, the solder paste must be able to withstand low and high shear rates, which results in continuous structural breakdown and build-up. the study investigates the effect of nickel additional to the thixotropic behaviour of lead-free Sn/Ag/Cu solder pastes using the structural kinetic model. A hysteresis loop test and constant shear test is utilized to investigate the thixotropic behaviour of the pastes using parallel plate rheometry in temperature 30 degrees C. In this study, the shear rates were increased from 0.01 s(-1) to 10s(-1) and the second curve was a result of decreasing shear rate from 10s(-1) to 0.01s(-1). For the constant shear test, the samples were subjected to two constant shear rates of 0.1s(-1) and 1s(-1). the constant shear rate test was designed to study the structural breakdown and build-up of the paste materials. From this investigation, hysteresis loop test was shown to be an effective test method to differentiate the extent of structural recovery in the solder pastes. the results of the structural parameter values obtained from the kinetic model showed a good correlation to the breakdown and build-up of the paste structure.

关键词： Rheology Lead-Free Solder Paste Nano-material and Nano-composite

来源：评论

学校读者我要写书评

暂无评论

A research on controlling three-dimensional effect of the video frames obtained from stereo camera

A research on controlling three-dimensional effect of the vi...

引用

international conference on Information, Communications and Signal processing

作者： Jeehong Lee Kyu-yeol Chae Simon Ji LG Electronics Inc. Seoul South Korea

ISBN: (纸本)9781457700293

In recent years, 3D TVs and the 3D video contents such as movie, commercial film, or drama are widely exploited for many people. Due to these developments, many people will want to make the 3D contents with 3D cameras, and share these contents by uploading them to the UCC website. However, some people can experience the visual discomfort and fatigue when they are watching 3D video contents on the 3D TV. the reasons why this phenomenon is happened may be cross-talk, vertically-misaligned video contents obtained from the uncalibrated cameras, the collision of the accommodation and convergence, or the excessive three-dimensional effect. In our works, we mainly focused on controlling three-dimensional effect by modifying the convergence distance between the left and right camera. To achieve this, we analyzed the feature of the parallel and toe-in camera, and the relationship between the three-dimensional effect and convergence distances. From these experiments, we determined the type of the camera alignment and the proper convergence distance that satisfies the tradeoff between three-dimensional effect and visual fatigue. Also, to reduce visual fatigue and utilize the determined convergence distance, the proposed camera calibration method was used. this calibrated stereo camera was applied to our manufactured multimedia tablet, so that it could provide the comfortable three-dimensional effect.

关键词： Cameras three dimensional displays Convergence Stereo image processing Visualization Calibration Fatigue

来源：评论

学校读者我要写书评

暂无评论

Implementing a Pickup and Delivery Problem with Time Windows algorithm on a GPU cluster

Implementing a Pickup and Delivery Problem with Time Windows...

引用

international conference on Computer Sciences and Convergence Information Technology (ICCIT)

作者： Geeratiya Srimool Putchong Uthayopas Juta Pichitlamkhen Department of Computer Engineering Faculty of Engineering Kasetsart University Bangkok Thailand Department of Industrial Engineering Faculty of Engineering Kasetsart University Bangkok Thailand

this work presents an implementation of a high speed Pickup and Delivery Problem with Time Window (PDPTW) problem using GPU cluster. this problem represents a class of a major logistic problem. the software implemented is tested on 8 nodes GPU cluster equipped with two of Tesla M2050 (448 cores) card on each node. the result shows a speedup of nearly 7 times for a small problem and 43 times using 4 nodes for a large problem. In the presentation, some factors that affect the performance will be discussed.

关键词： Graphics processing unit Instruction sets Vehicles parallel processing Clustering algorithms Handheld computers

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Intra-prediction Mode Selection Scheme for 4x4 Blocks in H.264

Efficient Parallel Intra-prediction Mode Selection Scheme fo...

引用

international conference on Intelligent Computation Technology and Automation, ICICTA

作者： Liangbao Jiao Jing Zhou Rui Chen School of Communications engineering Nanjing Institute of Technology Nanjing China College of Communication and Information System Nanjing University of Posts and Telecommunications Nanjing China

An intra-prediction mode with 4×4 block and 16×16 block sizes for luma component and 8×8 block size for chroma component is used in H.264 to improve the rate-distortion performance. However, the computational complexity of H.264 encoder is drastically increased due to the various intraprediction modes. Recently efficient hardware architectures were proposed for the fast execution of H.264/AVC intraprediction mode selection. this paper proposes an efficient pipelining method for the 4×4 blocks intra-prediction mode selection. In particular, we exploit the GPU's streaming architecture at 4 × 4 intra-prediction mode selection in H.264/AVC and we develop a special strategy including instruction optimization and taking full advantage of shared memory to further exploit the fine-grained parallelism of GPUs. Experimental results up to about 3×speedup of our GPU-based algorithms over the implementations on sequential CPUs.

关键词： Graphics processing unit Instruction sets Optimization Algorithm design and analysis System-on-a-chip Programming Automatic voltage control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共289页 << < 160 161 162 163 164 165 166 167 168 169 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：