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 n...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 study where we have developed four variations of RR,each algorithm considers three-time quanta and the performance of these variations was compared with the RR algorithm,and results highlighted that these variations performed better than conventional RR algorithm.In the future,we intend to develop an automated scheduler that can determine optimal algorithm based on the current set of processes and will allocate time quantum to the processes intelligently at the run time.This way the task performance of modern-day systems can be improved to make them more efficient.展开更多
We consider approximation algorithms for nonnegative polynomial optimization problems over unit spheres. These optimization problems have wide applications e.g., in signal and image processing, high order statistics, ...We consider approximation algorithms for nonnegative polynomial optimization problems over unit spheres. These optimization problems have wide applications e.g., in signal and image processing, high order statistics, and computer vision. Since these problems are NP-hard, we are interested in studying on approximation algorithms. In particular, we propose some polynomial-time approximation algorithms with new approximation bounds. In addition, based on these approximation algorithms, some efficient algorithms are presented and numerical results are reported to show the efficiency of our proposed algorithms.展开更多
文摘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 study where we have developed four variations of RR,each algorithm considers three-time quanta and the performance of these variations was compared with the RR algorithm,and results highlighted that these variations performed better than conventional RR algorithm.In the future,we intend to develop an automated scheduler that can determine optimal algorithm based on the current set of processes and will allocate time quantum to the processes intelligently at the run time.This way the task performance of modern-day systems can be improved to make them more efficient.
基金The authors would like to thank the reviewers for their insightful comments which help to improve the presentation of the paper. The first author＇s work was supported by the National Natural Science Foundation of China （Grant No. 11471242） and the work of the second author was supported by the National Natural Science Foundation of China （Grant No. 11601261）.
文摘We consider approximation algorithms for nonnegative polynomial optimization problems over unit spheres. These optimization problems have wide applications e.g., in signal and image processing, high order statistics, and computer vision. Since these problems are NP-hard, we are interested in studying on approximation algorithms. In particular, we propose some polynomial-time approximation algorithms with new approximation bounds. In addition, based on these approximation algorithms, some efficient algorithms are presented and numerical results are reported to show the efficiency of our proposed algorithms.
