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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

23,961 篇 会议
400 篇 期刊文献
285 册 图书
1 篇 学位论文

馆藏范围

24,647 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

14,497 篇 工学
- 13,367 篇 计算机科学与技术...
- 5,952 篇 软件工程
- 2,508 篇 电气工程
- 2,171 篇 信息与通信工程
- 916 篇 控制科学与工程
- 532 篇 电子科学与技术（可...
- 412 篇 机械工程
- 327 篇 生物工程
- 261 篇 动力工程及工程热...
- 219 篇 仪器科学与技术
- 207 篇 生物医学工程（可授...
- 155 篇 材料科学与工程（可...
- 152 篇 力学（可授工学、理...
- 150 篇 建筑学
- 147 篇 土木工程
- 123 篇 网络空间安全
- 117 篇 环境科学与工程（可...
- 112 篇 交通运输工程
2,956 篇 理学
- 2,034 篇 数学
- 449 篇 物理学
- 397 篇 生物学
- 343 篇 系统科学
- 313 篇 统计学（可授理学、...
- 145 篇 化学
2,037 篇 管理学
- 1,501 篇 管理科学与工程(可...
- 712 篇 工商管理
- 667 篇 图书情报与档案管...
249 篇 医学
- 190 篇 临床医学
- 111 篇 基础医学(可授医学...
173 篇 经济学
- 172 篇 应用经济学
153 篇 法学
85 篇 农学
82 篇 教育学
41 篇 文学
11 篇 军事学
8 篇 艺术学

主题

2,974 篇 distributed comp...
1,756 篇 parallel process...
1,703 篇 concurrent compu...
1,632 篇 cloud computing
1,229 篇 computational mo...
1,086 篇 computer archite...
954 篇 grid computing
932 篇 computer science
783 篇 application soft...
757 篇 computer network...
615 篇 scalability
519 篇 distributed data...
514 篇 algorithm design...
507 篇 hardware
503 篇 peer to peer com...
494 篇 parallel algorit...
477 篇 high performance...
450 篇 software enginee...
445 篇 parallel computi...
442 篇 parallel program...

机构

52 篇 university of ch...
46 篇 institute of com...
41 篇 college of compu...
36 篇 department of co...
36 篇 college of intel...
31 篇 department of co...
29 篇 school of comput...
29 篇 national laborat...
29 篇 natl univ def te...
27 篇 school of comput...
24 篇 school of comput...
24 篇 shandong provinc...
23 篇 institute of par...
23 篇 institute of inf...
22 篇 univ chinese aca...
21 篇 university of sc...
21 篇 school of comput...
20 篇 shanghai jiao to...
20 篇 department of co...
19 篇 graduate univers...

作者

35 篇 li dongsheng
29 篇 dongsheng li
28 篇 liu jie
27 篇 duerr frank
26 篇 m. takizawa
26 篇 rajkumar buyya
26 篇 zomaya albert y.
24 篇 fahringer thomas
21 篇 jack dongarra
19 篇 yang yang
19 篇 prodan radu
18 篇 wei li
17 篇 li kenli
17 篇 wang guojun
17 篇 badia rosa m.
16 篇 liu yang
16 篇 p. banerjee
16 篇 dou yong
15 篇 lei wang
15 篇 xuejun yang

语言

23,954 篇 英文
592 篇 其他
89 篇 中文
17 篇 俄文
2 篇 土耳其文
2 篇 乌克兰文
1 篇 德文
1 篇 西班牙文
1 篇 法文

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

共 24647 条记录，以下是771-780 订阅

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

详细简洁

排序：

Interferences Between Communications and Computations in distributed HPC Systems 27th

Interferences Between Communications and Computations in Dis...

引用

27th international European conference on parallel and distributed computing (Euro-Par)

作者： Swartvagher, Philippe Inria Bordeaux Sud Ouest F-33405 Talence France

ISBN: (纸本)9783031061561;9783031061554

Overlapping communications with computations in distributed applications should increase their performances and allow to reach better scalability. This implies, by construction, communications are executed in parallel of computations. In this work, we explore the impact of computations on communication performances and vice-versa, with a focus on the role of memory contention. One main observation is that highly memory-bound computations can have a severe impact on network bandwidth.

关键词： HPC MPI Memory contention

来源：评论

学校读者我要写书评

暂无评论

Game Theoretical distributed Task Offloading for Tethered Aerial Vehicles Communication Network 4

Game Theoretical Distributed Task Offloading for Tethered Ae...

引用

4th IEEE international conference on Electrical, Computer, and Energy Technologies, ICECET 2024

作者： Yang, Zhaohui Huang, Fengling Su, Xuqi Zhou, Pingfang Guo, Fusen Jing, Yuhao School of Aeronautics and Astronautics Shanghai Jiao Tong University Shanghai China School of Science Computing and Engineering Technologies Swinburne University of Technology Melbourne Australia School of Engineering and Information Technology University of New South Wales Canberra Australia

ISBN: (纸本)9798350395914

This paper introduces a game-theoretic framework aimed at enhancing offloading decisions within a network of multiple tethered aerial vehicles (TAVs) employed as communication base stations and relay platforms. Given their advantageous low deployment costs and extensive coverage areas, TAVs represent an innovative solution for dynamic air-ground communication networks. We address the inherent challenges associated with the mobility of ground users and consider across multiple temporal intervals. We initially segment offloading decisions into discrete time slots and model them within a strategic game principle. Subsequently, we prove that this game constitutes an exact potential game and introduce a distributed algorithm based on best response iteration. This algorithm is designed for decentralized deployment across individual tethered aerial vehicles. Through simulation studies, we demonstrate that our proposed methodology enhances network throughput relative to conventional random offloading strategies. It advances the theoretical understanding of offloading in dynamic network environments and offers practical algorithms for real-world applications. © 2024 IEEE.

关键词： Antenna grounds

来源：评论

学校读者我要写书评

暂无评论

distributed Cloud computing Architecture in Hyperspectral Remote Sensing Image Classification under Big Data 5

Distributed Cloud Computing Architecture in Hyperspectral Re...

引用

5th IEEE international conference on Information Systems and Computer Aided Education, ICISCAE 2022

作者： Feng, Kai Wu, Yi Shaanxi Academy of Aerospace Technology Application Co. Ltd. Xi'an China

ISBN: (数字)9781665481229

ISBN: (纸本)9781665481229

By using the cloud computing platform that has achieved excellent commercial results to perform parallel classification processing of massive remote sensing data, it can meet the requirements of improving the parallel processing efficiency of massive remote sensing data. The purpose of this paper is to study the application of distributed cloud computing architecture in hyperspectral remote sensing image classification based on big data. The related technologies of cloud computing are expounded, and the model of SCSRC, a sparse representation classification method based on spatial correlation constraints, is proposed. By analyzing the principle and solution method of SCSRC model, a distributed classification algorithm DP-SCSRC based on spatial correlation constraint sparse representation is proposed on the Spark platform, and the following optimization methods are designed for the core steps. Finally, through experiments with different computing nodes and different amounts of computing data, it is proved that the DP-SCSRC algorithm has a good distributed speedup ratio and data scalability under the premise of ensuring the classification accuracy. © 2022 IEEE.

关键词： distributed cloud

来源：评论

学校读者我要写书评

暂无评论

Optimizing CSR-Based SpMV on a New MIMD Architecture Pezy-SC3s 1

引用

23rd international conference on Algorithms and Architectures for parallel Processing (ICA3PP)

作者： Guo, Jihu Liu, Jie Wang, Qinglin Zhu, Xiaoxiong Natl Univ Def Technol Lab Digitizing Software Frontier Equipment Changsha 410073 Peoples R China Natl Univ Def Technol Natl Key Lab Parallel & Distributed Comp Changsha 410073 Peoples R China

ISBN: (数字)9789819708017

ISBN: (纸本)9789819708000;9789819708017

Sparse matrix-vector multiplication (SpMV) is extensively used in scientific computing and often accounts for a significant portion of the overall computational overhead. Therefore, improving the performance of SpMV is crucial. However, sparse matrices exhibit a sporadic and irregular distribution of non-zero elements, resulting in workload imbalance among threads and challenges in vectorization. To address these issues, numerous efforts have focused on optimizing SpMV based on the hardware characteristics of computing platforms. In this paper, we present an optimization on CSR-Based SpMV, since the CSR format is the most widely used and supported by various high-performance sparse computing libraries, on a novel MIMD computing platform Pezy-SC3s. Based on the hardware characteristics of Pezy-SC3s, we tackle poor data locality, workload imbalance, and vectorization challenges in CSRBased SpMV by employing matrix chunking, applying Atomic Cache for workload scheduling, and utilizing SIMD instructions during performing SpMV. As the first study to investigate SpMV optimization on Pezy-SC3s, we evaluate the performance of our work by comparing it with the CSR-Based SpMV and SpMV provided by Nvidia's CuSparse. Through experiments conducted on 2092 matrices obtained from SuiteSparse, we demonstrate that our optimization achieves a maximum speedup ratio of x17.63 and an average of x1.56 over CSR-Based SpMV and an average bandwidth utilization of 35.22% for large-scale matrices (nnz >= 10(6)) compared with 36.17% obtained using CuSparse. These results demonstrate that our optimization effectively harnesses the hardware resources of Pezy-SC3s, leading to improved performance of CSR-Based SpMV.

关键词： SpMV Optimization CSR-Based SpMV Pezy-SC3s

来源：评论

学校读者我要写书评

暂无评论

parallel implementation for dynamic mesh optimization on distributed computer system 22

Parallel implementation for dynamic mesh optimization on dis...

引用

6th High Performance computing and Cluster Technologies conference, HPCCT 2022

作者： Tang, Jing Zhang, Jian Wu, Xiao-Jun Zhang, Yao-Bin Zhou, Nai-Chun Computational Aerodynamics Institute China Aerodynamics Research and Development Center Mianyang621000 China

ISBN: (纸本)9781450396646

The large scale computer system provides a high performance platform for engineering applications. Mesh generation is the basis for numerical simulation for computing science, which heavily relies on user' experience and may not match the demand of application itself. Dynamic mesh optimization according to the features of application is an automatic and smart way during the parallel simulation. The shared-memory parallelism on a standalone computer is the main strategy for mesh generation which is regarded as a pre-processing of simulation. However, it is not suitable for dynamic mesh optimization which is involved in parallel simulation commonly on distributed computer system. In this paper, the parallel implementation on distributed system is established. A two-stages method was proposed for mesh parallel editing to make new mesh objects parallel consistent. The parallel repartition-migration method was devised to recover the load balance for numerical simulation after mesh editing. parallel performance test shows that parallel mesh editing is a communication dense procedure and so the parallel efficiency drops as the computing cores increase. © 2022 ACM.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Custom Accessors: Enabling Scalable Data Ingestion, (Re-)Organization, and Analysis on distributed Systems

Custom Accessors: Enabling Scalable Data Ingestion, (Re-)Org...

引用

2024 IEEE international conference on Big Data, BigData 2024

作者： Castellana, Vito Giovanni Mutlu, Burcu O. Dio Lavore, Ian Di Firoz, Jesun Wolf, Katherine Minutoli, Marco Feo, John Pacific Northwest National Laboratory RichlandWA United States Politecnico di Milano Milano Italy

ISBN: (纸本)9798350362480

The emerging class of high velocity and high volume data analytic workflows comprise interwoven data ingestion, organization, and processing stages, with ingestion and organization steps often contributing comparable or even higher computational costs than actual processing steps. Since complex workflows consist of a variety of phases that view and use data differently, being able to construct efficient, scalable, distributed data structures (arrays, vectors, sets, maps, and multi-maps) is essential and requires custom methods to extend and shrink containers, analyze and position data, and, maintain globally-consistent meta-data. In this paper, we propose a novel data-structure access paradigm based on the concept of Accessors. At a high level, accessors are customizable callable objects that can modify the behavior of insert, read, update, and delete operations for distributed containers while preserving atomicity guarantees. Accessors provide a very clean and natural way to implement a variety of programming patterns, e.g., conditional insertion/deletion and cascading computations, which would be otherwise hard (or even impossible) to express in parallel and distributed settings without using locks. We demonstrate the practicality and usefulness of our approach with two representative use cases and study the performance of these applications on a distributed High-Performance computing system. Our analysis highlights that our proposed abstraction allows for an effective overlapping and concurrent execution of different workflow steps (e.g., data ingestion and analysis), which in a conventional analytics pipeline would execute sequentially, contributing cumulatively to the overall latency. © 2024 IEEE.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

DiAD - distributed Acceleration for Datacenter FPGAs 33

DiAD - Distributed Acceleration for Datacenter FPGAs

引用

33rd international conference on Field-Programmable Logic and Applications (FPL)

作者： Lant, Joshua Skordalakis, Emmanouil Paraskevas, Kyriakos Toms, William B. Lujan, Mikel Goodacre, John Univ Manchester Dept Comp Sci Manchester M13 9PL Lancs England

ISBN: (纸本)9798350341515

The growing demands placed upon modern compute and network resources are far exceeding the capabilities of traditional computer architectures. It is now customary for accelerators to perform the bulk of compute, and this compute is being pushed ever closer to the network. FPGA vendors have brought powerful datacenter cards to the market, combining reprogrammable FPGA fabrics with high bandwidth networking capability. However, the supporting infrastructure has yet to reach maturity, so modern and diverse workloads are not yet able to fully leverage these architectural advances. In this paper we present DiAD;a novel framework providing FPGA firmware and driver support for fully unified, distributed compute and network acceleration across a commodity Ethernet network. We present a far richer feature set and greater flexibility than other existing solutions. We show comparable networking performance from the host when compared to Xilinx's OpenNIC solution. As well as allowing for host networking through the FPGA fabric, we demonstrate reliable data transfer directly between FPGA fabrics without host intervention, and show native memory transactions sent over the network supporting pointer-chasing workloads. We achieve line rate for dataflow type communication and approach line rate for larger native memory transfers (87G).

关键词： datacenter distributed computing FPGA networks

来源：评论

学校读者我要写书评

暂无评论

Massively parallel Maximum Coverage Revisited 50th

Massively Parallel Maximum Coverage Revisited

引用

50th international conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025

作者： Bui, Thai Vu, Hoa T. San Diego State University San DiegoCA92182 United States

ISBN: (纸本)9783031826696

We study the maximum set coverage problem in the massively parallel model. In this setting, m sets that are subsets of a universe of n elements are distributed among m machines. In each round, these machines can communicate with each other, subject to the memory constraint that no machine may use more than O~n memory. The objective is to find the k sets whose coverage is maximized. We consider the regime where k=Ω(m) (i.e., k=m/100), m=O(n), and each machine has O~n memory1. Maximum coverage is a special case of the submodular maximization problem subject to a cardinality constraint. This problem can be approximated to within a 1-1/e factor using the greedy algorithm, but this approach is not directly applicable to parallel and distributed models. When k=Ω(m), to obtain a 1-1/e-ϵ approximation, previous work either requires O~mn memory per machine which is not interesting compared to the trivial algorithm that sends the entire input to a single machine, or requires 2O(1/ϵ)n memory per machine which is prohibitively expensive even for a moderately small value ϵ. Our result is a randomized (1-1/e-ϵ)-approximation algorithm that uses O(1/ϵ3·logm·(log(1/ϵ)+logm))rounds. Our algorithm involves solving a slightly transformed linear program of the maximum coverage problem using the multiplicative weights update method, classic techniques in parallel computing such as parallel prefix, and various combinatorial arguments. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of distributed GPU-Accelerated Task-Based Workflows 27

Performance Analysis of Distributed GPU-Accelerated Task-Bas...

引用

27th international conference on Extending Database Technology, EDBT 2024

作者： Carvalho, Marcos N.L. Queralt, Anna Romero, Oscar Simitsis, Alkis Tatu, Cristian Badia, Rosa M. UPC Barcelona Spain NKUA and Athena RC Athens Greece Universitat Politècnica de Catalunya Barcelona Spain Athena Research Center Athens Greece Barcelona Supercomputing Center Barcelona Spain

ISBN: (纸本)9783893180950

We present an empirical approach to identify the key factors affecting the execution performance of task-based workflows on a High Performance computing (HPC) infrastructure composed of heterogeneous CPU-GPU clusters. Our results reveal that the execution performance in distributed GPU-accelerated task-based workflows highly depends on several interrelated factors regarding the task algorithm, dataset, resources, and system employed. In addition, our analysis identifies key correlations among these factors, presents novel observations, and offers guidelines toward designing an automated method to handle task-based workflows in modern, high-compute capacity, CPU-GPU engines. © 2024 Copyright held by the owner/author(s).

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

SpecInF: Exploiting Idle GPU Resources in distributed DL Training via Speculative Inference Filling 20th

SpecInF: Exploiting Idle GPU Resources in Distributed DL Tr...

引用

20th IFIP WG 10.3 international conference on Network and parallel computing, NPC 2024

作者： Lv, Cunchi Shi, Xiao Liang, Dong Tan, Wenting Zhao, Xiaofang Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Nanjing China Zhongguancun Laboratory Haidian China Nanjing Institute of InforSuperbahn Nanjing China

ISBN: (纸本)9789819628292

Deep Learning (DL), especially with Large Language Models (LLMs), brings benefits to various areas. However, DL training systems usually yield prominent idling GPU resources due to many factors, such as resource allocation and collective communication. To improve GPU utilization, we present SpecInF, which adopts a Speculative Inference Filling method to exploit idle GPU resources. It collocates each primary training instance with additional inference instances on the same GPU, detects the training bubbles and adaptively fills with online or offline inference workloads. Our results show that SpecInF can effectively enhance GPU utilization under mainstream parallel training modes, delivering additional up to 14× offline inference throughputs than TGS and 67% reduction in online inference p95 latency than MPS, while guaranteeing collocated training throughput. © IFIP international Federation for Information Processing 2025.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 74 75 76 77 78 79 80 81 82 83 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：