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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

829 篇 会议
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

669 篇 工学
- 634 篇 计算机科学与技术...
- 299 篇 软件工程
- 107 篇 信息与通信工程
- 95 篇 电气工程
- 49 篇 控制科学与工程
- 32 篇 电子科学与技术（可...
- 11 篇 机械工程
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 4 篇 建筑学
- 4 篇 生物工程
- 3 篇 力学（可授工学、理...
- 3 篇 冶金工程
- 3 篇 土木工程
- 3 篇 网络空间安全
155 篇 理学
- 132 篇 数学
- 20 篇 统计学（可授理学、...
- 16 篇 物理学
- 10 篇 系统科学
- 5 篇 化学
- 4 篇 生物学
52 篇 管理学
- 46 篇 管理科学与工程(可...
- 17 篇 工商管理
- 10 篇 图书情报与档案管...
8 篇 医学
- 5 篇 临床医学
- 3 篇 特种医学
5 篇 法学
- 4 篇 社会学
- 2 篇 法学
3 篇 经济学
- 3 篇 应用经济学
1 篇 教育学
1 篇 农学
1 篇 军事学

主题

170 篇 parallel process...
77 篇 parallel process...
55 篇 concurrent compu...
43 篇 distributed comp...
42 篇 computer science
41 篇 distributed comp...
36 篇 parallel algorit...
32 篇 computer archite...
29 篇 hardware
28 篇 application soft...
28 篇 computational mo...
24 篇 costs
24 篇 algorithm design...
23 篇 parallel program...
23 篇 delay
19 篇 processor schedu...
18 篇 parallel archite...
18 篇 computer network...
16 篇 partitioning alg...
15 篇 high performance...

机构

5 篇 natl univ def te...
4 篇 univ of central ...
3 篇 oak ridge natl l...
3 篇 california inst ...
3 篇 syracuse univ sy...
3 篇 beijing univ pos...
3 篇 new jersey inst ...
3 篇 inner mongolia u...
3 篇 univ of maryland...
3 篇 univ of illinois...
3 篇 ohio state univ ...
3 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 univ texas austi...
2 篇 natl univ irelan...
2 篇 washington state...
2 篇 concordia univ m...
2 篇 lipn
2 篇 school of comput...

作者

4 篇 kale laxmikant v...
4 篇 prasanna viktor ...
4 篇 rothermel kurt
3 篇 yuxing peng
3 篇 yao wenbin
3 篇 mi haibo
3 篇 haibo mi
3 篇 mcloone s
3 篇 liu jie
3 篇 sohn andrew
3 篇 wang yijie
3 篇 tang yuxing
3 篇 ward t
3 篇 boukerche a
3 篇 sato mitsuhisa
3 篇 das sajal k.
3 篇 li xiaoyong
3 篇 siegel howard ja...
3 篇 delaney d
2 篇 boku taisuke

语言

831 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=8th IEEE Symposium on Parallel and Distributed Processing"

共 835 条记录，以下是101-110 订阅

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

详细简洁

排序：

Efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors

Efficient implementation of tree-based multicast routing for...

引用

Proceedings of the 1996 8th ieee symposium on parallel and distributed processing

作者： Malumbres, M.P. Duato, Jose Torrellas, Josep Universidad Politecnica de Valencia Valencia Spain

this paper presents an efficient routing and flow control mechanism to implement multidestination message passing in wormhole networks. It is targeted to situations where the size of message data is very small, like in invalidation and update messages in distributed shared-memory multiprocessors (DSMs) with hardware cache coherence. the mechanism is a variation of tree-based multicast with pruning to avoid deadlocks. the new scheme does not require that the destination addresses in a given multicast message be ordered, thereby avoiding any ordering overhead. It allows messages to use any deadlock-free routing function and only requires one startup for each multicast message. the new scheme has been evaluated on several k-ary n-cube networks under synthetic loads. the results show that the proposed scheme is faster than other multicast mechanisms when the multicast traffic is composed of short messages.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

distributed and randomized enumeration 8

Distributed and randomized enumeration

引用

8th Euromicro Workshop on parallel and distributed processing, EURO-PDP 2000

作者： Dembiński, P. Institute of Computer Science Polish Academy of Sciences ul. Ordona 21 Warsaw01-237 Poland

ISBN: (纸本)0769505007

the paper describes a randomized distributed enumeration algorithm which (in contrast to deterministic solutions) works for all network topologies and with fully asynchronous communication. the algorithm correctness and efficiency are considered. the expected execution time is of the order of the time needed for a broadcast. © 2000 ieee.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Investigating Memory Optimization of Hash-index for Next Generation Sequencing on Multi-core Architecture

Investigating Memory Optimization of Hash-index for Next Gen...

引用

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

作者： Wang, Wendi Tang, Wen Li, Linchuan Tan, Guangming Zhang, Peiheng Sun, Ninghui Chinese Acad Sci Inst Comp Technol High Performance Comp Res Ctr Beijing 100864 Peoples R China

ISBN: (纸本)9780769546766

Next Generation Sequencing (NGS) is gaining interests due to the increased requirements and the decreased sequencing cost. the important and prerequisite step of most NGS applications is the mapping of short sequences, called reads, to the template reference sequences. Both the explosion of NGS data with over billions of reads generated each day and the data-intensive computations pose great challenges to the capability of existing computing systems. In this paper, we take a hash-index based algorithm (PerM) as an example to investigate the optimization approaches for accelerating NGS reads mapping on multi-core architectures. First, we propose a new parallel algorithm that reorders bucket access in hash index among multiple threads so that data locality in shared cache is improved. Second, in order to reduce the number of empty hash bucket, we propose a serialized hash index compression algorithm, which coincides with the sequential access nature of our new parallel algorithm. With reduced hash index size, it also becomes possible for us to use longer hash keys, which alleviates the hash conflicts and improves the query performance. Our experiment on an 8-socket 8-cores Intel Xeon X7550 SMP with 128 GB memory shows that the new parallel algorithm reduces LLC miss ratio to be 8% similar to 15% of the original algorithm and the overall performance is improved by 4 similar to 11 times (6 times avg.).

关键词： hashing parallel algorithms core construction next generation sequencing locality data reading buckets

来源：评论

学校读者我要写书评

暂无评论

parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening 36

Parallel, Portable Algorithms for Distance-2 Maximal Indepen...

引用

36th ieee International parallel and distributed processing symposium (ieee IPDPS)

作者： Kelley, Brian Rajamanickam, Sivasankaran Sandia Natl Labs POB 5800 Albuquerque NM 87185 USA

ISBN: (纸本)9781665481069

Given a graph, finding the distance-2 maximal independent set (MIS-2) of the vertices is a problem that is useful in several contexts such as algebraic multigrid coarsening or multilevel graph partitioning. Such multilevel methods rely on finding the independent vertices so they can be used as seeds for aggregation in a multilevel scheme. We present a parallel MIS-2 algorithm to improve performance on modern accelerator hardware. this algorithm is implemented using the Kokkos programming model to enable performance portability. We demonstrate the portability of the algorithm and the performance on a variety of architectures (x86/ARM CPUs and NVIDIA/AMD GPUs). the resulting algorithm is also deterministic, producing an identical result for a given input across all of these platforms. the new MIS-2 implementation outperforms implementations in state of the art libraries like CUSP and ViennaCL by 3-8x while producing similar quality results. We further demonstrate the benefits of this approach by developing parallel graph coarsening scheme for two different use cases. First, we develop an algebraic multigrid (AMG) aggregation scheme using parallel MIS-2 and demonstrate the benefits as opposed to previous approaches used in the MueLu multigrid package in Trilinos. We also describe an approach for implementing a parallel multicolor "cluster" Gauss-Seidel preconditioner using this MIS-2 coarsening, and demonstrate better performance with an efficient, parallel, multicolor Gauss-Seidel algorithm.

关键词： distributed processing Clustering algorithms Programming Libraries Hardware Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Portable petaflop/s programming: Applying distributed computing methodology to the grid within a single machine room

Portable petaflop/s programming: Applying distributed comput...

引用

Proceedings of the 1999 8th ieee International symposium on High Performance distributed Computing - HPDC-8

作者： Woodward, Paul R. Anderson, S.E. Univ of Minnesota Minnesota United States

Petaflop/s computing platforms will combine deep memory hierarchies in both latency and bandwidth with a need for many-thousand-fold parallelism. Initial users of these systems will most likely be asked to meet these challenges to efficient parallel program design armed only with minimal system software. A candidate for a portable petaflop/s programming model that can enable these important early application programs to be developed while at the same time permitting these same applications to run efficiently on the most capable computing systems now available, is presented.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Computer experiments with a parallel clonal selection algorithm for the Graph Coloring Problem

Computer experiments with a parallel clonal selection algori...

引用

10th Workshop on Advances in parallel and distributed Computational Models/22nd ieee International parallel and distributed processing symposium

作者： Dabrowski, Jacek Kubale, Marek Gdansk Univ Technol PL-80952 Gdansk Poland

ISBN: (纸本)9781424416936

Artificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. this paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. the performance of the algorithm over a set of well-established benchmark graphs and random graphs is compared with a parallel Tabu Search algorithm.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Leaner, more efficient, available copy protocol

Leaner, more efficient, available copy protocol

引用

Proceedings of the 1996 8th ieee symposium on parallel and distributed processing

作者： Long, Darrell D.E. Paris, Jehan-Francois Univ of California Santa Cruz United States

Available copy protocols provide the highest data availability and data reliability of all replication protocols that do not regenerate failed replicas. Unfortunately, all existing implementations of available copy protocols either rely on complex procedures for ascertaining which replicas are up to date after a total failure or have to wait for the recovery of all failed sites. We present a simple technique for efficiently implementing the available copy protocol. Our protocol does not require version numbers and maintains only n+log(n) bits of state per replica. We also show under standard Markovian assumptions that our new protocol provides the same data availability as the best feasible implementations of the available copy protocol.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

Improved algorithms and data structures for solving graph problems in external memory

Improved algorithms and data structures for solving graph pr...

引用

Proceedings of the 1996 8th ieee symposium on parallel and distributed processing

作者： Kumar, Vijay Schwabe, Eric J. Northwestern Univ Evanston United States

Recently, the study of I/O-efficient algorithms has moved beyond fundamental problems of sorting and permuting and into wider areas such as computational geometry and graph algorithms. With this expansion has come a need for new algorithmic techniques and data structures. In this paper, we present I/O-efficient analogues of well-known data structures that we show to be useful for obtaining simpler and improved algorithms for several graph problems. Our results include improved algorithms for minimum spanning trees, breadth-first search, and single-source shortest paths. the descriptions of these algorithms are greatly simplified by their use of well-defined I/O-efficient data structures with good amortized performance bounds. We expect that I/O-efficient data structures such as these will be a useful tool for the design of I/O-efficient algorithms.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Refactoring the Molecular Docking Simulation for Heterogeneous, Manycore Processors Systems 15

Refactoring the Molecular Docking Simulation for Heterogeneo...

引用

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

作者： Chen, Junshi Lin, Han Liang, Weihao Yu, Yang Han, Wenting An, Hong Chen, Yong Liu, Xin Univ Sci & Technol China Sch Comp Sci & Technol Hefei Anhui Peoples R China Texas Tech Univ Dept Comp Sci Lubbock TX 79409 USA Natl Res Ctr Parallel Comp Engn & Technol Beijing Peoples R China

ISBN: (纸本)9781538637906

this paper presents a scalable design and implementation of the molecular docking application DOCK for a large-scale high performance computing system, the Sunway TaihuLight supercomputer, which provisions a heterogeneous, manycore processor architecture that consists of management processing elements (MPEs) and clusters of computing processing elements (CPEs). the key innovation is a novel refactoring of DOCK on the CPEs. Optimization techniques for data redundancy minimization to fit data in cache, software-controlled prefetching into scratchpads, memory access coalescing, software caches, vectorization and loop unrolling are employed to improve the exploitation of the computational resources. For a single docking process, the refactored version using both the MPE and CPE cluster achieved 260x to 402x speedup compared against the original ported version using MPE only. To scale the DOCK to the full Sunway Taihulight system with 10,649,600 cores (including all MPE and CPE cores), we present an MPI communication domain partition scheme as well. For docking 9 million small compounds to a Zika virus target protein, we manage to scale to 131,072 MPEs, and 8,388,608 CPEs, with a total of 8,519,680 cores.

关键词： molecular docking Sunway TaihuLight Supercomputer heterogeneous manycore optimization

来源：评论

学校读者我要写书评

暂无评论

An efficient waveform iterative technique for device transient simulation on parallel distributed memory computers

An efficient waveform iterative technique for device transie...

引用

8th International symposium on Integrated Circuits, Devices and Systems (ISIC-99)

作者： Yang, TR Plöjaragatan 63 583 33 Linköping Sweden

In this paper, we mainly study the parallelization aspects of the accelerated waveform relaxation algorithms for the transient simulation of semiconductor devices on parallel distributed memory computers since these method are competitive with standard pointwise methods on serial machines, but are significantly faster on parallel computers. Here we propose an efficient variant of GMRES method, for solving the resulting sequence of time-varying sparse linear differential-algebraic initial-value problems (IVP) arising at each linearization step with waveform Newton. We will describe a more efficient alternative which avoids the global communication of inner products and only requires local communications on for massively distributed memory computers since the number of inner products represents the bottleneck of parallel performance. Experimental results carried out on Parsytec GC/PowerPlus with regards to the comparison with other accelerated approaches such as convolution SOR and waveform GMRES techniques on waveform relaxation algorithm and pointwise methods are described.

关键词： Semiconductor storage

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：