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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Reliability Aware Task Scheduling In Wireless Hetrogeneous Systems

by Sonali T. Bodkhe, Anjali R. Mahajan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 140 - Number 8
Year of Publication: 2016
Authors: Sonali T. Bodkhe, Anjali R. Mahajan
10.5120/ijca2016909415

Sonali T. Bodkhe, Anjali R. Mahajan . Reliability Aware Task Scheduling In Wireless Hetrogeneous Systems. International Journal of Computer Applications. 140, 8 ( April 2016), 20-26. DOI=10.5120/ijca2016909415

@article{ 10.5120/ijca2016909415,
author = { Sonali T. Bodkhe, Anjali R. Mahajan },
title = { Reliability Aware Task Scheduling In Wireless Hetrogeneous Systems },
journal = { International Journal of Computer Applications },
issue_date = { April 2016 },
volume = { 140 },
number = { 8 },
month = { April },
year = { 2016 },
issn = { 0975-8887 },
pages = { 20-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume140/number8/24614-2016909415/ },
doi = { 10.5120/ijca2016909415 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:41:43.918604+05:30
%A Sonali T. Bodkhe
%A Anjali R. Mahajan
%T Reliability Aware Task Scheduling In Wireless Hetrogeneous Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 140
%N 8
%P 20-26
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A distributed operating system is one that looks to its user like an ordinary centralized operating system, but runs on multiple, independent nodes. A distributed operating system should: control resource allocation to allow their use in the most effective way; provide the user with a convenient virtual computer that serves as a high-level programming environment; hide the distribution of the resources; provide mechanisms for protecting system resources against access by unauthorized users. The main purpose of this research is to explore and use the idle resources and to share the wireless distributed system fairly among the processes. Reliability is taken into account to achieve the goal of scheduling. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that proposed scheduling algorithm can achieve reliable task scheduling and improves system reliability significantly. For experimental performance study, a real world application as well as synthetic workloads have been considered. It can be stated that shortening scheduling times improves performance of the system. Hence if scheduling algorithms are applied in parallel to reduce scheduling times, the performance of the heterogeneous clusters will be further enhanced.

References
  1. T. F. Abdelzaher and K.G. Shin, “Combined Task and Message Scheduling in Distributed Real-Time Systems,” IEEE Trans. Parallel and Distributed Systems, Vol. 10, No. 11, Nov. 1999.
  2. I. D. Baev, W.M. Meleis, A. Eichenberger, “Lower bounds on precedence-constrained scheduling for parallel machines,” Proc. the 29th Int’l Conf. Parallel Processing, pp.549-553, 2000.
  3. O. Beaumont, V. Boudet and Y. Robert, “A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors,” Proc. 11th Heterogeneous Compting Workshop, 2002.
  4. O. Beaumont, A. Legrand, and Y. Robert, ENS Lyon, L. Carter and J. Ferrante, “Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms”, Proc. Int’l Parallel and Distributed Processing Symp., 2002.
  5. M. Cosnard, E. Jeannot and T. Yang, “SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multimachines,” Proc. 28th Int’l Conf. Parallel Processing, Fukushima, Japan, 1999.
  6. A. Doğan, F. Özgüner, “Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing,” Proc. Int’l Conf. Parallel Processing, pp. 307-314, 2000.
  7. Xiao Qin , Hong Jiang , “A Dynamic and Reliability-Driven Scheduling Algorithm for Parallel Real-time Jobs on Heterogeneous Clusters” at Department of Computer Science, New Mexico Institute of Mining and Technology.
  8. E.N. Huh, L.R. Welch, B.A. Shirazi and C.D. Cavanaugh,“Heterogeneous Resource Management for Dynamic Real-Time Systems,” Proc. 9th Heterogeneous Computing Workshop, pp. 287-296, 2000.
  9. M. Iverson and F. Özgüner, “Dynamic, Competitive Scheduling of Multiple DAGs in a Distributed Heterogeneous environment,” Proc. the 7th Heterogeneous Computing Workshop, pp.70-78, 1998.
  10. V. Kalogeraki, P.M. Melliar-Smith, L.E. Moser, “Dynamic scheduling for soft real-time distributed object systems,” Proc. IEEE Int’l Symp. Object-Oriented Real-Time Distributed Computing, pp.114-116, 2000.
  11. D. Kebbal, E.G Talbi, and J.M Geib, “Building and scheduling parallel adaptive applications in heterogeneous environments,” Proc. IEEE Int’l Workshop Cluster Computing, pp.195-201, 1999.
  12. Y. K. Kwok and I. Ahmad, “FASTEST: A Practical Low-Complexity Algorithm for Compile-Time Assignment of Parallel Programs to Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, Vol.10, No. 2, pp. 147-159, Feb. 1999.
  13. T. Lundqvist and P. Stenstrom, “Timing anomalies in dynamically scheduled micromachines,” Proc. IEEE Real-Time Systems Symp., pp.12-21, 1999.
  14. M. Maheswaran and H.J. Siegel, “A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems,” Proc. the 7th Heterogeneous Computing Workshop, pp.57-69, 1998.
  15. G. Manimaran and C.S.R Murthy, “An Efficient Dynamic Scheduling Algorithm for Multimachine Real-Time Systems,” IEEE Trans. Parallel and Distributed System, Vol. 9, No. 3, pp. 312-315, 1998.
  16. J.C. Palencia, and H.M. Gonzalez, “Schedulability analysis for tasks with static and dynamic offsets,” Proc. IEEE Real-Time Systems Symp., pp.26-37, 1998.
  17. A. Palis, “Online Real-Time Job Scheduling with Rate of Progress Guarantees," Proc. 6th Int’l Symp. Parallel Architectures, Algorithms, and Networks, Manila, Philippines, pp. 65-70, 2002.
  18. X. Qin, H. Jiang, C.S. Xie, and Z.F. Han, “Reliability-driven scheduling for real-time tasks with precedence constraints in heterogeneous distribute systems,” Proc. Int’l Conf. Parallel and Distributed Computing and Systems 2000.
  19. X. Qin and H. Jiang, “Dynamic, Reliability-driven Scheduling of Parallel Real-time Jobs in Heterogeneous Systems,” Proc. Int’l Conf.Parallel Processing, Valencia, Spain, pp.113-122, 2001.
  20. X. Qin, H. Jiang, D. R. Swanson, "An Efficient Fault-tolerant Scheduling Algorithm for Real-time Tasks with Precedence Constraints in Heterogeneous Systems," Proc. Int’l Conf. Parallel Processing,Vancouver, Canada, pp. 360-368, 2002.
  21. Radulescu, A.J.C van Gemund, “Fast and effective task scheduling in heterogeneous systems,” Proc. Euromicro Conf. Real-Time Systems, pp.229-238, 2000.
  22. S. Ranaweera, D.P. Agrawal, “Scheduling of Periodic Time Critical Applications for Pipelined Execution on Heterogeneous systems,” Proc. Int’l Conf. Parallel Processing, pp. 131 –138, 2001.
  23. S. Sahni and G. Vairaktarakis, “Scheduling for distributed computing,”Proc. IEEE Workshop Future Trends of Distributed Computing Systems, pp. 284-289, 1997.
  24. R.M. Santos, J. Santos, and J. Orozco, “Scheduling heterogeneous multimedia servers: different QoS for hard, soft and non real-time clients,” Proc. Euromicro Conf. Real-Time Systems, pp.247-253, 2000.
  25. Shirazi, H.Y. Youn, and D. Lorts, "Evaluation of Static Scheduling Heuristics for Real-Time Multiprocessing," Parallel Processing Letters, Vol. 5, No. 4, pp. 599-610, 1995.
  26. G.C.Sih and E.A.Lee, “A Compile-Time Scheduling heuristic for Interconnection-Constrained Heter-ogeneous Machine Architectures,” IEEE Trans. Parallel and Distributed Systems, 4(2), pp.175-187, 1993.
  27. S. Srinivasan, and N.K. Jha, “Safty and Reliability Driven Task Allocation in Distributed Systems,” IEEE Trans. Parallel and Distributed Systems, 10(3), pp. 238-251, 1999.
  28. X.Y. Tang, S.T. Chanson, “Optimizing static job scheduling in a network of heterogeneous computers,” Proc. Int’l Conf. Parallel Processing, pp. 373-382, 2000.
  29. M.E. Thomadakis and Jyh-Charn Liu, “On the efficient scheduling of non-periodic tasks in hard real-time systems,” Proc. IEEE Real-Time Systems Symp., pp.148-151, 1999.
  30. H. Topcuoglu, S. Hariri and M.Y.Wu, “Task Scheduling Algorithms for Heterogeneous Machines,” Proc. Heterogeneous Computing Workshop, pp3-14, 1999.
  31. D. B. Tracy, Noemix, H.J. Siegel and A. Maciejewski, “Static Mapping Heuristics for Tasks with Dependencies, Priorities, Deadlines, and Multiple Versions in Heterogeneous Environments,” Proc. Int’l Parallel and Distributed Processing Symp., 2002.
  32. Ms. Sonali T. Bodkhe, Dr. Anjali R. Mahajan, “A Proposed Methodology For Task Scheduling In Wireless Distributed Systems.”Proc. International Conference on Advances in Computing and Information Technology, pp 7-12,ICACIT 2014
  33. Peng-Yeng Yin *, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te Wang , “Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization” in The Journal of Systems and Software(2007) pages-724–735.
  34. He, Zili Shao, Bin Xiao, Qingfeng Zhuge, Edwin Sha, “Reliability Driven Task Scheduling for Heterogeneous Systems”.
  35. S.Sarathambekai*, K.Umamaheswari, “ Task Scheduling in Distributed Systems using Discrete Particle Swarm Optimization” in International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 2, February 2014
  36. Ehab Y. Abdel Maksoud, “Performance and Reliability- Driven Scheduling Approach for Efficient Execution of Parallelizable Stochastic Tasks in Heterogeneous Computing Systems” in Int. J. Open Problems Compt. Math., Vol. 3, No. 2, June 2010
Index Terms

Computer Science
Information Sciences

Keywords

Dynamic scheduling heterogeneous systems performance evaluation processor utilization reliability schedulability.

Powered by PhDFocusTM