Skip to main content
SpringerLink
Log in

Real-time service process admission control with schedule reorganization

  • Special Issue Paper
  • Published:
Service Oriented Computing and Applications Aims and scope Submit manuscript

Abstract

This paper addresses the problem of resource reservation for applications using the real-time service-oriented architecture paradigm. Real-time services must be completed by their deadlines. They can be scheduled anywhere within an execution interval. Some services have a large execution interval which gives them more flexibility during admission control. However, the conventional approach for real-time process scheduling is to reserve a fixed schedule on the first come, first served basis and thus does not take advantage of this flexibility. In this paper, a reorganization algorithm is presented to relocate existing reservations in order to accommodate new requests that have less flexibility. For service process reservations, intermediate deadlines may also be adjusted to further increase the flexibility of service reservations. Simulation results show that reorganization can greatly enhance the acceptance ratio of real-time requests in most situations.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Abhaya VG, Tari Z, Bertk P (2009) Achieving predictability and service differentiation in web services. In: International conference on service oriented, computing, pp 364–372

  2. Burchard LO (2003) On the performance of computer networks with advance reservation mechanisms. In: The 11th IEEE international conference on networks, 2003. ICON2003, pp 449–454

  3. Buttazzo G, Bini E, Wu Y (2011) Partitioning real-time applications over multicore reservations. Ind Inf IEEE Trans 7(2):302–315

    Article  Google Scholar 

  4. Chetto H, Silly M, Bouchentouf T (1990) Dynamic scheduling of real-time tasks under precedence constraints. Real-Time Syst 2(3):181–194

    Article  Google Scholar 

  5. Hong S, Chantem T, Hu X (2011) Meeting end-to-end deadlines through distributed local deadline assignments. In: 2011 IEEE 32nd real-time systems symposium (RTSS), pp 183–192

  6. Huhns M, Singh M (2005) Service-oriented computing: key concepts and principles. Intern Comput IEEE 9(1):75–81

    Article  Google Scholar 

  7. Konstanteli K, Kyriazis D, Varvarigou T, Cucinotta T, Anastasi G (2009) Real-time guarantees in flexible advance reservations. In: 33rd Annual IEEE international computer software and applications conference, 2009. COMPSAC ’09, vol 2, pp 67–72

  8. Moses SA, Gruenwald L, Dadachanji K (2008) A scalable data structure for real-time estimation of resource availability in build-to-order environments. J Intell Manuf 19(5):611–622

    Article  Google Scholar 

  9. Naiksatam S, Figueira S (2007) Elastic reservations for efficient bandwidth utilization in lambdagrids. Futur Gener Comput Syst 23:1–22

    Google Scholar 

  10. Netto M, Buyya R (2008) Rescheduling co-allocation requests based on flexible advance reservations and processor remapping. In: Proceedings of the 2008 9th IEEE/ACM international conference on grid, computing, pp 144–151

  11. Nie W, Panahi M, Lin KJ (2010) A flexible schedule reservation scheme for real-time service-oriented architecture. In: Proceedings of the 12th IEEE international conference on commerce and enterprise computing, pp 1–8. IEEE Computer Society, Washington, DC

  12. Panahi M, Nie W, Lin KJ (2009) A framework for real-time service-oriented architecture. In: Proceedings of the 2009 IEEE conference on commerce and enterprise, computing, pp 460–467

  13. Zhou S, Lin KJ (2011) A flexible service reservation scheme for real-time soa. In: 2011 IEEE 8th international conference on e-Business engineering (ICEBE), pp 215–222

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of California Irvine, Irvine, CA, USA

    Sen Zhou & Kwei-Jay Lin

Authors
  1. Sen Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kwei-Jay Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sen Zhou.

Additional information

This work was supported in part by the National Science Council, National Taiwan University and Intel Corporation under Grants NSC 100-2911-I-002-001, and 101R7501.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, S., Lin, KJ. Real-time service process admission control with schedule reorganization. SOCA 7, 3–14 (2013). https://doi.org/10.1007/s11761-012-0123-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11761-012-0123-1

Keywords

Search

Navigation