期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到2,545篇文章
< 1 2 … 128 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
An Adaptive Imperialist Competitive Algorithm with Cooperation for Flexible Jobshop and Parallel Batch Processing Machine Scheduling 认领 引用
1
作者 Jie Wang Deming Lei 《Computers, Materials & Continua》 SCIE EI 2026年第6期1934-1960,共27页
Both flexible jobshop scheduling and parallel batch processing machine scheduling have been extensively considered;however,the flexible jobshop and parallel batch processing machine scheduling problem(FJPBPMSP)is prev... Both flexible jobshop scheduling and parallel batch processing machine scheduling have been extensively considered;however,the flexible jobshop and parallel batch processing machine scheduling problem(FJPBPMSP)is prevalent in real-life manufacturing processes and is seldom investigated.In this study,FJPBPMSP is examined,where flexible processing and batch processing are performed sequentially.An adaptive imperialist competitive algorithm with cooperation(CAICA)is proposed to minimize makespan and total energy consumption simultaneously.In CAICA,a four-string representation is adopted,and initial empires with novel structures are formed by uniformly dividing the population.An adaptive assimilation and revolution are designed.An adaptive assimilation and revolution are designed.An adaptive imperialist competition with cooperation is provided.Search strategies,imperialists,and colonies are also renewed by new procedures.Computational experiments are conducted on 50 instances.The computational results show that the new strategies of CAICA are effective,and CAICA can provide better results than its comparative algorithms in solving FJPBPMSP. 展开更多
关键词 Flexible jobshop scheduling parallel batch processing scheduling imperialist competition algorithm cooperation
暂未订购 下载PDF
A Shufled Frog-Leaping Algorithm with Competition for Parallel Batch Processing Machines Scheduling in Fabric Dyeing Process 认领 引用 被引量：1
2
作者 Mingbo Li Deming Lei 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第5期1789-1808,共20页
As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that a... As a complicated optimization problem,parallel batch processing machines scheduling problem(PBPMSP)exists in many real-life manufacturing industries such as textiles and semiconductors.Machine eligibility means that at least one machine is not eligible for at least one job.PBPMSP and scheduling problems with machine eligibility are frequently considered;however,PBPMSP with machine eligibility is seldom explored.This study investigates PBPMSP with machine eligibility in fabric dyeing and presents a novel shuffled frog-leaping algorithm with competition(CSFLA)to minimize makespan.In CSFLA,the initial population is produced in a heuristic and random way,and the competitive search of memeplexes comprises two phases.Competition between any two memeplexes is done in the first phase,then iteration times are adjusted based on competition,and search strategies are adjusted adaptively based on the evolution quality of memeplexes in the second phase.An adaptive population shuffling is given.Computational experiments are conducted on 100 instances.The computational results showed that the new strategies of CSFLA are effective and that CSFLA has promising advantages in solving the considered PBPMSP. 展开更多
关键词 Batch processing machines shuffled frog-leaping algorithm competition parallel machines scheduling
暂未订购 下载PDF
An Adaptive Cooperated Shuffled Frog-Leaping Algorithm for Parallel Batch Processing Machines Scheduling in Fabric Dyeing Processes 认领 引用
3
作者 Lianqiang Wu Deming Lei Yutong Cai 《Computers, Materials & Continua》 SCIE EI 2025年第5期1771-1789,共19页
Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing ... Fabric dyeing is a critical production process in the clothing industry and heavily relies on batch processing machines(BPM).In this study,the parallel BPM scheduling problem with machine eligibility in fabric dyeing is considered,and an adaptive cooperated shuffled frog-leaping algorithm(ACSFLA)is proposed to minimize makespan and total tardiness simultaneously.ACSFLA determines the search times for each memeplex based on its quality,with more searches in high-quality memeplexes.An adaptive cooperated and diversified search mechanism is applied,dynamically adjusting search strategies for each memeplex based on their dominance relationships and quality.During the cooperated search,ACSFLA uses a segmented and dynamic targeted search approach,while in non-cooperated scenarios,the search focuses on local search around superior solutions to improve efficiency.Furthermore,ACSFLA employs adaptive population division and partial population shuffling strategies.Through these strategies,memeplexes with low evolutionary potential are selected for reconstruction in the next generation,while thosewithhighevolutionarypotential are retained to continue their evolution.Toevaluate the performance of ACSFLA,comparative experiments were conducted using ACSFLA,SFLA,ASFLA,MOABC,and NSGA-CC in 90 instances.The computational results reveal that ACSFLA outperforms the other algorithms in 78 of the 90 test cases,highlighting its advantages in solving the parallel BPM scheduling problem with machine eligibility. 展开更多
关键词 Batch processing machine parallel machine scheduling shuffled frog-leaping algorithm fabric dyeing process machine eligibility
暂未订购 下载PDF
High-dimensional robust nested parallel streaming adaptive processor 认领 引用
4
作者 WU Gang HUANG Zhongping LEI Zhiyong 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2026年第2期431-444,共14页
The paper presents a full-exchange streaming adaptive processor architecture with nested parallel sampling covariance matrix estimation and adaptive weight computation,to achieve polarization-space-time adaptive proce... The paper presents a full-exchange streaming adaptive processor architecture with nested parallel sampling covariance matrix estimation and adaptive weight computation,to achieve polarization-space-time adaptive processing(P-STAP),adaptive digital beamforming(ADBF)and multiple side-lobe canceller(MSLC)within a configurable computational framework.An effective method for real-time numerical calculation is proposed by reducing truncation errors,ensuring robust convergence,and low time complexity through the lower-diagnoal-lower transpose(LDLT)right multiplication iterative(LDLT-RMI)method.To fully implement P-STAP for high-intensity interference clutter adaptive robust suppression,a series of intellectual property(IP)cores are designed for high-order,high-condition symmetric positive definite matrix inversion.The adaptive processor can operate on a frame-structured data flow,accommodating various space-time-frequency-polarization multi-domain combinations,which supports 8 to 100 channels with a dynamic range of up to 80 dB.Even the interferences reach a high intensity of 65 dB,the adaptive processor can still work stably. 展开更多
关键词 nested parallel streaming adaptive processing(P-STAP) configurable computational framework polarizationspace-time adaptive processing high-order high-condition matrix inversion
暂未订购 下载PDF
Automation and parallelization scheme to accelerate pulsar observation data processing 认领 引用
5
作者 Xingnan Zhang Minghui Li 《Astronomical Techniques and Instruments》 CSCD 2025年第4期226-238,共13页
Previous studies aiming to accelerate data processing have focused on enhancement algorithms,using the graphics processing unit(GPU)to speed up programs,and thread-level parallelism.These methods overlook maximizing t... Previous studies aiming to accelerate data processing have focused on enhancement algorithms,using the graphics processing unit(GPU)to speed up programs,and thread-level parallelism.These methods overlook maximizing the utilization of existing central processing unit(CPU)resources and reducing human and computational time costs via process automation.Accordingly,this paper proposes a scheme,called SSM,that combines“Srun job submission mode”,“Sbatch job submission mode”,and“Monitor function”.The SSM scheme includes three main modules:data management,command management,and resource management.Its core innovations are command splitting and parallel execution.The results show that this method effectively improves CPU utilization and reduces the time required for data processing.In terms of CPU utilization,the average value of this scheme is 89%.In contrast,the average CPU utilizations of“Srun job submission mode”and“Sbatch job submission mode”are significantly lower,at 43%and 52%,respectively.In terms of the data-processing time,SSM testing on the Five-hundred-meter Aperture Spherical radio Telescope(FAST)data requires only 5.5 h,compared with 8 h in the“Srun job submission mode”and 14 h in the“Sbatch job submission mode”.In addition,tests on the FAST and Parkes datasets demonstrate the universality of the SSM scheme,which can process data from different telescopes.The compatibility of the SSM scheme for pulsar searches is verified using 2 days of observational data from the globular cluster M2,with the scheme successfully discovering all published pulsars in M2. 展开更多
关键词 Astronomical data Parallel processing PulsaR Exploration and Search TOolkit(PRESTO) CPU FAST Parkes
暂未订购 下载PDF
Parallel Processing Based on Ship Maneuvering in Identification of Interaction Force Coefficients 认领 引用 被引量：2
6
作者 刘小健 黄国樑 邓德衡 《Journal of Shanghai Jiaotong university(Science)》 EI 2008年第3期352-356,共5页
The parallel processing based on the free running model test was adopted to predict the interaction force coefficients （flow straightening coefficient and wake fraction） of ship maneuvering. And the multipopulation ... The parallel processing based on the free running model test was adopted to predict the interaction force coefficients （flow straightening coefficient and wake fraction） of ship maneuvering. And the multipopulation genetic algorithm （MPGA） based on real coding that can contemporarily process the data of free running model and simulation of ship maneuvering was applied to solve the problem. Accordingly the optimal individual was obtained using the method of genetic algorithm. The parallel processing of multiopulation solved the prematurity in the identification for single population, meanwhile, the parallel processing of the data of ship maneuvering （turning motion and zigzag motion） is an attempt to solve the coefficient drift problem. In order to validate the method, the interaction force coefficients were verified by the procedure and these coefficients measured were compared with those ones identified. The maximum error is less than 5%, and the identification is an effective method. 展开更多
关键词 interaction force coefficient multi-population genetic algorithm （MPGA） parallel processing parameter identification
暂未订购 下载PDF
RESEARCH ON SATELLITE IMAGE PROCESSING AND RECOGNITION WITH PARALLEL ALGORITHM  认领 引用 被引量：1
7
作者 刘正光 郭爱民 +1 位作者 程彦 刘勇 《Transactions of Tianjin University》 CAS 1999年第2期73-77,共5页
Using the method of mathematical morphology,this paper fulfills filtration,segmentation and extraction of morphological features of the satellite cloud image.It also gives out the relative algorithms,which is realized... Using the method of mathematical morphology,this paper fulfills filtration,segmentation and extraction of morphological features of the satellite cloud image.It also gives out the relative algorithms,which is realized by parallel C programming based on Transputer networks.It has been successfully used to process the typhoon and the low tornado cloud image.And it will be used in weather forecast. 展开更多
关键词 satellite cloud image extraction of morphological features mathematical morphology parallel processing
暂未订购 下载PDF
Fourier hologram method using Gerchberg-Saxton algorithm for parallel femtosecond laser processing 认领 引用
8
作者 汪金礼 苏亚辉 +2 位作者 崔洪涛 杨亮 方志伟 《Journal of Measurement Science and Instrumentation》 CAS 2012年第3期304-306,共3页
In order to improve femtosecond laser throughput,a parallel processing system consisting of liquid crystal on silicon(LCOS)device as spatial light modulator is put forward.A method is described for displaying Fourier ... In order to improve femtosecond laser throughput,a parallel processing system consisting of liquid crystal on silicon(LCOS)device as spatial light modulator is put forward.A method is described for displaying Fourier hologram on LCOS,and a high uniformity of several diffraction peaks in the computer reconstruction is achieved.Application of this method to the parallel femtosecond laser processing is also demonstrated,and two intersecting rings and three tangent rings are fabricated respectively by one time in the photoresist. 展开更多
关键词 femtosecond laser parallel processing liquid crystal on silicon(LCOS) Fourier hologram Gerchberg-Saxton(GS)algorithm
暂未订购 下载PDF
Exploiting Parallelism in the Simulation of General Purpose Graphics Processing Unit Program 认领 引用
9
作者 赵夏 马胜 +1 位作者 陈微 王志英 《Journal of Shanghai Jiaotong university(Science)》 EI 2016年第3期280-288,共9页
The simulation is an important means of performance evaluation of the computer architecture. Nowadays, the serial simulation of general purpose graphics processing unit(GPGPU) architecture is the main bottleneck for t... The simulation is an important means of performance evaluation of the computer architecture. Nowadays, the serial simulation of general purpose graphics processing unit(GPGPU) architecture is the main bottleneck for the simulation speed. To address this issue, we propose the intra-kernel parallelization on a multicore processor and the inter-kernel parallelization on a multiple-machine platform. We apply these two methods to the GPGPU-sim simulator. The intra-kernel parallelization method firstly parallelizes the serial simulation of multiple compute units in one cycle. Then it parallelizes the timing and functional simulation to reduce the performance loss caused by the synchronization between different compute units. The inter-kernel parallelization method divides multiple kernels of a CUDA program into several groups and distributes these groups across multiple simulation hosts to perform the simulation. Experimental results show that the intra-kernel parallelization method achieves a speed-up of up to 12 with a maximum error rate of 0.009 4% on a 32-core machine, and the inter-kernel parallelization method can accelerate the simulation by a factor of up to 3.9 with a maximum error rate of 0.11% on four simulation hosts. The orthogonality between these two methods allows us to combine them together on multiple multi-core hosts to get further performance improvements. 展开更多
关键词 general purpose graphics processing unit(GPGPU) multicore intra-kernel inter-kernel parallel
暂未订购 下载PDF
A Hierarchical Task Graph Parallel Computing Framework for Chemical Process Simulation 认领 引用
10
作者 Shifeng Qu Shaoyi Yang +3 位作者 Wenli Du Zhaoyang Duan Feng Qian Meihong Wang 《Engineering》 SCIE EI CSCD 2025年第8期229-239,共11页
Sequential-modular-based process flowsheeting software remains an indispensable tool for process design,control,and optimization.Yet,as the process industry advances in intelligent operation and maintenance,convention... Sequential-modular-based process flowsheeting software remains an indispensable tool for process design,control,and optimization.Yet,as the process industry advances in intelligent operation and maintenance,conventional sequential-modular-based process-simulation techniques present challenges regarding computationally intensive calculations and significant central processing unit(CPU)time requirements,particularly in large-scale design and optimization tasks.To address these challenges,this paper proposes a novel process-simulation parallel computing framework(PSPCF).This framework achieves layered parallelism in recycling processes at the unit operation level.Notably,PSPCF introduces a groundbreaking concept of formulating simulation problems as task graphs and utilizes Taskflow,an advanced task graph computing system,for hierarchical parallel scheduling and the execution of unit operation tasks.PSPCF also integrates an advanced work-stealing scheme to automatically balance thread resources with the demanding workload of unit operation tasks.For evaluation,both a simpler parallel column process and a more complex cracked gas separation process were simulated on a flowsheeting platform using PSPCF.The framework demonstrates significant time savings,achieving over 60%reduction in processing time for the simpler process and a 35%–40%speed-up for the more complex separation process. 展开更多
关键词 Parallel computing Process simulation Task graph parallelism Sequential modular approach
暂未订购 下载PDF
Parallel processing architecture of H.264 adaptive deblocking filters 认领 引用 被引量：1
11
作者 Hu WEI Tao LIN Zheng-hui LIN 《Journal of Zhejiang University-SCIENCE A》 SCIE EI CAS 2009年第8期1160-1168,共9页
In H.264,computational complexity and memory access of deblocking filters are variable,dependent on video contents.This paper proposes a VLSI architecture of deblocking filters with adaptive dynamic power,which avoids... In H.264,computational complexity and memory access of deblocking filters are variable,dependent on video contents.This paper proposes a VLSI architecture of deblocking filters with adaptive dynamic power,which avoids redundant computations and memory accesses by precluding the blocks that can be skipped.The vertical and horizontal edges are simulta-neously processed in an advanced scan order to speed up the decoder.As a result,dynamic power of the proposed architecture can be reduced adaptively(up to about 89%) for different videos,and the off-chip memory access is improved when compared to previous designs.Moreover,the processing capability of the proposed architecture is in particular appropriate for real-time deblocking of high-definition television(HDTV,1920×1080 pixels/frame,60 frames/s video signals) video operation at 62 MHz.Using the proposed architecture,power can be reduced by up to about 89% and processing time by from 25% to 81% compared with previous designs. 展开更多
关键词 Deblocking filter Adaptive dynamic power Parallel processing Pipeline H.264
暂未订购 下载PDF
Parallel Image Processing: Taking Grayscale Conversion Using OpenMP as an Example 认领 引用 被引量：2
12
作者 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
Improvement Detecting Method of Optical Axes Parallelism of Shipboard Photoelectrical Theodolite Based on Image Processing 认领 引用 被引量：4
13
作者 Huihui Zou 《Optics and Photonics Journal》 2017年第8期127-133,共7页
An improvement detecting method was proposed according to the disadvantages of testing method of optical axes parallelism of shipboard photoelectrical theodolite (short for theodolite) based on image processing. Point... An improvement detecting method was proposed according to the disadvantages of testing method of optical axes parallelism of shipboard photoelectrical theodolite (short for theodolite) based on image processing. Pointolite replaced 0.2'' collimator to reduce the errors of crosshair images processing and improve the quality of image. What’s more, the high quality images could help to optimize the image processing method and the testing accuracy. The errors between the trial results interpreted by software and the results tested in dock were less than 10'', which indicated the improve method had some actual application values. 展开更多
关键词 Improvement Detecting Method Shipboard Photoelectrical Theodolite Optical Axes Parallelism Image Processing
暂未订购 下载PDF
New multi-DSP parallel computing architecture for real-time image processing 认领 引用 被引量：4
14
作者 Hu Junhong Zhang Tianxu Jiang Haoyang 《Journal of Systems Engineering and Electronics》 2006年第4期883-889,共7页
The flexibility of traditional image processing system is limited because those system are designed for specific applications. In this paper, a new TMS320C64x-based multi-DSP parallel computing architecture is present... The flexibility of traditional image processing system is limited because those system are designed for specific applications. In this paper, a new TMS320C64x-based multi-DSP parallel computing architecture is presented. It has many promising characteristics such as powerful computing capability, broad I/O bandwidth, topology flexibility, and expansibility. The parallel system performance is evaluated by practical experiment. 展开更多
关键词 parallel computing image processing real-time computer architecture
暂未订购 下载PDF
REALIZATION OF QUICK-LOOK IMAGING FOR SPACEBORNE SAR BASED ON PARALLEL PROCESSING 认领 引用 被引量：1
15
作者 TangZhi ZhouYinqing LiJingwen 《Journal of Electronics(China)》 2004年第2期152-158,共7页
Large range cell migration is a severe challenge to imaging algorithm for spaceborne SAR. Based on design of Finite Impulse Response (FIR) filter and Range Doppler (RD) algorithm, a realization of quick-look imaging f... Large range cell migration is a severe challenge to imaging algorithm for spaceborne SAR. Based on design of Finite Impulse Response (FIR) filter and Range Doppler (RD) algorithm, a realization of quick-look imaging for large range cell migration is proposed. It realized quick-look imaging of 8 times reduced resolution with parallel processing on memory shared 8 CPU SGI server. According to simulation experiment, this quick-look imaging algorithm with parallel processing can image 16384x16384 SAR raw data within 6 seconds. It reaches the requirement of real-time imaging. 展开更多
关键词 Space borne SAR Quick-look imaging Range cell migration Parallel processing
暂未订购 下载PDF
Improved Strategies for Parallel Medical Image Processing Applications 认领 引用
16
作者 WANG Kiln WANG Xiao-ying +1 位作者 LI San-li CHEN Ying 《Chinese Journal of Biomedical Engineering(English Edition)》 CAS 2008年第1期8-17,共10页
In order to meet the demands of high efficient and real-time computer assisted diagnosis as well as screening in medical area, to improve the efficacy of parallel medical image processing is of great importance. This ... In order to meet the demands of high efficient and real-time computer assisted diagnosis as well as screening in medical area, to improve the efficacy of parallel medical image processing is of great importance. This article proposes improved strategies for parallel medical image processing applications,which is categorized into two genera. For each genus individual strategy is devised, including the theoretic algorithm for minimizing the exertion time. Experiment using mammograms not only justifies the validity of the theoretic analysis, with reasonable difference between the theoretic and measured value, but also shows that when adopting the improved strategies, efficacy of medical image parallel processing is improved greatly. 展开更多
关键词 image processing parallel processing medical image
暂未订购 下载PDF
Parallel Image Processing Technology of Surface Detection System 认领 引用 被引量：2
17
作者 LI Chang-le CHENG Wan-sheng FAN Ji-zhuang ZHAO Jie 《Semiconductor Photonics and Technology》 2008年第4期217-223,243,共7页
To improve image processing speed and detection precision of a surface detection system on a strip surface,based on the analysis of the characteristics of image data and image processing in detection system on the str... To improve image processing speed and detection precision of a surface detection system on a strip surface,based on the analysis of the characteristics of image data and image processing in detection system on the strip surface,the design of parallel image processing system and the methods of algorithm implementation have been studied. By using field programmable gate array(FPGA) as hardware platform of implementation and considering the characteristic of detection system on the strip surface,a parallel image processing system implemented by using multi IP kernel is designed. According to different computing tasks and the load balancing capability of parallel processing system,the system could set different calculating numbers of nodes to meet the system's demand and save the hardware cost. 展开更多
关键词 parallel image processing parallel algorithm surface defect FPGA multi IP core
暂未订购 下载PDF
Parallel Technologies with Image Processing Using Inverse Filter 认领 引用
18
作者 Rahaf Alsharhan Areej Muheef +2 位作者 Yasmin Al Ibrahim Afnan Rayyani Yasir Alguwaifli 《Journal of Computer and Communications》 2024年第1期110-119,共10页
Real-time capabilities and computational efficiency are provided by parallel image processing utilizing OpenMP. However, race conditions can affect the accuracy and reliability of the outcomes. This paper highlights t... Real-time capabilities and computational efficiency are provided by parallel image processing utilizing OpenMP. However, race conditions can affect the accuracy and reliability of the outcomes. This paper highlights the importance of addressing race conditions in parallel image processing, specifically focusing on color inverse filtering using OpenMP. We considered three solutions to solve race conditions, each with distinct characteristics: #pragma omp atomic: Protects individual memory operations for fine-grained control. #pragma omp critical: Protects entire code blocks for exclusive access. #pragma omp parallel sections reduction: Employs a reduction clause for safe aggregation of values across threads. Our findings show that the produced images were unaffected by race condition. However, it becomes evident that solving the race conditions in the code makes it significantly faster, especially when it is executed on multiple cores. 展开更多
关键词 Parallel Parallelization Image Processing Inverse Filtering OpenMP Race Conditions
暂未订购 下载PDF
Using Graphics Processing Units to Parallelize the FDK Algorithm for Tomographic Image Reconstruction 认领 引用
19
作者 Joel Sancnchez Dominguez Luiz Femando de Oliveira +1 位作者 Nilton Alves Junior Joaquim Teixeira de Assis 《Journal of Chemistry and Chemical Engineering》 2012年第8期760-768,共9页
The paper presents the implementation of a parallel version of FDK （Felkamp, David e Kress） algorithm using graphics processing units. Discussion was briefly some elements the computed tomographic scan and FDK algor... The paper presents the implementation of a parallel version of FDK （Felkamp, David e Kress） algorithm using graphics processing units. Discussion was briefly some elements the computed tomographic scan and FDK algorithm; and some ideas about GPUs （Graphics Processing Units） and its use in general purpose computing were presented. The paper shows a computational implementation of FDK algorithm and the process of parallelization of this implementation. Compare the parallel version of the algorithm with the sequential version, used speedup as a performance metric. To evaluate the performance of parallel version, two GPUs, GeForce 9400GT （16 cores） a low capacity GPU and Quadro 2000 （192 cores） a medium capacity GPU was reached speedup of 3.37. 展开更多
关键词 Computed tomography images reconstruction FDK algorithm GPUs CUDA-C parallel processing.
暂未订购 下载PDF
Development and Application of High-efficiency,Interactive Processing Functions of SP2 Parallel Computer 认领 引用
20
《China Oil & Gas》 CAS 2000年第2期44-44,共1页
关键词 Development and Application of High-efficiency,Interactive Processing Functions of SP2 Parallel Computer SP
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 128 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