期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到743篇文章
< 1 2 … 38 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Optimization Techniques for GPU-Based Parallel Programming Models in High-Performance Computing 认领 引用
1
作者 Shuntao Tang Wei Chen 《信息工程期刊（中英文版）》 2024年第1期7-11,共5页
This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from g... This study embarks on a comprehensive examination of optimization techniques within GPU-based parallel programming models,pivotal for advancing high-performance computing(HPC).Emphasizing the transition of GPUs from graphic-centric processors to versatile computing units,it delves into the nuanced optimization of memory access,thread management,algorithmic design,and data structures.These optimizations are critical for exploiting the parallel processing capabilities of GPUs,addressingboth the theoretical frameworks and practical implementations.By integrating advanced strategies such as memory coalescing,dynamic scheduling,and parallel algorithmic transformations,this research aims to significantly elevate computational efficiency and throughput.The findings underscore the potential of optimized GPU programming to revolutionize computational tasks across various domains,highlighting a pathway towards achieving unparalleled processing power and efficiency in HPC environments.The paper not only contributes to the academic discourse on GPU optimization but also provides actionable insights for developers,fostering advancements in computational sciences and technology. 展开更多
关键词 Optimization Techniques GPU-Based Parallel Programming Models High-Performance Computing
A Trace-state Based Approach to Specification and Design of Parallel Programs 认领 引用
2
作者 He Jifeng Oxford University Computing LaboratoryProgramming Research Group Parks Road, Oxford OXl 3QD, England 《计算机工程》 EI CAS 北大核心 1996年第S1期91-105,共15页
In this paper they deal with the issue of specification and design of parallel communicatingprocesses. A trace-state based model is introduced to describe the behaviour of concurrent programs. They presenta formal sys... In this paper they deal with the issue of specification and design of parallel communicatingprocesses. A trace-state based model is introduced to describe the behaviour of concurrent programs. They presenta formal system based on that model to achieve hierarchical and modular development and verification methods. Anumber of refinement rules are used to decompose the specification into smaller ones and calculate program fromthe 展开更多
关键词 COMM A Trace-state Based Approach to Specification and Design of Parallel Programs
暂未订购 下载PDF
Parallel programming models for heterogeneous many‑cores:a comprehensive survey 认领 引用 被引量：9
3
作者 Jianbin Fang Chun Huang +1 位作者 Tao Tang Zheng Wang 《CCF Transactions on High Performance Computing》 EI 2020年第4期382-400,共19页
Heterogeneous many-cores are now an integral part of modern computing systems ranging from embedding systems to supercomputers.While heterogeneous many-core design offers the potential for energy-efficient high-perfor... Heterogeneous many-cores are now an integral part of modern computing systems ranging from embedding systems to supercomputers.While heterogeneous many-core design offers the potential for energy-efficient high-performance,such potential can only be unlocked if the application programs are suitably parallel and can be made to match the underlying heterogeneous platform.In this article,we provide a comprehensive survey for parallel programming models for heterogeneous many-core architectures and review the compiling techniques of improving programmability and portability.We examine various software optimization techniques for minimizing the communicating overhead between heterogeneous computing devices.We provide a road map for a wide variety of different research areas.We conclude with a discussion on open issues in the area and potential research directions.This article provides both an accessible introduction to the fast-moving area of heterogeneous programming and a detailed bibliography of its main achievements. 展开更多
关键词 Heterogeneous computing Many-core architectures Parallel programming models
Approach of generating parallel programs from parallelized algorithm design strategies 认领 引用 被引量：4
4
作者 WAN Jian-yi LI Xiao-ying 《The Journal of China Universities of Posts and Telecommunications》 EI 2008年第3期128-132,共5页
Today, parallel programming is dominated by message passing libraries, such as message passing interface （MPI）. This article intends to simplify parallel programming by generating parallel programs from parallelized... Today, parallel programming is dominated by message passing libraries, such as message passing interface （MPI）. This article intends to simplify parallel programming by generating parallel programs from parallelized algorithm design strategies. It uses skeletons to abstract parallelized algorithm design strategies, as well as parallel architectures. Starting from problem specification, an abstract parallel abstract programming language＋ （Apla＋） program is generated from parallelized algorithm design strategies and problem-specific function definitions. By combining with parallel architectures, implicity of parallelism inside the parallelized algorithm design strategies is exploited. With implementation and transformation, C＋＋ and parallel virtual machine （CPPVM） parallel program is finally generated. Parallelized branch and bound （B＆B） algorithm design strategy and paraUelized divide and conquer （D ＆ C） algorithm design strategy are studied in this article as examples. And it also illustrates the approach with a case study. 展开更多
关键词 parallel programming skeletons algorithm design strategy parallel architecture
暂未订购 下载PDF
User-level failure detection and auto-recovery of parallel programs in HPC systems 认领 引用
5
作者 Guozhen ZHANG Yi LIU +2 位作者 Hailong YANG Jun XU Depei QIAN 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第6期31-42,共12页
As the mean-time-between-failures(MTBF)continues to decline with the increasing number of components on large-scale high performance computing(HPC)systems,program failures might occur during the execution period with ... As the mean-time-between-failures(MTBF)continues to decline with the increasing number of components on large-scale high performance computing(HPC)systems,program failures might occur during the execution period with high probability.Ensuring successful execution of the HPC programs has become an issue that the unprivileged users should be concerned.From the user perspective,if the program failure cannot be detected and handled in time,it would waste resources and delay the progress of program execution.Unfortunately,the unprivileged users are unable to perform program state checking due to execution control by the job management system as well as the limited privilege.Currently,automated tools for supporting user-level failure detection and autorecovery of parallel programs in HPC systems are missing.This paper proposes an innovative method for the unprivileged user to achieve failure detection of job execution and automatic resubmission of failed jobs.The state checker in our method is encapsulated as an independent job to reduce interference with the user jobs.In addition,we propose a dual-checker mechanism to improve the robustness of our approach.We implement the proposed method as a tool named automatic re-launcher(ARL)and evaluate it on the Tianhe-2 system.Experiment results show that ARL can detect the execution failures effectively on Tianhe-2 system.In addition,the communication and performance overhead caused by ARL is negligible.The good scalability of ARL makes it applicable for large-scale HPC systems. 展开更多
关键词 high performance computing parallel program failure detection failure auto-recovery
暂未订购 下载PDF
On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies 认领 引用
6
作者 金国华 陈福接 《Journal of Computer Science & Technology》 SCIE EI 1994年第1期1-26,共26页
Based on a thorough study of the relationship between array element accesses and loop indices of the nested loop, a method is presented with which the staggering relation and the compacting relation between the thread... Based on a thorough study of the relationship between array element accesses and loop indices of the nested loop, a method is presented with which the staggering relation and the compacting relation between the threads of the nested loop (either with a single linear function or with multiple linear functions) can be determined at compile-time,and accordingly the nested loop (either perfectly nested one or imperfectly nested one)can be restructured to avoid the thrashing problem. Due to its simplicity, our method can be efficiently implemented in any parallel compiler, and the improvement of the performance is significant as shown by the experimental results. 展开更多
关键词 Optimization parallel program complex memory hierarchies SRIS,RSRIS compacted RSRIS
暂未订购 下载PDF
Grid Service Framework: Supporting Multi-Models Parallel Grid Programming 认领 引用
7
作者 邓倩妮 陆鑫达 《Journal of Shanghai Jiaotong university(Science)》 2004年第1期56-59,共4页
Web service is a grid computing technology that promises greater ease-of-use and interoperability than previous distributed computing technologies. This paper proposed Group Service Framework, a grid computing platfor... Web service is a grid computing technology that promises greater ease-of-use and interoperability than previous distributed computing technologies. This paper proposed Group Service Framework, a grid computing platform based on Microsoft. NET that use web service to: (1) locate and harness volunteer computing resources for different applications, and (2) support multi-models such as Master/Slave, Divide and Conquer, Phase Parallel and so forth parallel programming paradigms in Grid environment, (3) allocate data and balance load dynamically and transparently for grid computing application. The Grid Service Framework based on Microsoft. NET was used to implement several simple parallel computing applications. The results show that the proposed Group Service Framework is suitable for generic parallel numerical computing. 展开更多
关键词 web service volunteer computing grid computing parallel programming garadigm
暂未订购 下载PDF
Extending OP2 framework to support portable parallel programming of complex applications 认领 引用 被引量：1
8
作者 Zongjing Chen Kangjin Huang +4 位作者 Yonggang Che Chuanfu Xu Jian Zhang Zhe Dai Ming Li 《CCF Transactions on High Performance Computing》 EI 2024年第3期330-342,共13页
Current HPC hardware presents the characteristics of heterogeneity and diversity.Portable parallel programming technologies are attractive for application developers.OP2 is a domain specific programming framework for ... Current HPC hardware presents the characteristics of heterogeneity and diversity.Portable parallel programming technologies are attractive for application developers.OP2 is a domain specific programming framework for unstructured applications.It supports unified programming and automatic code generation for multiple hardware platforms.However,current OP2 implementation is faced with some difficulties in programming application with complex data structures and function calls.To address this issue,we improve the implementation of OP2 framework in this paper.We modified the source-to-source translator and the runtime library of OP2,making it possible to automatically support applications with complex data structures and function calls during the generation of serial,OpenMP,CUDA,and MPI versions of codes.This avoids tedious manual code rewriting process for the OP2 application developers.HOUR2D,a high order and complex unstructured CFD application,is used as an example to verify the applicability of our extension to the OP2 framework.The results show that our extension enables OP2 to support portable programming for complex unstructured applications without changing its programming mode,ensures the correctness of the results,and achieves comparable or even better performance than manual parallelizations on Intel Xeon Gold CPU,HUAWEI Kunpeng CPU and NVIDIA V100 GPU. 展开更多
关键词 Unstructured mesh applications Portable parallel programming OP2 Complex applications Applicability Performance
PDP:Parallel Dynamic Programming 认领 引用 被引量：41
9
作者 Fei-Yue Wang Jie Zhang +2 位作者 Qinglai Wei Xinhu Zheng Li Li 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2017年第1期1-5,共5页
Deep reinforcement learning is a focus research area in artificial intelligence.The principle of optimality in dynamic programming is a key to the success of reinforcement learning methods.The principle of adaptive dy... Deep reinforcement learning is a focus research area in artificial intelligence.The principle of optimality in dynamic programming is a key to the success of reinforcement learning methods.The principle of adaptive dynamic programming ADP is first presented instead of direct dynamic programming DP,and the inherent relationship between ADP and deep reinforcement learning is developed.Next,analytics intelligence,as the necessary requirement,for the real reinforcement learning,is discussed.Finally,the principle of the parallel dynamic programming,which integrates dynamic programming and analytics intelligence,is presented as the future computational intelligence.©2014 Chinese Association of Automation. 展开更多
关键词 Parallel dynamic programming Dynamic programming Adaptive dynamic programming Reinforcement learning Deep learning Neural networks Artificial intelligence
暂未订购 下载PDF
Scheduling Step-Deteriorating Jobs on Parallel Machines by Mixed Integer Programming 认领 引用 被引量：5
10
作者 郭鹏 程文明 +1 位作者 曾鸣 梁剑 《Journal of Donghua University(English Edition)》 EI CAS 2015年第5期709-714,719,共6页
Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical... Production scheduling has a major impact on the productivity of the manufacturing process. Recently, scheduling problems with deteriorating jobs have attracted increasing attentions from researchers. In many practical situations,it is found that some jobs fail to be processed prior to the pre-specified thresholds,and they often consume extra deteriorating time for successful accomplishment. Their processing times can be characterized by a step-wise function. Such kinds of jobs are called step-deteriorating jobs. In this paper,parallel machine scheduling problem with stepdeteriorating jobs( PMSD) is considered. Due to its intractability,four different mixed integer programming( MIP) models are formulated for solving the problem under consideration. The study aims to investigate the performance of these models and find promising optimization formulation to solve the largest possible problem instances. The proposed four models are solved by commercial software CPLEX. Moreover,the near-optimal solutions can be obtained by black-box local-search solver LocalS olver with the fourth one. The computational results show that the efficiencies of different MIP models depend on the distribution intervals of deteriorating thresholds, and the performance of LocalS olver is clearly better than that of CPLEX in terms of the quality of the solutions and the computational time. 展开更多
关键词 parallel machine step-deterioration mixed integer programming(MIP) scheduling models total completion time
暂未订购 下载PDF
The parallel 3D magnetotelluric forward modeling algorithm 认领 引用 被引量：34
11
作者 Tan Handong Tong Tuo Lin Changhong 《Applied Geophysics》 2006年第4期197-202,共6页
The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the dat... The workload of the 3D magnetotelluric forward modeling algorithm is so large that the traditional serial algorithm costs an extremely large compute time. However, the 3D forward modeling algorithm can process the data in the frequency domain, which is very suitable for parallel computation. With the advantage of MPI and based on an analysis of the flow of the 3D magnetotelluric serial forward algorithm, we suggest the idea of parallel computation and apply it. Three theoretical models are tested and the execution efficiency is compared in different situations. The results indicate that the parallel 3D forward modeling computation is correct and the efficiency is greatly improved. This method is suitable for large size geophysical computations. 展开更多
关键词 Magnetotelluric 3D forward modeling MPI parallel programming design 3D staggered-grid finite difference method parallel algorithm.
暂未订购 下载PDF
中小型流域梯级水电站群机组负荷分配方法 认领 引用
12
作者 龚科 江政 +2 位作者 张元元 杨立勇 邱晓松 《水电能源科学》 北大核心 2026年第7期217-221,216,共5页
传统梯级水电站群短期调度通常先确定电站出力再分配至机组,需反复校正约束以保证水量平衡,降低了计算效率与解集质量。为此,提出一种以机组为最小单元的中小型流域梯级水电站短期调度模型。该模型包含两层:内层采用基于水位启发信息的... 传统梯级水电站群短期调度通常先确定电站出力再分配至机组,需反复校正约束以保证水量平衡,降低了计算效率与解集质量。为此,提出一种以机组为最小单元的中小型流域梯级水电站短期调度模型。该模型包含两层:内层采用基于水位启发信息的层推法确定机组启停与出力;外层是以水位经济区间上下限为决策变量,通过多核并行禁忌增量动态规划求解不同水位经济区间下的机组出力。两层交替迭代直至发电量变化满足精度要求,最终得到各电站最优水位经济运行区间及机组出力过程。某流域5座日调节电站实例表明,该方法可快速制定日发电计划,机组出力过程平稳,且能显著提升梯级总发电量,适用于中小流域梯级电站的短期调度。 展开更多
关键词 短期调度 机组负荷分配 多核并行 增量动态规划法
暂未订购 下载PDF
基于SSA算法的C语言程序多核可扩展并行计算优化方法 认领 引用
13
作者 元尼东珠 《西安文理学院学报（自然科学版）》 2026年第2期49-54,共6页
C语言程序在多核可扩展并行计算过程中,增加线程数可以显著提高程序的并行度,使更多的计算任务可以同时进行.但随着线程数的增加,线程间的同步和资源竞争问题会变得更加复杂,降低并行计算效果.对此,提出基于SSA算法的C语言程序多核可扩... C语言程序在多核可扩展并行计算过程中,增加线程数可以显著提高程序的并行度,使更多的计算任务可以同时进行.但随着线程数的增加,线程间的同步和资源竞争问题会变得更加复杂,降低并行计算效果.对此,提出基于SSA算法的C语言程序多核可扩展并行计算优化方法.通过综合考虑平衡执行时间、资源利用率、负载均衡等多个方面,将C语言程序多核可扩展并行计算优化问题建模为一个多目标优化问题.对线程数、任务划分以及负载均衡等目标进行约束,保证C语言程序的并行计算性能.结合SSA算法对约束目标进行求解,通过不断调整线程分配与任务划分策略,优化C语言程序在多核环境下的并行计算结果.在实验中,对提出的方法进行了代码运行质量的检验,测试结果表明,采用提出的方法对C语言程序进行优化后,代码覆盖率在高线程条件下依然保持较高水平,具备较为理想的优化效果. 展开更多
关键词 SSA算法 C语言程序 多核可扩展 并行计算 程序优化
暂未订购 下载PDF
Parallel Dispatch:A New Paradigm of Electrical Power System Dispatch 认领 引用 被引量：10
14
作者 Jun Jason Zhang Fei-Yue Wang +5 位作者 Qiang Wang Dazhi Hao Xiaojing Yang David Wenzhong Gao Xiangyang Zhao Yingchen Zhang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2018年第1期311-319,共9页
Modern power systems are evolving into sociotechnical systems with massive complexity, whose real-time operation and dispatch go beyond human capability. Thus,the need for developing and applying new intelligent power... Modern power systems are evolving into sociotechnical systems with massive complexity, whose real-time operation and dispatch go beyond human capability. Thus,the need for developing and applying new intelligent power system dispatch tools are of great practical significance. In this paper, we introduce the overall business model of power system dispatch, the top level design approach of an intelligent dispatch system, and the parallel intelligent technology with its dispatch applications. We expect that a new dispatch paradigm,namely the parallel dispatch, can be established by incorporating various intelligent technologies, especially the parallel intelligent technology, to enable secure operation of complex power grids,extend system operators' capabilities, suggest optimal dispatch strategies, and to provide decision-making recommendations according to power system operational goals. 展开更多
关键词 ACP knowledge automation power dispatch parallel dynamic programming parallel intelligence paralle learning situational awareness
暂未订购 下载PDF
swDaCe:一种申威众核处理器上以数据为中心的并行编程模型设计与实现 认领 引用
15
作者 沈沛祺 陈俊仕 安虹 《小型微型计算机系统》 CSCD 北大核心 2026年第3期751-759,共9页
高性能科学计算是超级计算机的核心应用领域,包括粒子模拟、气候分析等关键任务.然而,随着摩尔定律逐渐失效,超级计算机体系结构日益趋向异构和复杂,导致科学计算应用的开发和优化变得更加困难.为解决这一问题,本文基于新一代申威超级... 高性能科学计算是超级计算机的核心应用领域,包括粒子模拟、气候分析等关键任务.然而,随着摩尔定律逐渐失效,超级计算机体系结构日益趋向异构和复杂,导致科学计算应用的开发和优化变得更加困难.为解决这一问题,本文基于新一代申威超级计算平台,提出并实现了一种以数据为中心的并行编程模型——swDaCe.该模型通过解耦数据流图优化与原始程序,使得编程人员可以使用Python描述计算逻辑,并最终生成适配申威众核架构的高性能C++代码.此外,本文提出了一系列针对申威架构的数据流优化方法,包括从核任务映射、向量化并行以及DMA访存优化,以充分利用申威众核处理器的计算能力.实验结果表明,swDaCe生成的代码在稀疏矩阵计算等典型应用中实现了显著的性能提升,单核组加速比达到25倍以上,验证了该框架在申威架构上的有效性. 展开更多
关键词 新一代神威平台 异构众核处理器 数据流编程 并行计算 稀疏矩阵乘
暂未订购 下载PDF
面向GPU细粒度线程同步应用的共享数据冲突管理研究 认领 引用
16
作者 尹萍宇 路晓鑫 +1 位作者 高岚 张伟功 《小型微型计算机系统》 CSCD 北大核心 2026年第7期1775-1782,共8页
近年来,GPU作为应用最广泛的加速器得到了快速发展,众多需要进行数据共享的应用也开始利用GPU进行加速,并取得良好的加速效果.为充分利用GPU强大的并行计算能力,这些应用往往采用细粒度线程同步.然而,这种同步方式却引发频繁的共享数据... 近年来,GPU作为应用最广泛的加速器得到了快速发展,众多需要进行数据共享的应用也开始利用GPU进行加速,并取得良好的加速效果.为充分利用GPU强大的并行计算能力,这些应用往往采用细粒度线程同步.然而,这种同步方式却引发频繁的共享数据访问冲突,导致大量同步操作失败,严重影响应用性能.针对这一问题,本文对GPU中细粒度线程同步的共享数据冲突管理进行了深入研究,结合GPU体系结构特征,分别以消极、公平、积极的原则提出了3种共享数据冲突管理策略,以在减少同步失败频率的同时尽可能的降低线程的等待时延,从而有效提升应用性能.实验结果表明,本文所提出的消极冲突管理与积极冲突管理策略,较CPU典型的回退策略分别实现了31.2%与33.2%的加速,较GPU当前性能最优的共享数据冲突管理策略SWCF分别实现了8.9%与10.5%的加速;公平冲突管理策略在KM应用的高冲突输入中,与CPU典型的回退策略和GPU的SWCF策略相比分别实现了65.1%和21.1%的加速. 展开更多
关键词 GPU 并行编程 细粒度线程同步 共享数据冲突管理
暂未订购 下载PDF
An Approach to Parallelization of SIFT Algorithm on GPUs for Real-Time Applications 认领 引用 被引量：5
17
作者 Raghu Raj Prasanna Kumar Suresh Muknahallipatna John McInroy 《Journal of Computer and Communications》 2016年第17期18-50,共33页
Scale Invariant Feature Transform (SIFT) algorithm is a widely used computer vision algorithm that detects and extracts local feature descriptors from images. SIFT is computationally intensive, making it infeasible fo... Scale Invariant Feature Transform (SIFT) algorithm is a widely used computer vision algorithm that detects and extracts local feature descriptors from images. SIFT is computationally intensive, making it infeasible for single threaded im-plementation to extract local feature descriptors for high-resolution images in real time. In this paper, an approach to parallelization of the SIFT algorithm is demonstrated using NVIDIA’s Graphics Processing Unit (GPU). The parallel-ization design for SIFT on GPUs is divided into two stages, a) Algorithm de-sign-generic design strategies which focuses on data and b) Implementation de-sign-architecture specific design strategies which focuses on optimally using GPU resources for maximum occupancy. Increasing memory latency hiding, eliminating branches and data blocking achieve a significant decrease in aver-age computational time. Furthermore, it is observed via Paraver tools that our approach to parallelization while optimizing for maximum occupancy allows GPU to execute memory bound SIFT algorithm at optimal levels. 展开更多
关键词 Scale Invariant Feature Transform (SIFT) Parallel Computing GPU GPU Occupancy Portable Parallel Programming CUDA
暂未订购 下载PDF
基于国产编程语言的并行水动力模型开发及初步调优 认领 引用
18
作者 王明阳 王静 +2 位作者 李娜 俞茜 宫啸天 《人民黄河》 CAS 北大核心 2026年第2期41-46,共6页
基于国产编程语言Taichi开发了具有跨平台并行计算能力的高性能二维水动力模型FRAS。FRAS拥有良好的并行计算灵活性,能与同构CPU-CPU和异构CPU-GPU计算架构良好兼容,还支持多核CPU、CUDA、OpenGL、Metal、Vulkan等多种并行加速技术,具... 基于国产编程语言Taichi开发了具有跨平台并行计算能力的高性能二维水动力模型FRAS。FRAS拥有良好的并行计算灵活性,能与同构CPU-CPU和异构CPU-GPU计算架构良好兼容,还支持多核CPU、CUDA、OpenGL、Metal、Vulkan等多种并行加速技术,具有良好的跨平台性能。采用非结构化网格离散二维空间,运用有限体积法对连续性方程和动量方程进行数值离散处理,将FRAS模型应用于辽宁省绕阳河的洪水计算,相较于原始串行代码,并行化处理后加速比为14.7。通过优化变量存储结构,计算性能因访存优化而提升约2倍,初步优化后程序加速比达30.1。 展开更多
关键词 二维水动力模型 并行计算 跨平台 Taichi编程语言
暂未订购 下载PDF
Scheduling and Subcontracting under Parallel Machines 认领 引用 被引量：2
19
作者 陈荣军 唐国春 《Chinese Quarterly Journal of Mathematics》 CSCD 2012年第4期590-597,共8页
In this paper,we study a model on joint decisions of scheduling and subcontracting, in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.T... In this paper,we study a model on joint decisions of scheduling and subcontracting, in which jobs(orders) can be either processed by parallel machines at the manufacturer in-house or subcontracted to a subcontractor.The manufacturer needs to determine which jobs should be produced in-house and which jobs should be subcontracted.Furthermore,it needs to determine a production schedule for jobs to be produced in-house.We discuss five classical scheduling objectives as production costs.For each problem with different objective functions,we give optimality conditions and propose dynamic programming algorithms. 展开更多
关键词 scheduling subcontracting dynamic programming parallel machines
暂未订购 下载PDF
Parallel Image Processing: Taking Grayscale Conversion Using OpenMP as an Example 认领 引用 被引量：2
20
作者 Bayan AlHumaidan Shahad Alghofaily +2 位作者 Maitha Al Qhahtani Sara Oudah Naya Nagy 《Journal of Computer and Communications》 2024年第2期1-10,共10页
In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularl... In recent years, the widespread adoption of parallel computing, especially in multi-core processors and high-performance computing environments, ushered in a new era of efficiency and speed. This trend was particularly noteworthy in the field of image processing, which witnessed significant advancements. This parallel computing project explored the field of parallel image processing, with a focus on the grayscale conversion of colorful images. Our approach involved integrating OpenMP into our framework for parallelization to execute a critical image processing task: grayscale conversion. By using OpenMP, we strategically enhanced the overall performance of the conversion process by distributing the workload across multiple threads. The primary objectives of our project revolved around optimizing computation time and improving overall efficiency, particularly in the task of grayscale conversion of colorful images. Utilizing OpenMP for concurrent processing across multiple cores significantly reduced execution times through the effective distribution of tasks among these cores. The speedup values for various image sizes highlighted the efficacy of parallel processing, especially for large images. However, a detailed examination revealed a potential decline in parallelization efficiency with an increasing number of cores. This underscored the importance of a carefully optimized parallelization strategy, considering factors like load balancing and minimizing communication overhead. Despite challenges, the overall scalability and efficiency achieved with parallel image processing underscored OpenMP’s effectiveness in accelerating image manipulation tasks. 展开更多
关键词 Parallel Computing Image Processing OpenMP Parallel Programming High Performance Computing GPU (Graphic Processing Unit)
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 38 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