Asymptotic Analysis of RQ-System with Feedback and Batch Poisson Arrival Under the Condition of Increasing Average Waiting Time in Orbit

Author(s):  
A. A. Nazarov ◽  
S. V. Rozhkova ◽  
E. Yu. Titarenko
2016 ◽  
Vol 2 (2) ◽  
pp. 19-21
Author(s):  
Achmad Teguh Wibowo

Aspek penting dalam sistem operasi adalah multiprogramming. Multiprogramming adalah proses atau metode yang digunakan untuk mengekssekusi beberapa proses secara bersamaan dalam memori. Tujuan utamanya adalah untuk meminimalkan Average Waiting Time, Average Turnaround Time, dan memaksimalkan penggunaan CPU. Ada berbagai algoritma yang digunakan dalam multiprogramming seperti First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling (PS) dan Round Robin(RR). Diantara semua itu yang paling sering digunakan adalah Round Robin. Round Robin merupakan algoritma penjadwalan yang optimal dengn sistem timeshared. Dalam RR, waktu kuantum bersifat statis dan algoritma ini bergantung pada besarnya kuantum yang dipilih/digunakan. Kuantum inilah yang berpengaruh pada Average Waiting Time dan Average Turnaround Time nantinya. Tujuan dari makalah ini adalah mengusulkan algoritma yang lebih baik daripada Round Robin sederhana dan Smart Optimized Round Robin sebelumnya.


2020 ◽  
pp. short50-1-short50-8
Author(s):  
Vladimir Bogatyrev ◽  
Stanislav Bogatyrev ◽  
Anatoly Bogatyrev

The possibilities of increasing the likelihood of timely service and reducing the average waiting time for requests for inter-machine exchange in distributed real-time computer systems are investigated. The analyzed effect is achieved as a result of redundant multi-way transmissions of packets that are critical to delays, which provide for the replication of transmitted packets with the task for each replica of the path (route) of the sequential passage of network nodes. The condition for the timeliness of the reserved transmissions is that the accumulated waiting in the queues of the nodes making up the path, at least for one of the replicas, does not exceed the maximum permissible time. An analytical model is proposed for estimating the average delays of multi-path redundant transmissions, when determined by the average delivery time of the first of the replicas transmitted in different ways. For requests critical to service delays, the influence of the frequency of reservation (replication) of requests on the probability of their timely service and the average waiting time accumulated at the nodes of the path for the replica delivered first was analyzed.


2019 ◽  
Vol 8 (2) ◽  
pp. 3800-3804

As focusing on the scheduling schemes, there are many scheduling schemes for multilevel. So the paper is concentrating to compare the scheduling schemes and producing the average waiting time and turnaround time. If it is minimized then the overall performance may shoot up. In this paper comparison is done between three scheduling schemes Enhanced Dynamic Multilevel Packet scheduling (EDMP), Circular Wait Dynamic Multilevel Packet scheduling (CW-DMP) and Starvation-Free Dynamic Multilevel Packet scheduling (SF-DMP). In all the above schemes there are three priority levels say priority level 1(Pr1), priority level 2(Pr2) and priority level 3(Pr3). Pr1 will comprise the real time tasks, Pr2 containing the non real time remote tasks and non real time local tasks are there in Pr3. In each and every scheme, each and every priority level will be using the individual scheduling technique to schedule the tasks. Also the comparison is done based on waiting time and the turnaround time of the task thereby the average waiting time and the average turnaround time are calculated.


2021 ◽  
Vol 108 (Supplement_7) ◽  
Author(s):  
Mohamed Abouelazayem ◽  
Raluca Belchita

Abstract Aim To review the new referrals to the Upper GI surgery clinic for appropriateness, investigations requested, and waiting times and to identify potential pathways to reduce waiting times and improve the patient experience. Method Patients who attended the UGI clinic over 2 months period were identified. Data were collected from GP referrals and Electronic Patient Records. Follow up, post-discharge appointments, and Did Not Attends were excluded. Data collected included time from referral to first clinic, symptoms, investigations requested, suitability for a pathway, and appropriateness of referral. A first clinic outcome was concluded from reading the GP referral, there were 5 outcomes to choose from; direct to another specialty, discharge back to GP, clinic, surgery, pre-investigate and clinic. Results 147 referrals were analysed. The average waiting time from referral to the first clinic was 51 days (range 7-119 days). 73% of the referrals were GP referrals and 27% from other specialties. The most common referral was for gallstones and the most common 2 outcomes were Pre-investigate and surgery. Conclusion Most of the investigations and outcomes suggested from the project were the same as those from clinic letters. The following pathways can be developed to cut waiting times and costs for the trust:


2012 ◽  
Vol 576 ◽  
pp. 714-717
Author(s):  
Mohammad Iqbal ◽  
Muhammad Ridwan Andi Purnomo ◽  
Muhammad Ammar Bin Mohd Imra ◽  
Mohamed Konneh ◽  
A.N. Mustafizul Karim

Material handling is one of major components in Flexible Manufacturing System (FMS). Any improvement of material handling capability is to affect the performance of the whole system. This paper discusses the simulation study on the effect of part arrival rate and dispatching rules to the average waiting time and production rate of the FMS. The facilities of the system were modeled into simulation environment by using Arena Simulation Software. The production parameters such as machine processing times, part transportation speed and type of products were put into the model to represent the behaviors of the real system. Two rules have been considered in the study, i. e. first come first served (FCFS), and shortest processing time (SPT). Average waiting time and productivity were taken into account as performance measures of the system. The result of the study showed that SPT rule gives shorter average waiting time and higher productivity. Based on this result, the SPT rules would be used to control part transporter in order to have a better performance of the FMS.


2007 ◽  
Vol 7 (19) ◽  
pp. 2891-2895
Author(s):  
Muhammad Qadeer Sharif ◽  
Pingzhi Fan ◽  
Yi Pan

2020 ◽  
Vol 12 (8) ◽  
pp. 3477
Author(s):  
Kwangji Kim ◽  
Mi-Jung Kim ◽  
Jae-Kyoon Jun

When competitive small restaurants have queues in peak periods, they lack strategies to cope. However, few studies have examined small restaurants’ revenue management strategies at peak times. This research examines how such small restaurants in South Korea can improve their profitability by adapting their price increases, table mix, and the equilibrium points of the utilization rates, and reports the following findings based on the analysis of two studies. In Study 1, improving profitability by increasing prices should carefully consider the magnitude and timing. In Study 2, when implementing the table mix strategy, seat occupancy and profit also increase, and we further find the equilibrium points of the utilization rates. Under a queuing system, the utilization rate and average waiting time are also identified as having a trade-off relationship. The results provide insights into how managers of small restaurants with queues can develop efficient revenue management strategies to manage peak hours.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-18 ◽  
Author(s):  
Vee-Liem Saw ◽  
Luca Vismara ◽  
Lock Yue Chew

We study how N intelligent buses serving a loop of M bus stops learn a no-boarding strategy and a holding strategy by reinforcement learning. The no-boarding and holding strategies emerge from the actions of stay or leave when a bus is at a bus stop and everyone who wishes to alight has done so. A reward that encourages the buses to strive towards a staggered phase difference amongst them whilst picking up passengers allows the reinforcement learning process to converge to an optimal Q-table within a reasonable amount of simulation time. It is remarkable that this emergent behaviour of intelligent buses turns out to minimise the average waiting time of commuters, in various setups where buses move with the same speed or different speeds, during busy as well as lull periods. Cooperative actions are also observed, e.g., the buses learn to unbunch.


Sign in / Sign up

Export Citation Format

Share Document