An algorithm for computing the mean response time of a single server queue with generalized on/off traffic arrivals

Author(s):  
Sebastià Galmés ◽  
Ramon Puigjaner
Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 457
Author(s):  
Isabel María Introzzi ◽  
María Marta Richard’s ◽  
Yesica Aydmune ◽  
Eliana Vanesa Zamora ◽  
Florencia Stelzer ◽  
...  

Recent studies suggest that the developmental curves in adolescence, related to the development of executive functions, could be fitted to a non-linear trajectory of development with progressions and retrogressions. Therefore, the present study proposes to analyze the pattern of development in Perceptual Inhibition (PI), considering all stages of adolescence (early, middle, and late) in intervals of one year. To this aim, we worked with a sample of 275 participants between 10 and 25 years, who performed a joint visual and search task (to measure PI). We have fitted ex-Gaussian functions to the probability distributions of the mean response time across the sample and performed a covariance analysis (ANCOVA). The results showed that the 10- to 13-year-old groups performed similarly in the task and differ from the 14- to 19-year-old participants. We found significant differences between the older group and all the rest of the groups. We discuss the important changes that can be observed in relation to the nonlinear trajectory of development that would show the PI during adolescence.


1987 ◽  
Vol 24 (03) ◽  
pp. 758-767
Author(s):  
D. Fakinos

This paper studies theGI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.


2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Siew Khew Koh ◽  
Ah Hin Pooi ◽  
Yi Fei Tan

Consider the single server queue in which the system capacity is infinite and the customers are served on a first come, first served basis. Suppose the probability density functionf(t)and the cumulative distribution functionF(t)of the interarrival time are such that the ratef(t)/1-F(t)tends to a constant ast→∞, and the rate computed from the distribution of the service time tends to another constant. When the queue is in a stationary state, we derive a set of equations for the probabilities of the queue length and the states of the arrival and service processes. Solving the equations, we obtain approximate results for the stationary probabilities which can be used to obtain the stationary queue length distribution and waiting time distribution of a customer who arrives when the queue is in the stationary state.


Sign in / Sign up

Export Citation Format

Share Document