gang scheduling
Recently Published Documents


TOTAL DOCUMENTS

79
(FIVE YEARS 7)

H-INDEX

18
(FIVE YEARS 0)

Author(s):  
Krishan Kumar ◽  
Renu

Multithreading is ability of a central processing unit (CPU) or a single core within a multi-core processor to execute multiple processes or threads concurrently, appropriately supported by operating system. This approach differs from multiprocessing, as with multithreading processes & threads have to share resources of a single or multiple cores: computing units, CPU caches, & translation lookaside buffer (TLB). Multiprocessing systems include multiple complete processing units, multithreading aims to increase utilization of a single core by using thread-level as well as instruction-level parallelism. Objective of research is increase efficiency of scheduling dependent task using enhanced multithreading. gang scheduling of parallel implicit-deadline periodic task systems upon identical multiprocessor platforms is considered. In this scheduling problem, parallel tasks use several processors simultaneously. first algorithm is based on linear programming & is first one to be proved optimal for considered gang scheduling problem. Furthermore, it runs in polynomial time for a fixed number m of processors & an efficient implementation is fully detailed. Second algorithm is an approximation algorithm based on a fixed-priority rule that is competitive under resource augmentation analysis in order to compute an optimal schedule pattern. Precisely, its speedup factor is bounded by (2?1/m). Both algorithms are also evaluated through intensive numerical experiments. In our research we have enhanced capability of Gang Scheduling by integration of multi core processor & Cache & make simulation of performance in MATLAB.


2021 ◽  
Author(s):  
Waqar Ali ◽  
Rodolfo Pellizzoni ◽  
Heechul Yun
Keyword(s):  

2019 ◽  
Vol 8 (2) ◽  
pp. 2459-2462

This paper focuses on the job scheduling in cloud environment. Here the task has been scheduled in cloud and fog. Cloud provides services to heavy application while fog provides service to lighter application. The job scheduler would be helpful to reduce burden of cloud and help in energy optimization. The jobs are scheduled according to their types and priority. Various job scheduling algorithm such as gang scheduling, FCFS and round robin mechanism have been discussed in this research for load balancing and improve the compilation time. The simulation has been made using Matlab on virtual machines.


Author(s):  
K. M. Al-Aubidy ◽  
K. Batiha ◽  
H. Y. Al-Kharbshh

IJARCCE ◽  
2017 ◽  
Vol 6 (3) ◽  
pp. 373-377 ◽  
Author(s):  
Swati Dwivedi ◽  
Anand Muni Mishra

Sign in / Sign up

Export Citation Format

Share Document