• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

通过架构感知调度优化大规模问题的资源利用。

Optimizing resource utilization for large scale problems through architecture aware scheduling.

作者信息

Elsawwaf Ali M, Aly Gamal M, Faheem Hossam M, Fayez Mahmoud

机构信息

Computer and Systems Engineering Dept, Faculty of Engineering, Ain Shams University, Cairo, Egypt.

Computer systems Department, Faculty of Computer and Information Sciences, Ain Shams University, Cairo, Egypt.

出版信息

Sci Rep. 2024 Nov 1;14(1):26356. doi: 10.1038/s41598-024-75711-8.

DOI:10.1038/s41598-024-75711-8
PMID:39487166
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11530424/
Abstract

Rapid development realms of parallel architectures and its heterogeneity have inspired researchers to invent new scheduling strategies to efficiently distribute workloads among these architectures in a way that may lead to better performance. This paper presents a comprehensive study on optimizing resource utilization for large-scale problems by employing architecture-aware scheduling techniques. We conducted a series of experiments to measure the execution times of various architectures with different problem sizes. These experiments have been conducted multiple times to minimize measurement variance. The findings from these experiments are utilized to develop a scheduling strategy that enables faster completion of larger data-parallel problems while maximizing resource utilization. The proposed approach makes performance enhancement with 16.7% for large data size. It has a significant impact on enhancing computational efficiency and reducing costs in high-performance computing environments.

摘要

并行架构的快速发展领域及其异构性激发研究人员发明新的调度策略,以便以可能带来更好性能的方式在这些架构之间高效地分配工作负载。本文通过采用架构感知调度技术,对大规模问题的资源利用优化进行了全面研究。我们进行了一系列实验,以测量不同问题规模下各种架构的执行时间。这些实验已多次进行,以尽量减少测量方差。利用这些实验的结果来开发一种调度策略,该策略能够在最大化资源利用的同时更快地完成更大的数据并行问题。对于大数据规模,所提出的方法使性能提高了16.7%。它对提高高性能计算环境中的计算效率和降低成本具有重大影响。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/850eb6ad48c7/41598_2024_75711_Fig15_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/c2121d3376dd/41598_2024_75711_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/ce3f9402b80f/41598_2024_75711_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/07b21af85a25/41598_2024_75711_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/e2dff11e962b/41598_2024_75711_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/72c9455ac0c9/41598_2024_75711_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/7300ac002726/41598_2024_75711_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/9dab575535fa/41598_2024_75711_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/3493d08a8a0b/41598_2024_75711_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/a3e1d297f75d/41598_2024_75711_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/610282f72668/41598_2024_75711_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/70b8a7a64d3a/41598_2024_75711_Fig11_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/0139e42bb2bc/41598_2024_75711_Fig12_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/30a1c04c8980/41598_2024_75711_Fig13_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/f8f8b04de349/41598_2024_75711_Fig14_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/850eb6ad48c7/41598_2024_75711_Fig15_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/c2121d3376dd/41598_2024_75711_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/ce3f9402b80f/41598_2024_75711_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/07b21af85a25/41598_2024_75711_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/e2dff11e962b/41598_2024_75711_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/72c9455ac0c9/41598_2024_75711_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/7300ac002726/41598_2024_75711_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/9dab575535fa/41598_2024_75711_Fig7_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/3493d08a8a0b/41598_2024_75711_Fig8_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/a3e1d297f75d/41598_2024_75711_Fig9_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/610282f72668/41598_2024_75711_Fig10_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/70b8a7a64d3a/41598_2024_75711_Fig11_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/0139e42bb2bc/41598_2024_75711_Fig12_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/30a1c04c8980/41598_2024_75711_Fig13_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/f8f8b04de349/41598_2024_75711_Fig14_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/9f4a/11530424/850eb6ad48c7/41598_2024_75711_Fig15_HTML.jpg

相似文献

