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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,925 篇 会议
282 篇 期刊文献
26 册 图书
1 篇 科技报告

馆藏范围

11,234 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,466 篇 工学
- 5,207 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 885 篇 电气工程
- 573 篇 信息与通信工程
- 252 篇 控制科学与工程
- 221 篇 电子科学与技术（可...
- 137 篇 网络空间安全
- 91 篇 机械工程
- 60 篇 生物工程
- 58 篇 动力工程及工程热...
- 52 篇 生物医学工程（可授...
- 46 篇 环境科学与工程（可...
- 45 篇 仪器科学与技术
- 41 篇 安全科学与工程
- 40 篇 建筑学
- 40 篇 测绘科学与技术
- 34 篇 化学工程与技术
- 33 篇 土木工程
- 32 篇 交通运输工程
1,033 篇 理学
- 813 篇 数学
- 121 篇 系统科学
- 116 篇 统计学（可授理学、...
- 83 篇 物理学
- 70 篇 生物学
- 48 篇 化学
- 41 篇 地球物理学
988 篇 管理学
- 843 篇 管理科学与工程(可...
- 285 篇 工商管理
- 176 篇 图书情报与档案管...
57 篇 经济学
- 54 篇 应用经济学
36 篇 法学
26 篇 医学
21 篇 农学
9 篇 教育学
6 篇 文学
3 篇 艺术学
2 篇 军事学

主题

1,705 篇 concurrent compu...
1,583 篇 distributed comp...
1,152 篇 parallel process...
986 篇 computer science
963 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
725 篇 grid computing
598 篇 high performance...
591 篇 hardware
530 篇 processor schedu...
488 篇 computer network...
456 篇 resource managem...
428 篇 scalability
399 篇 costs
395 篇 bandwidth
394 篇 runtime
383 篇 parallel program...
367 篇 peer to peer com...
356 篇 delay

机构

47 篇 college of compu...
40 篇 institute of com...
30 篇 oak ridge natl l...
29 篇 ibm thomas j. wa...
25 篇 institute of com...
23 篇 inria
23 篇 oak ridge nation...
22 篇 school of comput...
21 篇 mathematics and ...
18 篇 argonne natl lab...
18 篇 department of co...
18 篇 department of co...
18 篇 tokyo institute ...
17 篇 department of co...
17 篇 georgia inst tec...
17 篇 iit dept comp sc...
16 篇 univ chinese aca...
16 篇 lawrence berkele...
16 篇 department of co...
15 篇 department of co...

作者

32 篇 dongarra jack
30 篇 jack dongarra
23 篇 p. sadayappan
21 篇 a. choudhary
21 篇 david a. bader
20 篇 maciejewski anth...
19 篇 feng wu-chun
18 篇 dhabaleswar k. p...
18 篇 hoefler torsten
17 篇 p. banerjee
17 篇 h. casanova
17 篇 bader david a.
17 篇 howard jay siege...
17 篇 schulz martin
17 篇 panda dhabaleswa...
15 篇 s.k. das
15 篇 h.j. siegel
15 篇 hai jin
14 篇 gopalakrishnan g...
14 篇 alexey lastovets...

语言

11,156 篇 英文
68 篇 其他
10 篇 中文

检索条件"任意字段=International Symposium on Parallel and Distributed Computing"

共 11234 条记录，以下是791-800 订阅

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

详细简洁

排序：

Automating GPU Scalability for Complex Scientific Models: Phonon Boltzmann Transport Equation

Automating GPU Scalability for Complex Scientific Models: Ph...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Eric Heisler Siddharth Saurav Aadesh Deshmukh Sandip Mazumder Hari Sundar Kahlert School of Computing University of Utah Salt Lake City USA Mechanical and Aerospace Engineering The Ohio State University Columbus USA

ISBN: (数字)9798350387117

ISBN: (纸本)9798350387124

Heterogeneous computing environments combining CPU and GPU resources provide a great boost to large-scale scientific computing applications. Code generation utilities that partition the work into CPU and GPU tasks while considering data movement costs allow researchers to develop high-performance solutions more quickly and easily, and make these resources accessible to a larger user *** present developments for a domain-specific language (DSL) and code generation framework for solving partial differential equations (PDEs). These enhancements facilitate GPU-accelerated solution of the Boltzmann transport equation (BTE) for phonons, which is the governing equation for simulating thermal transport in semiconductor materials at sub-micron scales. The solution of the BTE involves thousands of coupled PDEs as well as complicated boundary conditions and solving a nonlinear equation that couples all of the degrees of freedom at each time step. These developments enable the DSL to generate configurable hybrid GPU/CPU code that couples accelerated kernels with user-defined code. We observed performance improvements of around 18X compared to a CPU-only version produced by this same DSL with minimal additional programming effort.

关键词： Codes Boltzmann equation Semiconductor materials Graphics processing units Phonons Switches Programming

来源：评论

学校读者我要写书评

暂无评论

Measurement-Based Quantum Approximate Optimization

Measurement-Based Quantum Approximate Optimization

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Tobias Stollenwerk Stuart Hadfield Jülich Research Center Institute for Quantum Computing Analytics (PGI-12) Jülich Germany Quantum Artificial Intelligence Lab (QuAIL) USRA Research Institute for Advanced Computer Science NASA Ames Research Center CA

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

Parameterized quantum circuits are attractive candidates for potential quantum advantage in the near term and beyond. At the same time, as quantum computing hardware not only continues to improve but also begins to incorporate new features such as mid-circuit measurement and adaptive control, opportunities arise for innovative algorithmic paradigms. In this work we focus on measurement-based quantum computing protocols for approximate optimization, in particular related to quantum alternating operator ansätze (QAOA), a popular quantum circuit model approach to combinatorial optimization. For the construction and analysis of our measurement-based protocols we demonstrate that diagrammatic approaches, specifically ZX-calculus and its extensions, are effective for adapting such algorithms to the measurement-based setting. In particular we derive measurement patterns for applying QAOA to the broad and important class of QUBO problems. We further outline how for constrained optimization, hard problem constraints may be directly incorporated into our protocol to guarantee the feasibility of the solution found and avoid the need for dealing with penalties. Finally we discuss the resource requirements and tradeoffs of our approach to that of more traditional quantum circuits.

关键词： Protocols Quantum advantage Focusing Logic gates Approximation algorithms Time measurement Hardware

来源：评论

学校读者我要写书评

暂无评论

Envision: Application Level Fairness for Cooperative Edge-AI Services with Deep Reinforcement Learning

Envision: Application Level Fairness for Cooperative Edge-AI...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Jiale Huang Long Chen Shaojie Zheng Jigang Wu School of Computer Science and Technology Guangdong University of Technology Guangzhou China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

Edge artificial intelligence (Edge-AI) is emerging with the proliferation of both multi-access edge computing (MEC) and AI. Cooperative Edge-AI can not only increase the computing resource utilization ratio with edge-edge collaboration, but also improve the big data processing efficiency of mobile end devices through computation offloading to a group of edge servers. Existing paradigms for cooperative edge-AI applications are not tailored for heterogeneous types of applications, thus harming the quality of experience (QoE) of different application users or operators in the network. This paper thus fills the gap by firstly defining the fairness index as service completion ratio, and then formulating the max-min fairness problem subject to edge server’s storage, computation, deadline constraints and so on. The problem is proven to be NP-hard through reduction from a well-known NP-complete problem, the multi-knapsack problem. To tackle the dynamics of both computing resources and channel fading conditions, a deep reinforcement learning algorithm is invented on the basis of buffer replay and evaluation-target networks, to derive the joint service deployment and computation offloading strategy. Extensive experimental results demonstrate that the proposed scheme named as Envision is at least 17× faster than the existing ORA algorithm.

关键词： Fading channels Multi-access edge computing Heuristic algorithms Minimax techniques Deep reinforcement learning Quality of experience Servers Resource management NP-complete problem Indexes

来源：评论

学校读者我要写书评

暂无评论

Energy Balanced Cooperative Edge-AI Services for Service Quality Guarantee

Energy Balanced Cooperative Edge-AI Services for Service Qua...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Kongyang Li Long Chen Tianwen Peng Jigang Wu School of Computer Science and Technology Guangdong University of Technology Guangzhou China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

Cooperative edge computing has shown its advantage to expedite the computing speed and enhance resource utilization ratio when offering edge-AI services. Under such setting, existing works have studied the joint service deployment and request routing problem with cooperative edge servers, however, they have seldom considered the energy balance of edge servers, especially for those battery limited edge devices. To guarantee the edge-AI service quality and achieve a balanced energy consumption, this work thus addresses the joint service deployment and request offloading problem by optimizing the maximum energy consumption of an edge node in each small cell base station in the heterogeneous network. The problem is proven to be NP-hard with a randomized approximation solution. Experimental results demonstrate that the proposed algorithm RRMME can well guarantee the service quality and achieve energy balance. Compared to the designed benchmark algorithm without service quality guarantee, but has energy budget constraint, RRMME algorithm can significantly reduce the average energy consumption by about 28.7%, while has only a slightly service completion rate reduction of less than 8% averagely.

关键词： Energy consumption Base stations Benchmark testing Approximation algorithms Routing Heterogeneous networks Batteries Servers Resource management Edge computing

来源：评论

学校读者我要写书评

暂无评论

An In-Situ Sliding Window Approximate Inner-Product Scheme Based on parallel distributed Arithmetic for Ultra-Low Power Fault-Tolerant Applications

An In-Situ Sliding Window Approximate Inner-Product Scheme B...

引用

IEEE international Midwest symposium on Circuits and Systems (MWSCAS)

作者： Rizk, Dominick Rizk, Rodrigue Rizk, Frederic Kumar, Ashok Univ Louisiana Lafayette Ctr Adv Comp Studies Lafayette LA 70504 USA

ISBN: (纸本)9781665424615

Approximate computing (AC) provides an efficient solution for reducing power, area, and complexity of digital systems. When backed with distributed arithmetic (DA), AC leverages the ability to implement ultra-efficient inner-product units in terms of area, power, and delay. Such units can be used in any inherently resilient application. This paper presents a novel scheme of approximate inner-product based on parallel DA for low-power fault-tolerant applications backed with a novel in-situ sliding window algorithm. Our model eliminates the need for an explicit error correction scheme, which further reduces the overhead while improving the accuracy. The experimental results show that our model achieves a state-of-the-art performance in terms of power delay product (PDP), area power product (APP) with a reduction of 39.26% and 48.83%, respectively.

关键词： Approximate computing distributed arithmetic DSP inner-product LUT memory VLSI SOP

来源：评论

学校读者我要写书评

暂无评论

parallel analysis of TACLeBench kernel benchmark's loop and procedure level speculation 19

Parallel analysis of TACLeBench kernel benchmark's loop and ...

引用

19th IEEE international symposium on parallel and distributed Processing with Applications (IEEE ISPA)

作者： Meng, Huiling Wang, Yaobin Li, Ling Musariri, Manasah Wang, Xinyi Southwest Univ Sci & Technol Mianyang Sichuan Peoples R China

ISBN: (纸本)9781665435741

Thread level speculation (TLS) technology has gained substantial international recognition due to its unique parallel program execution. It uses the potential parallel execution of programs to improve the utilization of multi-core resources. However, the kernel benchmark of TACLeBench has not effectively been analyzed using TLS parallelization. In response to this problem, we select 7 programs in the TACLeBench kernel benchmark to analyze its loop and procedure level speculation executions to measure their maximum potential parallelism. Furthermore, we discuss its runtime characteristics (thread size, speculative parallelism coverage, dependency feature) and the influence of program source code on speedup. Our experimental results illustrate that: 1) Most applications achieve impressive results. Bsort reaches 20.79x speedup in loop level speculation, and lms has 9.51x speedup in procedure level speculation;2) By using TLS to accelerate the TACLeBench kernel benchmark, most applications effectively utilize computing resources from 4 to 16 cores;3) The kernel benchmark is more suitable for developing parallelism in loop level speculation.

