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 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 Priority based round robin (PBRR) CPU scheduling algorithm

2019 ◽  
Vol 9 (1) ◽  
pp. 190
Author(s):  
Sonia Zouaoui ◽  
Lotfi Boussaid ◽  
Abdellatif Mtibaa
Keyword(s):  
Operating System ◽  
Real Time ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
New Approach ◽  
Real Time Operating System ◽  
Cpu Scheduling

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>

scholarly journals The Timeliness of the Reserved Service in the Cluster with the Regulation of the Time of Destruction of Overdue Requests in the Node Queues

2021 ◽  
Author(s):  
Vladimir Bogatyrev ◽  
Stanislav Bogatyrev ◽  
Anatoly Bogatyrev
Keyword(s):  
Distributed Computing ◽  
Real Time ◽  
Distributed Control ◽  
Waiting Time ◽  
Significant Influence ◽  
Queuing Systems ◽  
Time Limits ◽  
Average Waiting Time ◽  
Insufficient Time ◽  
Maximum Allowable Time

With the increasing complexity of distributed control tasks based on their intellectualization, there are problems of insufficient time and computing resources for functioning in real time. In this regard, there is a need to develop methods for organizing distributed real-time computer systems, based on the consolidation of distributed computing resources with their integration into clusters. The possibilities of increasing the probability of timely servicing of waiting- critical requests in the cluster as a result of query replication and controlling the time of destruction of potentially expired replicas in node queues are investigated. The cluster is represented as a group of queuing systems with infinite queues with a limited average waiting time. The effectiveness of the reserved service of a real-time request is determined by the probability of executing at least one of the generated copies of the request in the maximum allowable time without losing it due to errors and waiting time limits in the queues of cluster nodes. It is shown that there is an optimal multiplicity of query replication with a significant influence of the choice of restrictions on the waiting time for requests in queues before they are destroyed.

scholarly journals Convoy Effect Elimination in FCFS Scheduling

2020 ◽  
Vol 9 (3) ◽  
pp. 3218-3221
Keyword(s):  
Operating Systems ◽  
Waiting Time ◽  
Turnaround Time ◽  
Round Robin ◽  
Process Scheduling ◽  
Priority Scheduling ◽  
Average Waiting Time ◽  
Novel Method ◽  
Lengthy Process

One of the important activities of operating systems is process scheduling. There are many algorithms available for scheduling like First Come First Served, Shortest Job First, Priority Scheduling and Round Robin. The fundamental algorithm is First Come First Served. It has some drawback of convoy effect. Convoy effect occurs when the small processes are waiting for lengthy process to complete. In this paper novel method is proposed to reduce convoy effect and to make the Scheduling optimal which reduces average waiting time and turnaround time.

scholarly journals Efficient PIMRR Algorithm Based on Scheduling Measures for Improving Real Time Systems

2018 ◽  
Vol 7 (2.32) ◽  
pp. 275
Author(s):  
Siva Nageswara Rao ◽  
Ramkumar Jayaraman ◽  
Dr S.V.N Srinivasu
Keyword(s):  
Real Time ◽  
Waiting Time ◽  
Turnaround Time ◽  
Real Time Systems ◽  
Quantum Time ◽  
Modulo Operation ◽  
Multiple Process ◽  
Time Systems ◽  
Throughput And Delay

Scheduling play an important role to perform a single (or) multiple process activities by considering scheduling criteria’s such as, waiting time, turnaround time, CPU utilization and context switches. The scheduling criteria’s mainly depends on the quantum time which is specific to real time systems. The challenges faced by the real time systems based on scheduling activities viz., higher waiting time, more context switches and high turnaround time. All the scheduling criteria’s are integrated to achieve Quality of Service (QoS) like throughput and delay. To improve the scheduling criteria’s like waiting time, context switches and turnaround time, PIMRR algorithm is proposed. The PIMRR algorithm is first integrated with modulo operation to provide priority to all the process. The average of all the processes burst time is equal to the quantum time. Performance analysis is done for PMIRR with the existing simple round robin, PRR, Priority based RR scheduling based on the scheduling criteria’s. Our results demonstrates that the PIMRR is more efficient compared to the existing ones, in terms of waiting time and turnaround time versus quantum time.   

scholarly journals Computer-assisted contralateral side comparison of the ankle joint using flat panel technology

2021 ◽  
Author(s):  
Sarina Thomas ◽  
Lisa Kausch ◽  
Holger Kunze ◽  
Maxim Privalov ◽  
André Klein ◽  
...  
Keyword(s):  
Information Gain ◽  
Contralateral Side ◽  
Computer Assisted ◽  
Ankle Joints ◽  
Additional Radiation ◽  
Median Position ◽  
Operative Evaluation ◽  
Overall Performance ◽  
The Individual ◽  
Segmentation Problem

