Skip to main content

Dynamic Clustering of Tasks and DCS for Multiple Task Allocation

  • Chapter
New Horizons of Parallel and Distributed Computing

Abstract

This paper describes how the allocation of stream of tasks, with minimum knowledge, is possible in a distributed computing system. In literature, almost all the task allocation models in a distributed computing system require a priori knowledge of tasks execution time, communication time etc. on the processing nodes. Since the task assignment is not known in advance, this time is difficult to estimate. A cluster-based dynamic allocation scheme is proposed for both the distributed computing system and the tasks that eliminate the execution time requirement. Further, as opposed to a single task, multiple tasks are considered for allocation by the model. For both the task clustering and processor clustering a fuzzy function is used. Clustering and assignment process is used dynamically as it suits the stochastic stream of incoming tasks. Experimental validate the efficacy of the proposed model.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vidyarthi D P, Tripathi A K (1996) Precedence Constrained Task Allocation in Distributed Computing Systems. Int J of High Speed Computing 8(l):47–55

    Article  Google Scholar 

  2. Vidyarthi D P, Tripathi A K, Mantri A N (1996) A Genetic Task Allocation Algorithm for Distributed Computing System Incorporating Problem Specific Knowledge. Int J of High Speed Computing 8(4):363–370

    Article  Google Scholar 

  3. Tripathi A K, Sarker B K, Kumar N, Vidyarthi D P (2000) Multiple Task Allocation with Load Consideration. Int J of Inform and Comp Sci 3(l):36–44

    Google Scholar 

  4. Kafil M, Ahmed I (1998) Optimal Task Assignment in Heterogeneous Distributed Computing System. IEEE Concurrency, July–September:42–51

    Google Scholar 

  5. Chu W W, Lan L T (1987) Task Allocation and Precedence Relations for Distributed Real Time Systems. IEEE Trans. Computers C-36(6):667–679

    Google Scholar 

  6. Shatz S M, Wang J P, Goto M (1992) Task Allocation for Maximizing Reliability of Distributed Computer Systems, IEEE Trans, on Computer 41(9): 1156–1168

    Article  Google Scholar 

  7. Efe K (1982) Heuristic Models of Task Assignment Scheduling in Distributed Systems. IEEE Computer June:50–56

    Google Scholar 

  8. Vidyarthi D P, Tripathi A K (1998) A Fuzzy IMC Cost Reduction Model for Task Allocation in Distributed Computing Systems. In: proc. Fifth Int Sym on Methods and Models in Automation and Robotics, Poland, August:719–721

    Google Scholar 

  9. Abdelzaher T F, Shin K G (2000) Period-Based Load Partitioning and Assignment for Large Real-Time Applications. IEEE Tran on Computers 49(1):81–87

    Article  Google Scholar 

  10. Peng D T, Shin K G (1989) Static Allocation of Periodic Task with Precedence. In: Proc. Int Conf Distributed Computing Systems, June:190–198

    Google Scholar 

  11. Hou C J, Shin K G (1994) Replication and Allocation of Task Modules in Distributed Real Time Systems. ln:Proc. 24th IEEE Symp Fault Tolerant Computing Systems, June:26–35

    Google Scholar 

  12. Shukla S B, Agrawal D P (1994) A Framework for Mapping Periodic Real Time Applications on Multicomputers. IEEE Tran on Para and Dist Systems 5(7):778–784

    Article  Google Scholar 

  13. Oh Y, Son S H (1995) Scheduling Hard Real-Time Tasks with Tolerance to Multiple Processor Failures. Multiprocessing and Multiprogramming 40:193–206

    Article  Google Scholar 

  14. Tia T S, Liu J W S (1995) Assigning Real Time Tasks and Resources to Distributed Systems. Int J Mini and Microcomputer 17(1):18–25

    Google Scholar 

  15. Wu S S, Sweeping D (1994) Heuristic Algorithms for Task Assignment and Scheduling in a Processor Network. Parallel Computing 20:1–14

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Vidyarthi, D.P., Tripathi, A.K., Sarker, B.K., Yang, L.T. (2005). Dynamic Clustering of Tasks and DCS for Multiple Task Allocation. In: Guo, M., Yang, L.T. (eds) New Horizons of Parallel and Distributed Computing. Springer, Boston, MA. https://doi.org/10.1007/0-387-28967-4_9

Download citation

  • DOI: https://doi.org/10.1007/0-387-28967-4_9

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-24434-1

  • Online ISBN: 978-0-387-28967-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics