scholarly journals Evaluation of the functioning of selected public transport interchanges in Szczecin

2017 ◽  
Vol 18 (3) ◽  
pp. 24-27
Author(s):  
Karol Abramek ◽  
Paweł Regulski
Keyword(s):  
Waiting Time ◽  
Public Transport ◽  
Actual Data ◽  
Average Waiting Time

The article presents the result of calculations on the average waiting time for the planned merger, which has been designated on the basis of the timetable and the actual average waiting time for connection designated on the basis of actual data of arrivals and departures of vehicles transport of Szczecin.

A Queue Dispatch Optimizing Method for Elevator Traffic System

2012 ◽  
Vol 182-183 ◽  
pp. 1919-1923
Author(s):  
Jian Liu ◽  
Ting Zhang ◽  
Jin Xiang Pian ◽  
Feng Yan Han ◽  
Li Wang ◽  
...  
Keyword(s):  
Waiting Time ◽  
Control Strategy ◽  
New Method ◽  
Actual Data ◽  
Traffic System ◽  
Average Waiting Time ◽  
Queue Model ◽  
Simulation Results

In this paper, a new method is presented to optimize the elevator traffic system based on queue model. The application of this method is studied in detail. Parameters for the elevator running including number of elevator passenger, average waiting time and arriving ratio, and the relationships between them have been analyzed as well. Therefore, the dispatching of elevator dynamic partition can be done. The actual data of rush hours are used for simulation tests. The simulation results show that this method has good performance. The method is a more practical control strategy especially in rush hours.

scholarly journals Super Smart Optimized Round Robin

2016 ◽  
Vol 2 (2) ◽  
pp. 19-21
Author(s):  
Achmad Teguh Wibowo
Keyword(s):  
Waiting Time ◽  
Turnaround Time ◽  
Round Robin ◽  
Priority Scheduling ◽  
Average Waiting Time ◽  
First Come First Serve ◽  
Time Average ◽  
Average Turnaround Time

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.

scholarly journals Inter-Machine Exchange of Real Time in Distributed Computer Systems

2020 ◽  
pp. short50-1-short50-8
Author(s):  
Vladimir Bogatyrev ◽  
Stanislav Bogatyrev ◽  
Anatoly Bogatyrev
Keyword(s):  
Real Time ◽  
Analytical Model ◽  
Waiting Time ◽  
Computer Systems ◽  
Delivery Time ◽  
Network Nodes ◽  
Average Waiting Time ◽  
Service Delays ◽  
Distributed Computer Systems

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.

scholarly journals Scheduling Schemes in Dynamic Multilevel Packet Scheduling in WSN

2019 ◽  
Vol 8 (2) ◽  
pp. 3800-3804
Keyword(s):  
Real Time ◽  
Waiting Time ◽  
Packet Scheduling ◽  
Turnaround Time ◽  
Priority Level ◽  
Average Waiting Time ◽  
Level 3 ◽  
Overall Performance ◽  
The Individual ◽  
Priority Levels

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.

scholarly journals EP.WE.727Upper GI Surgery Clinic Referrals; Can We Improve the Patient Experience?

2021 ◽  
Vol 108 (Supplement_7) ◽  
Author(s):  
Mohamed Abouelazayem ◽  
Raluca Belchita
Keyword(s):  
Patient Experience ◽  
Waiting Time ◽  
Waiting Times ◽  
Patient Records ◽  
Electronic Patient Records ◽  
Post Discharge ◽  
Average Waiting Time ◽  
Upper Gi

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:

Sign in / Sign up

Export Citation Format

Share Document