Implementation on introducing upgraded gang scheduling algorithm
Keywords:
Parallel processingAbstract
In computers, parallel processing is processing of program instructions by dividing them among multiple processors with objective of running a program in less time. In this paper we have explain to speed up processing by introducing concept of cache & ram & customization of existing algorithm to provide additional support. We have study to simulation of enhanced gang scheduling algorithm with additional parameters & also make comparative analysis traditional & proposed Methods.
References
Yeh-Ching Chung wrote on 2006 “Performance Analysis & Applications of A Compile-Time Optimization Approach for List Scheduling Algorithms on Distributed
Memory Multiprocessors”
Ishfaq Ahmad1 wrote on 2008 “On Parallelizing Multiprocessor Scheduling Problem”
Maruf Ahmed wrote on 2009 Scheduling Algorithms for Distributed Memory Systems within Improved Time Complexity
Wayne F. Boyer wrote on 2010 “Non evolutionary algorithm for scheduling dependent tasks within distributed heterogeneous computing environments”
A research titled “Chip Multithreading: Opportunities & Challenges” by Lawrence Spracklen on 2012
Rajeev Garg, Ali El-Moursy authored research on 2012 “Partitioning Multi Threaded Processors using Large Number of Threads”
