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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

874 篇 会议
36 篇 期刊文献
2 册 图书

馆藏范围

912 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

654 篇 工学
- 590 篇 计算机科学与技术...
- 181 篇 软件工程
- 105 篇 电气工程
- 77 篇 信息与通信工程
- 53 篇 控制科学与工程
- 34 篇 电子科学与技术（可...
- 24 篇 仪器科学与技术
- 15 篇 网络空间安全
- 11 篇 机械工程
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 8 篇 动力工程及工程热...
- 7 篇 测绘科学与技术
- 6 篇 交通运输工程
- 5 篇 力学（可授工学、理...
- 5 篇 石油与天然气工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
139 篇 理学
- 100 篇 数学
- 14 篇 物理学
- 12 篇 生物学
- 10 篇 系统科学
- 9 篇 统计学（可授理学、...
- 7 篇 地球物理学
- 6 篇 化学
62 篇 管理学
- 41 篇 管理科学与工程(可...
- 25 篇 图书情报与档案管...
- 12 篇 工商管理
14 篇 医学
- 14 篇 临床医学
3 篇 经济学
2 篇 法学
2 篇 农学

主题

89 篇 parallel process...
46 篇 graphics process...
46 篇 distributed comp...
40 篇 computer archite...
40 篇 computational mo...
37 篇 graphics process...
32 篇 hardware
31 篇 parallel process...
28 篇 kernel
27 篇 optimization
24 篇 parallel program...
23 篇 benchmark testin...
23 篇 instruction sets
23 篇 multicore proces...
22 篇 libraries
20 篇 parallel algorit...
20 篇 runtime
20 篇 concurrent compu...
20 篇 distributed data...
19 篇 parallel computi...

机构

6 篇 tsinghua univ de...
6 篇 virginia tech de...
4 篇 univ chinese aca...
4 篇 ohio state univ ...
3 篇 nanyang technol ...
3 篇 college of compu...
3 篇 georgia inst tec...
3 篇 georgia inst tec...
3 篇 pacific northwes...
3 篇 univ hamburg ham...
3 篇 univ calif irvin...
3 篇 pacific northwes...
3 篇 oak ridge natl l...
3 篇 univ calif irvin...
3 篇 lawrence berkele...
3 篇 department of co...
2 篇 university of ot...
2 篇 universidad cató...
2 篇 univ pisa dept c...
2 篇 shanghai jiao to...

作者

5 篇 buluc aydin
4 篇 franca felipe m....
4 篇 bader david a.
4 篇 liu jie
4 篇 torquati massimo
4 篇 panda dhabaleswa...
4 篇 wang qinglin
4 篇 owens john d.
4 篇 danelutto marco
3 篇 pearce roger
3 篇 hirmer pascal
3 篇 ferner clayton
3 篇 nakano koji
3 篇 marco danelutto
3 篇 azzedine boukerc...
3 篇 harshvardhan
3 篇 mitschang bernha...
3 篇 gerndt michael
3 篇 simmhan yogesh
3 篇 marzulo leandro ...

语言

907 篇 英文
4 篇 中文
1 篇 其他

检索条件"任意字段=23rd IEEE International Parallel and Distributed Processing Symposium"

共 912 条记录，以下是81-90 订阅

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

详细简洁

排序：

NUMA-ICTM: A parallel Version of ICTM Exploiting Memory Placement Strategies for NUMA Machines

NUMA-ICTM: A Parallel Version of ICTM Exploiting Memory Plac...

引用

23rd ieee international parallel and distributed processing symposium

作者： Castro, Marcio Fernandes, Luiz Gustavo Pousa, Christiane Mehaut, Jean-Francois de Aguiar, Marilton Sanchotene Pontificia Univ Catolica Rio Grande do Sul PPGCC GMAP Porto Alegre RS Brazil Univ Grenoble 1 Lab Informat Grenoble Grenoble France Univ Catolica Pelotas PPGInf GMFC Pelotas Brazil

ISBN: (纸本)9781424437511

In geophysics, the appropriate subdivision of a region into segments is extremely important. ICTM (Interval Categorizer Tesselation Model) is an application that categorizes geographic regions using information extracted from satellite images. The categorization of large regions is a computational intensive problem, what justifies the proposal and development of parallel solutions in order to improve its applicability. Recent advances in multiprocessor architectures lead to the emergence of NUMA (Non-Uniform Memory Access) machines. In this work, we present NUMA-ICTM: a parallel solution of ICTM for NUMA machines. First, we parallelize ICTM using OpenMP After, we improve the OpenMP solution using the MAI (Memory Affinity Interface) library;which allows a control of memory allocation in NUMA machines. The results show that the optimization of memory allocation leads to significant performance gains over the pure OpenMP parallel solution.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

PyMW - a Python Module for Desktop Grid and Volunteer Computing

PyMW - a Python Module for Desktop Grid and Volunteer Comput...

引用

23rd ieee international parallel and distributed processing symposium

作者： Heien, Eric M. Takata, Yusuke Hagihara, Kenichi Kornafeld, Adam Osaka Univ Grad Sch Informat Sci & Technol Osaka 5608531 Japan Hungarian Acad Sci Inst Comp & Automat Res Lab Parallel & Distributed Syst H-1132 Budapest Hungary

ISBN: (纸本)9781424437511

We describe a general purpose master-worker parallel computation Python module called PyMW. PyMW is intended to support rapid development, testing and deployment of large scale master-worker style computations on a desktop grid or volunteer computing environment. This module targets nonexpert computer users by hiding complicated task submission and result retrieval procedures behind a simple interface. PyMW also provides a unified interface to multiple computing environments with easy extension to support additional environments. In this paper, we describe the internal structure and external interface to the PyMW module and its support for the Condor computing environment and the Berkeley Open Infrastructure for Network Computing (BOINC) platform. We demonstrate the effectiveness and scalability of PyMW by performing master-worker style computations on a desktop grid using Condor and a BOINC volunteer computing project.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

The GREEN-NET Framework: Energy Efficiency in Large Scale distributed Systems

The GREEN-NET Framework: Energy Efficiency in Large Scale Di...

引用

23rd ieee international parallel and distributed processing symposium

作者： Da Costa, Georges Gelas, Jean-Patrick Georgiou, Yiannis Lefevre, Laurent Orgerie, Anne-Cecile Pierson, Jean-Marc Richard, Olivier Sharma, Kamal Univ Toulouse 3 IRIT 118 Route Narbonne F-31062 Toulouse France Univ Lyon Ecole Normale Super INRIA RESO F-69364 Lyon France MESCAL IMAG Lab Informat & Distribut ID F-38330 Saint Martin France Indian Inst Technol Kanpur 208016 Uttar Pradesh India

ISBN: (纸本)9781424437511

The question of energy savings has been a matter of concern since a long time in the mobile distributed systems and battery-constrained systems. However, for large-scale non-mobile distributed systems, which nowadays reach impressive sizes, the energy dimension (electrical consumption) just starts to be taken into account. In this paper, we present the GREEN-NET1 framework which is based on 3 main components: an ON/OFF model based on an Energy Aware Resource Infrastructure (EARI), an adapted Resource Management System (OAR) for energy efficiency and a trust delegation component to assume network presence of sleeping nodes.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Coupled Thermo-Hydro-Mechanical Modelling: A New parallel Approach

Coupled Thermo-Hydro-Mechanical Modelling: A New Parallel Ap...

引用

23rd ieee international parallel and distributed processing symposium

作者： Vardon, P. J. Banicescu, I Cleall, P. J. Thomas, H. R. Philp, R. N. Cardiff Univ Geoenvironm Res Ctr Cardiff S Glam Wales Mississippi State Univ Ctr Comp Sci Dept Comp Sci Mississippi State MS USA Cardiff Univ Comp Sci Cardiff Wales

ISBN: (纸本)9781424437511

A hybrid MPI/OpenMP method of parallelising a bi-conjugate gradient iterative solver for coupled thermo-hydro-mechanical finite-element simulations in unsaturated soil is implemented and found to be efficient on modern parallel computers. In particular, a new method of parallelisation using a hybrid multi-threaded and message passing approach depending on calculation size was implemented yielding better performance over more processing units. This was tested on both an Opteron 2218 2.6GHz Dual-Core processor based system with a Gigabit Ethernet interconnect and an Intel aeon (Harpertown/Seaburg) 3.0GHz Quad-Core processor based system with an InfiniBand Connect-X interconnect. The impact of the experimental results reflect on the scalability of field-scale simulations with a higher resolution both spatially and temporally.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Sequence Alignment with GPU: Performance and Design Challenges

Sequence Alignment with GPU: Performance and Design Challeng...

引用

23rd ieee international parallel and distributed processing symposium

作者： Striemer, Gregory M. Akoglu, Ali Univ Arizona Dept Elect & Comp Engn Tucson AZ 85721 USA

ISBN: (纸本)9781424437511

In bioinformatics, alignments are commonly performed in genome and protein sequence analysis for gene identification and evolutionary similarities. There are several approaches for such analysis, each varying in accuracy and computational complexity. Smith-Waterman (SW) is by far the best algorithm for its accuracy in similarity scoring. However, execution time of this algorithm on general purpose processor based systems makes it impractical for use by life scientists. In this paper we take Smith-Waterman as a case study to explore the architectural features of Graphics processing Units (GPUs) and evaluate the challenges the hardware architecture poses, as well as the software modifications needed to map the program architecture on to the GPU. We achieve a 23x speedup against the serial version of the SW algorithm. We further study the effect of memory organization and the instruction set architecture on GPU performance. For that purpose we analyze another implementation on an Intel Quad Core processor that makes use of Intel's SIMD based SSE2 architecture. We show that if reading blocks of 16 words at a time instead of 4 is allowed, and if 64KB of shared memory as opposed to 16KB is available to the programmer, GPU performance enhances significantly making it comparable to the SIMD based implementation. We quantify these observations to illustrate the need for studies on extending the instruction set and memory organization for the GPU.

关键词： Smith-Waterman Graphics processing Unit Alignment Residue

来源：评论

学校读者我要写书评

暂无评论

Concurrent SSA for General Barrier-Synchronized parallel Programs

Concurrent SSA for General Barrier-Synchronized Parallel Pro...

引用

23rd ieee international parallel and distributed processing symposium

作者： Shah, Harshit Shyamasundar, R. K. Varma, Pradeep Tata Inst Fundamental Res Sch Technol & Comp Sci Homi Bhabha Rd Bombay 400005 Maharashtra India IBM India Res Lab New Delhi 110070 India

ISBN: (纸本)9781424437511

Static single assignment (SSA) form has been widely, studied and used for sequential programs. This form enables many compiler optimizations to be done efficiently,. Work on concurrent static single assignment form (CSSA) for concurrent programs is focused on languages that have limited, implicit barriers (e.g., cobegin/coend and parallel do). Recent programming languages for high-performance computing have general features for barrier/phase synchronization - this is essentially a dual of mutual exclusion and arises mainly in constructing,synchronous systems from asynchronous systems. X10 is one such language that has features for general purpose barriers. In X10, barriers are provided through features such as clocks and finish. Since barriers provide explicit synchronization, they offer an opportunity for reducing pi interferences needed for CSSA. This paper provides a means for computing improved CSSA form of a program taking advantage of the general barriers present in it. Our algorithm. is based on constructing a control-flow, graph of the program and flow equations. The efficiency of analysis and optimizations for parallel programs depends on the number and complexity of pi assignments in their CSSA representations. We demonstrate that our approach of computing CSSA form for languages supporting general barrier synchronization can improve the precision of intermediate representation for computing global value numbering and loop invariant detection.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

A flexible and robust lookup algorithm for P2P systems

A flexible and robust lookup algorithm for P2P systems

引用

23rd ieee international parallel and distributed processing symposium

作者： Andreolini, Mauro Lancellotti, Riccardo Univ Modena & Reggio Emilia I-41100 Modena Italy

ISBN: (纸本)9781424437511

One of the most critical operations performed in a P2P system is the lookup of a resource. The main issues to be addressed by lookup algorithms are: (1) support for flexible search criteria (e.g., wildcard or multi-keyword searches), (2) effectiveness - i.e., ability to identify all the resources that match the search criteria, (3) efficiency - i.e. low overhead, (4) robustness with respect to node failures and churning. Flood-based P2P networks provide flexible lookup facilities and robust performance at the expense of high overhead, while other systems (e.g. DHT) provide a very efficient lookup mechanism, but lacks flexibility In this paper we propose a novel resource lookup algorithm, namely fuzzy-DHT, that solves this trade-off by introducing a flexible and robust lookup criteria based on multiple keywords on top of a distributed hash table algorithm. We demonstrate that the fuzzy-DHT algorithm satisfies all the requirements of P2P lookup systems combining the flexibility of flood-based mechanisms while preserving efficiency, effectiveness ad robustness.

关键词： Peer-to-peer Overlay Routing distributed Hash Tables Resource lookup

来源：评论

学校读者我要写书评

暂无评论

An Approach for Matching Communication Patterns in parallel Applications

An Approach for Matching Communication Patterns in Parallel ...

引用

23rd ieee international parallel and distributed processing symposium

作者： Ma, Chao Teo, Yong Meng March, Verdi Xiong, Naixue Pop, Ioana Romelia He, Yan Xiang See, Simon Natl Univ Singapore Dept Comp Sci Singapore Singapore Wuhan Univ Coll Comp Sci Wuhan Peoples R China Univ Politehn Bucuresti Fac Automat Control & Comp Bucharest Romania Sun Microsyst Inc Asia Pacific Sci & Technol Ctr Santa Clara CA USA

ISBN: (纸本)9781424437511

Interprocessor communication is an. important,factor in determining the performance scalability of parallel systems. The communication requirements of a parallel application can be quantified to understand its communication pattern and communication pattern similarities among applications can be determined. This is essential for the efficient mapping of applications on parallel systems and leads to better interprocessor communication implementation among others. This paper proposes a methodology to compare the communication pattern of distributed-memory programs. Communication correlation coefficient quantifies the degree of similarity between two applications based on the communication metrics selected to characterize the applications. To capture the network topology requirements, we extract the communication graph of each applications and quantities this similarity. We apply this methodology to four applications in the NAS parallel benchmark suite and evaluate the communication patterns by studying the effects of varying problem size and the number of logical processes (LPs).

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Energy Benefits of Reconfigurable Hardware for Use in Underwater Snesor Nets

Energy Benefits of Reconfigurable Hardware for Use in Underw...

引用

23rd ieee international parallel and distributed processing symposium

作者： Benson, Bridget Irturk, Ali Cho, Junguk Kastner, Ryan Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA

ISBN: (纸本)9781424437511

Small, dense underwater sensor networks have the potential to greatly improve undersea environmental and structural monitoring. However, few sensor nets exist because commercially available underwater acoustic modems are too costly and energy inefficient to be practical for this applications. Therefore, when designing an acoustic modem for sensor networks, the designer must optimize for low cost and low energy consumption at every level, from the analog electronics, to the signal processing scheme, to the hardware platform. In this paper we focus on the design choice of hardware platform: digital signal processors, microcontrollers, or reconfigurable hardware, to optimize for energy efficiency while keeping costs low. We implement one algorithm used in an acoustic modem design Matching Pursuits for channel estimation - on all three platforms and perform a design space exploration to compare the timing, power and energy consumption of each implementation. We show that the reconfigurable hardware implementation can provide a maximum of 210X and 52X decrease in energy consumption over the microcontroller and DSP implementations respectively.

关键词： underwater acoustic modems mapping parallel algorithms energy efficiency issues field programmable gate arrays design space exploration

来源：评论

学校读者我要写书评

暂无评论

Multi-Users Scheduling in parallel Systems

Multi-Users Scheduling in Parallel Systems

引用

23rd ieee international parallel and distributed processing symposium

作者： Saule, Erik Trystram, Denis Grenoble Univ LIG F-38330 Montbonnot St Martin France

ISBN: (纸本)9781424437511

We art, interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has specific needs or wishes for computing his/her jobs expressed as a function to optimize (among maximum completion time, sum of completion times and sum of weighted completion times). Such problems have been mainly studied through Game Theory. In this work, we focus on solving the problem by optimizing simultaneously each user's objective Junction independently using classical combinatorial optimization techniques. Some results have already been proposed for two users on a single computing resource. However, no generic combinatorial method is known for many objectives. The analysis proposed in this paper concerns an arbitrarily fixed number of users and is not restricted to a single resource. We first derive inapproximability bounds;then we analyze several greedy heuristics whose approximation ratios are close to these bounds., However they remain high since they are linear in the number of users. We provide a deeper analysis which shows that a slightly modified version of the algorithm is a constant approximation of a Pareto-optimal solution.

关键词： Multi-objective optimization Multi-users scheduling approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：