Skip to main content

A Fuzzy Clustering Method to Minimize the Inter Task Communication Effect for Optimal Utilization of Processor’s Capacity in Distributed Real Time Systems

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 130))

Abstract

A distributed processing System is a collection of heterogeneous processors which requires systematic assignment of a set of “m” tasks T = {t1, t2….tm} of a program to a set of “n” processors P = {p1, p2….pn}, (where, m > > n) to achieve the efficient utilization of available processor’s capacity. If this step is not performed properly, an increase in the number of processors may actually result in a decrease in the total system throughput. The Inter-Task Communication (ITC) time is always the most costly and the least reliable factor in distributed processing environment. This paper deals a heuristic task allocation model which performs the proper allocation of task to most suitable processor to get an optimal solution. A fuzzy membership functions is developed for making the clusters of tasks with the constraints to maximize the throughput and minimize the parallel execution time of the system.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chu, E.W., Lee, D., Iffla, B.: A Distributed processing system for naval data communication networks. In: Proceeding AFIPS Nat. Comput. Conference, vol. 147, pp. 783–793 (1978)

    Google Scholar 

  2. Deng, Z., Liu, J.W., Sun, S.: Dynamic scheduling of hard real-time applications in open system environment, Tech. Rep., University of Illinois at Urbana-Champaign (1993)

    Google Scholar 

  3. Buttazzo, G., Stankovic, J.A.: RED: robust earliest deadline scheduling. In: Proc. 3rd Intl. Workshop Responsive Computing Systems, Lincoln, pp. 100–111 (1993)

    Google Scholar 

  4. Petters, S.M.: Bounding the execution time of real-time tasks on modern processors. In: Proc. 7th Intl. Conf. Real-Time Computing Systems and Applications, Cheju Island, pp. 498–502 (2000)

    Google Scholar 

  5. Zhu, J., Lewis, T.G., Jackson, W., Wilson, R.L.: Scheduling in hard real-time applications. IEEE Softw. 12, 54–63 (1995)

    Google Scholar 

  6. Taewoong, K., Heonshik, S., Naehyuck, C.: Scheduling algorithm for hard real-time communication in demand priority network. In: Proc. 10th Euromicro Workshop Real-Time Systems, Berlin, Germany, pp. 45–52 (1998)

    Google Scholar 

  7. Liu, C.L., Layland, J.W.: Scheduling algorithms for multi-programming in a hard-real-time environment. J. ACM 20, 46–61 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  8. Babbar, D., Krueger, P.: On-line hard real-time scheduling of parallel tasks on partitionable multiprocessors. In: Proc. Intl. Conf. Parallel Processing, pp. 29–38 (1994)

    Google Scholar 

  9. Lifeng, W., Haibin, Y.: Research on a soft real-time scheduling algorithm based on hybrid adaptive control architecture. In: Proc. American Control Conf., Lisbon, Portugal, pp. 4022–4027 (2003)

    Google Scholar 

  10. Dar-Tzen, P., Shin, K.G., Abdelzaher, T.F.: Assignment and Scheduling Communicating Periodic Tasks in Distributed Real-Time Systems. IEEE Transactions On Software Engineering 23(12), 745–758 (1997)

    Article  Google Scholar 

  11. Chiang, T.-C., Chang, P.-Y., Huang, Y.-M.: Multi-Processor Tasks with Resource and Timing Constraints Using Particle Swarm Optimization. IJCSNS International Journal of Computer Science and Network Security 6(4), 71–77 (2006)

    Google Scholar 

  12. Heiss, H.-U., Schmitz, M.: Decentralized Dynamic Load Balancing: The Particles Approach. Information Sciences 84(2), 115–128 (1995)

    Article  Google Scholar 

  13. Elsadek, A.A., Earl Wells, B.: A Heuristic model for task, allocation in heterogeneous distributed computing systems. The International Journal of Computers and Their Applications 6(1), 1–36 (1999)

    Google Scholar 

  14. Page, A.J., Naughton, T.J.: Framework for task scheduling in heterogeneous distributed computing using genetic algorithms. In: 5th Artificial Intelligence and Cognitive Science Conference, Ireland, pp. 137–146 (2004)

    Google Scholar 

  15. Page, A.J., Naughton, T.J.: Dynamic task scheduling using genetic algorithms for heterogeneous distributed computing. In: Proceedings of the 19th Dynamic Task Scheduling with Load 487 IEEE/ACM International Parallel and Distributed Processing Symposium, Denver, USA, pp. 1530–2075 (2005)

    Google Scholar 

  16. Wu Annie, S., Yu, H., Jin, S., Lin, K.-C., Schiavone, G.: An Incremental Genetic Algorithm Approach to Multiprocessor Scheduling. IEEE Transactions on Parallel and Distributed Systems 15(9), 824–834 (2004)

    Article  Google Scholar 

  17. Zomaya, A.Y., Teh, Y.H.: Observations on using genetic algorithms for dynamic load-balancing. IEEE Transactions on Parallel and Distributed Systems 12(9), 899–911 (2001)

    Article  Google Scholar 

  18. Edwin, S.H., Hou, N.A., Hong, R.: A genetic algorithm for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems 5(2), 113–120 (1994)

    Article  Google Scholar 

  19. Manimaran, G., Siva Ram Murthy, C.: A Fault-Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real-Time Systems and Its Analysis. IEEE Transactions on Parallel and Distributed Systems 9(11), 1137–1152 (1998)

    Article  Google Scholar 

  20. Chen, R.-M., Huang, Y.-M.: Multiprocessor Task Assignment with Fuzzy Hopfield Neural Network Clustering Techniques. Journal of Neural Computing and Applications 10(1), 12–21 (2001)

    Article  Google Scholar 

  21. Yadav, P.K., Singh, M.P., Kumar, H.: Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with dynamic Reassignment. Journal of Computer System, Network and Communication, 1–9 (2008)

    Google Scholar 

  22. Yang, C., Simon, D.: A new particle swarm optimization technique. In: Proceedings of the International Conference on Systems Engineering, pp. 164–169 (2005)

    Google Scholar 

  23. Van Den Bergh, F., Engelbrecht, A.P.: A study of particle swarm optimization particle trajectories. Information Sciences, 937–997 (2006)

    Google Scholar 

  24. Yadav, P.K., Singh, M.P., Sharma, K.: Task Allocation Model for Reliability and Cost Optimization in Distributed Computing System. International Journal of Modelling, Simulation and Scientific Computing (IJMSSC) 2(2), 1–19 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. K. Yadav .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer India Pvt. Ltd.

About this paper

Cite this paper

Yadav, P.K., Pradhan, P., Singh, P.P. (2012). A Fuzzy Clustering Method to Minimize the Inter Task Communication Effect for Optimal Utilization of Processor’s Capacity in Distributed Real Time Systems. In: Deep, K., Nagar, A., Pant, M., Bansal, J. (eds) Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011. Advances in Intelligent and Soft Computing, vol 130. Springer, India. https://doi.org/10.1007/978-81-322-0487-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-0487-9_16

  • Published:

  • Publisher Name: Springer, India

  • Print ISBN: 978-81-322-0486-2

  • Online ISBN: 978-81-322-0487-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics