Comparison of Polling Disciplines When Analyzing Waiting Time for Signaling Message Processing at SIP-Server

2015 ◽  
pp. 358-372 ◽  
Author(s):  
Yuliya Gaidamaka ◽  
Elvira Zaripova
Keyword(s):  
Waiting Time ◽  
Message Processing ◽  
Sip Server

Predictors of waiting time for liver TX: A three-year experience

2001 ◽  
Vol 120 (5) ◽  
pp. A370-A370
Author(s):  
C BOBROWSKI ◽  
H GHADIMPOOR ◽  
M STENECK ◽  
X ROGIERS ◽  
C BROELSCH ◽  
...  
Keyword(s):  
Waiting Time

A two unit standby redundant system with standby failure and repair waiting time

Optimization ◽  
1973 ◽  
Vol 4 (6) ◽  
pp. 453-462
Author(s):  
L. Cunningham ◽  
N. Singh
Keyword(s):  
Waiting Time ◽  
Redundant System

Effects of Waiting Time on Treatment Engagement

2014 ◽  
Author(s):  
A.M.L. Westin ◽  
C.L. Barksdale ◽  
S.H. Stephan
Keyword(s):  
Waiting Time ◽  
Treatment Engagement

Attitude Ambivalence and Message Processing: The Moderating Role of Message Position

2007 ◽  
Author(s):  
Jason K. Clark ◽  
Duane T. Wegener ◽  
Leandre R. Fabrigar
Keyword(s):  
Message Processing ◽  
Moderating Role

Superfast TB test slashes waiting time

Nature ◽  
2010 ◽  
Author(s):  
Apoorva Mandavilli
Keyword(s):  
Waiting Time

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document