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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
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
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
Kafil M, Ahmed I (1998) Optimal Task Assignment in Heterogeneous Distributed Computing System. IEEE Concurrency, July–September:42–51
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
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
Efe K (1982) Heuristic Models of Task Assignment Scheduling in Distributed Systems. IEEE Computer June:50–56
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
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
Peng D T, Shin K G (1989) Static Allocation of Periodic Task with Precedence. In: Proc. Int Conf Distributed Computing Systems, June:190–198
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
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
Oh Y, Son S H (1995) Scheduling Hard Real-Time Tasks with Tolerance to Multiple Processor Failures. Multiprocessing and Multiprogramming 40:193–206
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
Wu S S, Sweeping D (1994) Heuristic Algorithms for Task Assignment and Scheduling in a Processor Network. Parallel Computing 20:1–14
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)