Impacts of Scheduling Algorithms in Services on Collective End-to-End Execution Time Characteristics of Web Service Workflows

2013 ◽  
Author(s):  
Xiang Li ◽  
Yushun Fan ◽  
Le Xin ◽  
Keman Huang ◽  
Yihang Luo ◽  
...  
Keyword(s):  
Web Service ◽  
Execution Time ◽  
Scheduling Algorithms ◽  
End To End

QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

Accelerating Web Service Workflow Execution via Intelligent Allocation of Services to Servers

2010 ◽  
Vol 21 (4) ◽  
pp. 60-90 ◽  
Author(s):  
Konstantinos Stamkopoulos ◽  
Evaggelia Pitoura ◽  
Panos Vassiliadis ◽  
Apostolos Zarras
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Provider ◽  
Execution Time ◽  
Load Distribution ◽  
Greedy Algorithms ◽  
Critical Role ◽  
Service Operations ◽  
Workflow Execution ◽  
Provision Of Services

The appropriate deployment of web service operations at the service provider site plays a critical role in the efficient provision of services to clients. In this paper, the authors assume that a service provider has several servers over which web service operations can be deployed. Given a workflow of web services and the topology of the servers, the most efficient mapping of operations to servers must then be discovered. Efficiency is measured in terms of two cost functions that concern the execution time of the workflow and the fairness of the load distribution among the servers. The authors study different topologies for the workflow structure and the server connectivity and propose a suite of greedy algorithms for each combination.

Demystifying the Placement Policies of the NVIDIA GPU Thread Block Scheduler for Concurrent Kernels

2021 ◽  
Vol 48 (3) ◽  
pp. 81-88
Author(s):  
Guin Gilman ◽  
Samuel S. Ogden ◽  
Tian Guo ◽  
Robert J. Walls
Keyword(s):  
Resource Availability ◽  
Execution Time ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Performance Degradation ◽  
Thread Block ◽  
Local Resource ◽  
Scheduling Policy ◽  
Nvidia Gpu ◽  
Placement Policies

In this work, we empirically derive the scheduler's behavior under concurrent workloads for NVIDIA's Pascal, Volta, and Turing microarchitectures. In contrast to past studies that suggest the scheduler uses a round-robin policy to assign thread blocks to streaming multiprocessors (SMs), we instead find that the scheduler chooses the next SM based on the SM's local resource availability. We show how this scheduling policy can lead to significant, and seemingly counter-intuitive, performance degradation; for example, a decrease of one thread per block resulted in a 3.58X increase in execution time for one kernel in our experiments. We hope that our work will be useful for improving the accuracy of GPU simulators and aid in the development of novel scheduling algorithms.

scholarly journals An efficient scheduling framework for improving QoS in web service composition

2018 ◽  
Vol 7 (1.9) ◽  
pp. 107
Author(s):  
T N.Aruna ◽  
Dr Vijivinod
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Execution Time ◽  
Web Service Composition ◽  
Social Spider ◽  
Business World ◽  
The Social ◽  
Social Spider Algorithm ◽  
Productive Method

Proficient QoS-based web service determination from the various number of practically substitutable web service to convey complex undertakings are a present call from the business world. QoS-based web service’s determination is a multi-target improvement issue. Current methodologies like FCFS, Priority and Multi-queue to explain it. Be that as it may, the execution time of QoS-based web services choice to accomplish the most extreme wellness esteem is as yet a worry for handy circulated applications. This paper proposes a productive method to take care of this issue utilizing the Social Spider Algorithm (SSA).

Sign in / Sign up

Export Citation Format

Share Document