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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

5,462 篇 工学
- 5,203 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 883 篇 电气工程
- 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,582 篇 distributed comp...
1,152 篇 parallel process...
986 篇 computer science
963 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
724 篇 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,200 篇 英文
18 篇 其他
10 篇 中文

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

共 11228 条记录，以下是161-170 订阅

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

详细简洁

排序：

RainCloud: Decentralized Coordination and Communication in Heterogeneous IoT Swarms 1

RainCloud: Decentralized Coordination and Communication in H...

引用

1st international symposium on parallel computing and distributed Systems, PCDS 2024

作者： Loisel, Filip Zeqo, Geri Morichetta, Andrea Lackinger, Anna Dustdar, Schahram DSG@TU Wien Auxo GmbH Austria Distributed Systems Group Tu Wien Austria

ISBN: (纸本)9798350349658

The increasing volume and complexity of IoT systems demand a transition from the cloud-centric model to a decentralized IoT architecture in the so called computing Continuum, with no or minimal reliance on central servers. This paradigm shift, however, raises novel research concerns for decentralized coordination, calling for accurate policies. However, building such strategies is not trivial. Our work aims to relieve the DevOps engineers from this concern and propose a solution for autonomous, decentralized task allocation at runtime for IoT systems. To this end, we present a semantic communication approach and an ad-hoc lightweight coordination strategy based on Ant Colony Optimization (ACO). We compare the ACO strategy with Random Search and Gossip protocol-based algorithms. We conduct accurate experiments with up to a hundred nodes in both a static and a dynamic environment, i.e., with device outages. We show that ACO finds a matching node with the smallest hops and messages sent. While the Gossip strategy can allocate the most tasks successfully, ACO scales better, thus being a promising candidate for decentralized task coordination in IoT clusters. © 2024 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

FASOP: Fast yet Accurate Automated Search for Optimal parallelization of Transformers on Heterogeneous GPU Clusters 24

FASOP: Fast yet Accurate Automated Search for Optimal Parall...

引用

33rd international symposium on High-Performance parallel and distributed computing (HPDC)

作者： Hwang, Sunyeol Lee, Eungyeong Oh, Hongseok Yi, Youngmin Univ Seoul Seoul South Korea

ISBN: (纸本)9798400704130

Transformer-based large language models have recently shown remarkable performance, but their significantly large parameters require efficient training, which is commonly realized by utilizing both data- and model-parallel deep learning on a GPU cluster. To minimize the training time, the optimal degrees of data and model parallelisms and the optimal model partitioning should be searched. When heterogeneous GPU clusters are used to utilize as many GPUs as possible, it becomes more challenging. In this work, we propose a framework named FASOP that automatically and rapidly finds the (near-)optimal degrees of parallelisms and model partitioning of Transformer-based models on heterogeneous GPU clusters, with an accurate estimation of pipelining latency and communications. Moreover, it can search for optimal cluster configurations that minimize the training time while satisfying the cost of GPU clusters. The proposed model partitioning algorithm in FASOP is three orders of magnitude faster than Dynamic Programming in the state-of-the-art for GPT-2 1.5B on a mixed set of 32 GPUs with A100 and A10, leading to a few seconds instead of several hours. And, FASOP shows only 8.7% mean absolute error in training time estimation for GPT-2 1.5B. With a fast yet accurate search, FASOP achieved up to 1.37x speedup compared to Megatron-LM.

关键词： Heterogeneous cluster distributed deep learning parallelization strategy Large language model

来源：评论

学校读者我要写书评

暂无评论

CLOUD-BASED FINE-GRAINED parallel OPTIMIZATION ON CPU-GPU HETEROGENEOUS HYPERSPECTRAL IMAGE SUPERPIXEL SPACE-SPECTRUM FUSION CLASSIFICATION ALGORITHMS

CLOUD-BASED FINE-GRAINED PARALLEL OPTIMIZATION ON CPU-GPU HE...

引用

IEEE international Geoscience and Remote Sensing symposium (IGARSS)

