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.展开更多
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 sub...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 overhead of the RR and favor short process for the sake of minimizing time cost.Each process has a weight proportional to the weights of all processes.The process’s weight determines its time slice within the current period.The authors benefit from the clustering technique in grouping the processes that are similar in their attributes(e.g.,CPU service time,weight,allowed time slice(ATS),proportional burst time(PBT)and NCS).Each process in a cluster is assigned the average of the processes’time slices in this cluster.A comparative study of six popular scheduling algorithms and the proposed approach on nine groups of processes vary in their attributes was performed and the evaluation was measured in terms of waiting and turnaround times,and NCS.The experiments showed that the proposed algorithm gives better results.展开更多
A new approximation of fair queuing called Compensating Hound Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of th...A new approximation of fair queuing called Compensating Hound Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of throughput, requires only O( I) time complexity to process a packet, and is simple enough to be implemented in hardware. After the performances are analyzed, the fairness and packet loss rate of the algorithm are simulated. Simulation results show that the CRR can effectively isolate the effects of contending .sources.展开更多
Nowadays session-based applications are one of the typical applications in the Internet,and people build such applications on clusters on concern of scalability. Scheduling in such a cluster is a key technology since ...Nowadays session-based applications are one of the typical applications in the Internet,and people build such applications on clusters on concern of scalability. Scheduling in such a cluster is a key technology since system performance depends on it. In this paper,we investigate the Round-Robin algorithm in the context of Session-based applications. An analyzing model for such sys-tems is proposed. Through both theoretical analysis and simulation,we find the main factor for system performance. And the result also shows that this algorithm shows up with significantly different performance under various conditions.展开更多
Since first establishing thermal measurement techniques for micrometer-scale wires,various methods have been devised and improved upon.However,the uncertainty of different measurements on the same sample has not yet b...Since first establishing thermal measurement techniques for micrometer-scale wires,various methods have been devised and improved upon.However,the uncertainty of different measurements on the same sample has not yet been discussed.In this work,a round robin test was performed to compare the thermal conductivity and thermal diffusivity measurement methods for a fine metal wire.The tested material was a pure gold wire,with a diameter of 30μm.The wire was cut into certain lengths and distributed to four institutions using five different measurement methods:the direct current(DC)self-heating method,the DC heating T-type method,the 3ωmethod for thermal conductivity,the scanning laser heating alternating current(AC)method,and the spot periodic heating radiation thermometry method for thermal diffusivity.After completing the measurements,the reported thermal conductivity and thermal diffusivity at room temperature,i.e.,317 W·m^(-1)·K^(-1)and 128×10^(-6)m^(2)·s^(-1),respectively,were adopted as references for comparison with the measurement results.The advantages and disadvantages of each method are described in terms of the effect of electrical and thermal junctions fabricated on a wire,such as an electrode,a thermocouple,and a heat bath.The knowledge obtained from the tested methods will be useful for selecting and designing a measurement technique for various wire-like materials.展开更多
In this paper, we proposed the scheme for a passive round-robin differential-phase-shift quantum key distribution（RRDPS-QKD） set-up based on the principle of Hong–Ou–Mandel interference. Our scheme requires two le...In this paper, we proposed the scheme for a passive round-robin differential-phase-shift quantum key distribution（RRDPS-QKD） set-up based on the principle of Hong–Ou–Mandel interference. Our scheme requires two legitimate parties to prepare their signal state with two different non-orthogonal bases instead of single in original protocol. Incorporating this characteristic, we establish the level of security of our protocol under the intercept-resend attack and demonstrate its detector-flaw-immune feature. Furthermore, we show that our scheme not only inherits the merit of better tolerance of bit errors and finite-sized-key effects but can be implemented using hardware similar to the measurement device independent QKD（MDI-QKD）. This ensures good compatibility with the current commonly used quantum system.展开更多
Recently,a round-robin differential phase-shift（RRDPS） protocol was proposed[Nature 509,475（2014）],in which the amount of leakage is bounded without monitoring the signal disturbance.Introducing states of the phas...Recently,a round-robin differential phase-shift（RRDPS） protocol was proposed[Nature 509,475（2014）],in which the amount of leakage is bounded without monitoring the signal disturbance.Introducing states of the phase-encoded Bennett-Brassard 1984 protocol（PE-BB84） to the RRDPS,this paper presents another quantum key distribution protocol called round-robin differential quadrature phase-shift（RRDQPS） quantum key distribution.Regarding a train of many pulses as a single packet,the sender modulates the phase of each pulse by one of {0,π/2,π,3π/2},then the receiver measures each packet with a Mach-Zehnder interferometer having a phase basis of 0 or π/2.The RRDQPS protocol can be implemented with essential similar hardware to the PE-BB84,so it has great compatibility with the current quantum system.Here we analyze the security of the RRDQPS protocol against the intercept-resend attack and the beam-splitting attack.Results show that the proposed protocol inherits the advantages arising from the simplicity of the RRDPS protocol and is more robust against these attacks than the original protocol.展开更多
文摘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.
文摘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 overhead of the RR and favor short process for the sake of minimizing time cost.Each process has a weight proportional to the weights of all processes.The process’s weight determines its time slice within the current period.The authors benefit from the clustering technique in grouping the processes that are similar in their attributes(e.g.,CPU service time,weight,allowed time slice(ATS),proportional burst time(PBT)and NCS).Each process in a cluster is assigned the average of the processes’time slices in this cluster.A comparative study of six popular scheduling algorithms and the proposed approach on nine groups of processes vary in their attributes was performed and the evaluation was measured in terms of waiting and turnaround times,and NCS.The experiments showed that the proposed algorithm gives better results.
文摘A new approximation of fair queuing called Compensating Hound Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of throughput, requires only O( I) time complexity to process a packet, and is simple enough to be implemented in hardware. After the performances are analyzed, the fairness and packet loss rate of the algorithm are simulated. Simulation results show that the CRR can effectively isolate the effects of contending .sources.
文摘Nowadays session-based applications are one of the typical applications in the Internet,and people build such applications on clusters on concern of scalability. Scheduling in such a cluster is a key technology since system performance depends on it. In this paper,we investigate the Round-Robin algorithm in the context of Session-based applications. An analyzing model for such sys-tems is proposed. Through both theoretical analysis and simulation,we find the main factor for system performance. And the result also shows that this algorithm shows up with significantly different performance under various conditions.
文摘Since first establishing thermal measurement techniques for micrometer-scale wires,various methods have been devised and improved upon.However,the uncertainty of different measurements on the same sample has not yet been discussed.In this work,a round robin test was performed to compare the thermal conductivity and thermal diffusivity measurement methods for a fine metal wire.The tested material was a pure gold wire,with a diameter of 30μm.The wire was cut into certain lengths and distributed to four institutions using five different measurement methods:the direct current(DC)self-heating method,the DC heating T-type method,the 3ωmethod for thermal conductivity,the scanning laser heating alternating current(AC)method,and the spot periodic heating radiation thermometry method for thermal diffusivity.After completing the measurements,the reported thermal conductivity and thermal diffusivity at room temperature,i.e.,317 W·m^(-1)·K^(-1)and 128×10^(-6)m^(2)·s^(-1),respectively,were adopted as references for comparison with the measurement results.The advantages and disadvantages of each method are described in terms of the effect of electrical and thermal junctions fabricated on a wire,such as an electrode,a thermocouple,and a heat bath.The knowledge obtained from the tested methods will be useful for selecting and designing a measurement technique for various wire-like materials.
基金Project supported by the Fund from the State Key Laboratory of Information Photonics and Optical Communications(Beijing University of Posts and Telecommunications)(Grant No.IPOC2017ZT0)
文摘In this paper, we proposed the scheme for a passive round-robin differential-phase-shift quantum key distribution（RRDPS-QKD） set-up based on the principle of Hong–Ou–Mandel interference. Our scheme requires two legitimate parties to prepare their signal state with two different non-orthogonal bases instead of single in original protocol. Incorporating this characteristic, we establish the level of security of our protocol under the intercept-resend attack and demonstrate its detector-flaw-immune feature. Furthermore, we show that our scheme not only inherits the merit of better tolerance of bit errors and finite-sized-key effects but can be implemented using hardware similar to the measurement device independent QKD（MDI-QKD）. This ensures good compatibility with the current commonly used quantum system.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61505261 and 11304397)the National Basic Research Program of China(Grant No.2013CB338002)
文摘Recently,a round-robin differential phase-shift（RRDPS） protocol was proposed[Nature 509,475（2014）],in which the amount of leakage is bounded without monitoring the signal disturbance.Introducing states of the phase-encoded Bennett-Brassard 1984 protocol（PE-BB84） to the RRDPS,this paper presents another quantum key distribution protocol called round-robin differential quadrature phase-shift（RRDQPS） quantum key distribution.Regarding a train of many pulses as a single packet,the sender modulates the phase of each pulse by one of {0,π/2,π,3π/2},then the receiver measures each packet with a Mach-Zehnder interferometer having a phase basis of 0 or π/2.The RRDQPS protocol can be implemented with essential similar hardware to the PE-BB84,so it has great compatibility with the current quantum system.Here we analyze the security of the RRDQPS protocol against the intercept-resend attack and the beam-splitting attack.Results show that the proposed protocol inherits the advantages arising from the simplicity of the RRDPS protocol and is more robust against these attacks than the original protocol.