关键词： Thread level speculation (TLS) multi-core TACLeBench

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Programming Models and Performance for Stencil Computation on GPGPUs

Evaluation of Programming Models and Performance for Stencil...

引用

IEEE international symposium on parallel and distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Baodi Shan Mauricio Araya-Polo TotalEnergies EP Research & Technology US LLC Houston Texas USA

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

GPGPUs are widely used in high-performance computing. Therefore, it is crucial to experiment and discover how to better utilize their latest generations of relevant applications. In this paper, we introduce highly tuned stencil-based kernels for NVIDIA A100 and H100 (of a GH200) GPGPUs. Performance results yield useful insights into the behavior of this type of computation for these new accelerators. This knowledge can be leveraged by many scientific applications which involves stencil computations. Further, evaluation of three different programming models: CUDA, OpenACC, and OpenMP target offloading is conducted on aforementioned accelerators. We extensively study the performance and portability of various kernels under each programming model and provide corresponding optimization recommendations. Furthermore, we compare the performance of different programming models on the mentioned architectures. Up to 58% performance improvement was achieved against the previous GPGPU generation for a highly optimized kernel of the same class, and up to 42% for all classes. In terms of programming models, and keeping portability in mind, optimized OpenACC implementation outperforms OpenMP implementation by 33%. If portability is not a factor, the best CUDA implementation outperforms the optimized OpenACC one by 2.1×.

