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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,815 篇 会议
182 篇 期刊文献
83 册 图书
1 篇 学位论文

馆藏范围

4,081 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

2,093 篇 工学
- 1,908 篇 计算机科学与技术...
- 1,023 篇 软件工程
- 368 篇 电气工程
- 154 篇 信息与通信工程
- 137 篇 电子科学与技术（可...
- 75 篇 控制科学与工程
- 30 篇 机械工程
- 30 篇 生物工程
- 25 篇 材料科学与工程（可...
- 24 篇 生物医学工程（可授...
- 22 篇 仪器科学与技术
- 20 篇 光学工程
- 19 篇 建筑学
- 17 篇 测绘科学与技术
- 16 篇 土木工程
- 13 篇 动力工程及工程热...
- 12 篇 农业工程
526 篇 理学
- 417 篇 数学
- 50 篇 物理学
- 39 篇 系统科学
- 33 篇 生物学
- 30 篇 统计学（可授理学、...
- 16 篇 化学
- 16 篇 地球物理学
207 篇 管理学
- 154 篇 管理科学与工程(可...
- 61 篇 工商管理
- 54 篇 图书情报与档案管...
19 篇 农学
- 14 篇 作物学
18 篇 法学
- 18 篇 社会学
15 篇 经济学
- 15 篇 应用经济学
13 篇 医学
3 篇 文学
3 篇 军事学
2 篇 教育学
2 篇 艺术学
1 篇 哲学

主题

647 篇 parallel process...
545 篇 parallel program...
527 篇 computer archite...
462 篇 parallel archite...
448 篇 concurrent compu...
358 篇 parallel algorit...
320 篇 programming
313 篇 hardware
283 篇 computer science
276 篇 algorithm design...
263 篇 computational mo...
214 篇 programming prof...
165 篇 parallel process...
164 篇 dynamic programm...
154 篇 application soft...
138 篇 program processo...
138 篇 costs
138 篇 distributed comp...
136 篇 libraries
133 篇 runtime

机构

9 篇 stanford univ st...
9 篇 intel corporatio...
8 篇 barcelona superc...
8 篇 oak ridge natl l...
8 篇 univ calif berke...
7 篇 school of comput...
7 篇 oak ridge nation...
7 篇 carnegie mellon ...
7 篇 college of compu...
7 篇 oak ridge nation...
7 篇 univ texas austi...
6 篇 school of comput...
6 篇 sandia national ...
6 篇 department of co...
6 篇 department of co...
6 篇 school of comput...
6 篇 department of co...
5 篇 department of co...
5 篇 nvidia corporati...
5 篇 pacific northwes...

作者

15 篇 jack dongarra
12 篇 dongarra jack
11 篇 hong shen
10 篇 hoefler torsten
9 篇 zhong cheng
9 篇 olukotun kunle
9 篇 gu yan
8 篇 chapman barbara
7 篇 garcia i.
7 篇 forsell martti
7 篇 sun yihan
7 篇 jigang wu
7 篇 nakano koji
7 篇 danelutto marco
6 篇 cheng zhong
6 篇 v.k. prasanna
6 篇 blelloch guy e.
6 篇 h.j. siegel
6 篇 lumsdaine andrew
6 篇 tsigas philippas

语言

4,044 篇 英文
29 篇 其他
11 篇 中文

检索条件"任意字段=International Symposium on Parallel Architectures, Algorithms, and Programming"

共 4081 条记录，以下是71-80 订阅

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

详细简洁

排序：

HAM-SpMSpV: an Optimized parallel Algorithm for Masked Sparse Matrix-Sparse Vector Multiplications on multi-core CPUs 24

HAM-SpMSpV: an Optimized Parallel Algorithm for Masked Spars...

引用

33rd international symposium on High-Performance parallel and Distributed Computing (HPDC)

作者： Xu, Lei Jia, Haipeng Zhang, Yunquan Wang, Luhan Jiang, Xianmeng Univ Chinese Acad Sci Chinese Acad Sci Inst Comp Technol Sch Comp Sci & Technol Beijing Peoples R China Chinese Acad Sci Inst Comp Technol Beijing Peoples R China

ISBN: (纸本)9798400704130

The efficiency of Sparse Matrix-Sparse Vector Multiplication (SpM-SpV) is critically important in fields such as machine learning and graph analytics. In certain algorithms, masked SpMSpV computes only a subset of the result entries. Despite its significance, this selective computation poses unique challenges, and existing algorithms often struggle to exploit the sparsity of the input and the mask vectors concurrently. To boost the efficiency of masked SpMSpV on shared memory architectures, we introduce a hybrid adaptive masked SpMSpV algorithm (HAM-SpMSpV) designed to select the efficient kernel automatically based on input features. This approach builds upon the foundation of a conventional algorithm, incorporating two novel masked SpMSpVs: the pre-bucketing masked SPA-based algorithm and the pre-masking bucketed hash-based algorithm. The newly proposed algorithms significantly expedite computation, especially in scenarios with high sparsity in input vectors and masks. Our evaluation involved extensive testing across a diverse range of real-world graphs, utilizing various sparsity of input vectors and masks. This rigorous testing confirmed that our approach notably outperforms existing solutions. Specifically, it achieves a speedup of up to 1.96 times compared to SuiteSparse:GraphBLAS and a remarkable 6.28 times relative to MKL Graph, demonstrating significant advancements in SpMSpV efficiency.

关键词： Sparse Matrix-Sparse Vector Multiplication (SpMSpV) Mask Shared Memory Adaptive Method

来源：评论

学校读者我要写书评

暂无评论

A Shared Memory SMC Sampler for Decision Trees 35

A Shared Memory SMC Sampler for Decision Trees

引用

35th IEEE international symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Drousiotis, Efthyvoulos Varsi, Alessandro Spirakis, Paul G. Maskell, Simon Univ Liverpool Dept Elect Engn & Elect Liverpool L69 3BX Merseyside England Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England

ISBN: (纸本)9798350305487

Modern classification problems tackled by using Decision Tree (DT) models often require demanding constraints in terms of accuracy and scalability. This is often hard to achieve due to the ever-increasing volume of data used for training and testing. Bayesian approaches to DTs using Markov Chain Monte Carlo (MCMC) methods have demonstrated great accuracy in a wide range of applications. However, the inherently sequential nature of MCMC makes it unsuitable to meet both accuracy and scaling constraints. One could run multiple MCMC chains in an embarrassingly parallel fashion. Despite the improved runtime, this approach sacrifices accuracy in exchange for strong scaling. Sequential Monte Carlo (SMC) samplers are another class of Bayesian inference methods that also have the appealing property of being parallelizable without trading off accuracy. Nevertheless, finding an effective parallelization for the SMC sampler is difficult, due to the challenges in parallelizing its bottleneck, redistribution, in such a way that the workload is equally divided across the processing elements, especially when dealing with variable-size models such as DTs. This study presents a parallel SMC sampler for DTs on Shared Memory (SM) architectures, with an O(log(2) N) parallel redistribution for variable-size samples. On an SM machine mounting 32 cores, the experimental results show that our proposed method scales up to a factor of 16 compared to its serial implementation, and provides comparable accuracy to MCMC, but 51 times faster.

关键词： parallel algorithms Sequential Monte Carlo Samplers Markov Chain Monte Carlo Bayesian Decision Trees Shared Memory programming

来源：评论

学校读者我要写书评

暂无评论

Towards a GraphBLAS Implementation for Go 36

Towards a GraphBLAS Implementation for Go

引用

36th IEEE international parallel and Distributed Processing symposium (IEEE IPDPS)

作者： Costanza, Pascal Hurt, Ibrahim Mattson, Timothy G. Intel Extreme Scale Comp Grp Brussels Belgium Intel Extreme Scale Comp Grp Hillsboro OR USA Intel Parallel Comp Lab Ocean Park WA USA

ISBN: (纸本)9781665497473

The GraphBLAS are building blocks for constructing graph algorithms as linear algebra. They are defined mathematically with the goal that they would eventually map onto a variety of programming languages. Today they exist in C, C++, Python, MATLAB (R), and Julia. In this paper, we describe the GraphBLAS for the Go programming language. A particularly interesting aspect of this work is that using the concurrency features of the Go language, we aim to build a runtime system that uses the GraphBLAS nonblocking mode by default.

关键词： GraphBLAS Graph algorithms Go

来源：评论

学校读者我要写书评

暂无评论

Efficient Distributed parallel Aligning Reads and Reference Genome with Many Repetitive Subsequences Using Compact de Bruijn Graph 12

Efficient Distributed Parallel Aligning Reads and Reference ...

引用

12th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Li, Yao Zhong, Cheng Chen, Danyang Zhang, Jinxiong Yin, Mengxiao Guangxi Univ Sch Comp Elect & Informat Nanning Peoples R China Guangxi Univ Key Lab Parallel Distributed Comp Technol Nanning Peoples R China

ISBN: (纸本)9781665496391

A large number of reads generated by the next generation sequencing platform will contain many repetitive subsequences. Effective localizing and identifying genomic regions containing repetitive subsequences will contribute to the subsequent genomic data analysis. To accelerate the alignment between large-scale short reads and reference genome with many repetitive subsequences, this paper develops a compact de Bruijn graph based short-read alignment algorithm on distributed parallel computing platform. The algorithm uses resilient distributed data sets (RDDS) to perform calculations in memory, and executes the broadcast method to distribute short reads and reference genome to the computing nodes to reduce the data communication time on the cluster system, and the number of RDD partitions is set to optimize the performance of parallel aligning algorithm. Experimental results on real datasets show that compared with the compact de Bruijn graph based sequential short-read alignment algorithm, our implemented distributed parallel alignment algorithm achieves good acceleration on the premise of obtaining the same correct alignment percentage as a whole, and compared with existing distributed parallel alignment algorithms, the implemented parallel algorithm can more quickly complete the alignment between large-scale short reads and reference genome with highly repetitive subsequences.

关键词： read alignment highly repetitive subsequences compact de Bruijn graph Hash indexing distributed parallel computing

来源：评论

学校读者我要写书评

暂无评论

parallel Accelerating Ultra-Long Read Alignment by Vertical Partitioning Data 13

Parallel Accelerating Ultra-Long Read Alignment by Vertical ...

引用

13th IEEE international symposium on parallel architectures, algorithms and programming, PAAP 2022

作者： Pan, Deng Zhong, Cheng Chen, Danyang Zhang, Jinxiong Yang, Feng Guangxi University Key Laboratory of Parallel Distributed Computing Technology Guangxi Universities School of Computer Electronics and Information Guangxi Nanning China Guangxi University Key Laboratory of Parallel Distributed Computing School of Computer Electronics and Information Guangxi Nanning China

ISBN: (纸本)9781665452182

The alignment between sequencing reads and genome is a basic work in biological big data analysis. Each read of the third generation sequencing data is getting longer, and the data size is getting larger. To effectively solve the ultra-long read alignment problem with high requirements for computing and memory capacity, a strategy for vertical partitioning ultra-long reads on hybrid CPU/GPU cluster is proposed, and a heap data structure is used to filter the local aligned results in all computing nodes of the parallel cluster system according to the alignment score to reduce the data transmission size. The methods for early termination and parallel merging-splicing are used to accelerate splicing local aligned results. The local aligned results among all computing nodes are collected and extended to obtain the final alignment results. The experimental results on datasets of simulated and real ultra-long reads show that the proposed parallel alignment algorithm can obtain high alignment accuracy, sensitivity and base-level sensitivity as a whole, and accelerate completing alignment between ultra-long reads and reference genome. © 2022 IEEE.

关键词： Alignment

来源：评论

学校读者我要写书评

暂无评论

Energy Efficiency Enhancement Of parallelized Implementation of NIST Lightweight Cryptography Standardization Finalists

Energy Efficiency Enhancement Of Parallelized Implementation...

引用

IEEE international symposium on Circuits and Systems (ISCAS)

作者： Elsadek, Islam Aftabjahani, Sohrab Gardner, Doug MacLean, Erik Wallrabenstein, John Ross Tawfik, Eslam Yahya Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA Intel Corp Santa Clara CA 95051 USA Analog Devices Inc Norwood MA 02062 USA

ISBN: (纸本)9781665484855

parallelism and pipelining are widely used to improve the performance and throughput of systems. However, its effect on energy consumption needs to be studied. In this paper the alteration in energy consumption that results from using parallel architecture is studied over LWC algorithms from NIST standardization process. Ten algorithms are currently in the final round of the standardization process. Two algorithms out of the ten final round candidates can be parallelized which are Elephant and ISAP algorithms. For these algorithms, both iterative looping and parallel architectures are designed and synthesized over ASIC GF22nm technology. Then both architectures are compared in terms of area, throughput and energy. Results showed an enhancement in energy efficiency up to 49% and 28% and throughput improvement reaches up to 96% and 45% in Elephant and ISAP, respectively.

关键词： parallel architecture Lightweight cryptography Resource-constrained Energy efficiency NIST

来源：评论

学校读者我要写书评

暂无评论

A Novel Set of Directives for Multi-device programming with OpenMP 36

A Novel Set of Directives for Multi-device Programming with ...

引用

36th IEEE international parallel and Distributed Processing symposium (IEEE IPDPS)

作者： Torres, Raul Ferrer, Roger Teruel, Xavier Barcelona Supercomp Ctr Comp Sci Dept Barcelona Spain

ISBN: (纸本)9781665497473

The latest versions of OpenMP have been offering support for offloading execution to the accelerator devices present in a variety of heterogeneous architectures via the target directives. However, these directives can only refer to one device at a time, which makes multi-device programming an explicit and tedious task. In this work, we present an extension of OpenMP in the form of a new set of directives (target spread directives) which offers direct support for multiple devices and allows the distribution of data and/or workload among them without explicit programming. This results in an additional level of parallelism between the host and the devices. The target spread directives were evaluated using the Somier micro-app in a PowerPC cluster node with up to four Nvidia Tesla V100 GPUs. The results showed a speedup of approximately 2X using four GPUs and the new directive set, in comparison with the baseline implementation which used one GPU and the existing target directive set.

关键词： OpenMP language extension multi-device support multi-GPU heterogeneous architectures offloading LLVM accelerators

来源：评论

学校读者我要写书评

暂无评论

Engineering Shared-Memory parallel Shuffling to Generate Random Permutations In-Place 21

Engineering Shared-Memory Parallel Shuffling to Generate Ran...

引用

21st international symposium on Experimental algorithms, SEA 2023

作者： Penschuck, Manuel Goethe Universität Frankfurt Germany

ISBN: (纸本)9783959772792

Shuffling is the process of placing elements into a random order such that any permutation occurs with equal probability. It is an important building block in virtually all scientific areas. We engineer, to the best of our knowledge for the first time, a practically fast, parallel shuffling algorithm with O n log n parallel depth that requires only poly-logarithmic auxiliary memory (with high probability). In an empirical evaluation, we compare our implementations with a number of existing solutions on various computer architectures. Our algorithms consistently achieve the highest through-put on all machines. Further, we demonstrate that the runtime of our parallel algorithm is comparable to the time that other algorithms may take to acquire the memory from the operating system to copy the input. © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

A parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted Cube 12

A Parallel Algorithm to Construct Node-Independent Spanning ...

引用

12th international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Pan, Zhiyong Cheng, Baolei Fan, Jianxi Zhang, Huanwen Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China

ISBN: (纸本)9781665496391

An interconnection network can be abstracted into a graph, and the basic mathematical research in the graph can provide a good reference for the research in the practical application. The study of node-independent spanning trees (node-ISTs) in a graph has received extensive attention because of their application in reliable communication, fault-tolerant broadcasting and secure message distribution, and has achieved remarkable results on many special networks. But there are few results in the line graph of them. As one of the typical variations of hypercube, locally twisted cube has many excellent properties, whose line graph has all the advantages of locally twisted cube. So it makes sense to do some research on the line graph of locally twisted cube. In this paper, we propose a parallel algorithm to construct 2n -2 node-ISTs rooted at node [u,N(u, 2)], where u is an arbitrary node on locally twisted cube and n >= 1. And the correctness of our algorithm is proved.

关键词： Locally twisted cube Line graph parallel algorithm Node-independent spanning trees

来源：评论

学校读者我要写书评

暂无评论

Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for parallel Queries 25

Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access...

引用

30th international Conference on Architectural Support for programming Languages and Operating Systems-ASPLOS

作者： Xu, Shifan Lu, Alvin Ding, Yongshan Yale Univ Yale Quantum Inst New Haven CT 06511 USA

ISBN: (纸本)9798400710797

Quantum Random Access Memory (QRAM) is a crucial architectural component for querying classical or quantum data in superposition, enabling algorithms with wide-ranging applications in quantum arithmetic, quantum chemistry, machine learning, and quantum cryptography. In this work, we introduce Fat-Tree QRAM, a novel query architecture capable of pipelining multiple quantum queries simultaneously while maintaining desirable scalings in query speed and fidelity. Specifically, Fat-Tree QRAM performs.. (log(N)) independent queries in O(log(N)) time using O (N) qubits, offering immense parallelism benefits over traditional QRAM architectures. To demonstrate its experimental feasibility, we propose modular and on-chip implementations of Fat-Tree QRAM based on superconducting circuits and analyze their performance and fidelity under realistic parameters. Furthermore, a query scheduling protocol is presented to maximize hardware utilization and access the underlying data at an optimal rate. These results suggest that Fat-Tree QRAM is an attractive architecture in a shared memory system for practical quantum computing.

关键词： Quantum Computing Quantum Random Access Memory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共409页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：