CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Performance Intensification of DRTS under Static Load Sharing Scheme

by Urmani Kaushal, Avanish Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 71 - Number 16
Year of Publication: 2013
Authors: Urmani Kaushal, Avanish Kumar
10.5120/12446-9204

Urmani Kaushal, Avanish Kumar . Performance Intensification of DRTS under Static Load Sharing Scheme. International Journal of Computer Applications. 71, 16 ( June 2013), 55-59. DOI=10.5120/12446-9204

@article{ 10.5120/12446-9204,
author = { Urmani Kaushal, Avanish Kumar },
title = { Performance Intensification of DRTS under Static Load Sharing Scheme },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 71 },
number = { 16 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 55-59 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume71/number16/12446-9204/ },
doi = { 10.5120/12446-9204 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:35:47.469575+05:30
%A Urmani Kaushal
%A Avanish Kumar
%T Performance Intensification of DRTS under Static Load Sharing Scheme
%J International Journal of Computer Applications
%@ 0975-8887
%V 71
%N 16
%P 55-59
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Distributed Real Time System (DRTS) provides enormous platform for parallel applications. It is an alternative for highly expensive parallel machines. Task allocation for parallel applications over it, is a crucial phase where strategy for task allocation should be chosen to maximize the throughput and enhance the overall processor utilization. Task allocation is NP-hard or NP-complete problem. A new heuristic for this problem has been suggested and implemented in this paper. To achieve this goal, tasks should be clustered in such a way that it can minimize the inter-task communication cost as well as it must also be taken care that the execution cost of tasks must also be minimum over the processor where the tasks are going to get assigned. Here k-mean clustering has been used to cluster the tasks in the required number of clusters. The proposed model has been simutated in matlab.

References
  1. C. J. Hou, K. G. Shin, "Load sharing with consideration of future task arrivals in heterogeneous real time systems", In proceedings of the IEEE 13th Real Time Systems Symposium, 1992, pp 146-155.
  2. Kopetz, H. (1997). REAL-TIME SYSTEMS: Design Principles for Distributed Embedded Applications. Kluwer Academic Puplishers .
  3. Z. Zeng and V. Bharadwaj, "Design and Performance Evaluation of Queue-and-Rate-Adjustment Dynamic Load Balancing Policies for Distributed Networks", IEEE Trans. On Computers, vol. 55, no. 11, pp. 1410-1422, November 2006.
  4. Pereng-yi RICHARD MA, Edward Y. S. LEE, Masahiro TSUCHIYA, "A Task Allocation Model for Distributed Computing Systems", IEEE Trans. on Computers, Vol. C-31, No. 1, January 1982, pp. 41-47.
  5. Chien-Chung Shen, Wen-Hsiang Tsai, "A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems using a Minimax Criterion", IEEE Trans. on Computers, Vol. C-34, No. 3, March 1985, pp. 197-203.
  6. Wesley W Chu, Lance M. T. Lan, "Task Allocation and Precedence Relations for Distributed Real Time Systems", IEEE Trans. on Computers, Vol. C-36, No. 6, June 1987, pp. 667-679.
  7. C. Siva Ram Murthy, K. N. Balsubramaniya Murthy, A. Sreenivas, "Scheduling of Precedence-Constrained Parallel Program Tasks on Multiprocessors", Microprocessing and Microprogramming, Vol. 36, 1992/93, pp. 93-104.
  8. GamalAttiya, YskandarHamam, "Task allocation for maximizing reliability of distributed systems: A simulated annealing approach", J. Parallel Distrib. Comput. 66 (2006) 1259 – 1266.
  9. D. P. Vidyarthi, A. K. Tripathi, "Precedence Constrained Task Allocation in Distributed Computing System", Int. J. of High Speed Computing, Vol. 8, No. 1, 1996, pp. 47-55.
  10. S. Karthik, C. Siva Ram Murthy, " Improved Task Allocation Algorithms to Maximize Reliability of Redundant Distributed Systems", IEEE Trans. on Reliability, Vol. 44, No. 4, Dec. 1995, pp. 575-586.
  11. P. K. Yadav, M. P. Singh, Kuldeep Sharma, "An Optimal Task Allocation Model for Sustem Cost Analysis in Heterogeneous Distributed Computing Systems: A Heuristic Approach", International Journal of Computer Applications, Vol. 28, No. 4, August 2011.
  12. A. Kumar, M. P. Sing, P. K. Yadav, "A Fast Algorithm for Allocating Tasks in Distributed Processing System", Proceedings of the 30th Annual Convention of CSI, Hyderabad, (1995), 347-358.
  13. Aravind H, C Rajgopal, K P Soman, "A Simple Approach to Clustering in Excel", International Journal of Computer Applications, Vol. 11, No. 7, December 2010.
  14. AnuragRaii, VikramKapoor, "Efficient Clustering Model for Utilization of Processor's Capacity in Distributed Computing System", International Journal of Computer Applications, Vol. 44, No. 23, April 2012.
  15. KapilGovil, Avanish Kumar "A Modified and Efficient Algorithm for Static Task Assignment in Distributed Processing Environment", International Journal of Computer Applications, Vol. 23, No. 8, June 2011.
Index Terms

Computer Science
Information Sciences

Keywords

DRTS parallel application throughput processer utilization NP-complete

Powered by PhDFocusTM