1
Optimizing resource utilization for large scale problems through architecture aware scheduling.通过架构感知调度优化大规模问题的资源利用。
Sci Rep. 2024 Nov 1;14(1):26356. doi: 10.1038/s41598-024-75711-8.
2
Advancements in heuristic task scheduling for IoT applications in fog-cloud computing: challenges and prospects.雾计算-云计算环境下物联网应用启发式任务调度的研究进展:挑战与展望
PeerJ Comput Sci. 2024 Jun 17;10:e2128. doi: 10.7717/peerj-cs.2128. eCollection 2024.
3
Greedy Firefly Algorithm for Optimizing Job Scheduling in IoT Grid Computing.用于优化物联网网格计算中作业调度的贪婪萤火虫算法
Sensors (Basel). 2022 Jan 23;22(3):850. doi: 10.3390/s22030850.
4
Genetic algorithm with skew mutation for heterogeneous resource-aware task offloading in edge-cloud computing.用于边缘云计算中异构资源感知任务卸载的带偏斜变异的遗传算法。
Heliyon. 2024 Jun 10;10(12):e32399. doi: 10.1016/j.heliyon.2024.e32399. eCollection 2024 Jun 30.
5
Scheduling-Guided Automatic Processing of Massive Hyperspectral Image Classification on Cloud Computing Architectures.云计算架构上大规模高光谱图像分类的调度引导自动处理。
IEEE Trans Cybern. 2021 Jul;51(7):3588-3601. doi: 10.1109/TCYB.2020.3026673. Epub 2021 Jun 23.
6
Multi-objective and multi constrained task scheduling framework for computational grids.用于计算网格的多目标多约束任务调度框架
Sci Rep. 2024 Mar 19;14(1):6521. doi: 10.1038/s41598-024-56957-8.
7
Latency-Aware Task Scheduling for IoT Applications Based on Artificial Intelligence with Partitioning in Small-Scale Fog Computing Environments.基于人工智能的小尺度雾计算环境中分区的物联网应用的时滞感知任务调度。
Sensors (Basel). 2022 Sep 27;22(19):7326. doi: 10.3390/s22197326.
8
OOSP: Opportunistic Optimization Scheme for Pod Deployment Enhanced with Multilayered Sensing.OOSP:基于多层感知增强的Pod部署机会主义优化方案
Sensors (Basel). 2024 Sep 26;24(19):6244. doi: 10.3390/s24196244.
9
Smart Resource Allocation in Mobile Cloud Next-Generation Network (NGN) Orchestration with Context-Aware Data and Machine Learning for the Cost Optimization of Microservice Applications.基于上下文感知数据和机器学习的移动云下一代网络(NGN)编排中的智能资源分配,以实现微服务应用的成本优化
Sensors (Basel). 2024 Jan 29;24(3):865. doi: 10.3390/s24030865.
10
Evaluation of Task Scheduling Algorithms in Heterogeneous Computing Environments.异构计算环境中的任务调度算法评估。
Sensors (Basel). 2021 Sep 2;21(17):5906. doi: 10.3390/s21175906.

本文引用的文献

1
Exploring Scalable Parallelization for Edit Distance-Based Motif Search.探索基于编辑距离的 motif 搜索的可扩展并行化。
IEEE/ACM Trans Comput Biol Bioinform. 2023 Mar-Apr;20(2):1587-1593. doi: 10.1109/TCBB.2022.3208867.
2
A Review on Planted (, d) Motif Discovery Algorithms for Medical Diagnose.基于(, d)基序发现算法的医学诊断综述。
Sensors (Basel). 2022 Feb 5;22(3):1204. doi: 10.3390/s22031204.
3
Fast and exact quantification of motif occurrences in biological sequences.快速准确地定量生物序列中的基序出现次数。
BMC Bioinformatics. 2021 Sep 18;22(1):445. doi: 10.1186/s12859-021-04355-6.
4
Review of Different Sequence Motif Finding Algorithms.不同序列基序查找算法综述。
Avicenna J Med Biotechnol. 2019 Apr-Jun;11(2):130-148.
5
Exploring the structure and function of temporal networks with dynamic graphlets.利用动态图元探索时间网络的结构与功能。
Bioinformatics. 2015 Jun 15;31(12):i171-80. doi: 10.1093/bioinformatics/btv227.
6
A survey of DNA motif finding algorithms.DNA基序查找算法综述。
BMC Bioinformatics. 2007 Nov 1;8 Suppl 7(Suppl 7):S21. doi: 10.1186/1471-2105-8-S7-S21.