关键词： Solid modeling distributed processing Three-dimensional displays Computational modeling High performance computing Conferences Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

ParaDiS: a parallel and distributed framework for Significant pattern mining

ParaDiS: a Parallel and Distributed framework for Significan...

引用

Cluster, Cloud and Internet computing Workshops (CCGridW), IEEE/ACM international symposium on

作者： Jyoti Sriram Kailasam Aleksey Buzmakov School of Computing and Electrical Engg. Indian Institute of Technology Mandi Himachal Pradesh India Dept. of Computer Science and Engg. National Institute of Technology Warangal Telangana India Higher School of Economics National Research University Perm Russia

Mining patterns having a high association with a class label is a supervised data mining technique, frequently used in many applications. As we test many patterns using statistical tests to find all interesting patterns, a certain association is likely achieved by chance. The state-of-the-art TopKWY algorithm mines the top-k interesting patterns while controlling the family-wise-error rate (FWER) in the result set. TopKWY is a sequential algorithm that internally uses compute-intensive closed pattern mining. Moreover, it tests several patterns against thousands of permuted class labels to control FWER. To the best of our knowledge, no parallel/distributed implementation exists to address the scalability challenges faced by TopKWY. The tree formed by the explored patterns in TopKWY is inherently irregular and the search strategy used for exploration, namely, the best-first search is non-trivial to emulate in a distributed setup. This paper designs and implements ParaDiS, a novel parallel and distributed framework for mining the top-k statistically significant patterns. We compare its performance with the sequential TopKWY algorithm for real-world datasets and observe a significant reduction in execution time. We further show that our framework achieves good speedup, minimal communication overhead, and faster pruning of non-promising branches by efficient sharing of significance threshold.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrity Audit Scheme Based on Collaborative Cache in Industrial Internet of Things Environment

