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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,500 篇 会议
69 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

1,951 篇 工学
- 1,911 篇 计算机科学与技术...
- 889 篇 软件工程
- 388 篇 信息与通信工程
- 292 篇 电气工程
- 139 篇 电子科学与技术（可...
- 102 篇 控制科学与工程
- 66 篇 网络空间安全
- 32 篇 动力工程及工程热...
- 25 篇 建筑学
- 24 篇 机械工程
- 21 篇 生物医学工程（可授...
- 20 篇 土木工程
- 16 篇 生物工程
- 15 篇 交通运输工程
- 15 篇 安全科学与工程
- 14 篇 环境科学与工程（可...
- 13 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 化学工程与技术
419 篇 理学
- 345 篇 数学
- 42 篇 统计学（可授理学、...
- 40 篇 系统科学
- 38 篇 物理学
- 21 篇 生物学
- 18 篇 化学
353 篇 管理学
- 304 篇 管理科学与工程(可...
- 126 篇 工商管理
- 74 篇 图书情报与档案管...
23 篇 经济学
- 22 篇 应用经济学
14 篇 法学
- 14 篇 社会学
8 篇 农学
7 篇 医学
5 篇 教育学
2 篇 文学
2 篇 军事学

主题

188 篇 parallel process...
155 篇 application soft...
137 篇 graphics process...
130 篇 parallel process...
122 篇 computer archite...
114 篇 hardware
110 篇 computational mo...
102 篇 distributed comp...
101 篇 concurrent compu...
94 篇 computer science
86 篇 runtime
86 篇 distributed comp...
84 篇 parallel program...
67 篇 scalability
65 篇 graphics process...
61 篇 libraries
61 篇 instruction sets
60 篇 resource managem...
56 篇 kernel
55 篇 bandwidth

机构

15 篇 oak ridge natl l...
12 篇 cent s univ sch ...
11 篇 argonne natl lab...
11 篇 univ tennessee k...
10 篇 guangzhou univ s...
10 篇 school of comput...
10 篇 univ manchester ...
10 篇 ohio state univ ...
8 篇 oak ridge natl l...
7 篇 univ chinese aca...
7 篇 hunan univ coll ...
6 篇 chinese acad sci...
6 篇 iit dept comp sc...
6 篇 oak ridge nation...
6 篇 hunan engn lab r...
6 篇 univ illinois de...
6 篇 department of co...
5 篇 univ sci & techn...
5 篇 georgia state un...
5 篇 georgia inst tec...

作者

16 篇 dongarra jack
13 篇 wang guojun
12 篇 sun xian-he
10 篇 cerin christophe
9 篇 schulz martin
9 篇 guo minyi
9 篇 agrawal gagan
9 篇 wolf felix
9 篇 robert yves
8 篇 matsuoka satoshi
8 篇 jin hai
7 篇 li kenli
7 篇 prasad sushil k.
7 篇 banicescu ioana
7 篇 antoniu gabriel
7 篇 kale laxmikant v...
7 篇 zhou xuehai
7 篇 labarta jesus
6 篇 li xi
6 篇 hoefler torsten

语言

2,571 篇 英文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=13th IEEE International Symposium on Parallel and Distributed Processing with Applications"

共 2573 条记录，以下是2451-2460 订阅

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

详细简洁

排序：

Performance Evaluation of the ROSENET Network Emulation System

Performance Evaluation of the ROSENET Network Emulation Syst...

引用

international Workshop/symposium on distributed Simulation and Real-Time applications (DS-RT)

作者： Yan Gu Richard Fujimoto Computational Science and Engineering Division College of Computing Georgia Institute of Technology Atlanta GA USA

Network emulation has been widely used to aid in the development and evaluation of real time applications. Traditional emulation tools based on a single node machine or a cluster of machines cannot satisfy today's requirements for testing real time applications distributed over wide area networks. ROSENET is a novel network emulation system that exploits a remote high fidelity simulation to provide scale and accuracy for a low fidelity emulator serving a locally executing real time application. the distributed emulators and simulators in the ROSENET system coordinate by periodically updating their simulation/emulation status using network models. We evaluate the performance of an implementation of ROSENET using the NIST Net emulator and GTNetS simulator. Results show that ROSENET provides a promising approach to network emulation supporting accuracy and scale while meeting real-time constraints. We also illustrate the procedures using ROSENET to evaluate a contemporary real-time distributed application Skype and present experimental results.

关键词： Emulation Computational modeling Real time systems Telecommunication traffic Traffic control Application software Computer networks Predictive models Scalability parallel processing

来源：评论

学校读者我要写书评

暂无评论

the FTRA 3rd international workshop on privacy enhanced technology and security engineering (PETSE 2011)

Proceedings - 9th IEEE International Symposium on Parallel a...

引用

Proceedings - 9th ieee international symposium on parallel and distributed processing with applications Workshops, ISPAW 2011 - ICASE 2011, SGH 2011, GSDP 2011 2011年 40-40页

作者： Jeong, Young-Sik Sharif, Hamid Kim, Jongsung Shi, Qi Cao, Zhenfu Xu, Heng

来源：评论

学校读者我要写书评

暂无评论

Coarse-grain parallel genetic algorithms: categorization and new approach

Coarse-grain parallel genetic algorithms: categorization and...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Shyh-Chang Lin W.F. Punch E.D. Goodman Genetic Algorithm Research and Applications Group Case Center and Department of Computer Science Michigan State University USA Dept. of Comput. Sci. Michigan State Univ. East Lansing MI USA

this paper describes a number of different coarse-grain GA's, including various migration strategies and connectivity schemes to address the premature convergence problem. these approaches are evaluated on a graph partitioning problem. Our experiments showed, first, that the sequential GA's used are not as effective as parallel GA's for this graph partition problem. Second, for coarse-grain GA's, the results indicate that using a large number of nodes and exchanging individuals asynchronously among them is very effective. third, GA's that exchange solutions based on population similarity instead of a fixed connection topology get better results without any degradation in speed. Finally, we propose a new coarse-grained GA architecture, the Injection Island GA (iiGA). the preliminary results of iiGA's show them to be a promising new approach to coarse-grain GA's.< >

关键词： Genetic algorithms Convergence Genetic mutations Adaptive systems Circuit testing Application software Computer science Topology Optimization methods Image recognition

来源：评论

学校读者我要写书评

暂无评论

A Fast GPU-Based Motion Estimation Algorithm for HD 3D Video Coding

A Fast GPU-Based Motion Estimation Algorithm for HD 3D Video...

引用

international symposium on parallel and distributed processing with applications, ISPA

作者： Rafael Rodríguez S'nchez José Luis Martínez Gerardo Fern'ndez Escribano José Luis S'nchez José Manuel Claver Instituto de Investigación en Informática de Albacete Universidad de Castilla-La Mancha Albacete Spain Departamento de Informática Universidad de Valencia Burjassot Valencia Spain

H.264/AVC is the commercial standard currently most in use for video and is based on single view (mono view). Recently, the video community has also standardized an H.264/AVC extension for supporting 3D video sensation which is referred to as Multiview Video Coding (MVC). Like H.264/AVC, MVC includes temporal and spatial prediction but also includes inter-view prediction as well as disparity estimation. Until now, in H.264/AVC the inter prediction techniques have been the most time-consuming tasks and, thus, in MVC with its new interview predictions the encoding time is even higher. this paper proposes a GPU-based algorithm for both temporal and interview prediction. the algorithm proposed is able to perform this complex prediction task by means of an efficient distribution of all the computations over the GPU and also tries to mitigate the sequential dependencies. the approach can achieve a remarkable time reduction of up to 98% with only a negligible loss in coding efficiency. Moreover, this paper shows that the proposed GPU-based algorithm is more energy efficient and thus, requires less energy than the sequential reference.

关键词： Graphics processing unit Video coding Prediction algorithms Encoding Instruction sets Kernel Software algorithms

来源：评论

学校读者我要写书评

暂无评论

An Efficient GPU General Sparse Matrix-Matrix Multiplication for Irregular Data

An Efficient GPU General Sparse Matrix-Matrix Multiplication...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： Weifeng Liu Brian Vinter Niels Bohr Institute University of Copenhagen Copenhagen Denmark

General sparse matrix-matrix multiplication (SpGEMM) is a fundamental building block for numerous applications such as algebraic multigrid method, breadth first search and shortest path problem. Compared to other sparse BLAS routines, an efficient parallel SpGEMM algorithm has to handle extra irregularity from three aspects: (1) the number of the nonzero entries in the result sparse matrix is unknown in advance, (2) very expensive parallel insert operations at random positions in the result sparse matrix dominate the execution time, and (3) load balancing must account for sparse data in both input matrices. Recent work on GPU SpGEMM has demonstrated rather good both time and space complexity, but works best for fairly regular matrices. In this work we present a GPU SpGEMM algorithm that particularly focuses on the above three problems. Memory pre-allocation for the result matrix is organized by a hybrid method that saves a large amount of global memory space and efficiently utilizes the very limited on-chip scratchpad memory. parallel insert operations of the nonzero entries are implemented through the GPU merge path algorithm that is experimentally found to be the fastest GPU merge approach. Load balancing builds on the number of the necessary arithmetic operations on the nonzero entries and is guaranteed in all stages. Compared with the state-of-the-art GPU SpGEMM methods in the CUSPARSE library and the CUSP library and the latest CPU SpGEMM method in the Intel Math Kernel Library, our approach delivers excellent absolute performance and relative speedups on a benchmark suite composed of 23 matrices with diverse sparsity structures.

关键词： Sparse matrices Graphics processing units Upper bound Load management Artificial neural networks Libraries Instruction sets

来源：评论

学校读者我要写书评

暂无评论

Sorting N items using a p-sorter in optimal time

Sorting N items using a p-sorter in optimal time

引用

international symposium on parallel and distributed processing (IPDPS)

作者： S. Olarin S.Q. Zheng Dept. of Comput. Sci. Old Dominion Univ. Norfolk VA USA Department of Computer Science Louisiana State University Baton Rouge LA USA

A sorting device capable of sorting p items in constant time is called a p-sorter. It is known that the task of sorting N items using a p-sorter requires at least /spl Omega/ (N log N/p log p) applications of the p-sorter. this bound is tight: there exist algorithms that use O (N log N/p log p) calls to the p-sorter to sort N items. However, there is no known implementable algorithm that can sort N items in O(N log N/p log p) time using a p-sorter. the main contribution of this paper is to propose a simple VLSI architecture and to show that in our architecture N items can be sorted in O(N log N/p log p) calls to the p-sorter, while enforcing conflict-free memory accesses. An important feature of our design is that the total additional VLSI area for hardware, other than the memory for data and the p-sorter, is kept to a minimum.

关键词： Sorting Very large scale integration Computer architecture Computer science Semiconductor device measurement Application software Hardware parallel algorithms parallel processing parallel architectures

来源：评论

学校读者我要写书评

暂无评论

e-Science Infrastructure Integration Invariants to Enable HTC and HPC Interoperability applications

e-Science Infrastructure Integration Invariants to Enable HT...

引用

ieee international symposium on parallel and distributed processing Workshops and Phd Forum (IPDPSW)

作者： M. Riedel M.S. Memon A.S. Memon D. Mallmann th. Lippert D. Kranzlmuller A. Streit Forschungszentrum Jülich Jülich Supercomputing Centre Jülich Germany Ludwig Maximilians University Munich Munich Germany Karlsruhe Institute of Technology Karlsruhe Germany

During the past decade, significant international and broader interdisciplinary research is increasingly carried out by global collaborations that often share resources within a single production e-science infrastructure. More recently, increasing complexity of e-science applications embrace multiple physical models (i.e. multi-physics) and consider longer and more detailed simulation runs as well as a larger range of scales (i.e. multi-scale). this increase in complexity is creating a steadily growing demand for cross-infrastructure operations that take the advantage of multiple e-science infrastructures with a more variety of resource types. Since interoperable e-science infrastructures are still not seamlessly provided today we proposed in earlier work the Infrastructure Interoperability Reference Model (IIRM) that represents a trimmed down version of the Open Grid Service Architecture (OGSA) in terms of functionality and complexity, while on the other hand being more specifically useful for production and thus easier to implement. this contribution focuses on several important reference model invariants that are often neglected when infrastructure integration activities are being performed thus hindering seamless interoperability in many aspects. In order to indicate the relevance of our invariant definitions, we provide insights into two accompanying cross-infrastructure use cases of the bio-informatics and fusion science domain.

关键词： Authorization Production Biological system modeling Computational modeling Context Data models

来源：评论

学校读者我要写书评

暂无评论

Quantifying the Effects of Contention on parallel File Systems

Quantifying the Effects of Contention on Parallel File Syste...

引用

ieee international symposium on parallel and distributed processing Workshops and Phd Forum (IPDPSW)

作者： Steven A. Wright Stephen A. Jarvis Performance Computing and Visualisation University of Warwick UK

ISBN: (纸本)9781467376853

As we move towards the Exactable era of supercomputing, node-level failures are becoming more common-place, frequent check pointing is currently used to recover from such failures in long-running science applications. While compute performance has steadily improved year-on-year, parallel I/O performance has stalled, meaning check pointing is fast becoming a bottleneck to performance. Using current file systems in the most efficient way possible will alleviate some of these issues and will help prepare developers and system designers for Exactable, unfortunately, many domain-scientists simply submit their jobs with the default file system configuration. In this paper, we analyse previous work on finding optimality on Lustre file systems, demonstrating that by exposing parallelism in the parallel file system, performance can be improved by up to 49x. However, we demonstrate that on systems where many applications are competing for a finite number of object storage targets (OSTs), competing tasks may reduce optimal performance considerably. We show that reducing each job's request for OSTs by 40% decreases performance by only 13%, while increasing the availability and quality of service of the file system. Further, we present a series of metrics designed to analyse and explain the effects of contention on parallel file systems. Finally, we re-evaluate our previous work with the parallel Log-structured File System (PLFS), comparing it to Lustre at various scales. We show that PLFS may perform better than Lustre in particular configurations, but that at large scale PLFS becomes a bottleneck to performance. We extend the metrics proposed in this paper to explain these performance deficiencies that exist in PLFS, demonstrating that the software creates high levels of self-contention at scale.

关键词： Bandwidth File systems Optimization Quality of service Measurement Supercomputers

来源：评论

学校读者我要写书评

暂无评论

A compiler-enabled model- and measurement-driven adaptation environment for dependability and performance

A compiler-enabled model- and measurement-driven adaptation ...

引用

international symposium on parallel and distributed processing (IPDPS)

作者： V.S. Adve A. Agbaria M.A. Hiltunen R.K. Iyer K.R. Joshi Z. Kalbarczyk R.M. Lefever R. Plante W.H. Sanders R.D. Schlichting University of Illinois Urbana-Champaign Urbana-Champaign IL USA AT and T Research Laboratories Florham Park NJ USA

Traditional techniques for building dependable, high-performance distributed systems are too expensive for most non-critical systems, often causing dependability to be sidelined as a design goal. Nevertheless, systems are expected to be dependable, and if dependability could be provided at a lower cost, many applications would stand to benefit. We believe that compiler techniques can be used to create novel and enhance existing dependability mechanisms to create a wider range of cost/dependability tradeoffs than is currently available. Similarly, compilers can assist in the area of error detection by expanding the range of errors that can be detected. New compiler techniques, combined with model-driven adaptation and control mechanisms, can be used to dynamically guide a system as it makes choices, with cost, dependability, and performance tradeoffs, in response to the occurrence of faults and changes in the environment. this paper reports on a new project that is exploring the approach. the broad goal of the work is to create a powerful yet flexible runtime environment for dependable and high-performance systems that operate within much lower cost constraints than is currently possible.

关键词： Adaptation model Costs Military computing distributed computing Grid computing Runtime environment Computer applications Predictive models Area measurement Buildings

来源：评论

学校读者我要写书评

暂无评论

Implementations and Interpretations of the Talbot-Ogden Infiltration Model

Implementations and Interpretations of the Talbot-Ogden Infi...

引用

13th international symposium on distributed Computing and applications to Business,Engineering & Science（DCABES 2014）

作者： Mookwon Seo Derrick Cerwinsky Krishan Gahalaut Craig C.Douglas University of Wyoming Mathematics Department King Abdullah University of Science& Technology (KAUST) University of Wyoming School of Energy Resources and Mathematics Department

the interaction between surface and subsurface hydrology flow systems is important for water supplies. Accurate, efficient numerical models are needed to estimate the movement of water through unsaturated soil. We investigate a water infiltration model and develop very fast serial and parallel implementations that are suitable for a computer with a graphical processing unit(GPU).

关键词： parallel computing GPU computing Hydrology Water infiltration

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共258页 << < 242 243 244 245 246 247 248 249 250 251 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：