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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,645 篇 会议
54 篇 期刊文献
12 册 图书

馆藏范围

1,711 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,164 篇 工学
- 1,105 篇 计算机科学与技术...
- 417 篇 软件工程
- 162 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
86 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,674 篇 英文
33 篇 其他
4 篇 中文
1 篇 土耳其文

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

共 1711 条记录，以下是321-330 订阅

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

详细简洁

排序：

Implicit Decomposition for Write-Efficient Connectivity Algorithms 32

Implicit Decomposition for Write-Efficient Connectivity Algo...

引用

27th international Heterogeneity in Computing Workshop in conjunction with 32nd IEEE international parallel and distributed processing symposium (IPDPS)

作者： Ben-David, Naama Blelloch, Guy E. Fineman, Jeremy T. Gibbons, Phillip B. Gu, Yan McGuffey, Charles Shun, Julian Carnegie Mellon Univ Pittsburgh PA 15213 USA Georgetown Univ Washington DC 20057 USA MIT CSAIL Cambridge MA 02139 USA

ISBN: (纸本)9781538643686

The future of main memory appears to lie in the direction of new technologies that provide strong capacity-toperformance ratios, but have write operations that are much more expensive than reads in terms of latency, bandwidth, and energy. Motivated by this trend, we propose sequential and parallel algorithms to solve graph connectivity problems using significantly fewer writes than conventional algorithms. Our primary algorithmic tool is the construction of an o(n)-sized implicit decomposition of a bounded-degree graph G on n nodes, which combined with read-only access to G enables fast answers to connectivity and biconnectivity queries on G. The construction breaks the linear-write "barrier", resulting in costs that are asymptotically lower than conventional algorithms while adding only a modest cost to querying time. For general non-sparse graphs on m edges, we also provide the first parallel algorithms for connectivity and biconnectivity that require o(m) writes and O(m) operations. These algorithms provide insight into how applications can efficiently process computations on large graphs in systems with read-write asymmetry.

关键词： Random access memory Computational modeling Task analysis parallel algorithms Writing Standards Clustering algorithms"

来源：评论

学校读者我要写书评

暂无评论

Communication-free Massively distributed Graph Generation 32

Communication-free Massively Distributed Graph Generation

引用

27th international Heterogeneity in Computing Workshop in conjunction with 32nd IEEE international parallel and distributed processing symposium (IPDPS)

作者： Funke, Daniel Lamm, Sebastian Sanders, Peter Schulz, Christian Strash, Darren von Looz, Moritz Karlsruhe Inst Technol Karlsruhe Germany Univ Vienna Vienna Austria Colgate Univ New York NY USA

ISBN: (纸本)9781538643686

Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do so is a challenging task that requires a careful analysis and an extensive evaluation. However, engineering such algorithms is often hindered by the scarcity of publicly available datasets. Network generators serve as a tool to alleviate this problem by providing synthetic instances with controllable parameters. However, many network generators fail to provide instances on a massive scale due to their sequential nature or resource constraints. Additionally, truly scalable network generators are few and often limited in their realism. In this work, we present novel generators for a variety of network models commonly found in practice. By making use of pseudorandomization and divide-and-conquer schemes, our generators follow a communication-free paradigm. The resulting generators are often embarrassingly parallel and have a near optimal scaling behavior. This allows us to generate instances of up to 2 43 vertices and 2 47 edges in less than 22 minutes on 32768 cores. Therefore, our generators allow new graph families to be used on an unprecedented

关键词： graph generation communication-free distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Scheduling parallel Tasks under Multiple Resources: List Scheduling vs. Pack Scheduling 32

Scheduling Parallel Tasks under Multiple Resources: List Sch...

引用

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

作者： Sun, Hongyang Elghazi, Redouane Gainaru, Ana Aupy, Guillaume Raghavan, Padma Vanderbilt Univ 221 Kirkland Hall Nashville TN 37235 USA Ecole Normale Super Lyon Lyon France Univ Bordeaux INRIA LaBRI CNRSBordeaux INP Talence France

ISBN: (纸本)9781538643686

