Bilal Khan¹, Danish Shehzad¹, Numan Shafi¹, Ga-Young Kim^2,*, Muhammad Umar Aftab¹

CMC-Computers, Materials & Continua, Vol.73, No.1, pp. 1671-1690, 2022, DOI:10.32604/cmc.2022.024918

Abstract Nowadays multiple wireless communication systems operate in industrial environments side by side. In such an environment performance of one wireless network can be degraded by the collocated hostile wireless network having higher transmission power or higher carrier sensing threshold. Unlike the previous research works which considered IEEE 802.15.4 for the Industrial Wireless communication systems (iWCS) this paper examines the coexistence of IEEE 802.11 based iWCS used for delay-stringent communication in process automation and gWLAN (general-purpose WLAN) used for non-real time communication. In this paper, we present a Markov chain-based performance model that described the transmission failure of iWCS due to… More >

Monday Eze^1,*, Charles Okunbor², Solomon Esomu³, Nneka Richard-Nnabu⁴, Kayode Oladapo¹, Oghenetega Avwokuruaye⁵, Abisola Olayiwola⁶, Akpovi Ominike⁷, Godwin Odulaja⁸, Oluwatobi Akinmerese¹

Computer Systems Science and Engineering, Vol.42, No.1, pp. 15-31, 2022, DOI:10.32604/csse.2022.021964

Abstract Knowledge propagation is a necessity, both in academics and in the industry. The focus of this work is on how to achieve rapid knowledge propagation using collaborative study groups. The practice of knowledge sharing in study groups finds relevance in conferences, workshops, and class rooms. Unfortunately, there appears to be only few researches on empirical best practices and techniques on study groups formation, especially for achieving rapid knowledge propagation. This work bridges this gap by presenting a workflow driven computational algorithm for autonomous and unbiased formation of study groups. The system workflow consists of a chronology of stages, each made… More >

Sardar Zafar Iqbal, Hina Gull^*, Saqib Saeed, Madeeha Saqib, Mohammed Alqahtani, Yasser A. Bamarouf, Gomathi Krishna, May Issa Aldossary

Computer Systems Science and Engineering, Vol.41, No.2, pp. 461-477, 2022, DOI:10.32604/csse.2022.017003

Abstract Modern human life is heavily dependent on computing systems and one of the core components affecting the performance of these systems is underlying operating system. Operating systems need to be upgraded to match the needs of modern-day systems relying on Internet of Things, Fog computing and Mobile based applications. The scheduling algorithm of the operating system dictates that how the resources will be allocated to the processes and the Round Robin algorithm (RR) has been widely used for it. The intent of this study is to ameliorate RR scheduling algorithm to optimize task scheduling. We have carried out an experimental… More >

Samih M. Mostafa^1,*, Sahar Ahmed Idris², Manjit Kaur³

CMC-Computers, Materials & Continua, Vol.70, No.3, pp. 6271-6288, 2022, DOI:10.32604/cmc.2022.021978

Abstract Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who interested in CPU scheduling algorithms. Waiting time, turnaround time, and number of context switches are the most time cost criteria used to compare between CPU scheduling algorithms. CPU scheduling algorithms are divided into non-preemptive and preemptive. Round Robin (RR) algorithm is the most famous as it is the basis for all the algorithms used in time-sharing. In this paper, the authors proposed a novel CPU scheduling algorithm based on RR. The proposed algorithm is called Adjustable… 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 >

David E. Soine, Richard J. Jones, Jr., Julie M. Harvie, Troy J. Skousen, Tyler F. Schoenherr

Sound & Vibration, Vol.52, No.1, pp. 9-12, 2018, DOI:10.32604/sv.2018.03629

Abstract Qualification of products to their vibration and shock requirements in a laboratory setting consists of two basic steps. The first is the quantification of the product’s mechanical environment in the field. The second is the process of testing the product in the laboratory to ensure it is robust enough to survive the field environment. The latter part is the subject of the “Boundary Condition for Component Qualification” challenge problem. This paper describes the challenges in determining the appropriate boundary conditions and input stimulus required to qualify the product. This paper also describes the step sand analyses that were taken to… More >