International Research Journal of Commerce , Arts and Science

 ( Online- ISSN 2319 - 9202 )     New DOI : 10.32804/CASIRJ

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 33    Submit Your Rating     Cite This   Download        Certificate

MULTIPROCESSING SCHEDULING ALGORITHMS WITH THE LOAD SHARING

    1 Author(s):  JUGMENDRA SINGH

Vol -  6, Issue- 11 ,         Page(s) : 43 - 54  (2015 ) DOI : https://doi.org/10.32804/CASIRJ

Abstract

In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. The problem of multiprocessor scheduling may be required for both related and unrelated tasks. The main objective of any multiprocessor scheduling algorithm is to schedule the tasks or jobs in optimized way so that performance of the processors may be optimized. In this paper, we have discussed about multiprocessor scheduling algorithms with the load sharing.

1. Yu-Kwong Kwok, Ishfaq Ahmad, “Static Scheduling Algorithm for Allocating Directed Task Graph to multiprocessors”, ACM Computing Surveys, Vol. 31, no. 4, December 1999.
2. Poonam Panwar, A.K.Lal and Jugminder Singh, “A Genetic Algorithm based Technique for Efficient Scheduling of Tasks on Multiprocessor System”, Advances in Intelligent and Soft Computing, vol 131, pp. 855–861, SPRINGER INDIA, 2012.
3. Garey, Michael R.; Johnson, David S.. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company. p. 238. ISBN 0716710445. Multiprocessor Operating Systems, By Andrew S. Tanenbaum, Mar 22, 2002.
4. Nirmeen A. Bahnasawy, Fatma Omara, Magdy A. Koutb, Mervat Mosa,  “A New Algorithm for Static Task Scheduling For Heterogeneous Distributed Computing Systems”, Volume 1 No. 1, May 2011 International Journal of Information and Communication Technology Research, 2010-11.
5. S. Shivle, R. Castain, H. J. Siegel, A. A. Maciejewski, T. Banka, K. Chindam, S. Dussinger, P. Pichumani, P. Satyasekaan, W. Saylor, D.Sendek, J. Sousa, J. Sridharan, P. Sugavanam, and J. Velazco,“Static mapping of subtasks in a heterogeneous ad hoc grid environment,” Proc. of Parallel and Distributed Processing Symposium, Apr. 2004. 
6. K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability, New York: McGraw-Hill, Inc., 1993. 
7. H. Topcuoglu, S. Hariri, M.Y. Wu,” Performance-Effective and Low Complexity Task Scheduling for Heterogeneous Computing,” IEEE Trans. Parallel Distributed Systems, Vol. 13 (3), pp.260–274, 2005. 
8. Mohammad I. Daoud, Nawwaf Kharma “A High Performance Algorithm For Static Task Scheduling In Heterogeneous Distributed Computing Systems,” IEEE Trans. Parallel Distributed Systems, Vol. 28, pp39-49, July 2007. 
9. Dan McNulty, Lena Olson, Markus Peloquin, “A Comparison of Scheduling Algorithms for Multiprocessors”, December 13, 2010.
10. Liu, C. L., and Layland, J. W. “Scheduling algorithms for multiprogramming in a hard-real -time environment”, Journal of ACM 20, (January 1973), 46–61.
11. Brandenburg, B. B., Calandrino, J. M., and Anderson, J. H. “On the scalability of real- time scheduling algorithms on multicore platforms: A case study”, In IEEE Real-Time Systems Symposium (2008), pp. 157–169.
12. Baruah, S. K., Cohen, N. K., Plaxton, C. G., and Varvel, D. A. Proportionate progress: a notion of fairness in resource allocation. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing (New York, NY, USA, 1993), STOC ’93, ACM, pp. 345–354.
13. Baruah, S. K., Gehrke, J., and Plaxton, C. G. Fast scheduling of periodic tasks on multiple resources. In Proceedings of the 9th International Symposium on Parallel Processing (Washington, DC, USA, 1995), IPPS ’95, IEEE Computer Society, pp. 280–288.
14. Holman, P., and Anderson, J. Adapting Pfair scheduling for symmetric multiprocessors. Journal of Embedded Computing 1 , 4 (2005), 543–564.
15. Cho, H., Ravindran, B., and Jensen, E. D. An optimal real-time scheduling algorithm for multiprocessors. In RTSS ’06: Proceedings of the 27th IEEE International Real-Time Systems Symposium (Washington, DC, USA, 2006), IEEE Computer Society, pp. 101–110.
16. LRE-TL: An Optimal Multiprocessor Scheduling Algorithm for Sporadic Task Sets Shelby Funk and Vijaykant Nadadur.
17. S. K. Baruah, N. Cohen, C. G. Plaxton, and D. Varvel, “Proportionate progress: A notion of fairness in resource allocation,” Algorithmica, vol. 15, no. 6, pp. 600–625, June 1996.
18. H. Cho, B. Ravindran, and E. D. Jensen, “An optimal real-time scheduling algorithm for multiprocessors,” in Proceedings the 27th IEEE Real-Time System Symposium (RTSS), Los Alamitos, CA, 2006, pp. 101 – 110. 
19. C. L. Liu and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard real-  time environment,” Journal of the ACM, vol. 20, no. 1, pp. 46–61, 1973.
20. M. Dertouzos and A. K. Mok, “Multiprocessor scheduling in a hard real-time environment,” IEEE Transactions on Software Engineering, vol. 15, no. 12, pp.1497–1506, 1989.
21. M. Dertouzos, “Control robotics : the procedural control of physical processors,” in Proceedings of the IFIP Congress, 1974, pp. 807–813.
22. D.I. George Amalarethinam, G.J. Joyce Mary, “A new DAG based Dynamic Task Scheduling Algorithm (DYTAS) for Multiprocessor Systems”, International Journal of Computer Applications (0975 – 8887) Volume 19– No.8, April 2011.
23. URL sce.umkc.edu/~cotterr/cs431_sp13
24. Multiprocessor operating system: Andrew S Tanenbaum
25 Robinson, Jacob, and Yahya Rahmat-Samii. "Particle swarm optimization in electromagnetics." Antennas and Propagation, IEEE Transactions on 52, no. 2 (2004): 397-407.
26 Sim, Kwang Mong, and Weng Hong Sun. "Ant colony optimization for routing and loadbalancing: survey and new directions." Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on 33, no. 5 (2003): 560-572.
27 Rolland, Erik, David A. Schilling, and John R. Current. "An efficient tabu search procedure for the p-median problem." European Journal of Operational Research 96, no. 2 (1997): 329-342.
28 Romero, R., R. A. Gallego, and A. Monticelli. "Transmission system expansion planning by simulated annealing." Power Systems, IEEE Transactions on 11, no. 1 (1996): 364-369.
29 Price, W. L. "Global optimization by controlled random search." Journal of Optimization Theory and Applications 40, no. 3 (1983): 333-348

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details