Shabir Ahmad¹, Faisal Jamil², Abid Ali³, Ehtisham Khan⁴, Muhammad Ibrahim², Taeg Keun Whangbo^1,*

CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 1363-1379, 2022, DOI:10.32604/cmc.2022.017715

Abstract The concept of Software-Defined Networking (SDN) evolves to overcome the drawbacks of the traditional networks with Internet Protocol (I.P.) packets sending and packets handling. The SDN structure is one of the critical advantages of efficiently separating the data plane from the control plane to manage the network configurations and network management. Whenever there are multiple sending devices inside the SDN network, the OpenFlow switches are programmed to handle the limited number of requests for their interface. When the recommendations are exceeded from the specific threshold, the load on the switches also increases. This research article introduces a new approach named… More >

Ke Song^1,*, Paul Liu², Dongquan Liu³

CMES-Computer Modeling in Engineering & Sciences, Vol.128, No.3, pp. 1133-1150, 2021, DOI:10.32604/cmes.2021.016008

Abstract A novel beamforming algorithm named Delay Multiply and Sum (DMAS), which excels at enhancing the resolution and contrast of ultrasonic image, has recently been proposed. However, there are nested loops in this algorithm, so the calculation complexity is higher compared to the Delay and Sum (DAS) beamformer which is widely used in industry. Thus, we proposed a simple vector-based method to lower its complexity. The key point is to transform the nested loops into several vector operations, which can be efficiently implemented on many parallel platforms, such as Graphics Processing Units (GPUs), and multi-core Central Processing Units (CPUs). Consequently, we… More >

Samih M. Mostafa^1,*, Hirofumi Amano²

CMC-Computers, Materials & Continua, Vol.66, No.3, pp. 3253-3270, 2021, DOI:10.32604/cmc.2021.014675

Abstract CPU scheduling is the basic task within any time-shared operating system. One of the main goals of the researchers interested in CPU scheduling is minimizing time cost. Comparing between CPU scheduling algorithms is subject to some scheduling criteria (e.g., turnaround time, waiting time and number of context switches (NCS)). Scheduling policy is divided into preemptive and non-preemptive. Round Robin (RR) algorithm is the most common preemptive scheduling algorithm used in the time-shared operating systems. In this paper, the authors proposed a modified version of the RR algorithm, called dynamic time slice (DTS), to combine the advantageous of the low scheduling… More >

R.H. Haney¹, R.V. Mohan²

CMES-Computer Modeling in Engineering & Sciences, Vol.95, No.5, pp. 431-452, 2013, DOI:10.3970/cmes.2013.095.431

Abstract The use of Graphics Processing Units (GPUs) as co-processors for single CPU/GPU computing systems has become pronounced in high performance computing research, however the solution of truly large scale computationally intensive problems require the utilization of multiple computing nodes. Multiple CPU/GPU computing systems bring new complexities to the observed performance of computationally intensive applications, the more salient of which is the cost of local CPU-GPU host and intra-nodal communication. This paper compares and analyzes the performance of a computationally intensive application represented by resin infusion flow during liquid composite molding process for the manufacture of structural composites application via two… More >