Achieving Guaranteed Service with Fault-Tolerant Resources in Grid Sukalyan Goswami and Ajanta Das Abstract Composed of loosely coupled virtual resources, grid, being highly dis- tinguished from traditional high-performance computing, is extensively used in computation-intensive problem solving in the arenas of science and technology. Maintaining performance or balancing load of each resource in grid is always more challenging with high chances of resource failure. The objective of this paper is to improve the ef ficiency of the Nearest Deadline First Scheduled (NDFS) algorithm considering resource failure a sudden occurrence in grid. The algorithm introduces periodical runtime backup to another available resource for retaining Quality-of-Service as approved in service quality agreement. This paper presents multiple job execution cases through implementation of benchmark codes executed in local grid test bed using Globus Toolkit middleware, with an emphasis on resource failure phenomenon of grid. These experimental results establish the requirements of the proposed algorithm to ensure the job deadline misses get reduced even if unexpected resource failures happen. Keywords Grid computing Á Job allocation Á Runtime backup Á Quality-of-service Á Resource failure 1 Introduction With the advancement of technology, grid computing supports computations across the multiple administrative domains. Computation-intensive problems are easily solved in computational grid [1] environment with successful coordination of S. Goswami Institute of Engineering & Management, Kolkata, India e-mail: sukalyan.goswami@gmail.com A. Das (&) Department of Computer Science & Engineering, Birla Institute of Technology, Mesra, Kolkata Campus, Kolkata 700107, India e-mail: ajantadas@bitmesra.ac.in © Springer Nature Singapore Pte Ltd. 2018 D.K. Mishra et al. (eds.), Information and Communication Technology, Advances in Intelligent Systems and Computing 625, https://doi.org/10.1007/978-981-10-5508-9_18 189