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

Reliable Fault-Tolerant Multi-bus Scheduling Algorithm

by Chafik Arar, Hamoudi Kalla, Salim Kalla, Riadh Hocine
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 71 - Number 12
Year of Publication: 2013
Authors: Chafik Arar, Hamoudi Kalla, Salim Kalla, Riadh Hocine
10.5120/12409-9060

Chafik Arar, Hamoudi Kalla, Salim Kalla, Riadh Hocine . Reliable Fault-Tolerant Multi-bus Scheduling Algorithm. International Journal of Computer Applications. 71, 12 ( June 2013), 11-15. DOI=10.5120/12409-9060

@article{ 10.5120/12409-9060,
author = { Chafik Arar, Hamoudi Kalla, Salim Kalla, Riadh Hocine },
title = { Reliable Fault-Tolerant Multi-bus Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 71 },
number = { 12 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 11-15 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume71/number12/12409-9060/ },
doi = { 10.5120/12409-9060 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:35:21.668278+05:30
%A Chafik Arar
%A Hamoudi Kalla
%A Salim Kalla
%A Riadh Hocine
%T Reliable Fault-Tolerant Multi-bus Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 71
%N 12
%P 11-15
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we propose a fault-tolerant scheduling real-time embedded system. This scheduling algorithm is dedicated to multi-bus heterogeneous architectures, which take as input a given system description and a given fault hypothesis. It is based on a data fragmentation and passive redundancy, which allow fast fault detection/retransmission and efficient use of buses. This scheduling approach consists of a list scheduling heuristic based on a Failure Rate Pressure. In order to maximize the reliability of the system, the scheduling of each fragmented data is depend on Failure Rate Pressure. Data fragmentation allows reliable communication and maximizes the reliability of the system. Finally, simulation results show the performance of our approach when using data fragmentation.

References
  1. P. Jalote. Fault-Tolerance in Distributed Systems. Prentice Hall, Englewood Cliffs, New Jersey, 1994.
  2. H. Kopetz and G. Bauer. The time-triggered architecture. PIEEE, 91(1):112–126, October 2003.
  3. Salim Kalla, Hamoudi Kalla, and Chafik Arar. Article: Reliability-driven fault tolerant scheduling heuristics for distributed embedded real-time systems. International Journal of Computer Applications, 36(5):5–11, December 2011. Published by Foundation of Computer Science, New York, USA.
  4. Ismail Assayad, Alain Girault, and Hamoudi Kalla. Tradeoff exploration between reliability, power consumption, and execution time for embedded systems. International Journal on Software Tools for Technology Transfer, pages 1–17, 2012.
  5. Ismail Assayad, Alain Girault, and Hamoudi Kalla. Scheduling of real-time embedded systems under reliability and power constraints. In Complex Systems (ICCS), 2012 International Conference on, pages 1–6. IEEE, 2012.
  6. N. Kandasamy, J. P. Hayes, and B. T. Murray. Dependable communication synthesis for distributed embedded systems. In International Conference on Computer Safety, Reliability and Security, SAFECOMP'03, Edinburgh, UK, September 2003.
  7. S. Dulman, T. Nieberg, J. Wu, and P. Havinga. Trade-off between traffic overhead and reliability in multipath routing for wireless sensor networks. In Wireless Communications and Networking Conference, 2003.
  8. B. Kao, H. Garcia-Molina, and D. Barbara. Aggressive transmissions of short messages over redundant paths. TPDS, 5(1):102–109, January 1994.
  9. Hong Song and Hao Wu. The applied research of support vector machine in bus fault identification. In Natural Computation (ICNC), 2010 Sixth International Conference on, volume 3, pages 1326–1329, Aug.
  10. R. Vaidyanathan and S. Nadella. Fault-tolerant multiple bus networks for fan-in algorithms. In International Parallel Processing Symposium, pages 674–681, April 1996.
  11. X. Qin, H. Jiang, and D. R. Swanson. An efficient primarysegmented backup scheme for dependable real-time communication in multihop networks. In IEEE/ACM trans. on Networking, 2003.
  12. C. Dima; A. Girault; C. Lavarenne; and Y. Sorel. Off-line realtime fault-tolerant scheduling. In 9th Euromicro Workshop on Parallel and Distributed Processing, pages 410–417, 2001.
  13. L. Carloni C. Pinello and A. Sangiovanni Vincentelli. Faulttolerant deployment of embedded software for cost-sensitive real-time feedback-control applications design. In Automation and Test in Europe , DATE'04, IEEE, 2004.
  14. A. Girault, H. Kalla, and Y. Sorel. Transient processor/bus fault tolerance for embedded systems. In IFIP Working Conference on Distributed and Parallel Embedded Systems, DIPES'06, pages 135–144, Braga, Portugal, October 2006. Springer.
  15. M. Pizza, L. Strigini, A. Bondavalli, and F. Di Giandomenico. Optimal discrimination between transient and permanent faults. In 3rd IEEE High Assurance System Engineering Symposium, pages 214–223, Bethesda, MD, USA, 1998.
  16. Alain Girault and Hamoudi Kalla. A novel bicriteria scheduling heuristics providing a guaranteed global system failure rate. IEEE TDSC, 6(4):241–254, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Embedded systems real-time systems fault tolerance reliability passive redundancy data fragmentation scheduling algorithm

Powered by PhDFocusTM