CLUSTER-BASED LOAD PARTITIONING AND ALLOCATION IN DISTRIBUTED COMPUTING SYSTEMS

D. Prakash Vidyarthi, A. Kumar Tripathi, and B. Kumer Sarker

References

  1. [1] D.P. Vidyarthi & A.K. Tripathi, Precedence constrained taskallocation in distributed computing systems, InternationalJournal of High Speed Computing, 8 (1), 1996, 47–55. doi:10.1142/S0129053396000045
  2. [2] A.K. Tripathi, D.P. Vidyarthi, & A.N. Mantri, A genetic taskallocation algorithm for distributed computing system incorporating problem specific knowledge, International Journal ofHigh Speed Computing, 8 (4), 1996, 363–370. doi:10.1142/S0129053396000203
  3. [3] M. Kafil & I. Ahmed, Optimal task assignment in heterogeneous distributed computing system, IEEE Concurrency,July–September 1998, 42–51.306
  4. [4] W.W. Chu & L.T. Lan, Task allocation and precedence relationsfor distributed real time systems, IEEE Trans. Computers,C-36 (6), 1987, 667–679. doi:10.1109/TC.1987.1676960
  5. [5] S.M. Shatz, J.P. Wang, & M. Goto, Task allocation formaximizing reliability of distributed computer systems, IEEETrans. on Computer, 41 (9), 1992, 1156–1168. doi:10.1109/12.165396
  6. [6] K. Efe, Heuristic models of task assignment scheduling indistributed systems, IEEE Computer, June 1982, 50–56.
  7. [7] A.K. Tripathi, B.K. Sarker, N. Kumar, & D.P. Vidyarthi,Multiple task allocation with load consideration, InternationalJournal of Information and Computing Science, 3 (1), 2000,36–44.
  8. [8] D.T. Peng & K.G. Shin, Static allocation of periodic taskwith precedence, Proc. Int. Conf. on Distributed ComputingSystems, June 1989,190–198.
  9. [9] C.J. Hou & K.G. Shin, Replication and allocation of taskmodules in distributed real time systems, Proc. 24th IEEESymp. on Fault Tolerant Computing Systems, June 1994, 26–35. doi:10.1109/FTCS.1994.315660
  10. [10] S.B. Shukla & D.P. Agrawal, A framework for mapping periodicreal time applications on multicomputers, IEEE Trans. onParallel and Distributed Systems, 5 (7), 1994, 778–784. doi:10.1109/71.296323
  11. [11] Y. Oh & S.H. Son, Scheduling hard real-time tasks withtolerance to multiple processor failures, Multiprocessing andMultiprogramming, 40, 1995, 193–206. doi:10.1016/0165-6074(94)90085-X
  12. [12] T.S. Tia & J.W.S. Liu, Assigning real time tasks and resourcesto distributed systems, International Journal of Mini andMicrocomputers, 17 (1), 1995, 18–25.
  13. [13] S.S. Wu & D. Sweeping, Heuristic algorithms for task assignment and scheduling in a processor network, Parallel Computing, 20, 1994, 1–14. doi:10.1016/0167-8191(94)90109-0
  14. [14] T.F. Abdelzaher & K.G. Shin, Period–based load partitioningand assignment for large real-time applications, IEEE Trans.on Computers, 49 (1), 2000, 81–87. doi:10.1109/12.822566
  15. [15] D.P. Vidyarthi & A.K. Tripathi, A fuzzy IMC cost reductionmodel for task allocation in distributed computing systems,Proc. 5th Int. Symp. on Methods and Models in Automationand Robotics, Szczecin, Poland, August 1998, 719–721.

Important Links:

Go Back