Scheduling in High-Performance Computing (HPC) has been traditionally centered around computing resources (e.g., processors/cores). The ever-growing amount of data produced by modern scientific applications start to drive novel architectures and new computing frameworks to support more efficient data processing, transfer and storage for future HPC systems. This trend towards data-driven computing demands the scheduling solutions to also consider other resources (e.g., I/O, memory, cache) that can be shared amongst competing applications. In this paper, we study the problem of scheduling HPC applications while exploring the availability of multiple types of resources that could impact their performance. The goal is to minimize the overall execution time, or makespan, for a set of moldable tasks under multiple-resource constraints. Two scheduling paradigms, namely, list scheduling and pack scheduling, are compared through both theoretical analyses and experimental evaluations. Theoretically, we prove, for several algorithms falling in the two scheduling paradigms, tight approximation ratios that increase linearly with the number of resource types. As the complexity of direct solutions grows exponentially with the number of resource types, we also design a strategy to indirectly solve the problem via a transformation to a single-resource-type problem, which can significantly reduce the algorithms' running times without compromising their approximation ratios. Experiments conducted on Intel Knights Landing with two resource types (processor cores and high-bandwidth memory) and simulations designed on more resource types confirm the benefit of the transformation strategy and show that pack-based scheduling, despite having a worse theoretical bound, offers a practically promising and easy-to-implement solution, especially when more resource types need to be managed.

关键词： Task analysis Scheduling Processor scheduling Approximation algorithms Resource management Schedules Computational modeling"

来源：评论

学校读者我要写书评

暂无评论

Intra-Cluster Coalescing to Reduce GPU NoC Pressure 32

Intra-Cluster Coalescing to Reduce GPU NoC Pressure

引用

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

作者： Wang, Lu Zhao, Xia Kaeli, David Wang, Zhiying Eeckhout, Lieven Univ Ghent Ghent Belgium Northeastern Univ Boston MA 02115 USA Natl Univ Def Technol Changsha Hunan Peoples R China

ISBN: (纸本)9781538643686

GPUs continue to increase the number of streaming multiprocessors (SMs) to provide increasingly higher compute capabilities. To construct a scalable crossbar network-on-chip (NoC) that connects the SMs to the memory controllers, a cluster structure is introduced in modern GPUs in which several SMs are grouped together to share a network port. Because of network port sharing, clustered GPUs face severe NoC congestion, which creates a critical performance bottleneck. In this paper, we target redundant network traffic to mitigate GPU NoC congestion. In particular, we observe that in many GPU-compute applications, different SMs in a cluster access shared data. Issuing redundant requests to access the same memory location wastes valuable NoC bandwidth - we find on average 19.4% (and up to 48%) of the requests to be redundant. To reduce redundant NoC traffic, we propose intracluster coalescing (ICC) to merge memory requests from different SMs in a cluster. Our evaluation results show that ICC achieves an average performance improvement of 9.7% (and up to 33%) over a conventional design.

关键词： Graphics processing units Bandwidth Instruction sets Kernel Merging Hardware Scheduling"

来源：评论

学校读者我要写书评

暂无评论

MAX-PolyMem: High-Bandwidth Polymorphic parallel Memories for DFEs 32

MAX-PolyMem: High-Bandwidth Polymorphic Parallel Memories fo...

引用

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

作者： Ciobanu, Catalin Bogdan Stramondo, Giulio de Laat, Cees Varbanescu, Ana Lucia Univ Amsterdam Informat Inst Amsterdam Netherlands

ISBN: (纸本)9781538655559

