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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

16,237 篇 会议
368 篇 期刊文献
22 册 图书

馆藏范围

16,627 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

9,336 篇 工学
- 8,536 篇 计算机科学与技术...
- 4,019 篇 软件工程
- 1,983 篇 电气工程
- 1,384 篇 信息与通信工程
- 676 篇 电子科学与技术（可...
- 536 篇 控制科学与工程
- 229 篇 网络空间安全
- 188 篇 仪器科学与技术
- 141 篇 机械工程
- 115 篇 生物医学工程（可授...
- 106 篇 动力工程及工程热...
- 105 篇 测绘科学与技术
- 97 篇 光学工程
- 91 篇 生物工程
- 82 篇 建筑学
- 70 篇 土木工程
- 63 篇 环境科学与工程（可...
- 62 篇 安全科学与工程
1,974 篇 理学
- 1,506 篇 数学
- 245 篇 物理学
- 204 篇 统计学（可授理学、...
- 177 篇 系统科学
- 115 篇 生物学
- 100 篇 地球物理学
- 69 篇 化学
1,464 篇 管理学
- 1,206 篇 管理科学与工程(可...
- 468 篇 工商管理
- 321 篇 图书情报与档案管...
106 篇 医学
- 86 篇 临床医学
96 篇 经济学
- 93 篇 应用经济学
56 篇 法学
53 篇 农学
18 篇 教育学
12 篇 文学
9 篇 军事学
1 篇 艺术学

主题

2,212 篇 parallel process...
1,199 篇 computer archite...
1,130 篇 concurrent compu...
1,116 篇 distributed comp...
1,063 篇 computational mo...
1,037 篇 application soft...
1,017 篇 distributed proc...
990 篇 hardware
905 篇 computer science
708 篇 graphics process...
595 篇 runtime
527 篇 scalability
518 篇 parallel process...
507 篇 algorithm design...
494 篇 parallel program...
490 篇 parallel algorit...
470 篇 graphics process...
460 篇 kernel
446 篇 processor schedu...
440 篇 conferences

机构

38 篇 ibm thomas j. wa...
33 篇 college of compu...
31 篇 school of comput...
27 篇 oak ridge nation...
26 篇 university of ch...
26 篇 oak ridge natl l...
25 篇 georgia inst tec...
25 篇 ohio state univ ...
24 篇 department of co...
23 篇 tsinghua univers...
23 篇 pacific northwes...
21 篇 argonne national...
21 篇 oak ridge nation...
20 篇 georgia inst tec...
19 篇 college of compu...
19 篇 school of comput...
19 篇 department of co...
19 篇 argonne natl lab...
19 篇 pacific northwes...
19 篇 national laborat...

作者

39 篇 jack dongarra
31 篇 dongarra jack
29 篇 zomaya albert y.
26 篇 bader david a.
23 篇 feng wu-chun
22 篇 boukerche azzedi...
19 篇 hoefler torsten
18 篇 gagan agrawal
18 篇 schulz martin
16 篇 dhabaleswar k. p...
16 篇 p. sadayappan
16 篇 wang yijie
15 篇 ito yasuaki
15 篇 yves robert
14 篇 h. casanova
14 篇 alexey lastovets...
14 篇 azad ariful
13 篇 dongsheng li
13 篇 wang guojun
13 篇 kishore kothapal...

语言

16,553 篇 英文
44 篇 其他
27 篇 中文
2 篇 土耳其文
1 篇 葡萄牙文

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

共 16627 条记录，以下是4641-4650 订阅

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

详细简洁

排序：

A dynamic firing speculation to speedup distributed symbolic state-space generation 20

A dynamic firing speculation to speedup distributed symbolic...

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Chung, Ming-Ying Ciardo, Gianfranco University of California Riverside Department of Computer Science and Engineering Riverside CA 92521 United States

ISBN: (纸本)1424400546

The saturation strategy for symbolic state-space generation is very effective for globally-asynchronous locally-synchronous discrete-state systems. Its inherently sequential nature, however, makes it difficult to parallelize on a NOW. An initial attempt that utilizes idle workstations to recognize event firing patterns and then speculatively compute firings conforming to these patterns is at times effective but can introduce large memory overheads. We suggest an implicit method to encode the firing history of decision diagram nodes, where patterns can be shared by nodes. By preserving the actual firing history efficiently and effectively, the speculation is more informed. Experiments show that our implicit encoding method not only reduces the memory requirements but also enables dynamic speculation schemes that further improve runtime. © 2006 ieee.

关键词： State space methods

来源：评论

学校读者我要写书评

暂无评论

Performance Improvements of parallel applications thanks to MPI-4.0 Hints 34

Performance Improvements of Parallel Applications thanks to ...

引用

34th ieee international symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Moraru, Maxim Roussel, Adrien Taboada, Hugo Jaillet, Christophe Perache, Marc Krajecki, Michael Univ Reims LICIIS F-51097 Reims France CEA DAM DIF LRC DIGIT F-91297 Arpajon France Univ Paris Saclay CEA Lab Informat Haute Peiformance Calcul & Simulat Bruyeres Le Chatel France CEA DAM DIF F-91297 Arpajon France Univ Reims LRC DIGIT LICIIS F-51097 Reims France

ISBN: (数字)9781665451550

ISBN: (纸本)9781665451550

HPC systems have experienced significant growth over the past years, with modern machines having hundreds of thousands of nodes. Message Passing Interface (MPI) is the de facto standard for distributed computing on these architectures. On the MPI critical path, the message-matching process is one of the most time-consuming operations. In this process, searching for a specific request in a message queue represents a significant part of the communication latency. So far, no miracle algorithm performs well in all cases. This paper explores potential matching specializations thanks to hints introduced in the latest MPI 4.0 standard. We propose a hash-table-based algorithm that performs constant time message-matching for no wildcard requests. This approach is suitable for intensive point-to-point communication phases in many applications (more than 50% of CORAL benchmarks). We demonstrate that our approach can improve the overall execution time of real HPC applications by up to 25%. Also, we analyze the limitations of our method and propose a strategy for identifying the most suitable algorithm for a given application. Indeed, we apply machine learning techniques for classifying applications depending on their message pattern characteristics.

关键词： HPC distributed programming MPI Matching MPI 4.0 Sessions

来源：评论

学校读者我要写书评

暂无评论

Vector-processing for Mobile Devices: Benchmark and Analysis 26

Vector-Processing for Mobile Devices: Benchmark and Analysis

引用

26th ieee international symposium on Workload Characterization (IISWC)

作者： Khadem, Alireza Fujiki, Daichi Talati, Nishil Mahlke, Scott Das, Reetuparna Univ Michigan Ann Arbor MI 48109 USA Keio Univ Keio Japan Nvidia Res New York NY USA

ISBN: (纸本)9798350303179

Vector processing has become commonplace in today's CPU microarchitectures. Vector instructions improve performance and energy which is crucial for resource-constraint mobile devices. The research community currently lacks a comprehensive benchmark suite to study the benefits of vector processing for mobile devices. This paper presents Swan-an extensive vector processing benchmark suite for mobile applications. Swan consists of a diverse set of data-parallel workloads from four commonly used mobile applications: operating system, web browser, audio/video messaging application, and PDF rendering engine. Using Swan benchmark suite, we conduct a detailed analysis of the performance, power, and energy consumption of vectorized workloads, and show that: (a) Vectorized kernels increase the pressure on cache hierarchy due to the higher rate of memory requests. (b) Vector processing is more beneficial for workloads with lower precision operations and higher cache hit rates. (c) Limited Instruction-Level parallelism and strided memory accesses to multi-dimensional data structures prevent vector processing benefits from scaling with more SIMD functional units and wider registers. (d) Despite lower computation throughput than domain-specific accelerators, such as GPU, vector processing outperforms these accelerators for kernels with lower operation counts. Finally, we show five common computation patterns in mobile data-parallel workloads that dominate the execution time.

关键词： Mobile Benchmark Suite Mobile Vector processing SIMD

来源：评论

学校读者我要写书评

暂无评论

On the parallelisation of MCMC-based image processing

On the parallelisation of MCMC-based image processing

引用

2010 ieee international symposium on parallel and distributed processing, Workshops and Phd Forum, IPDPSW 2010

作者： Byrd, Jonathan M. R. Jarvis, Stephen A. Bhalerao, Abhir H. Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom

ISBN: (纸本)9781424465347

The increasing availability of multi-core and multi-processor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Monte Carlo (MCMC) simulations are widely used for approximate counting problems, Bayesian inference and as a means for estimating very high-dimensional integrals. As such MCMC has found a wide variety of applications in fields including computational biology and physics, financial econometrics, machine learning and image processing. Whilst divide and conquer is an obvious means to simplify image processing tasks, "naively" dividing an image into smaller images to be processed separately results in anomalies and breaks the statistical validity of the MCMC algorithm. We present a method of grouping the spatially local moves and temporarily partitioning the image to allow those moves to be processed in parallel, reducing the runtime whilst conserving the properties of the MCMC method. We calculate the theoretical reduction in runtime achievable by this method, and test its effectiveness on a number of different architectures. Experiments are presented that show reductions in runtime of 38% using a dual-core dual-processor machine. In circumstances where absolute statistical validity are not required, an algorithm based upon, but not strictly adhering to, MCMC may suffice. For such situation two additional algorithms are presented for partitioning of images to which MCMC will be applied. Assuming preconditions are met, these methods may be applied with minimal risk of anomalous results. Although the extent of the runtime reduction will be data dependent, the experiments performed showed the runtime reduced to 27% of its original value.© 2010 ieee.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

A VLSI BASED MULTIPROCESSOR ARCHITECTURE FOR VIDEO SIGNAL-processing

A VLSI BASED MULTIPROCESSOR ARCHITECTURE FOR VIDEO SIGNAL-PR...

引用

international SYMP ON CIRCUITS AND SYSTEMS ( ISCAS 92 )

作者： JESCHKE, H GAEDKE, K PIRSCH, P Laboratorium für Informationstechnologie Universität Hannover Schneiderberg 32 Hannover 1 D-3000 Germany

ISBN: (纸本)0780305930

This paper discusses a VLSI based multiprocessor architecture for real-time processing of video coding applications. The architecture consists of multiple identical processing elements and is characterized as MIMD (Multiple Instruction Multiple Data). The architecture of a processing element is based on a standard processor core, e. g. a RISC processor, and a low level coprocessor. The low level coprocessor is adapted to parallel processing of convolution-like operations. The performance of the architecture is discussed withrespectto the processing time for hybrid coding algorithms as well as to the required silicon area. © 2012 ieee.

关键词： Coprocessor

来源：评论

学校读者我要写书评

暂无评论

Improving Multisite Workflow Performance using Model-based Scheduling 43

Improving Multisite Workflow Performance using Model-based S...

引用

43rd Annual international Conference on parallel processing (ICPP)

作者： Maheshwari, Ketan Jung, Eun-Sung Meng, Jiayuan Vishwanath, Venkatram Kettimuthu, Rajkumar Argonne Natl Lab MCS Div Argonne IL 60439 USA Argonne Natl Lab LCF Div Argonne IL 60439 USA

ISBN: (纸本)9781479956180

Workflows play an important role in expressing and executing scientific applications. In recent years, a variety of computational sites and resources have emerged, and users often have access to multiple resources that are geographically distributed. These computational sites are heterogeneous in nature and performance of different tasks in a workflow varies from one site to another. Additionally, users typically have a limited resource allocation at each site. In such cases, judicious scheduling strategy is required in order to map tasks in the workflow to resources so that the workload is balanced among sites and the overhead is minimized in data transfer. Most existing systems either run the entire workflow in a single site or use naive approaches to distribute the tasks across sites or leave it to the user to optimize the allocation of tasks to distributed resources. This results in a significant loss in productivity for a scientist. In this paper, we propose a multi-site workflow scheduling technique that uses performance models to predict the execution time on different resources and dynamic probes to identify the achievable network throughput between sites. We evaluate our approach using real world applications in a distributed environment using the Swift distributed execution framework and show that our approach improves the execution time by up to 60% compared to the default schedule.

关键词： Clouds distributed computing parallel programming Resource modeling Scripting Swift

来源：评论

学校读者我要写书评

暂无评论

Scheduling distributed applications: The SimGrid simulation framework

Scheduling distributed applications: The SimGrid simulation ...

引用

3rd ieee/ACM international symposium on Cluster Computing and the Grid (CCGrid2003)

作者： Legrand, A Marchal, L Casanova, H Ecole Normale Super Lyon Lab Informat Parallelisme Lyon France

ISBN: (纸本)0769519199

Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach is to employ scheduling heuristics that approximate an optimal schedule. Unfortunately, it is often impossible to obtain analytical results to compare the efficacy of these heuristics. One possibility is to conducts large numbers of back-to-back experiments on real platforms. While this is possible on tightly-coupled platforms, it is infeasible on modern distributed platforms (i.e. Grids) as it is labor-intensive and does not enable repeatable results. The solution is to resort to simulations. Simulations not only enables repeatable results but also make it possible to explore wide ranges of platform and application scenarios. In this paper we present the SimGrid framework which enables the simulation of distributed applications in distributed computing environments for the specific purpose of developing and evaluating scheduling algorithms. This paper focuses on SimGrid v2, which greatly improves on the first version of the software with more realistic network models and topologies. SimGrid v2 also enables the simulation of distributed scheduling agents, which has become critical for current scheduling research in large-scale platforms. After describing and validating these features, we present a case study by which we demonstrate the usefulness of SimGrid for conducting scheduling research.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A compact and flexible Multi-DSP system for real-time SAR applications

A compact and flexible Multi-DSP system for real-time SAR ap...

引用

23rd international Geoscience and Remote Sensing symposium (IGARSS 2003)

作者： Langemeyer, S Kloos, H Simon-Klar, C Friebe, L Hinrichs, W Lieske, H Pirsch, P Univ Hannover Informat Technol Lab D-30167 Hannover Germany

ISBN: (纸本)0780379292

This paper presents a Multi-DSP system for real-time SAR-processing using the HiPAR-DSP 16. We developed this full programmable processor at the Laboratorium fur Informationstechnologie. With 16 parallel data paths and a two-dimensional memory it is optimized for image processing algorithms like FFT-transforms. SAR image synthesis methods, like the investigated wk-algorithm, use the computational intensive FFT-transform. To overcome the large processing power of future realtime SAR image synthesis applications, several DSPs have to work in parallel. The presented compact SAR system can be easily adapted to match the demands of different SAR algorithms by scaling the number of processing nodes. Equiped with 6 HiPAR-DSP 16 a 233 x 175 x 15 mm(3) board provides a realtime capability of processing SAR applications with a PRF of 1200 Hz. A rangeline length of 4096 8 bit complex samples and 4096 rangelines is assumed. The small volume and it's power consumption of less than 35 W enables it for on-board usage in compact air- or spaceborne systems.

关键词： Synthetic aperture radar

来源：评论

学校读者我要写书评

暂无评论

Analysis of the numerical effects of parallelism on a parallel genetic algorithm

Analysis of the numerical effects of parallelism on a parall...

引用

Proceedings of the 1996 10th international parallel processing symposium

作者： Hart, William E. Baden, Scott Belew, Richard K. Kohn, Scott Sandia Natl Lab Albuquerque United States

This paper examines the effects of relaxed synchronization on both the numerical and parallel efficiency of parallel genetic algorithms (GAs). We describe a coarse-grain geographically structured parallel genetic algorithm. Our experiments provide preliminary evidence that asynchronous versions of these algorithms have a lower run time than synchronous GAs. Our analysis shows that this improvement is due to (1) decreased synchronization costs and (2) high numerical efficiency (e.g. fewer function evaluations) for the asynchronous GAs. This analysis includes a critique of the utility of traditional parallel performance measures for parallel GAs.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Simulating and optimizing a peer-to-peer computing framework 20

Simulating and optimizing a peer-to-peer computing framework

引用

20th ieee international parallel and distributed processing symposium, IPDPS 2006

作者： Ernst-Desmulier, Jean-Baptiste Bourgeois, Julien Ngo, Minh Thanh Spies, François Verbeke, Jérome Laboratoire d'Informatique de Franche-Comté University of Franche-Comte 1 Cours Leprince-Ringuet 25200 Montbéliard France Lawrence Livermore National Laboratory Livermore CA 94550 United States

ISBN: (纸本)1424400546

The aim of P2P computing is to build virtual computing systems dedicated to large-scale computational problems. JXTA1proposes an underlying infrastructure on which JNGI2, one of the first P2P decentralized computing frameworks is built. In order to test this framework, we have built a tool named P2PPerf, which allows us to study the behavior of JNGI and to optimize it according to our simulation results. © 2006 ieee.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 461 462 463 464 465 466 467 468 469 470 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：