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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是191-200 订阅

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

详细简洁

排序：

Barrier Synchronization: Simplified, Generalized, and Solved without Mutual Exclusion 32

Barrier Synchronization: Simplified, Generalized, and Solved...

引用

32nd ieee international parallel and distributed processing symposium (IPDPS)

作者： Aravind, Alex Univ Northern British Columbia Dept Comp Sci Prince George BC Canada

ISBN: (纸本)9781538655559

Barrier synchronization is a fundamental concurrency issue encountered in a large number of concurrent and parallel applications that involve parallel processes cooperatively solving complex problems. Barrier synchronization essentially forces these parallel processes to wait until each one of them has reached a certain point in execution. Therefore, barrier synchronization has been considered as an inevitable synchronization construct for most parallel applications. Hence barrier synchronization or its variant has become an integral component of the most widely used parallel programming models such as OpenMP, MPI, MapReduce, and the bulk synchronous parallel (BSP) models. In [2], the authors stated that the performance of BSP model depends on 4 parameters the number of nodes, the speed of each node, the communication cost, and the synchronization cost. Among these, the synchronization cost is considered critical in improving the performance of any BSP implementation [2]. From parallel algorithm design and implementation perspective, we consider that the synchronization component is the most important one and its cost is the most critical performance factor for almost all the parallel programming models including BSP. This paper presents a class of simple barrier synchronization algorithms for shared memory systems. It includes general, efficient, and universal algorithms that are appealing from both practical and theoretical point of view. The correctness of the algorithms are proved. The algorithms are briefly analyzed to expose their strengths and weaknesses.

关键词： Barrier synchronization Mapreduce BSP parallel and distributed computational models Concurrent programming parallel processing distributed computing

来源：评论

学校读者我要写书评

暂无评论

A Three-Level parallel Algorithm For MrBayes 3.2 15

A Three-Level Parallel Algorithm For MrBayes 3.2

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Zhao, Mingjie Ren, Qiang Wang, Yilin Deng, Ruikang Ren, Mingming Wang, Gang Liu, Xiaoguang Nankai Univ Nankai Baidu Joint Lab Tianjin Peoples R China

ISBN: (纸本)9781538637906

MrBayes is a popular bioinformatics software that is widely used in phylogenetic analysis. The core algorithm of Mrbayes is Metropolis Coupled Markov Chain Monte Carlo (MC3). However, when dealing with large data sets, MC3 algorithm is too slow to meet researcher's requirements. Although several parallelizations have been proposed for MrBayes, such as MPI (Message Passing Interface) based MrBayes, GPU (Graphics processing Unit) based MrBayes, there is still no efficient parallel algorithm to fully utilize computing power of modern CPU and computer architecture. This paper (a) presents a new three-level hybrid parallel algorithm, include data-level parallelism (DLP), thread-level parallelism (TLP), and process-level parallelism (PLP), which can be used on most modern multi-core computers;(b) compares the performance of different combinations of parallel strategies on real-world protein data sets. The experimental results show that, this hybrid parallel algorithm does convert more computing powers into higher speedup. Furthermore, the proposed algorithm's speedup is near the speedup on one GPU at the same data sets. This algorithm is fit for practical use in phylogenetic inferences.

关键词： MrBayes SIMD hybrid parallel computing

来源：评论

学校读者我要写书评

暂无评论

Modelling Memory Requirements for Grid applications

Modelling Memory Requirements for Grid Applications

引用

23rd ieee international parallel and distributed processing symposium

作者： Elahi, Tanvire Kiddle, Cameron Simmonds, Rob Univ Calgary Grid Res Ctr Calgary AB T2N 1N4 Canada

ISBN: (纸本)9781424437511

Automating the execution of applications in grid computing environments is a complicated task due to the heterogeneity of computing resources, resource usage policies, and application requirements. applications differ in memory, usage, performance, scalability and storage usage. Having knowledge of this information can aid in matching jobs to resources and in selecting appropriate configuration parameters such as the number of processors to run on and memory, requirements for those resources. This paper presents an application memory usage model that can be used to aid in selecting appropriate job configurations for different resources. The model can be used to represent how memory scales with the number of processors, the memory usage of different types of processes, and changes in memory, usage during execution. It builds on a previously, developed information model used for describing resources, resource usage policies and limited information on applications. An analysis of the memory, usage model illustrating its use towards automating job execution in grid computing environments is also presented.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