Memory bandwidth is critical for many modern applications and architectures. parallel memories should alleviate this problem, but they are difficult to design and implement for non-trivial access patterns. Our work addresses these challenges through PolyMem, a Polymorphic parallel Memory which acts as a software cache and enables parallel memory accesses for different combinations of access patterns. PolyMem's design is based on the Polymorphic Register File (PRF) design, which guarantees conflict-free parallel access for memory access patterns widely used in scientific and multimedia applications. We present in detail the design and implementation of MAX-PolyMem, the first native implementation of PolyMem using Maxeler's toolchain. Our design supports multiple lanes, multiple read ports, and concurrent read and write operations. We further provide a detailed empirical analysis of the performance of MAX-PolyMem, including two sets of results. First, we conduct a thorough design space exploration to determine the best configurations and/or the performance bounds of MAX-PolyMem. For example, the design with the maximum read bandwidth is a 512KB memory, with 4 read ports, running at 137MHz, which can reach a peak read bandwidth of around 32GB/s. Second, to determine whether the MAX-PolyMem can reach and sustain these peaks, we implement the STREAM-Copy benchmark. The benchmarking results demonstrate that, in practice, MAX-PolyMem reaches over 99% of the theoretical peak performance.

关键词： Bandwidth Field programmable gate arrays Two dimensional displays Registers System-on-chip Runtime Benchmark testing"

来源：评论

学校读者我要写书评

暂无评论

A Study of Network Quality of Service in Many-Core MPI applications 32

A Study of Network Quality of Service in Many-Core MPI Appli...

引用

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

作者： Savoie, Lee Lowenthal, David K. de Supinski, Bronis R. Mohror, Kathryn Univ Arizona Dept Comp Sci Tucson AZ 85721 USA Lawrence Livermore Natl Lab Lawrence CA USA

ISBN: (纸本)9781538655559

Network contention in existing high performance computing (HPC) systems increases job execution time and reduces machine throughput. This problem is expected to become worse in future systems as core counts increase and networks become larger and more complicated. In this paper, we investigate the use of network Quality of Service (QoS) to mitigate the effects of network contention. QoS allocates bandwidth to individual jobs, thus limiting the impact that one job can have on another through network contention. We consider coarse-grained QoS, in which each job runs at a different priority level, by running a number of micro-benchmarks and applications in different QoS configurations on real hardware with QoS capabilities. Our results indicate that while network contention reduces job performance by as much as 70%, coarse-grained QoS is unlikely to improve throughput on HPC systems and may increase job execution times by more than 100%. Based on our analysis, finer-grained QoS is more likely to improve performance and throughput.

关键词： Quality of service Benchmark testing Bandwidth Throughput Hardware Interference Fabrics"

来源：评论

学校读者我要写书评

暂无评论

Tensile: Auto-tuning GEMM GPU Assembly for All Problem Sizes 32

Tensile: Auto-tuning GEMM GPU Assembly for All Problem Sizes

引用

27th international Heterogeneity in Computing Workshop in conjunction with 32nd IEEE international parallel and distributed processing symposium (IPDPS)

作者： Tanner, David E. Adv Micro Devices Inc Austin TX 78735 USA

ISBN: (纸本)9781538655559