Abstract Purpose Reduction and osteosynthesis of ankle fractures is a challenging surgical procedure when it comes to the verification of the reduction result. Evaluation is conducted using intra-operative imaging of the injured ankle and depends on the expertise of the surgeon. Studies suggest that intra-individual variance of the ankle bone shape and pose is considerably lower than the inter-individual variance. It stands to reason that the information gain from the healthy contralateral side can help to improve the evaluation. Method In this paper, an assistance system is proposed that provides a side-to-side view of the two ankle joints for visual comparison and instant evaluation using only one 3D C-arm image. Two convolutional neural networks (CNN) are employed to extract the relevant image regions and pose information of each ankle so that they can be aligned with each other. A first U-Net uses a sliding window to predict the location of each ankle. The standard plane estimation is formulated as segmentation problem so that a second U-Net predicts the three viewing planes for alignment. Results Experiments were conducted to assess the accuracy of the individual steps on 218 unilateral ankle datasets as well as the overall performance on 7 bilateral ankle datasets. The experiments on unilateral ankles yield a median position-to-plane error of $$0.73\pm 1.36$$ 0.73 ± 1.36 mm and a median angular error between 2.98$$^\circ $$ ∘ and 3.71$$^\circ $$ ∘ for the plane normals. Conclusion Standard plane estimation via segmentation outperforms direct pose regression. Furthermore, the complete pipeline was evaluated including ankle detection and subsequent plane estimation on bilateral datasets. The proposed pipeline enables a direct contralateral side comparison without additional radiation. This has the potential to ease and improve the intra-operative evaluation for the surgeons in the future and reduce the need for revision surgery.

scholarly journals Evaluation of mobile real-time polymerase chain reaction tests for the detection of severe acute respiratory syndrome coronavirus 2

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Chukwunonso Onyilagha ◽  
Henna Mistry ◽  
Peter Marszal ◽  
Mathieu Pinette ◽  
Darwyn Kobasa ◽  
...  
Keyword(s):  
Severe Acute Respiratory Syndrome ◽  
Real Time ◽  
Point Of Care ◽  
Middle Eastern ◽  
Turnaround Time ◽  
Cross Reactivity ◽  
Clinical Samples ◽  
Diarrhea Virus ◽  
Highly Sensitive ◽  
Transmissible Gastroenteritis

AbstractThe coronavirus disease 2019 (COVID-19) pandemic, caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), calls for prompt and accurate diagnosis and rapid turnaround time for test results to limit transmission. Here, we evaluated two independent molecular assays, the Biomeme SARS-CoV-2 test, and the Precision Biomonitoring TripleLock SARS-CoV-2 test on a field-deployable point-of-care real-time PCR instrument, Franklin three9, in combination with Biomeme M1 Sample Prep Cartridge Kit for RNA 2.0 (M1) manual extraction system for rapid, specific, and sensitive detection of SARS-COV-2 in cell culture, human, and animal clinical samples. The Biomeme SARS-CoV-2 assay, which simultaneously detects two viral targets, the orf1ab and S genes, and the Precision Biomonitoring TripleLock SARS-CoV-2 assay that targets the 5′ untranslated region (5′ UTR) and the envelope (E) gene of SARS-CoV-2 were highly sensitive and detected as low as 15 SARS-CoV-2 genome copies per reaction. In addition, the two assays were specific and showed no cross-reactivity with Middle Eastern respiratory syndrome coronavirus (MERS-CoV), infectious bronchitis virus (IBV), porcine epidemic diarrhea virus (PEDV), transmissible gastroenteritis (TGE) virus, and other common human respiratory viruses and bacterial pathogens. Also, both assays were highly reproducible across different operators and instruments. When used to test animal samples, both assays equally detected SARS-CoV-2 genetic materials in the swabs from SARS-CoV-2-infected hamsters. The M1 lysis buffer completely inactivated SARS-CoV-2 within 10 min at room temperature enabling safe handling of clinical samples. Collectively, these results show that the Biomeme and Precision Biomonitoring TripleLock SARS-CoV-2 mobile testing platforms could reliably and promptly detect SARS-CoV-2 in both human and animal clinical samples in approximately an hour and can be used in remote areas or health care settings not traditionally serviced by a microbiology laboratory.

On the Performance Comparisons of Native and Clientless Real-Time Screen-Sharing Technologies

2021 ◽  
Vol 17 (2) ◽  
pp. 1-26
Author(s):  
Chun-ying Huang ◽  
Yun-chen Cheng ◽  
Guan-zhang Huang ◽  
Ching-ling Fan ◽  
Cheng-hsin Hsu
Keyword(s):  
Real Time ◽  
Computer Games ◽  
Performance Metrics ◽  
Video Quality ◽  
Dynamic Network ◽  
Web Browsers ◽  
Depth Analysis ◽  
Measurement Methodology ◽  
Overall Performance ◽  
Screen Sharing

Real-time screen-sharing provides users with ubiquitous access to remote applications, such as computer games, movie players, and desktop applications (apps), anywhere and anytime. In this article, we study the performance of different screen-sharing technologies, which can be classified into native and clientless ones. The native ones dictate that users install special-purpose software, while the clientless ones directly run in web browsers. In particular, we conduct extensive experiments in three steps. First, we identify a suite of the most representative native and clientless screen-sharing technologies. Second, we propose a systematic measurement methodology for comparing screen-sharing technologies under diverse and dynamic network conditions using different performance metrics. Last, we conduct extensive experiments and perform in-depth analysis to quantify the performance gap between clientless and native screen-sharing technologies. We found that our WebRTC-based implementation achieves the best overall performance. More precisely, it consumes a maximum of 3 Mbps bandwidth while reaching a high decoding ratio and delivering good video quality. Moreover, it leads to a steadily high decoding ratio and video quality under dynamic network conditions. By presenting the very first rigorous comparisons of the native and clientless screen-sharing technologies, this article will stimulate more exciting studies on the emerging clientless screen-sharing technologies.

Sign in / Sign up

Export Citation Format

Share Document