作者： Wang, Hongfei Tao, Zhigang Wu, Zebin Zhang, Yi Zhou, Junlong Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing 210094 Peoples R China Nanjing Res Inst Elect Engn NRIEE Nanjing 210000 Peoples R China

ISBN: (纸本)9798350320107

To meet the need for efficient execution of hyperspectral remote sensing image classification algorithms, this paper proposes a fine-grained parallel optimization method for a CPU-GPU heterogeneous hyperspectral image superpixel spectral fusion classification algorithm based on cloud computing. Ray is used as the distributed computing engine to fully utilize the logical control ability and large-scale parallel computing ability of the CPU-GPU heterogeneous platform. We first decouple the superpixel spectral fusion classification algorithm, analyze the data dependence and computing characteristics of sub-tasks, use the GPU to accelerate the algorithm, and then further extend the algorithm to the CPU-GPU heterogeneous platform. At the same time, we establish a scheduling model for algorithm task scheduling problems, specifying the value of the parallelism degree for the algorithm in a fine-grained manner. It is verified by experiments that the parallelization method proposed in this paper can effectively improve the execution efficiency with the premise of the accuracy unreduced.

关键词： Hyperspectral Image Classification superpixel spatial-spectral fusion fine-grained parallel CPU-GPU heterogeneous cloud computing

来源：评论

学校读者我要写书评

暂无评论

Energy Optimization through a Multidimensional distributed Scheduling Approach 23

Energy Optimization through a Multidimensional Distributed S...

引用

23rd international symposium on parallel and distributed computing, ISPDC 2024

作者： Valera, Humberto Giraldo, Leonel Isaac Guerrero Mutnoz, Carlos Alejandro Sivira Marroquin, Alan Alfredo Rojas Damas, Lucas Aguilar Dalmau, Marc Roose, Philippe Cardinale, Yudith Technopôle Domolandes Saint-Geours-de-Maremne France Universidad Simón Bolivar Caracas Venezuela Universidad Católica San Pablo Arequipa Peru Universidad Internacional de Valencia Spain E2S Uppa University of Pau Anglet France

ISBN: (纸本)9798350369199

distributed systems, spanning pervasive, cloud, and edge computing, require robust scheduling for tasks and data management, facing challenges like hardware diversity, QoS, localization, and energy efficiency. Current solutions often lack a comprehensive approach, failing to achieve balanced load management, QoS, and notably in minimizing application energy use, a key modern concern. We propose a distributed scheduler using multidimensional spaces and data structures aimed at comprehensive load balancing, energy efficiency, and QoS. The scheduler indexes devices within the structure based on diverse criteria such as hardware availability, GPS, and energy features. It then organizes applications into abstract graphs, where nodes are containers and their data items (units of data accessed by the containers), and edges are the transfer rates among them. To migrate containers, the scheduler performs range queries within the structure for optimal devices. To organize data items, it finds the barycenter of the devices executing the containers linked to them. We evaluated our scheduler's effectiveness using the PISCO simulator, comparing it against other energy-efficient schedulers. © 2024 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Image Classification between Edge and Cloud computing 1

Performance Analysis of Image Classification between Edge an...

引用

1st international symposium on parallel computing and distributed Systems, PCDS 2024

作者： Vechprasit, Natthasak Monsakul, Annop Boonsieng, Pramuk Thai-Nichi Institute of Technology Faculty of Information Technology Bangkok Thailand Panyapiwat Institute of Management Faculty of Engineering and Technology Nonthaburi Thailand

ISBN: (纸本)9798350349658