Generic matrix matrix multiplication (GEMM) on graphics processors (GPU) has long been the target of both tuning to find a fastest kernel for a GPU and hand-written assembly to achieve highest possible efficiency. Tensile is an open source (https://***/ROCmSoftwarePlatform/Tensile) tool which builds on both of these, by auto generating assembly kernels, auto benchmarking the kernels against a range of problem sizes, then auto generating library C code which selects the optimal kernel for a given problem size. Not only can the kernels achieve near-peak efficiency for the best problem sizes, but the size-tuned kernels can achieve speedups of 2X to 350X compared to any single-tuned kernel optimized for a given GPU architecture.

关键词： Kernel Graphics processing units Tensile stress Computer architecture Throughput Instruction sets Bandwidth"

来源：评论

学校读者我要写书评

暂无评论

On the Cost of Cloud-Assistance in Tree-Structured P2P Live Streaming 32

On the Cost of Cloud-Assistance in Tree-Structured P2P Live ...

引用

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

作者： Fujita, Satoshi Hiroshima Univ Dept Informat Engn Higashihiroshima 7398527 Japan

ISBN: (纸本)9781538655559

Consider a cloud-assisted Peer-to-Peer (P2P) video streaming system, in which a given video stream of a unit bit rate is divided into several stripes and is delivered to all subscribing peers through different spanning trees of height two each, with the aid of the cloud bandwidth. We call such a low latency delivery of stripes a 2-hop delivery of the stripes. In this paper, we prove that if the average upload bandwidth of the peers equals to one and the video stream is divided into a stripes, then 2-hop delivery of the stream to n subscribing peers is possible if the additional bandwidth provided by the cloud is at least 2n/a. This result indicates that the cloud assistance is effective to realize a scalable, dependable P2P video streaming system, while the cost of cloud assistance can be arbitrarily small as the number of stripes increases.

关键词： P2P video streaming system cloud assistance 2-hop delivery scheme

来源：评论

学校读者我要写书评

暂无评论

BitFlow: Exploiting Vector parallelism for Binary Neural Networks on CPU 32

BitFlow: Exploiting Vector Parallelism for Binary Neural Net...

引用

27th international Heterogeneity in Computing Workshop in conjunction with 32nd IEEE international parallel and distributed processing symposium (IPDPS)

作者： Hu, Yuwei Zhai, Jidong Li, Dinghua Gong, Yifan Zhu, Yuhao Liu, Wei Su, Lei Jin, Jiangming TuSimple Inc Beijing Peoples R China Tsinghua Univ Dept Comp Sci Beijing Peoples R China Univ Rochester Dept Comp Sci Rochester NY 14627 USA

ISBN: (纸本)9781538643686

Deep learning has revolutionized computer vision and other fields since its big bang in 2012. However, it is challenging to deploy Deep Neural Networks (DNNs) into real-world applications due to their high computational complexity. Binary Neural Networks (BNNs) dramatically reduce computational complexity by replacing most arithmetic operations with bitwise operations. Existing implementations of BNNs have been focusing on GPU or FPGA, and using the conventional image-to-column method that doesn't perform well for binary convolution due to low arithmetic intensity and unfriendly pattern for bitwise operations. We propose BitFlow, a gemm-operator-network three-level optimization framework for fully exploiting the computing power of BNNs on CPU. BitFlow features a new class of algorithm named PressedConv for efficient binary convolution using locality-aware layout and vector parallelism. We evaluate BitFlow with the VGG network. On a single core of Intel Xeon Phi, BitFlow obtains 1.8x speedup over unoptimized BNN implementations, and 11.5x speedup over counterpart full-precision DNNs. Over 64 cores, BitFlow enables BNNs to run 1.1x faster than counterpart full-precision DNNs on GPU (GTX 1080).

关键词： Convolution Neural networks Layout parallel processing Acceleration Graphics processing units Machine learning"

来源：评论

学校读者我要写书评

暂无评论

A Fast and Massively-parallel Inverse Solver for Multiple-Scattering Tomographic Image Reconstruction 32

A Fast and Massively-Parallel Inverse Solver for Multiple-Sc...

引用

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

作者： Hidayetoglu, Mert Pearson, Carl El Hajj, Izzat Gurel, Levent Chew, Weng Cho Hwu, Wen-mei Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

ISBN: (纸本)9781538643686

We present a massively-parallel solver for large Helmholtz-type inverse scattering problems. The solver employs the distorted Born iterative method for capturing the multiple-scattering phenomena in image reconstructions. This method requires many full-wave forward-scattering solutions in each iteration, constituting the main performance bottleneck with its high computational complexity. As a remedy, we use the multilevel fast multipole algorithm (MLFMA). The solver scales among computing nodes using a two-dimensional parallelization strategy that distributes illuminations in one dimension, and MLFMA sub-trees in the other dimension. Multi-core CPUs and GPUs are used to provide per-node speedup. We demonstrate a 76% efficiency when scaling from 64 GPUs to 4,096 GPUs. The paper provides reconstruction of a 204.8.x204.8. image (4M unknowns) executed on 4,096 GPUs in near-real time (almost 2 minutes). To the best of our knowledge, this is the largest fullwave inverse scattering solution to date, in terms of both image size and computational resources.

关键词： Image reconstruction Imaging Complexity theory Inverse problems Scattering Transmitters Lighting"

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共172页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：