Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times...Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times and a certain setup times. All these setups have to be done by a single server, which can handle at most one job at a time. In this paper, we continue studying the complexity result for parallel machine problem with a single and release times. New complexity results are derived for special cases.展开更多
Simulation has become the evaluation method of choice for many areas of distributing computing research. Simulation has been applied successfully for modeling small and large complex systems and understanding their be...Simulation has become the evaluation method of choice for many areas of distributing computing research. Simulation has been applied successfully for modeling small and large complex systems and understanding their behavior, especially in the area of distributed systems or parallel environment. The aim of my research is to study and qualitative analysis of simulation on a single server & on distributed environment and finding the related issues & its comparison.展开更多
In this paper, we study a single server queueing system with Coxian-2 service. In Particular, we study M/C-2/M/1 queue with Coxian-2 service and exponential vacation. We assume that units (customers) arrive at t...In this paper, we study a single server queueing system with Coxian-2 service. In Particular, we study M/C-2/M/1 queue with Coxian-2 service and exponential vacation. We assume that units (customers) arrive at the system one by one in a Poisson process and the server provides one-by-one service based on first in first out (FIFO) rule. We obtained the steady state queue size distributions in terms of the probability generating functions, the average number of customers and their average waiting time in the system as well as in the queue.展开更多
The machine interference problem with reliable server under single vacation is considered here. There are M similar machines that are subject to fail or breaks down with a single server who is responsible for repairin...The machine interference problem with reliable server under single vacation is considered here. There are M similar machines that are subject to fail or breaks down with a single server who is responsible for repairing or maintaining the failed machines. The machine fails completely at random with rate 2 and they are serviced in order of breaks down. More so, the machines operate independently but are subject to fail or break down. The service time distributions of the failed machines are assumed to be exponentially distributed with state dependent service rate #n, where n is the number of failed machines. By state dependent service rate we mean a situation where the rate of service depends on the number of failed machines present in the system. The Chapman-Kolmogorov differential equations obtained for the reliable server under single vacation model is solved through ODE45 （Runge-Kutta algorithm of order 4 and 5） in MATLAB programming language. The transient probabilities obtained are used to compute the operational measures of performance for the systems. The following time dependent operational measures of performance for the system are obtained： expected number of failed machines, expected number of operating machines, machine availability, expected idle period, expected busy period, operational utilization of the machine, the variance of the expected number of failed machine and variance of expected number of operating machine in the system. The effects of failure rate of machines, service rate of failed machines and the number of operating machines are investigated; it is observe that the rate at which machine fails and is serviced, affect the expected number of failed and operating machines in the system. The CPU time for obtaining the transient results for the systems and the variance of the systems are reported in this work.展开更多
In the field of single-server blind quantum computation(BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable univer...In the field of single-server blind quantum computation(BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable universal quantum computation. In these two protocols, the client only needs to perform either the gate T(in the first protocol) or the gates H and X(in the second protocol). With assistance from a single server, the client can utilize his quantum capabilities to generate some single-qubit states while keeping the actual state of these qubits confidential from others. By using these single-qubit states, the verifiable universal quantum computation can be achieved.展开更多
Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results ...Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results about the recursive expressions of queue size distribution at different epoch （n＋, n, n-） are obtained. Furthermore the important relations between stationary queue size distribution at different epochs are discovered. The results are different from the relations given in M/G/1 queueing system. The model discussed in this paper can be widely applied in many kinds of communications and computer network.展开更多
In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we direct...In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we directly obtain the recursion formula of the L transformation of the transient queue length distribution at any time t , as well as the recursion formula of the equilibrium distribution for calculating conveniently.Furthermore we obtain the stochastic decompositions of the queue length and waiting time in equilibrium.展开更多
文摘Parallel machine problems with a single server and release times are generalizations of classical parallel machine problems. Before processing, each job must be loaded on a machine, which takes a certain release times and a certain setup times. All these setups have to be done by a single server, which can handle at most one job at a time. In this paper, we continue studying the complexity result for parallel machine problem with a single and release times. New complexity results are derived for special cases.
文摘Simulation has become the evaluation method of choice for many areas of distributing computing research. Simulation has been applied successfully for modeling small and large complex systems and understanding their behavior, especially in the area of distributed systems or parallel environment. The aim of my research is to study and qualitative analysis of simulation on a single server & on distributed environment and finding the related issues & its comparison.
文摘In this paper, we study a single server queueing system with Coxian-2 service. In Particular, we study M/C-2/M/1 queue with Coxian-2 service and exponential vacation. We assume that units (customers) arrive at the system one by one in a Poisson process and the server provides one-by-one service based on first in first out (FIFO) rule. We obtained the steady state queue size distributions in terms of the probability generating functions, the average number of customers and their average waiting time in the system as well as in the queue.
文摘The machine interference problem with reliable server under single vacation is considered here. There are M similar machines that are subject to fail or breaks down with a single server who is responsible for repairing or maintaining the failed machines. The machine fails completely at random with rate 2 and they are serviced in order of breaks down. More so, the machines operate independently but are subject to fail or break down. The service time distributions of the failed machines are assumed to be exponentially distributed with state dependent service rate #n, where n is the number of failed machines. By state dependent service rate we mean a situation where the rate of service depends on the number of failed machines present in the system. The Chapman-Kolmogorov differential equations obtained for the reliable server under single vacation model is solved through ODE45 （Runge-Kutta algorithm of order 4 and 5） in MATLAB programming language. The transient probabilities obtained are used to compute the operational measures of performance for the systems. The following time dependent operational measures of performance for the system are obtained： expected number of failed machines, expected number of operating machines, machine availability, expected idle period, expected busy period, operational utilization of the machine, the variance of the expected number of failed machine and variance of expected number of operating machine in the system. The effects of failure rate of machines, service rate of failed machines and the number of operating machines are investigated; it is observe that the rate at which machine fails and is serviced, affect the expected number of failed and operating machines in the system. The CPU time for obtaining the transient results for the systems and the variance of the systems are reported in this work.
基金Project supported by the National Science Foundation of Sichuan Province (Grant No. 2022NSFSC0534)the Central Guidance on Local Science and Technology Development Fund of Sichuan Province (Grant No. 22ZYZYTS0064)+1 种基金the Chengdu Key Research and Development Support Program (Grant No. 2021-YF09-0016-GX)the Key Project of Sichuan Normal University (Grant No. XKZX-02)。
文摘In the field of single-server blind quantum computation(BQC), a major focus is to make the client as classical as possible. To achieve this goal, we propose two single-server BQC protocols to achieve verifiable universal quantum computation. In these two protocols, the client only needs to perform either the gate T(in the first protocol) or the gates H and X(in the second protocol). With assistance from a single server, the client can utilize his quantum capabilities to generate some single-qubit states while keeping the actual state of these qubits confidential from others. By using these single-qubit states, the verifiable universal quantum computation can be achieved.
基金Supported by the National Natural Science Foundation of China (No.70871084)Scientific Research Fund of Southwestern University of Finance and Economicsthe Specialized Research Fund for the Doctoral Program of Higher Education of China (No.200806360001)
文摘Using recursive method, this paper studies the queue size properties at any epoch n＋ in Geom/G/ I（E, SV） queueing model with feedback under LASDA （late arrival system with delayed access） setup. Some new results about the recursive expressions of queue size distribution at different epoch （n＋, n, n-） are obtained. Furthermore the important relations between stationary queue size distribution at different epochs are discovered. The results are different from the relations given in M/G/1 queueing system. The model discussed in this paper can be widely applied in many kinds of communications and computer network.
基金This work was supported by the National Outstanding Youth Science Foundation ( 7972 50 0 2 ) andthe Nature Education Minister
文摘In this paper we study the transient and equilibrium distributions of the queue length for the M/G/1 queueing system with delay single server vacation.By the server busy period and the Laplace transformation we directly obtain the recursion formula of the L transformation of the transient queue length distribution at any time t , as well as the recursion formula of the equilibrium distribution for calculating conveniently.Furthermore we obtain the stochastic decompositions of the queue length and waiting time in equilibrium.