Image classification has become a major application in the AI era for connecting the physical and digital worlds. However, it requires intensive graphic processing power. IoT and Edge computing have become popular approaches for distributing and offloading the workload from the cloud to the edge. Many edge devices are powered by an energy-efficient processor that can't execute intensive workloads, but some may be able to. In this paper, we studied the overview of image classification implementation on edge and cloud computing and analyzed the performance to reveal the opportunity to implement a proper system architecture. The edge and cloud computing environments studied in this paper are a smartphone and a cloud GPU instance with sample applications to simulate real-world scenarios. The performance is based on the datasets and the processing environment comprising three factors: ML runtime, hardware, and network. Resulting in six factors: inference time, end-to-end execution time (including network delays), accuracy, confidence score, resource usage, and data transfer. © 2024 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

distributed Checkpointing in Dataflow with Static Scheduling 35

Distributed Checkpointing in Dataflow with Static Scheduling

引用

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

作者： Alves, Tiago A. O. Univ Estado Rio De Janeiro Rio De Janeiro Brazil

ISBN: (纸本)9798350381603

The Dataflow model, where instructions or tasks are fired as soon as their input data is ready, was proven to be a good fit for parallel/distributed computation. Previous works have presented DFER (Dataflow Error Recovery Model), that allows transient error and recovery in dataflow by adding special tasks and edges to the dataflow graph itself. However, permanent faults or faults that cause a processing element (PE) to become irresponsive are not addressed by DFER. For those cases it is necessary to adopt a checkpointing method. Since the whole purpose of Dataflow is to achieve high levels of parallelism and explore the potential asynchronicity between PEs, it is clear that the checkpointing method adopted must be uncoordinated and distributed. Current algorithms for distributed checkpointing rely solely on guaranteeing that causality between checkpoints can be trackable. In the context of Dataflow with static scheduling, i.e. when the dataflow graph is partitioned among the available PEs at compile-time, causality trackability is not sufficient as we will show. Since static scheduling of dataflow graphs is very important in various scenarios, it calls for a new algorithm for distributed checkpointing that can be adopted for the execution of statically scheduled dataflow graphs. In this paper we describe why the ability to track causality is not enough for statically scheduled dataflow and introduce a new algorithm for distributed checkpointing specifically tailored for such model of execution.

关键词： dataflow distributed checkpointing fault tolerance parallel programming

来源：评论

学校读者我要写书评

暂无评论

Porting a Computational Fluid Dynamics Code with AMR to Large-scale GPU Platforms 37

Porting a Computational Fluid Dynamics Code with AMR to Larg...

引用

37th IEEE international parallel and distributed Processing symposium (IPDPS)

作者： Davis, Joshua H. Shafner, Justin Nichols, Daniel Grube, Nathan Martin, Pino Bhatele, Abhinav Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Dept Aerosp Engn College Pk MD 20742 USA

ISBN: (纸本)9798350337662

Accurate modeling of turbulent hypersonic flows has tremendous scientific and commercial value, and applies to atmospheric flight, supersonic combustion, materials discovery and climate prediction. In this paper, we describe our experiences in extending the capabilities of and modernizing CRoCCo, an MPIbased, CPU-only compressible computational fluid dynamics code. We extend CRoCCo to support block-structured adaptive mesh refinement using a highly-scalable AMR library, AMReX, and add support for a fully curvilinear solver. We also port the computational kernels in CRoCCo to GPUs to enable scaling on modern exascale systems. We present our techniques for overcoming performance challenges and evaluate the updated code, CRoCCo v2.0, on the Summit system, demonstrating a 6x to 44x speedup over the CPU-only version.

关键词： hypersonics computational fluid dynamics adaptive mesh refinement GPU computing

来源：评论

学校读者我要写书评

暂无评论

Accelerating Function-Centric Applications by Discovering, Distributing, and Retaining Reusable Context in Workflow Systems 24

Accelerating Function-Centric Applications by Discovering, D...

引用

33rd international symposium on High-Performance parallel and distributed computing (HPDC)

作者： Thanh Son Phung Thomas, Colin Ward, Logan Chard, Kyle Thain, Douglas Univ Notre Dame Notre Dame IN 46556 USA Argonne Natl Lab Lemont IL USA Univ Chicago Chicago IL USA

ISBN: (纸本)9798400704130

