Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

High Available Fault Tolerant Technique in Distributed Shared Memory

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2016
Hosam E. Refaat, Usama Badawi

Hosam E Refaat and Usama Badawi. Article: High Available Fault Tolerant Technique in Distributed Shared Memory. International Journal of Computer Applications 140(12):1-9, April 2016. Published by Foundation of Computer Science (FCS), NY, USA. BibTeX

	author = {Hosam E. Refaat and Usama Badawi},
	title = {Article: High Available Fault Tolerant Technique in Distributed Shared Memory},
	journal = {International Journal of Computer Applications},
	year = {2016},
	volume = {140},
	number = {12},
	pages = {1-9},
	month = {April},
	note = {Published by Foundation of Computer Science (FCS), NY, USA}


distributed systems, that are based on constructing a network of heterogeneous computers, suffer from the problem of failing components during the system run time. In case of failure, the distributed applications must be restarted from the scratch. The main goal of this research is to add the dynamic failure recovery technique to the JavaSpaces server. So, the client continues its jobs while failures occur in the system. Also, the new technique in JavaSpaces is evaluated by analyzing and testing.


  1. Mattson T.G. Programming Environments for Parallel and Distributed computing: A Comparison of p4, PVM, Linda and TCGMSG. ftp Server,, 1995
  2. Milo Tomasevic Jelica Protic and Veljko Milutinovic. Distributed shared memory: Concepts and systems. IEEE Parallel and Distributed technology , 4(2):63-79, April, 1996
  3. Tran D., Nguyen T., and Motocova M., “Integrating Fault Tolerant Features Intoduction Topas Parallel Programmming Environment for Distributed Systems,” International Conference on Parallel Computing in Electrical Engineering (PARELEC), Poland, pp. 453-459, 2002.
  4. Kai Hwang and Zhiwei Xu. Scalable parallel computing: technology, architecture, programming, volume 5 of Computer engineering series, pages 326–345. WCB/McGraw-Hill, 1st edition, February 1998.
  5. David Gelernter. Getting the job done (linda, parallel programming language). j-BYTE , 13(12):301–308, November 1988
  6. Fred B.Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, December 1990.
  7. M. Staroswiecki1, and A. Moradi Amani. Fault-tolerant control of distributed systems by information pattern reconfiguration. International Journal of Adaptive Control and Signal Processing JUN 2014.
  8. Oracle Technology Network. Jini Architecture Specification, available from Sun Microsystems WWW Site (, 2006.
  9. Jacob Nelson, Brandon Holt, Brandon Myers, Preston Brigg, Luis Ceze, Simon Kahan, and Mark Oskin. Latency-Tolerant Software Distributed Shared Memory. In the Proceedings of the 2015 USENIX Annual Technical Conference (USENIC ATC ’15), 291-305, 2015.
  10. Mutasem Alsmadi, Usama A. Badawi and Hosam E. Refaat. High performance protocol for fault tolerant Distributed Shared memory(FaTP). Journal of Applied Science. 13(6) 790-799, 2013
  11. BlitzJavaSpacesImplementation., 2015
  12. Daniel Fiedler and Kristen Walcott and Thomas Richardson and Gregory M. Kapfhammer and Ahmed Amer and Panos K. Chrysanthis, Towards the Measurement of Tuple Space Performance, ACM SIGMETRICS Performance Evaluation Review, December, 2005, 33.
  13. van Heiningen, W., MacDonald, S. and Brecht, T. Babylon: middleware for distributed, parallel, and mobile Java applications. Concurrency Computat.: Pract. Exper., 20: 1195–1224,2008.
  14. Guanfeng Liang and Benjamin Sommer and Nitin H. Vaidya. Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers. INFOCOM'12", 1422-1430, 2012.


Parallel systems, Distributed shared memory, Fault Tolerant, Linda system, Tuple-space, Jini, JavaSpace.