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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,921 篇 会议
224 篇 期刊文献
173 册 图书
3 篇 学位论文

馆藏范围

11,321 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

6,670 篇 工学
- 6,102 篇 计算机科学与技术...
- 2,912 篇 软件工程
- 1,181 篇 电气工程
- 1,066 篇 信息与通信工程
- 479 篇 电子科学与技术（可...
- 358 篇 控制科学与工程
- 175 篇 仪器科学与技术
- 151 篇 机械工程
- 116 篇 动力工程及工程热...
- 112 篇 生物医学工程（可授...
- 101 篇 生物工程
- 87 篇 光学工程
- 87 篇 建筑学
- 69 篇 土木工程
- 68 篇 网络空间安全
- 65 篇 化学工程与技术
- 59 篇 材料科学与工程（可...
- 58 篇 安全科学与工程
1,465 篇 理学
- 975 篇 数学
- 310 篇 物理学
- 156 篇 系统科学
- 140 篇 统计学（可授理学、...
- 135 篇 生物学
- 83 篇 化学
898 篇 管理学
- 648 篇 管理科学与工程(可...
- 307 篇 图书情报与档案管...
- 290 篇 工商管理
144 篇 医学
- 120 篇 临床医学
- 62 篇 基础医学(可授医学...
62 篇 经济学
- 62 篇 应用经济学
55 篇 法学
34 篇 农学
26 篇 教育学
18 篇 文学
11 篇 军事学

主题

1,465 篇 parallel process...
583 篇 computer archite...
553 篇 distributed comp...
536 篇 application soft...
533 篇 computational mo...
528 篇 concurrent compu...
343 篇 hardware
318 篇 graphics process...
310 篇 scalability
307 篇 parallel program...
306 篇 graphics process...
304 篇 computer science
285 篇 runtime
263 篇 big data
263 篇 optimization
254 篇 parallel process...
227 篇 throughput
225 篇 processor schedu...
214 篇 resource managem...
209 篇 bandwidth

机构

31 篇 national laborat...
23 篇 science and tech...
21 篇 department of co...
19 篇 national laborat...
18 篇 university of ch...
17 篇 school of comput...
17 篇 institute of com...
16 篇 school of comput...
15 篇 college of compu...
15 篇 georgia inst tec...
15 篇 barcelona superc...
15 篇 department of co...
15 篇 intel corporatio...
14 篇 school of comput...
14 篇 chinese acad sci...
13 篇 tsinghua univ de...
13 篇 ibm thomas j. wa...
13 篇 cent s univ sch ...
13 篇 college of compu...
13 篇 ohio state univ ...

作者

21 篇 jack dongarra
16 篇 badia rosa m.
16 篇 liu jie
15 篇 wang guojun
15 篇 yijie wang
15 篇 a. choudhary
14 篇 anon
14 篇 kurt rothermel
13 篇 jun wang
13 篇 koldehofe boris
13 篇 mencagli gabriel...
13 篇 prodan radu
13 篇 wang yijie
12 篇 fahringer thomas
12 篇 dongsheng li
12 篇 zomaya albert y.
12 篇 navaux philippe ...
12 篇 yong dou
11 篇 fernandes luiz g...
11 篇 guangwen yang

语言

11,019 篇 英文
267 篇 其他
36 篇 中文
2 篇 俄文
2 篇 土耳其文
1 篇 德文

检索条件"任意字段=International Conference on Parallel and Distributed Processing Techniques and Applications"

共 11321 条记录，以下是3751-3760 订阅

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

详细简洁

排序：

Thread Progress Aware Block Migration for Dynamic NUCA

Thread Progress Aware Block Migration for Dynamic NUCA

引用

Euromicro conference on parallel, distributed and Network-Based processing

作者： Jianhua Li Xin An Yiming Ouyang Weiwang College of Computer & Information Hefei University of Technology China Hefei University of Technology Hefei Anhui CN

Non-Uniform Cache Architecture (NUCA) is a viable solution for large capacity on-chip caches to manage the increasing wire delay. Dynamic NUCA divides the last-level cache (LLC) into smaller cache banks connected by on-chip network. D-NUCA yields good performance through migrating blocks within bank sets at runtime to harness data locality. Various works have well explored and studied D-NUCA, including block migration, mapping and searching. However, all of the previous D-NUCA design are thread-oblivious. Due to the interference on shared resources, threads often demonstrate unbalanced progress wherein the lagging threads with slow progress are more critical to overall performance. In this paper, we propose a novel D-NUCA design called Thread prOgress aware block Migration (TOM). TOM exploits the dynamic thread criticality information to control block migration. TOM aims at boosting the execution of critical threads through biased block migration. Experimental results show that TOM can effectively reduce the execution time of a set of PARSEC applications with less energy dissipation compared with previous D-NUCA design.

关键词： Instruction sets System-on-chip Radiation detectors Energy dissipation Arrays Multicore processing

来源：评论

学校读者我要写书评

暂无评论

MrBayes 3.2.6 on Tianhe-1A: A High Performance and distributed Implementation of Phylogenetic Analysis

MrBayes 3.2.6 on Tianhe-1A: A High Performance and Distribut...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： Cheng Ling Arong Luo Jingyang Gao Guangzhou Institute of Advanced Technology Chinese Academy of Sciences Guangzhou P. R. China Deportment of Computer Science and Technology Beijing University of Chemical Technology Beijing P. R. China Key Laboratory of Systematics and Evolution Chinese Academy of Sciences Beijing P. R. China

ISBN: (纸本)9781509053827

Phylogenetic analysis has achieved extraordinary results in domains like species delimitation and evolutionary biology. An essential element behind this success has been the introduction of high performance computing techniques in the step of estimating the phylogenetic likelihoods. This paper describes the design and implementation of a distributed and CPU-GPU based heterogeneous computing system on parallelizing the analysis. The parallelization has been implemented in the state-of-the-art version of MrBayes, a widespread phylogeny reconstruction program. We benchmarked the method and another two GPU-based methods by using 8 distributed computing nodes on Tianhe-1A. The experimental results indicate that the proposed method outstrips BEAGLE and the nMC3 method by speedup factors of up to 1.98× and 1.68×, respectively. In comparison to the serially implemented MrBayes, a peak speedup of 188× is finally achieved by using 8 Tesla M 2050 GPUs. The proposed method is publicly available to facilitate further research on phylogenetic analysis.

关键词： Phylogeny Graphics processing units Acceleration Vegetation Probability Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Implementation of 8 bit processing element for edge detection techniques

Implementation of 8 bit processing element for edge detectio...

引用

international conference on Information Communication and Embedded Systems (ICICES)

作者： Manisha P. Khorgade Pravin Dakhole ETC Department RGCER Nagpur India Electronics Department YCCE Nagpur India

ISBN: (纸本)9781509025534

Today's multimedia, wireless applications increasing complexity which is motivation for the system designers to innovate continuously. The strongly emerging class Coarse-Grained Re-configurable Architecture (CGRA), is currently receiving high attention. CGRA has excellent performance with flexibility in fabrication techniques. Reconfigurable fabric (RF) is main part of CGRA processor. This paper gives a innovative design of processing element (PE) of reconfigurable fabric(RF) to achieve parallel processing techniques for edge detection. RF contains set of processing elements (PE) with mesh type of arrangement for 2 dimensional processing of image edge detection technique. This implemented design is evaluated by analyzing images of various sizes.

关键词： Radio frequency Image edge detection Routing Embedded systems Topology Computer architecture Fabrics

来源：评论

学校读者我要写书评

暂无评论

Task Allocation for distributed Stream processing

Task Allocation for Distributed Stream Processing

引用

Annual IEEE international conference on Computer Communications

作者： Raphael Eidenbenz Thomas Locher ABB Corporate Research

ISBN: (纸本)9781467399548

There is a growing demand for live, on-the-fly processing of increasingly large amounts of data. In order to ensure the timely and reliable processing of streaming data, a variety of distributed stream processing architectures and platforms have been developed, which handle the fundamental tasks of (dynamically) assigning processing tasks to the currently available physical resources and routing streaming data between these resources. However, while there are plenty of platforms offering such functionality, the theory behind it is not well understood. In particular, it is unclear how to best allocate the processing tasks to the given resources. In this paper, we establish a theoretical foundation by formally defining a task allocation problem for distributed stream processing, which we prove to be NP-hard. Furthermore, we propose an approximation algorithm for the class of series-parallel decomposable graphs, which captures a broad range of common stream processing applications. The algorithm achieves a constant-factor approximation under the assumptions that the number of resources scales at least logarithmically with the number of computational tasks and the computational cost of the tasks dominates the cost of communication.

关键词： Resource management Approximation algorithms Complexity theory Topology distributed databases Routing Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Efficient 2-Body Statistics Computation on GPUs: parallelization & Beyond

Efficient 2-Body Statistics Computation on GPUs: Paralleliza...

引用

international conference on parallel processing (ICPP)

作者： Napath Pitaksirianan Zhila Nouri Yi-Cheng Tu Department of Computer Science and Engineering University of South Florida Tampa FL U.S.A.

Various types of two-body statistics (2-BS) are regarded as essential components of data analysis in many scientific and computing domains. Due to the quadratic time complexity, use of modern parallel hardware has become an obvious direction for research and practice in 2-BS computation. This paper presents our recent work in designing and optimizing parallel algorithms for 2-BS computation on Graphics processing Units (GPUs). First, we classify 2-body applications into three groups based on their data output pattern. Then, we introduce a straightforward parallel algorithm under the CUDA framework. To that end, we split the algorithm into two stages: pairwise distance function computation and writing output. Then, we present modifications to the basic algorithm by integrating various techniques at each stage. Our algorithms design focuses on effective use of hardware/software features that are unique in GPU platforms. Experiments run on modern GPU hardware show that our GPU algorithms outperform the best known CPU program by at least an order of magnitude in various applications. Furthermore, our implementation achieves very high level of GPU resource utilization, indicating near-optimal performance. This work builds a solid foundation towards realizing our vision of a framework that can automatically generate optimized code for any new 2-BS problems.

关键词： Graphics processing units Instruction sets Algorithm design and analysis Registers parallel processing Kernel Correlation

来源：评论

学校读者我要写书评

暂无评论

GrapH: Heterogeneity-Aware Graph Computation with Adaptive Partitioning

GrapH: Heterogeneity-Aware Graph Computation with Adaptive P...

引用

international conference on distributed Computing Systems

作者： Christian Mayer Muhammad Adnan Tariq Chen Li Kurt Rothermel Institute of Parallel and Distributed Systems University of Stuttgart Germany

Vertex-centric graph processing systems such as Pregel, PowerGraph, or GraphX recently gained popularity due to their superior performance of data analytics on graph-structured data. These systems exploit the graph structure to improve data access locality during computation, making use of specialized graph partitioning algorithms. Recent partitioning techniques assume a uniform and constant amount of data exchanged between graph vertices (i.e., uniform vertex traffic) and homogeneous underlying network costs. However, in real-world scenarios vertex traffic and network costs are heterogeneous. This leads to suboptimal partitioning decisions and inefficient graph processing. To this end, we designed GrapH, the first graph processing system using vertex-cut graph partitioning that considers both, diverse vertex traffic and heterogeneous network, to minimize overall communication costs. The main idea is to avoid frequent communication over expensive network links using an adaptive edge migration strategy. Our evaluations show an improvement of 60% in communication costs compared to state-of-the-art partitioning approaches.

关键词： Heuristic algorithms Mirrors distributed databases Data analysis Partitioning algorithms Computational modeling Automata

来源：评论

学校读者我要写书评

暂无评论

A parallel Frequent Item Counting Algorithm

A Parallel Frequent Item Counting Algorithm

引用

international conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC

作者： Xun Yang Jun Liu Wenli Zhou Center for Data Science Beijing University of Posts and Telecommunications Beijing China HAOHAN Data Technology Co. LTD. Beijing China

ISBN: (纸本)9781509007691

Frequent items in high-speed streaming data are important to many applications like network monitoring and anomaly detecting. To deal with high arrival rate of streaming data, it is desirable that such systems be capable of supporting high processing throughput with tight guarantees on errors. In this paper, we address the problem of finding frequent and top-k items, and present a parallel version of the Space Saving algorithm in the context of the open source distributed computing system. Based on the theoretical analysis, the errors are restrictively bounded in our algorithm, and our parallel design could achieve high throughput. Taking advantage of the distributed computing resources, our evaluation reveals that such design delivers linear speedup with remarkable scalability.

关键词： Radiation detectors Algorithm design and analysis Monitoring Frequency estimation Telecommunications Throughput Context

来源：评论

学校读者我要写书评

暂无评论

Model Checking techniques for State Space Reduction in MANET Protocol Verification

Model Checking Techniques for State Space Reduction in MANET...

引用

IEEE international Symposium on parallel and distributed processing Workshops and Phd Forum (IPDPSW)

作者： Hideharu Kojima Yuta Nagashima Tatsuhiro Tsuchiya Graduate School of Information Science and Technology Osaka University Suita Japan School of Engineering Science Osaka University Toyonaka Japan

ISBN: (纸本)9781509036837

A Mobile Ad hoc Network (MANET) is a network that consists of mobile nodes and is autonomously managed without infrastructure base stations such as access points. MANETs have started being used as part of safety critical applications. A Vehicular Ad hoc Network (VANET) used in automated driving systems is such an example. In such applications, defects in the network protocol may cause serious social problems. Model checking, a state search-based verification technique, has proven to be effective in finding faults in complex system designs, such as communication protocols. However it is challenging to apply this technique to MANET protocols, because a MANET can have a number of different network topologies, thus resulting in the state explosion problem very easily. In this paper we propose a modeling technique to mitigate this problem using the AODV protocol as a running example. MANET protocols, such as AODV, typically enforce a source node that wishes to establish a route to the destination to retry the route establishing process some fixed number of times in face of failures. We show that to model check the protocol's behavior in these retries it suffices to consider only the last trial. The results of preliminary experiments using the SPIN model checker show that using the proposed technique significantly reduced the time and memory used in model checking.

关键词： Mobile ad hoc networks Routing Routing protocols Model checking Vehicular ad hoc networks Mobile nodes

来源：评论

学校读者我要写书评

暂无评论

An optimized parallel Failure-less Aho-Corasick algorithm for DNA sequence matching

An optimized Parallel Failure-less Aho-Corasick algorithm fo...

引用

international conference on Information and Automation for Sustainability (ICIAfS)

作者： D.R.V.L.B Thambawita Roshan G. Ragel Dhammike Elkaduwe Department of Computer Science and Technology Uva Wellassa University Badulla Sri Lanka Department of Computer Engineering University of Peradeniya Peradeniya Sri Lanka

ISBN: (纸本)9781509061334

The Aho-Corasick algorithm is a multiple patterns searching algorithm running sequentially in various applications like network intrusion detection and bioinformatics for finding several input strings within a given large input string. The parallel version of the Aho-Corasick algorithm is called as parallel Failure-less Aho-Corasick algorithm because it doesnt need failure links like in the original Aho-Corasick algorithm. In this research, we implemented an application specific parallel failureless Aho-Corasick algorithm on the general purpose graphic processing unit by applying several cache optimization techniques for matching DNA sequences. Our parallel Aho-Corasick algorithm shows better performance than the available parallel Aho-Corasick algorithm library due to its simplicity and optimized cache memory usage of graphic processing units for matching DNA sequences.

关键词： Pattern matching DNA Algorithm design and analysis Kernel Bioinformatics Intrusion detection Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

Social computing in open source community: A study of software reuse 2nd

Social computing in open source community: A study of softwa...

引用

2nd international conference on Young Computer Scientists, Engineers and Educators, ICYCSEE 2016

作者： Chen, Mengwen Wang, Tao Yang, Cheng Fan, Qiang Yin, Gang Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9789811020520

Software projects are not developed in isolation but often build upon other open source resources. These projects form a kind of reference ecosystem regarded as a software world. Most of social computing works focus on social networks such as Facebook and weibo to mine information. However, few previous works analyze Open Source Community which could help developers conduct collaborative development. In this paper, we model the Java reference ecosystem as a network based on the reuse relationships of GitHub-hosted Java projects and analyze the characteristics and the patterns of this reference ecosystem by using community detection and pattern discovery algorithms. Our study indicates that (1) Developers prefer to reuse software limited in only a small part of projects with cross cutting functionality or advanced applications. (2) Developers usually select software reused with similar function widely depending on different requirements, resulting to different patterns. Based on these collective intelligence, our study opens up several possible future directions of reuse recommendation, which are considered as guidance of collaborative development. © Springer Science+Business Media Singapore 2016.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 372 373 374 375 376 377 378 379 380 381 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：