Workflow systems provide a convenient way for users to write large-scale applications by composing independent tasks into large graphs that can be executed concurrently on high-performance clusters. In many newer workflow systems, tasks are often expressed as a combination of function invocations in a high-level language. Because necessary code and data are not statically known prior to execution, they must be moved into the cluster at runtime. An obvious way of doing this is to translate function invocations into self-contained executable programs and run them as usual, but this brings a hefty performance penalty: a function invocation now needs to piggyback its context with extra code and data to a remote node, and the remote node needs to take extra time to reconstruct the invocation's context before executing it, both detrimental to lightweight short-running functions. A better solution for workflow systems is to treat functions and invocations as first-class abstractions: subsequent invocations of the same function on a worker node should only pay for the cost of context setup once and reuse the context between different invocations. The remaining problems lie in discovering, distributing, and retaining the reusable context among workers. In this paper, we discuss the rationale and design requirement of these mechanisms to support context reuse, and implement them in TaskVine, a data-intensive distributed framework and execution engine. Our results from executing a large-scale neural network inference application and a molecular design application show that treating functions and invocations as first-class abstractions reduces the execution time of the applications by 94.5% and 26.9%, respectively.

关键词： Workflow Systems Serverless computing distributed Storage Burst Buffers

来源：评论

学校读者我要写书评

暂无评论

HM2: Efficient Host Memory Management for RDMA-Enabled distributed Systems 23

HM2: Efficient Host Memory Management for RDMA-Enabled Distr...

引用

32nd international symposium on High-Performance parallel and distributed computing (HPDC) part of the ACM Federated computing Research Conference (FCRC)

作者： Tang, Chen Chu, Zhaole Jin, Peiquan Luo, Yongping Guo, Kuankuan Univ Sci Technol China Hefei Peoples R China ByteDance Inc Beijing Peoples R China

ISBN: (纸本)9798400701559

Remote direct memory access (RDMA) supports zero-copy networking by transferring data from clients directly to host memory, eliminating the need to copy data between clients' memory and the data buffers in the hosting server. However, the hosting server must design efficient memory management schemes to handle incoming clients' data. In this paper, we propose a high-performance host memory management scheme called HM2 for RDMA-enabled distributed systems. We present a new buffer structure for incoming data from clients. In addition, we propose efficient data processing methods to reduce network transfers between clients and servers. We conducted a preliminary experiment to evaluate HM2, and the results showed HM2 achieved higher throughput than existing schemes, including L5 and FaRM.

关键词： RDMA memory management data buffer

来源：评论

学校读者我要写书评

暂无评论

A Communication-efficient Collaborative Task Offloading Method Based on distributed computing Cloud 22

A Communication-efficient Collaborative Task Offloading Meth...

引用

22nd IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2024

作者： Zhang, Ke Zong, Ruixing Song, Yingjie Zhou, Yong Xiao, Xiong Hunan University Changsha China

ISBN: (纸本)9798331509712

An interconnected distributed computing cloud, comprising network-linked computational nodes, facilitates the allocation of computational resources across diverse locations. The strategic offloading of computationally demanding tasks from resource-constrained nodes to proximate nodes endowed with ample resources can enhance the resource utilization within the computing cloud. Given the interdependencies among segmented tasks, improper task partitioning may engender supplementary overheads. Furthermore, the process of task offloading introduces additional communication overhead. Consequently, the judicious division of task components and the selection of appropriate offloading destinations assume paramount significance in mitigating collaborative computing complexity and communication overhead. To address these challenges, we propose a communication-efficient collaborative task offloading methodology, which entails the segmentation and offloading of computation-intensive tasks from the source node to one or more high-performance nodes to fully leverage device resources. Additionally, we devise a subtask placement strategy predicated on minimizing communication distances, whereby multiple subtasks are allocated to distinct nodes based on the calculated communication latencies between the source node and various computing nodes. Experiments demonstrate that our task offloading method exhibits the lowest overall loss. © 2024 IEEE.

关键词： distributed cloud

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：