scholarly journals Hybrid EDF Packet Scheduling for Real-Time Distributed Systems

Author(s):  
Tao Qian ◽  
Frank Mueller ◽  
Yufeng Xin
2021 ◽  
Vol 40 (2) ◽  
pp. 65-69
Author(s):  
Richard Wai

Modern day cloud native applications have become broadly representative of distributed systems in the wild. However, unlike traditional distributed system models with conceptually static designs, cloud-native systems emphasize dynamic scaling and on-line iteration (CI/CD). Cloud-native systems tend to be architected around a networked collection of distinct programs ("microservices") that can be added, removed, and updated in real-time. Typically, distinct containerized programs constitute individual microservices that then communicate among the larger distributed application through heavy-weight protocols. Common communication stacks exchange JSON or XML objects over HTTP, via TCP/TLS, and incur significant overhead, particularly when using small size message sizes. Additionally, interpreted/JIT/VM-based languages such as Javascript (NodeJS/Deno), Java, and Python are dominant in modern microservice programs. These language technologies, along with the high-overhead messaging, can impose superlinear cost increases (hardware demands) on scale-out, particularly towards hyperscale and/or with latency-sensitive workloads.


1982 ◽  
Vol 7 (1) ◽  
pp. 11-20 ◽  
Author(s):  
D.M. Berry ◽  
C. Ghezzi ◽  
D. Mandrioli ◽  
F. Tisato

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.


Sign in / Sign up

Export Citation Format

Share Document