FFT on XMT: Case Study of a Bandwidth-Intensive Regular Algorithm on a Highly-parallel Many Core 30

FFT on XMT: Case Study of a Bandwidth-Intensive Regular Algo...

引用

30th ieee international parallel and distributed processing symposium (IPDPS)

作者： Edwards, James Vishkin, Uzi Univ Maryland UMIACS College Pk MD 20742 USA

ISBN: (纸本)9781509036820

FFT has been a classic computation engine for numerous applications. The bandwidth-intensive nature of FFT capped its performance on off-the-shelf parallel machines that are bandwidth-limited, and forced application researchers into seeking easier-to-speedup alternatives to FFT, even when inferior to FFT. But, what if effective support of FFT is feasible? Using FFT as an example, we examine the impact that adoption of some enabling technologies, including silicon photonics, would have on the performance of a many-core architecture. The results show that a single-chip many-core processor could potentially outperform a large high-performance computing cluster.

关键词： data movement Fast Fourier Transform (FFT) many-core PRAM

来源：评论

学校读者我要写书评

暂无评论

Automatic Refinement of parallel applications Structure Detection

Automatic Refinement of Parallel Applications Structure Dete...

引用

26th ieee international parallel and distributed processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Gonzalez, Juan Huck, Kevin Gimenez, Judit Labarta, Jesus Univ Politecn Catalunya Barcelona Tech Barcelona Supercomp Ctr Barcelona Spain ParaTools Inc Eugene OR USA

ISBN: (纸本)9780769546766

Analyzing parallel programs has become increasingly difficult due to the immense amount of information collected on large systems. In this scenario, cluster analysis has been proved to be a useful technique to reduce the amount of data to analyze. A good example is the use of the density-based cluster algorithm DBSCAN to identify similar single program multiple data (SPMD) computing phases in message-passing applications. This structure detection simplifies the analyst work as the whole information available is reduced to a small set of clusters. However, DBSCAN presents two major problems: it is very sensitive to its parametrization and is not capable of correctly detect clusters when the data set has different densities across the data space. In this paper, we introduce the Aggregative Cluster Refinement, an iterative algorithm that produces more accurate structure detections of SPMD phases than DBSCAN. In addition, it is able to detect clusters with different densities.

关键词： parallel applications performance analysis automatic analysis cluster analysis data mining

来源：评论

学校读者我要写书评

暂无评论

Enabling High-Performance Memory Migration for Multithreaded applications on Linux

Enabling High-Performance Memory Migration for Multithreaded...

引用

23rd ieee international parallel and distributed processing symposium

作者： Goglin, Brice Furmento, Nathalie INRIA 351 Cours Liberat F-33405 Talence France CNRS F-33405 Talence France

ISBN: (纸本)9781424437511

As the number of cores per machine increases, memory architectures are being redesigned to avoid bus contention and sustain higher throughput needs. The emergence of Non-Uniform Memory Access (NUMA) constraints has caused affinities between threads and buffers to become an important decision criterion for schedulers. Memory migration dynamically enables the joint distribution of work and data across the machine but requires high-performance data transfers as well as a convenient programming interface. We present improvements of the LINUX migration primitives and the implementation of a Next-touch policy in the kernel to provide multithreaded applications with an easy way to dynamically maintain thread-data affinity. Microbenchmarks show that our work enables a high-performance, synchronous and lazy memory migration within multithreaded applications. A threaded LU factorization then reveals the large improvement that our Next-touch policy model may bring in applications with complex access patterns.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Solving the Container Explosion Problem for distributed High Throughput Computing 34

Solving the Container Explosion Problem for Distributed High...

引用

34th ieee international parallel and distributed processing symposium (IPDPS)

作者： Shaffer, Tim Hazekamp, Nicholas Blomer, Jakob Thain, Douglas Univ Notre Dame Notre Dame IN 46556 USA European Lab Particle Phys CERN Geneva Switzerland

