Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Duplication with Task Assignment in Mesh Distributed System

  • Sharma, Rashmi (Department of Computer Science and Information Technology, Jaypee University of Information Technology) ;
  • Nitin, Nitin (Department of Computer Science and Information Technology, Jaypee University of Information Technology)
  • Received : 2013.03.06
  • Accepted : 2014.03.31
  • Published : 2014.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Load balancing is the major benefit of any distributed system. To facilitate this advantage, task duplication and migration methodologies are employed. As this paper deals with dependent tasks (DAG), we used duplication. Task duplication reduces the overall schedule length of DAG along-with load balancing. This paper proposes a new task duplication algorithm at the time of tasks assignment on various processors. With the intention of conducting proposed algorithm performance computation; simulation has been done on the Netbeans IDE. The mesh topology of a distributed system is simulated at this juncture. For task duplication, overall schedule length of DAG is the main parameter that decides the performance of a proposed duplication algorithm. After obtaining the results we compared our performance with arbitrary task assignment, CAWF and HEFT-TD algorithms. Additionally, we also compared the complexity of the proposed algorithm with the Duplication Based Bottom Up scheduling (DBUS) and Heterogeneous Earliest Finish Time with Task Duplication (HEFT-TD).

Keywords

References

  1. L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network," IEEE Transactions on Computers, vol. C-33, no. 4, pp. 323-333, 1984.
  2. D. Bozdag, U. Catalyurek, and F. Ozguner, "A task duplication based bottom-up scheduling algorithm for heterogeneous environments," in Proceedings of the 20th International Parallel and Distributed Processing Symposium, Rhodes Island, Greece, 2006.
  3. Y. Jegou, "Runtime support for task migration on distributed memory architectures," in Proceedings of the 11th International Conference on Parallel Processing Symposium, Geneva, Switzerland, 1997.
  4. J. M. Lopez, M. Garcia, J. L. Diaz, and D. F. Garcia, "Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems," in Proceedings of the 12th Euromicro Conference on Real-Time Systems, Stockholm, Sweden, 2000, pp. 25-33.
  5. A. Burchard, J. Liebeherr, O. Yingfeng, and S. H. Son, "New strategies for assigning real-time tasks to multiprocessor systems," IEEE Transactions on Computers, vol. 44, no. 12, pp. 1429-1442, 1995. https://doi.org/10.1109/12.477248
  6. C. Wang, "Dynamic voltage scaling for priority-driven scheduled distributed real-time systems," Ph.D. dissertation, University of Kentucky, Lexington, KY, 2007.
  7. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, "Approximation algorithms for bin packing: a survey," in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum, Ed. Boston, MA: PWS Pub. Co., 1997, pp. 46-93.
  8. A. Bashiry, S. A. Madaniy, J. H. Kazmiy, and K. Qureshix, "Task partitioning and load balancing strategy for matrix applications on distributed system," Journal of Computers, vol. 8, no. 3, pp. 576-584, 2013.
  9. J. Baxter and J. H. Patel, "The LAST algorithm: a heuristic-based static task allocation algorithm," in Proceedings of the 1989 International Conference on Parallel Processing, University Park, PA, 1989, pp. 217-222.
  10. B. Kruatrachue and T. Lewis, "Grain size determination for parallel processing," IEEE Software, vol. 5, no. 1, pp. 23-32, 1988.
  11. P. Chaudhuri and J. Elcock, "Process scheduling in heterogeneous multiprocessor systems using task duplication," International Journal of Business Data Communications and Networking, vol. 6, no. 1, pp. 58-69, 2010. https://doi.org/10.4018/jbdcn.2010010104
  12. S. Ranaweera and D. P. Agrawal, "A task duplication based scheduling algorithm for heterogeneous systems," in Proceedings of the 14th International Parallel and Distributed Processing Symposium, Cancun, Mexico, 2000, pp. 445-450.
  13. S. Ranaweera and D. P. Agrawal, "A scalable task duplication based scheduling algorithm for heterogeneous systems," in Proceedings of the International Conference on Parallel Processing, Toronto, Canada, 2000, pp. 383-390.
  14. J. Singh and H. Singh, "Efficient tasks scheduling for heterogeneous multiprocessor using genetic algorithm with node duplication," Indian Journal of Computer Science and Engineering, vol. 2, no. 3, pp. 402-410, 2011.
  15. R. Sharma and N. Nitin, "Duplication with task assignment in mesh distributed system," in World Congress on Information and Communication Technologies, Mumbai, India, 2011, pp. 672-676.
  16. E. G. Coffman, Jr., G. Galambos, S. Martello, and D. Vigo, "Bin packing approximation algorithms: combinatorial analysis," in Handbook of Combinatorial Optimization, D. Du and P. M. Pardalos, Eds. Boston, MA: Kluwer Academic Publishers, 1998, pp. 151-207.
  17. V. M. Lo, "Heuristic algorithms for task assignment in distributed systems," IEEE Transactions on Computers, vol. 37, no. 11, pp. 1384-1397, 1988. https://doi.org/10.1109/12.8704

Cited by

  1. Multi-WSN Simulator with Log Data for Efficient Sensing on Internet of Things vol.11, pp.7, 2015, https://doi.org/10.1155/2015/348682
  2. Byzantine-resilient dual gossip membership management in clouds 2017, https://doi.org/10.1007/s00500-017-2553-3
  3. Distributed dynamic target tracking method by block diagonalization of topological matrix vol.72, pp.7, 2016, https://doi.org/10.1007/s11227-015-1499-4