Integrity Audit Scheme Based on Collaborative Cache in Indus...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Ruizhong Du Ziyuan Wang Yiwei Wang Jiawei Shen Hebei University China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

Edge caching can provide a limited delay guarantee for delay-sensitive industrial applications. However, in a highly distributed edge environment, cached data is prone to be damaged, and its integrity must be ensured. In this paper, we propose an integrity audit scheme based on collaborative caching in the Industrial Internet of Things (IIoT) environment. This scheme shifts the data storage function from the cloud core network to the edge network, allowing cooperation to fulfill user requests. Firstly, an end-edge-cloud collaborative caching mechanism is designed, partitioning cache space and achieving hierarchical placement through edge collaboration. Secondly, a cache value function combining content recommendation and cost is proposed; cache hit rate and value serve as constraints for replacement and update to dynamically adjust cache data in the edge network. Finally, the analysis proves the correctness and reliability of the scheme. Experimental results show that this scheme can quickly and effectively audit cached data, reduce waiting delay of industrial tasks, and address resource waste from invalid audits.

关键词： Cloud computing distributed processing Collaboration distributed databases Memory User experience Delays Reliability Low latency communication Industrial Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Alleviating Imbalance in Synchronous distributed Training of Deep Neural Networks 19

Alleviating Imbalance in Synchronous Distributed Training of...

引用

19th IEEE international symposium on parallel and distributed Processing with Applications (IEEE ISPA)

作者： Lin, Haiyang Yan, Mingyu Wang, Duo Li, Wenming Ye, Xiaochun Tang, Zhimin Fan, Dongrui Chinese Acad Sci State Key Lab Comp Architecture ICT Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China State Key Lab Math Engn & Adv Comp Wuxi Jiangsu Peoples R China

ISBN: (纸本)9781665435741

Deep neural networks achieve huge success in computer vision, natural language process and other fields. As larger networks and larger datasets bring better performance, the training time grows rapidly. distributed training uses parallelization strategy to accelerate the training of deep neural network. In the existing distributed training framework of deep neural network, the parameter server architecture has poor scalability and is not suitable for large-scale distributed training. Ring/HD All Reduce algorithm perform well in scalability under ideal circumstances. However, in many realistic scenarios, imbalance will occur frequently in the distributed training system, which is mainly the imbalance of compute ability and network. Due to the structure characteristics of synchronous distributed training and All Reduce algorithm, imbalance will bring serious impact on performance. At present, there is a lack of research on both compute ability imbalance and network imbalance, especially dynamic imbalance. To alleviate this problem, we analyze All Reduce algorithm first, and propose RingDL, which optimizes the performance of distributed training system by alleviating imbalance through customizable dynamic workloads strategy and link strategy. The experimental results show that RingDL significantly reduces idle time in computing phase and synchronous phase, improving the overall performance.

关键词： deep neural networks synchronous distributed training imbalance dynamic workloads strategy link strategy

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 76 77 78 79 80 81 82 83 84 85 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：