Skip to main content

Enhancing Security of Real-Time Applications on Grids Through Dynamic Scheduling

  • Conference paper
Job Scheduling Strategies for Parallel Processing (JSSPP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3834))

Included in the following conference series:

Abstract

Real-time applications with security requirements are emerging in various areas including government, education, and business. However, conventional real-time scheduling algorithms failed to fulfill the security requirements of real-time applications. In this paper we propose a dynamic real-time scheduling algorithm, or SAREG, which is capable of enhancing quality of security for real-time applications running on Grids. In addition, we present a mathematical model to formally describe a scheduling framework, security-sensitive real-time applications, and security overheads. We leverage the model to measure security overheads incurred by security services, including encryption, authentication, integrity check, etc. The SAREG algorithm seamlessly integrates security requirements into real-time scheduling by employing the security overhead model. To evaluate the effectiveness of SAREG, we conducted extensive simulations using a real world trace from a supercomputing center. Experimental results show that SAREG significantly improves system performance in terms of quality of security and schedulability over three existing scheduling algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdelzaher, T.F., Atkins, E.M., Shin, K.G.: QoS Negotiation in Real-Time Systems and Its Application to Automated Flight Control. IEEE Trans. Computers 49(11), 1170–1183 (2000)

    Article  Google Scholar 

  2. Ahmed, Q., Vrbsky, S.: Maintaining security in firm real-time database systems. In: Proc. 14th Ann. Computer Security Application Conf. (1998)

    Google Scholar 

  3. Azzedin, F., Maheswaran, M.: Towards trust-aware resource management in grid computing systems. In: Proc. 2nd IEEE/ACM Int’l. Symp. Cluster Computing and the Grid (May 2002)

    Google Scholar 

  4. Bosselaers, A., Govaerts, R., Vandewalle, J.: Fast hashing on the Pentium. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 298–312. Springer, Heidelberg (1996)

    Google Scholar 

  5. Braun, T.D.: A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: Proc. Workshop on Heterogeneous Computing (1999)

    Google Scholar 

  6. Caron, E., Chouhan, P.K., Desprez, F.: Deadline Scheduling with Priority for Client-Server Systems on the Grid. In: Proc. Int’l. Workshop Grid Computing, November 2004, pp. 410–414 (2004)

    Google Scholar 

  7. Connelly, K., Chien, A.A.: Breaking the barriers: high performance security for high performance computing. In: Proc. Workshop on New security paradigms, Virginia (September 2002)

    Google Scholar 

  8. Deepakumara, J., Heys, H.M., Venkatesan, R.: Performance comparison of message authentication code (MAC) algorithms for Internet protocol security (IPSEC). In: Proc. New-foundland Electrical and Computer Engineering Conf., St. John’s, Newfoundland (November 2003)

    Google Scholar 

  9. Elkeelany, O., et al.: Performance analysis of IPSec protocol: encryption and authentication. In: Proc. IEEE Int’l. Conf. Communications, New York, NY, April-May 2002, pp. 1164–1168 (2002)

    Google Scholar 

  10. Eltayeb, M., Dogan, A., Ozunger, F.: A data scheduling algorithm for autonomous distributed real-time applications in grid computing. In: Proc. Int’l. Conf. Parallel Processing, August 2004, pp. 388–395 (2004)

    Google Scholar 

  11. Freund, R.F., et al.: Scheduling resources in multi-user, heterogeneous computing environments with SmartNet. In: Proc. Heterogeneous Computing Workshop, March 1998, pp. 184–199 (1998)

    Google Scholar 

  12. George, B., Haritsa, J.: Secure transaction processing in firm real-time database systems. In: Proc. ACM SIGMOD Conf. (May 1997)

    Google Scholar 

  13. Halang, W.A., et al.: Measuring the performance of real-time systems. Int’l. Journal of Time-Critical Computing Systems, 59–68 (2000)

    Google Scholar 

  14. Harbitter, A., Menasce, D.A.: The performance of public key enabled Kerberos authentication in mobile computing applications. In: Proc. ACM Conf. Computer and Comm. Security, pp. 78–85 (2001)

    Google Scholar 

  15. Harchol-Balter, M., Downey, A.: Exploiting Process Lifetime Distributions for Load Balacing. ACM transaction on Computer Systems 3(31) (1997)

    Google Scholar 

  16. He, L., Jarvis, S.A., Spooner, D.P., Chen, X., Nudd, G.R.: Dynamic Scheduling of Parallel Jobs with QoS Demands in Muticluster and Grids. In: Proc. Int’l. Workshop Grid Computing, November 2004, pp. 402–409 (2004)

    Google Scholar 

  17. Humphrey, M., Thompson, M.R., Jackson, K.R.: Security for Grids. Proc. of the IEEE, 644–652 (March 2005)

    Google Scholar 

  18. In, J.U., Avery, P., Cavanaugh, R., Ranka, S.: Policy based scheduling for simple quality of service in grid computing. In: Proc. Int’l. Symp. Parallel and Distributed Processing, April 2004, pp. 23–32 (2004)

    Google Scholar 

  19. Irvine, C., Levin, T.: Towards a taxonomy and costing method for security services. In: Proc. 15th Annual Computer Security Applications Conference (1999)

    Google Scholar 

  20. Lee, J., Tierney, B., Johnston, W.: Data intensive distributed computing: a medical application example. In: Proc. High Performance Computing and Networking Conf. (April 1999)

    Google Scholar 

  21. Li, K.: Experimental performance evaluation of job scheduling and processor allocation algorithms for grid computing on metacomputers. In: Proc. Int’l. Symp. Parallel and Distributed Processing (April 2004)

    Google Scholar 

  22. Liden, S.: The Evolution of Flight Management Systems. In: Proc. IEEE/AIAA 13th Digital Avionics Systems Conf., pp. 157–169 (1995)

    Google Scholar 

  23. Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  24. Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamicmatching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: Proc. IEEE Heterogeneous Computing Workshop, April 1999, pp. 30–44 (1999)

    Google Scholar 

  25. Nahum, E., O’Malley, S., Orman, H., Schroeppel, R.: Towards High Performance Cryptographic Software. In: Proc. IEEE Workshop Architecture and Implementation of High Performance Communication Subsystems (August 1995)

    Google Scholar 

  26. Nilsson, J., Dahlgren, F.: Improving performance of load-store sequences for transaction processing workloads on multiprocessors. In: Proc. Int’l. Conference on Parallel Processing, September 21-24, pp. 246–255 (1999)

    Google Scholar 

  27. Qin, X., Jiang, H., Zhu, Y., Swanson, D.R.: Towards Load Balancing Support for I/O-Intensive Parallel Jobs in a Cluster of Workstations. In: Proc. 5th IEEE Int’l. Conf. on Cluster Computing, December 2003, pp. 100–107 (2003)

    Google Scholar 

  28. Qin, X., Jiang, H.: Improving Effective Bandwidth of Networks on Clusters using Load Balancing for Communication-Intensive Applications. In: Proc. 24th IEEE Int’l. Performance, Computing, and Communications Conf., Phoenix, Arizona (April 2005)

    Google Scholar 

  29. Qin, X.: Improving Network Performance through Task Duplication for Parallel Applications on Clusters. In: Proc. 24th IEEE Int’l. Performance, Computing, and Communications Conference, Phoenix, Arizona (April 2005)

    Google Scholar 

  30. Qin, X., Jiang, H., Swanson, D.R.: An Efficient Fault-tolerant Scheduling Algorithm for Real-time Tasks with Precedence Constraints in Heterogeneous Systems. In: Proc. 31st Int’l. Conf. Parallel Processing, Computing, and Communications Conf., Phoenix, Arizona, April 2005, pp. 360–368 (2005)

    Google Scholar 

  31. Qin, X., Jiang, H.: Dynamic, Reliability-driven Scheduling of Parallel Real-time Jobs in Heterogeneous Systems. In: Proc. 30th Int’l. Conf. Parallel Processing, September 2001, pp. 113–122 (2001)

    Google Scholar 

  32. Qin, X., Jiang, H.: Data Grids: Supporting Data-Intensive Applications in Wide Area Networks. In: High Performance Computing: Paradigm and Infrastructure (2004)

    Google Scholar 

  33. Ramamritham, K., Stankovic, J.A.: Dynamic task scheduling in distributed hard real-time system. IEEE Software 1(3) (July 1984)

    Google Scholar 

  34. Schreur, J.: B737 Flight Management Computer Flight Plan Trajectory Computation and Analysis. In: Proc. Am. Control Conf., pp. 3419–3429 (1995)

    Google Scholar 

  35. Son, S.H., Zimmerman, R., Hansson, J.: An adaptable security manager for real-time transactions. In: Proc. 12th Euromicro Conf. Real-Time Systems, June 2000, pp. 63–70 (2000)

    Google Scholar 

  36. Son, S.H., Mukkamala, R., David, R.: Integrating security and real-time requirements using covert channel capacity. IEEE Trans. Knowledge and Data Engineering 12(6), 865–879 (2000)

    Article  Google Scholar 

  37. Stankovic, J.A., Spuri, M., Ramamritham, K., Buttazzo, G.C.: Deadline Scheduling for Real-Time Systems – EDF and Related Algorithms. Kluwer Academic Publishers, Dordrecht (1998)

    MATH  Google Scholar 

  38. Theys, M.D., Tan, M., Beck, N., Siegel, H.J., Jurczyk, M.: A mathematical model and scheduling heuristic for satisfying prioritized data requests in an oversubscribed communication networks. IEEE Trans. Parallel and Distributed Systems 11(9), 969–988 (2000)

    Article  Google Scholar 

  39. Thomadakis, M.E., Liu, J.C.: On the efficient scheduling of non-periodic tasks in hard real-time systems. In: Proc. 20th IEEE Real-Time Systems Symp., pp. 148–151 (1999)

    Google Scholar 

  40. Vazhkudai, S., Schopf, J.M., Foster, I.: Predicting the Performance of Wide Area Data Transfers. In: Proceedings of the 16th International Parallel and Distributed Processing Symposium (April 2002)

    Google Scholar 

  41. Wright, R., Shifflett, D.J., Irvine, C.E.: Security Architecture for a Virtual Heterogeneous Machine. In: Proc. 14th Ann. Computer Security Applications Conference (1998)

    Google Scholar 

  42. Wu, M., Sun, X.H.: Memory conscious task partition and scheduling in Grid Environments. In: Proc. Int’l. Workshop Grid Computing, November 2004, pp. 138–145 (2004)

    Google Scholar 

  43. Xie, T., Sung, A., Qin, X.: Dynamic Task Scheduling with Security Awareness in Real-Time Systems. In: Proc. Int’l. Symp. Parallel and Distributed Processing, Denver (April 2005)

    Google Scholar 

  44. Xie, T., Qin, X., Sung, A.: SAREC: A Security-aware Scheduling Strategy for Real-Time Applications on Clusters. In: Proc. 34th Int’l. Conf. Parallel Processing, Norway, pp. 5–12 (2005)

    Google Scholar 

  45. Xie, T., Qin, X.: A New Allocation Scheme for Parallel Applications with Deadline and Security Constraints on Clusters. In: The 2005 IEEE International Conference on Cluster Computing, Boston, USA, September 27-30 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xie, T., Qin, X. (2005). Enhancing Security of Real-Time Applications on Grids Through Dynamic Scheduling. In: Feitelson, D., Frachtenberg, E., Rudolph, L., Schwiegelshohn, U. (eds) Job Scheduling Strategies for Parallel Processing. JSSPP 2005. Lecture Notes in Computer Science, vol 3834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605300_11

Download citation

  • DOI: https://doi.org/10.1007/11605300_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31024-2

  • Online ISBN: 978-3-540-31617-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics