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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

5,162 篇 会议
51 篇 期刊文献
21 册 图书

馆藏范围

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

日期分布

学科分类号

2,478 篇 工学
- 2,333 篇 计算机科学与技术...
- 1,202 篇 软件工程
- 559 篇 电气工程
- 345 篇 信息与通信工程
- 232 篇 电子科学与技术（可...
- 202 篇 控制科学与工程
- 137 篇 网络空间安全
- 63 篇 动力工程及工程热...
- 43 篇 机械工程
- 42 篇 生物工程
- 31 篇 生物医学工程（可授...
- 29 篇 建筑学
- 28 篇 光学工程
- 28 篇 土木工程
- 27 篇 仪器科学与技术
- 22 篇 环境科学与工程（可...
- 19 篇 材料科学与工程（可...
- 18 篇 安全科学与工程
528 篇 理学
- 374 篇 数学
- 74 篇 物理学
- 65 篇 系统科学
- 48 篇 生物学
- 37 篇 统计学（可授理学、...
- 16 篇 化学
445 篇 管理学
- 264 篇 管理科学与工程(可...
- 197 篇 图书情报与档案管...
- 132 篇 工商管理
33 篇 经济学
- 33 篇 应用经济学
30 篇 医学
- 23 篇 临床医学
- 17 篇 基础医学(可授医学...
20 篇 法学
13 篇 农学
9 篇 教育学
1 篇 文学

主题

1,759 篇 computer archite...
677 篇 high performance...
615 篇 hardware
463 篇 computational mo...
366 篇 parallel process...
352 篇 concurrent compu...
304 篇 application soft...
252 篇 bandwidth
247 篇 computer science
233 篇 distributed comp...
211 篇 graphics process...
205 篇 kernel
196 篇 grid computing
196 篇 costs
195 篇 scalability
193 篇 throughput
189 篇 cloud computing
184 篇 resource managem...
174 篇 benchmark testin...
172 篇 processor schedu...

机构

32 篇 university of ch...
15 篇 college of compu...
14 篇 ibm thomas j. wa...
14 篇 barcelona superc...
14 篇 mathematics and ...
13 篇 georgia inst tec...
13 篇 school of comput...
12 篇 oak ridge nation...
12 篇 mathematics and ...
12 篇 department of co...
11 篇 intel corporatio...
11 篇 univ fed rio gra...
10 篇 department of co...
10 篇 intel corp santa...
10 篇 oak ridge nation...
9 篇 univ chicago dep...
9 篇 computer science...
9 篇 oak ridge nation...
9 篇 institute of com...
8 篇 university of sc...

作者

16 篇 navaux philippe ...
13 篇 hai jin
11 篇 dhabaleswar k. p...
11 篇 borin edson
11 篇 xiaofei liao
11 篇 prasanna viktor ...
11 篇 wen-mei w. hwu
10 篇 jack dongarra
10 篇 panda dhabaleswa...
10 篇 i. foster
10 篇 d.k. panda
9 篇 dongarra jack
9 篇 renato ferreira
9 篇 vetter jeffrey s...
9 篇 mutlu onur
9 篇 jie zhang
8 篇 wang lei
8 篇 mateo valero
8 篇 hari subramoni
8 篇 guedes dorgival

语言

5,057 篇 英文
171 篇 其他
9 篇 中文
1 篇 葡萄牙文

检索条件"任意字段=2024 International Symposium on Computer Architecture and High Performance Computing Workshops"

共 5234 条记录，以下是311-320 订阅

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

详细简洁

排序：

Piccolo: Large-Scale Graph Processing with Fine-Grained in-Memory Scatter-Gather 31

Piccolo: Large-Scale Graph Processing with Fine-Grained in-M...

引用

31st IEEE international symposium on high performance computer architecture, HPCA 2025

作者： Shin, Changmin Song, Jaeyong Jang, Hongsun Kim, Dogeun Sung, Jun Kwon, Taehee Ju, Jae Hyung Liu, Frank Choi, Yeonkyu Lee, Jinho Seoul National University Department of Electrical and Computer Engineering Korea Republic of Old Dominion Univeristy School of Data Science United States Samsung Electronics Korea Republic of

ISBN: (纸本)9798331506476

Graph processing requires irregular, fine-grained random access patterns incompatible with contemporary off-chip memory architecture, leading to inefficient data access. This inefficiency makes graph processing an extremely memory-bound application. Because of this, existing graph processing accelerators typically employ a graph tiling-based or processing-in-memory (PIM) approach to relieve the memory bottleneck. In the tiling-based approach, a graph is split into chunks that fit within the on-chip cache to maximize data reuse. In the PIM approach, arithmetic units are placed within memory to perform operations such as reduction or atomic addition. However, both approaches have several limitations, especially when implemented on current memory standards (i.e., DDR). Because the access granularity provided by DDR is much larger than that of the graph vertex property data, much of the bandwidth and cache capacity are wasted. PIM is meant to alleviate such issues, but it is difficult to use in conjunction with the tiling-based approach, resulting in a significant disadvantage. Furthermore, placing arithmetic units inside a memory chip is expensive, thereby supporting multiple types of operation is thought to be impractical. To address the above limitations, we present Piccolo, an end-to-end efficient graph processing accelerator with fine-grained in-memory random scatter-gather. Instead of placing expensive arithmetic units in off-chip memory, Piccolo focuses on reducing the off-chip traffic with non-arithmetic function-in-memory of random scatter-gather. To fully benefit from in-memory scatter-gather, Piccolo redesigns the cache and miss-handling architecture (MHA) of the accelerator such that it can enjoy both the advantage of tiling and in-memory operations. Piccolo achieves a maximum speedup of 3.28 × and a geometric mean speedup of 1.62 ×, along with up to 59.7% reduction in energy consumption across various and extensive benchmarks. © 2025 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Tall-and-Skinny QR Factorization for Clusters of GPUs Using high-performance Building Blocks

Tall-and-Skinny QR Factorization for Clusters of GPUs Using ...

引用

29th international Conference on Parallel and Distributed computing (Euro-Par)

作者： Tomas, Andres E. Quintana-Orti, Enrique S. Univ Politecn Valencia Dept Informat Sistemas & Comp Valencia Spain Univ Valencia Dept Informat Valencia Spain

ISBN: (纸本)9783031506833;9783031506840

We build a message-passing realization of the QR factorization for tall-and-skinny matrices on top of highly parallel linear algebra kernels, such as various types of matrix multiplications and triangular system solves, plus a few small Cholesky decompositions. Our solution, using either the NVIDIA Collective Communications Library (NCCL) or a plain instance of MPI as the message-passing layer, and the implementation of these kernels in linear algebra libraries, can run both on clusters of multicore nodes, possibly accelerated with GPUs, or on multi-GPU platforms. The experimental evaluation of our parallel algorithm for the QR factorization on a cluster of 8 nodes with NVIDIA A100 boards shows significant acceleration factors over a code from MAGMA, based on House-lholder reflectors, that provides the same functionality. In addition, the experiments show a fair weak scalability when the problem has many more rows than columns.

关键词： QR factorization modified Gram-Schmidt method high performance computing graphics processing units (GPUs)

来源：评论

学校读者我要写书评

暂无评论

FRAME 2024 - Proceedings of the 2024 on Workshop on Flexible Resource and Application Management on the Edge, Part of: HPDC 2024 - 3rd international symposium on high-performance Parallel and Distributed computing

FRAME 2024 - Proceedings of the 2024 on Workshop on Flexible...

引用

4th Workshop on Flexible Resource and Application Management on the Edge, FRAME 2024

ISBN: (纸本)9798400706417

The proceedings contain 9 papers. The topics discussed include: towards sustainable deployment of microservices over the Cloud-IoT continuum, with FREEDA;towards enabling observability of energy demand, with NEST;urgent edge computing;optimizing resource allocation in the edge: a minimum weighted vertex cover approach;towards energy-aware execution and offloading of serverless functions;reactive autoscaling of Kubernetes nodes;OUTFIT: crowdsourced data feeding noise maps in digital twins;encoding consistency: optimizing self-driving reliability with real-time speed data;and striking trade-off between high performance and energy efficiency in an edge computing application for detecting floating plastic debris.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DroMPI: Parallel Computation Over Drop computing 24

DroMPI: Parallel Computation Over Drop Computing

引用

24th IEEE/ACM international symposium on Cluster, Cloud, and Internet computing (CCGrid)

作者： Grosu, George-Mircea Nistor, Silvia-Elena Ciobanu, Radu-Ioan Dobre, Ciprian Pop, Florin Natl Univ Sci & Technol Politehn Bucharest Bucharest Romania Natl Inst Res & Dev Informat ICI Bucharest Romania Acad Romanian Scientists Bucharest Romania

ISBN: (纸本)9798350377521;9798350377514

With the advancement of technology and the spread of multi-core systems, the need for parallelization arises and the interest in programming models is growing. At the same time, new distributed computing models have been proposed, being in fierce competition to obtain the highest possible performance. The Drop computing Paradigm proposes the idea of decentralized computing over ad-hoc opportunistic networks of mobile and Edge devices. In this respect, the Drop computing model does not only aim to achieve a minimum turnaround time but also to optimize other characteristics related to mobile devices, such as limited resources and opportunistic communication. Therefore, it is necessary to define a new programming model called DroMPI that intends to extend the capabilities of current parallel and distributed programming models, based on the Drop computing paradigm. Therefore, the solution aims to develop a library that takes advantage of hardware capabilities in the interest of the Drop computing paradigm and also provides programmers with a high-level programming interface. The library's features will be based on the Message Passing Interface (MPI) standard, which will be responsible for inter-node parallelization. The name of the library, DroMPI, is an acronym for Drop computing and MPI. The implementation of the model will be responsible for the management of communication between nodes and for providing an Application Programming Interface (API) for the development of parallel applications in the Drop computing paradigm.

关键词： Decentralized computing Parallel Computation Drop computing Application Programming Interface MPI

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient online resource provisioning for cloud-edge platforms via multi-armed bandits 34

Energy-efficient online resource provisioning for cloud-edge...

引用

34th IEEE international symposium on computer architecture and high performance computing (SBAC-PAD)

作者： Rey-Jouanchicot, Jordan del Castillo, Juan Angel Lorenzo Zuckerman, Stephane Veronica Belmega, E. CY Cergy Paris Univ CY Tech Cergy France CY Cergy Paris Univ ETIS UMR 8051 ENSEA CNRS F-95000 Cergy France Univ Gustave Eiffel CNRS LIGM F-77454 Marne La Vallee France

ISBN: (数字)9781665451574

ISBN: (纸本)9781665451574

Edge computing is a new paradigm in which data are locally collected, aggregated and preprocessed before being sent to a Cloud platform. Edge devices, typically IoT objects, are characterized by limited computational capabilities, alongside high energy efficiency operations. In smart building or smart city applications, the overall amount of available IoT devices may account for an important computational capacity. Aggregating the idle CPU cycles of several devices would allow performing on-site parallel and distributed computing, while reusing the available resources in the network. Timely and important computational tasks such as video surveillance processing, HPC jobs, or deep neural network training, can be performed with local available resources. This includes local servers or a private, on-site cloud, as opposed to the use of public clouds, thus avoiding security issues and fostering energy efficiency. An ongoing research topic in such a distributed and volatile context is to design novel algorithms for resource provisioning that allow tasks to be distributed over a set of available IoT devices in an efficient manner. This work presents two online, adaptive and robust scheduling techniques, based on the UCB and EXP3 Multi-Armed Bandit algorithms (MABs), for resource management in Cloud-Edge computing based environments while improving performance and reducing energy consumption. The novelty of our adapted algorithms lies in the fact that we explicitly account for unavailable computing IoT devices resulting in a time-varying available set of arms at each stage. Our numerical results show the high relevance of our approach in reaching optimal provisioning policies in time-varying environments.

关键词： Cloud Edge computing resource provisioning online learning multi-armed bandits

来源：评论

学校读者我要写书评

暂无评论

SWARM STORM: An Automated Chaos Tool for Docker Swarm Applications 24

SWARM STORM: An Automated Chaos Tool for Docker Swarm Applic...

引用

33rd international symposium on high-performance Parallel and Distributed computing (HPDC)

作者： Higgins, Travis Jha, Devki Nandan Ranjan, Rajiv Newcastle Univ Newcastle Upon Tyne Tyne & Wear England

ISBN: (纸本)9798400704130

Docker Swarm facilitates the deployment of modular applications in an independent yet interconnected manner. Applications within the Swarm communicate through Docker's internal network, ensuring rapid computation and enhanced security. Despite these advantages, the complex nature of software development often leads to the occurrence of various faults, including memory leaks, application failures, and network outages. To systematically identify and address such issues, chaos engineering has emerged as a powerful approach within both development and production environments. However, conducting chaos experiments within a Docker Swarm cluster in a multi-cloud environment proves to be challenging. In this paper, we present Swarm Storm, an automated framework designed for orchestrating chaos engineering experiments within Docker Swarm-based clusters in a cloud-agnostic environment with comprehensive testing features. We validate Swarm Storm using a simple Java benchmark application, demonstrating its effectiveness in addressing faults within the system.

关键词： Docker Swarm Fault Chaos Engineering Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Scalable and Consistent Graph Neural Networks for Distributed Mesh-based Data-driven Modeling

Scalable and Consistent Graph Neural Networks for Distribute...

引用

2024 workshops of the international Conference for high performance computing, Networking, Storage and Analysis, SC workshops 2024

作者： Barwey, Shivam Balin, Riccardo Lusch, Bethany Patel, Saumil Balakrishnan, Ramesh Pal, Pinaki Maulik, Romit Vishwanath, Venkatram Transportation and Power Systems Argonne National Laboratory United States Leadership Computing Facility Argonne National Laboratory United States Argonne National Laboratory Computational Science Division United States Pennsylvania State University Information Sciences and Technology United States Mathematics and Computer Science Argonne National Laboratory United States

ISBN: (纸本)9798350355543

This work develops a distributed graph neural network (GNN) methodology for mesh-based modeling applications using a consistent neural message passing layer. As the name implies, the focus is on enabling scalable operations that satisfy physical consistency via halo nodes at sub-graph boundaries. Here, consistency refers to the fact that a GNN trained and evaluated on one rank (one large graph) is arithmetically equivalent to evaluations on multiple ranks (a partitioned graph). This concept is demonstrated by interfacing GNNs with NekRS, a GPU-capable exascale CFD solver developed at Argonne National Laboratory. It is shown how the NekRS mesh partitioning can be linked to the distributed GNN training and inference routines, resulting in a scalable mesh-based data-driven modeling workflow. We study the impact of consistency on the scalability of mesh-based GNNs, demonstrating efficient scaling in consistent GNNs for up to O(1B) graph nodes on the Frontier exascale supercomputer. © 2024 IEEE.

关键词： graph neural networks mesh-based modeling

来源：评论

学校读者我要写书评

暂无评论

A Research-Based Course Module to Study Non-determinism in high performance Applications 36

A Research-Based Course Module to Study Non-determinism in H...

引用

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

作者： Bell, Patrick Suarez, Kae Fossum, Barbara Chapp, Dylan Bhowmick, Sanjukta Taufer, Michela Univ Tennessee Knoxville TN 37996 USA Univ North Texas Denton TX 76203 USA

ISBN: (纸本)9781665497473

We present a research-based course module to teach computer science students, software developers, and scientists the effects of non-determinism on high performance applications. The course module uses the ANACIN-X software package, a suite of software modules developed by the authors;ANACIN-X provides test cases, analytic tools to run different scenarios (e.g., using different numbers of processes and different communication patterns), and visualization tools for beginner, intermediate, and advanced level understandings in non-determinism. Through our course module, students in computer science, software developers, and scientists gain an understanding of non-determinism, how to measure its occurrence in an execution, and how to identify its root causes within an application's code.

关键词： high performance computing Parallelism Message Passing Workforce Development Debugging

来源：评论

学校读者我要写书评

暂无评论

Designing a Sustainable Serverless Graph Processing Tool on the computing Continuum

Designing a Sustainable Serverless Graph Processing Tool on ...

引用

29th international Conference on Parallel and Distributed computing (Euro-Par)

作者： Farahani, Reza Ristov, Sashko Prodan, Radu Alpen Adria Univ Klagenfurt Klagenfurt Austria Univ Innsbruck Innsbruck Austria

ISBN: (纸本)9783031488023;9783031488030

Graph processing has become increasingly popular and essential for solving complex problems in various domains, like social networks. However, the processing of graphs on a massive scale poses critical challenges, such as inefficient utilization of resources and energy. To bridge such challenges, the Graph-Massivizer project, funded by the Horizon Europe research and innovation program, conducts research and develops a high-performance, scalable, and sustainable platform for information processing and reasoning based on the massive graph (MG) representation of extreme data. This paper presents an initial architectural design for the Graph-Choreographer, one of the five Graph-Massivizer tools. We explain Graph-Choreographer's components and demonstrate how Graph-Choreographer can adopt the emerging serverless computing paradigm to process Basic Graph Operations (BGOs) as serverless functions across the computing continuum efficiently. We also present an early vision of our federated Function-as-a-Service (FaaS) testbed, which will be used to conduct experiments and assess the tool's performance.

关键词： computing Continuum Serverless FaaS Massive Graph

来源：评论

学校读者我要写书评

暂无评论

CORDOBA: Carbon-Efficient Optimization Framework for computing Systems 31

CORDOBA: Carbon-Efficient Optimization Framework for Computi...

引用

31st IEEE international symposium on high performance computer architecture, HPCA 2025

作者： Elgamal, Mariam Carmean, Doug Ansari, Elnaz Zed, Okay Peri, Ramesh Manne, Srilatha Gupta, Udit Wei, Gu-Yeon Brooks, David Hills, Gage Wu, Carole-Jean Harvard University United States Meta United States

ISBN: (纸本)9798331506476

The world's push toward an environmentally sustainable society is highly dependent on the semiconductor industry. Despite existing carbon modeling efforts to quantify carbon footprint of computing systems, optimizing carbon footprint in large design spaces-while also considering trade-offs in power, performance, and area-is especially challenging. To address this need, we present CORDOBA, a carbon-aware optimization framework that optimizes carbon efficiency. We quantify carbon efficiency using the total Carbon Delay Product metric (tCDP): the product of total carbon and application execution time. We justify why tCDP is an effective metric for quantifying carbon efficiency. We use CORDOBA to explore the large design space for carbonefficient specialized hardware, and identify distinct carbonefficient optimal designs across operational use (eliminating up to {9 8%} of the design space) despite uncertainty in carbon footprint parameters. We quantify opportunities to improve tCDP for real system case studies: (a) optimizing hardware provisioning from 8 to 4 cores in real system CPUs improves tCDP by 1.25 ×;and (b) leveraging advanced three-dimensional (3D) integration techniques (3D stacking of separately-fabricated logic and memory chips) improves tCDP by 6.9 × versus conventional systems. © 2025 IEEE.

关键词： carbon footprint carbon-aware optimization carbon-efficient computing metrics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：