Skip to main content
SpringerLink
Log in

Performance analysis of a dependable scheduling strategy based on a fault-tolerant grid model

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

The grid provides an integrated computer platform composed of differentiated and distributed systems. These resources are dynamic and heterogeneous. In this paper, a novel fault-tolerant grid-scheduling model is presented based on Stochastic Petri Nets (SPN) to assure the heterogeneity and dynamism of the grid system. Also, a new grid-scheduling strategy, the dependable strategy for the shortest expected accomplishing time (DSEAT), is put forward, in which the dependability factor is introduced in the task-dispatching strategy. In the end, the performance of the scheduling strategy based on the fault-tolerant grid-scheduling model is analyzed by an software package, named SPNP. The numerical results show that dynamic resources will increase the response time for all classes of tasks in differing degrees. Compared with shortest expected accomplishing time (SEAT) strategy, the DSEAT strategy can reduce the negative effects of dynamic and autonomic resources to some extent so as to guarantee a high quality of service (QoS).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Foster I, Kesselman C. The Grid Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, 1998

  2. Baker M A, Buyya R, Laforenza D. The grid: international efforts in global computing. International Journal of software Practice and Experience, 2002, 32(15): 1437–1466

    Article  MATH  Google Scholar 

  3. Foster I, Kesselman C, Tuecke S. The anatomy of the grid: enabling scalable virtual organizations. International J. Supercomputer Applications, 2001, 15(3): 200–222

    Article  Google Scholar 

  4. Algirdas A, Laprie J C, Randell B, et al. Basic concepts and taxonomy of dependable and secure computing. IEEE Transactions on Dependable and Secure Computing, 2004, 1(1): 11–33

    Article  Google Scholar 

  5. Gong L G, Sun X H. Performance modeling and prediction of nondedicated network computing. IEEE Trans on Computers, 2002, 51(9): 1041–1055

    Article  MathSciNet  Google Scholar 

  6. David M, William H, Kishor S. Model-based evaluation: from dependability to security. IEEE Transactions on Dependable and Secure Computing, 2004, 1(1): 48–65

    Article  Google Scholar 

  7. Ramamurthy S. Scheduling periodic hard real-Time tasks with arbitrary deadlines on multiprocessors real-time systems symposium. 23rd IEEE RTSS 2002, 59–68

  8. Jansen P G, Hanssen F, Lijding M E. Scheduling of early quantum tasks. In: Proceedings of the 15th Euromicro Conference on Real-Time Systems, 2003, 203–210

  9. Palencia J C, Harbour G M. Offset-based response time analysis of distributed systems scheduled under EDF. In: Proceedings of 15th Euromicro Conference on Real-Time Systems, 2003, 3–12

  10. Liu C, Yang L, Foster I, et al. Design and evaluation of a resource selection framework for grid applications. In: Proceedings of the 11th IEEE Int’l Symp. on High-Performance Distributed Computing. Washington: IEEE Computer Society, 2002, 63–72

    Google Scholar 

  11. Kartik S, Murthy S R. Task allocation algorithms for maximizing reliability of distributed computing systems. IEEE Trans. On Computer, 1997, 46(6): 719–724

    Article  Google Scholar 

  12. Qin X, Jiang H, Swanson DR. An efficient fault-tolerant scheduling algorithm for real-time tasks with precedence constraints in heterogeneous systems. In: Proceedings of the 31st Int’l Conf. on Parallel Processing (ICPP 2002), 2002, 360–368

  13. Dutot P. Complexity of master-slave tasking on heterogeneous trees. European Journal on Operational Research, 2005, 164(3): 690–695

    Article  MathSciNet  Google Scholar 

  14. Zhang Y Y, Squillante M S, Sivasubramaniam A, Sahoo R K. Performance implications of failures in large-scale cluster scheduling. Job Scheduling Strategies for Parallel Processing, 2005, 233–252

  15. Schroeder B, Gibson G. A large-scale study of failures in high-performance computing systems. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN2006), 2006, 249–258

  16. Sahoo R K, Sivasubramaniam A, Squillante M S, et al. Failure data analysis of a large-scale heterogeneous server environment. In: Proceedings of DSN’04, 2004, 772–781

  17. Shan Z G, Lin C, Ren F Y, et al. Modeling and performance analysis of a multiserver multiqueue system on the grid, distributed computing systems. In: Proceedings of the Ninth IEEE Workshop on Future Trends, 2003, 337–343

  18. Krauter K, Buyya R, Maheswaran M. A taxonomy and survey of Grid resource management systems for distributed computing. Software: Practice and Experience, 2002, 32(2): 135–164

    Article  MATH  Google Scholar 

  19. Geunmo K, Hyunsoo Y. On submesh allocation for mesh multicomputers: a best fit allocation and a virtual submesh allocation for faulty meshes. IEEE Trans on Parallel and Distributed Systems, 1998, 9(2): 175–185

    Article  Google Scholar 

  20. Murata T. Petri Nets: properties, analysis and applications. In: Proceedings of the IEEE, 1989, 77(4): 541–580

    Article  Google Scholar 

  21. Ciardo G, Trivedi K S. A decomposition approach for stochastic reward net models. Performance Evaluation, 1993, (18): 37–59

  22. Ciaodo G, Muppala J, Trivedi K S. SPNP: Stochastic Petri Net Package. In: Proceedings of Petri Nets and Performance Models, 1989, 142–151

Download references

Author information

Authors and Affiliations

  1. Information Engineering School, University of Science and Technology Beijing, Beijing, 100083, China

    Wang Yuanzhuo & Yang Yang

  2. Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, China

    Wang Yuanzhuo & Lin Chuang

  3. Department of Information Research, State Information Center, Beijing, 100045, China

    Shan Zhiguang

Authors
  1. Wang Yuanzhuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lin Chuang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yang Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shan Zhiguang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wang Yuanzhuo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Y., Lin, C., Yang, Y. et al. Performance analysis of a dependable scheduling strategy based on a fault-tolerant grid model. Front. Comput. Sc. China 1, 329–337 (2007). https://doi.org/10.1007/s11704-007-0032-1

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-007-0032-1

Keywords

Search

Navigation