ISBN: (纸本)9781728168760

Container technologies are seeing wider use at advanced computing facilities for managing highly complex applications that must execute at multiple sites. However, in a distributed high throughput computing setting, the unrestricted use of containers can result in the container explosion problem. If a new container image is generated for each variation of a job dispatched to a site, shared storage is soon exceeded. On the other hand, if a single large container image is used to meet multiple needs, the size of that container may become a problem for storage and transport. To address this problem, we observe that many containers have an internal structure generated by a structured package manager, and this information could be used to strategically combine and share container images. We develop LANDLORD to exploit this property and evaluate its performance through a combination of simulation studies and empirical measurement of high energy physics applications.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Dynamic Load Balancing and Channel Strategy for Apache Flume Collecting Real-time Data Stream 15

Dynamic Load Balancing and Channel Strategy for Apache Flume...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Shu, Buqing Chen, Haopeng Sun, Meng Shanghai Jiao Tong Univ Sch Software Shanghai Peoples R China

ISBN: (纸本)9781538637906

With the development of information technology, real-time data stream processing(RTDSP) has become a popular research topic. The first step of RTDSP is collecting data, requiring a data collector to receive data from the source and send them to the sink. Apache Flume, a distributed and reliable framework, used for this purpose, has some limitations and drawbacks on load balancing and storage. In this paper, we aim to improve performance and availability for collecting unstable real-time big data stream. So we propose a new load balancing strategy based on the free memory size and a storage strategy of integration memory channel with the multi-file channel to reduce the overhead of disk and network. Finally, the experimental results show that the availability and performance are improved under the condition of a poor network, high availability requirements, intense competition in memory resources and large data size. Specifically, the availability is higher than 99.999%, and the performance can be improved by 10%-50% under different conditions.

关键词： Load management Real-time systems distributed databases Throughput Monitoring Dynamic scheduling Memory management

来源：评论

学校读者我要写书评

暂无评论

An approach of anomaly diagnosis with logs for distributed services in communication network information system 15

An approach of anomaly diagnosis with logs for distributed s...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Sun, Kang Meng, Luo-Ming Guo, Shao-Yong Xu, Si-Ya Wang, Ying Li, Wei-Jian Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Power Grid Co Ltd Elect Power Dispatching Control Ctr Guangdong Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538637906

Anomaly diagnosis for distributed service plays an important role in communication network information system. Log analysis is the main method to undertake anomaly detection. In order to reduce the manual detection, we propose an anomaly detection method based on the time-weighted control flaw graph model. The border is split by a discrete degree strategy based on analyzing the time interval distribution and the time weight is selected to be k-means. Experiments show that our algorithm has good precision and recall in anomaly diagnosis. In real-world scenarios, it has a precision of 80% and a recall rate of 65% on average.

关键词： anomaly diagnosis logs distributed services time weight

来源：评论

学校读者我要写书评

暂无评论

Clustering Boundary Cutting for Packet Classification based on Distribution Density 15

Clustering Boundary Cutting for Packet Classification based ...

引用

15th ieee international symposium on parallel and distributed processing with applications (ISPA) / 16th ieee international Conference on Ubiquitous Computing and Communications (IUCC)

作者： Bi, Xia-an Zhou, Yanwen Yu, Jianping Hunan Nounal Univ Coll Math & Comp Sci Changsha 410081 Hunan Peoples R China

ISBN: (纸本)9781538637906

In this paper, we present the clustering boundary cutting trie algorithm in order to solve the problem of huge time consumption in existing trie based algorithms. In the proposed solution, there are two stages. The first stage is the density-based rule clustering process. The rules are represented as a range between 0 and 1 according to the prefixes of the packet fields. When the number of the rules in a range reaches to a certain density, the corresponding rules are formed in a cluster. The second stage is the trie construction process based on these clusters. Compared with traditional packet classification algorithms, the searching time of our algorithm increases by 47.05% -73.76% and keep the high accuracy of 69.83%-93.17%. The experiment demonstrates that our algorithm can effectively keep high accuracy as well as keeping stable high-throughput, and it is suitable for actual deployment.

关键词： Packet Classification Density-Based Clustering Trie

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：