Skip to main content
SpringerLink
Log in

RETRACTED ARTICLE: The performance of a memory restricted computer with a state-dependent job admission policy

  • Published:
Korean journal of computational & applied mathematics Aims and scope Submit manuscript

This article was retracted on 20 September 2019

This article has been updated

Abstract

Congestion and memory occupancy in computer system may be reduced further if new jobs are admitted only when the number of jobs queued at CPU is below CPU run queue cutoff (RQ). In this paper, we prove that response time of a job is invariant with respect toRQ if jobs do not communicate each other. We also demonstrate this invariance property numerically using marix-geometric methods and present an approximate method for the delay due to context switching under time slicing. The approximation suggests that time slicing with constant overhead yields a throughput similar to an FCFS system without overhead.

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

Change history

  • 20 September 2019

    The Editor has retracted this article [1] because it shows significant overlap with a work by Bondi [2]. The author agrees to this retraction.

  • 20 September 2019

    The Editor has retracted this article [1] because it shows significant overlap with a work by Bondi [2]. The author agrees to this retraction.

References

  1. Avi-Itzhak, B. and Heyman D.P.,Approximate Queueing Models for Multipro-gramming Cumputer System, Opns. Res. 21(6) (1973).

  2. Baskett, F., Chandy, K. Mani Muntz, R.R., Palacios, F.G.,Open, closed, and mixed networks of queues with different classes of customers, Journal of the A.C.M. 22(2), pp. 248–260 (1975).

    MathSciNet  MATH  Google Scholar 

  3. Buzen, J.P.,Computationnal algorithms for closed queueing networks with exponential servers, Communications of the A.C.M. 16(9), pp. 527–531 (1973).

    MathSciNet  MATH  Google Scholar 

  4. Coffman, E.G. and Ryan, T.A.,A study of storage partitioning using a mathematical model of locality, C.A.C.M. 15(3), pp. 185–190 (1972).

    MATH  Google Scholar 

  5. Denning, P.J. and Buzen, J.P.,The Operational Analysys of Queueing Network Models, Computing Surveys 10(3) (1978).

    Article  Google Scholar 

  6. Gelenbe, E. and Kurinckx, A.,Random injection control of multiprogramming in virtual memory, I.E.E.E. Trans. on Software Engineering SE-4(1), pp. 2–17 (1978).

    MATH  Google Scholar 

  7. Kleinrock, L.,Queueing System, Volume 2: Computer Applications, John Wiley, New York (1976).

    MATH  Google Scholar 

  8. Konheim, A.G. and Reiser, M.,Finite capacity queueing systems with applications in computer modeling, SIAM J. Computing 7, pp. 210–229 (1978).

    Article  MathSciNet  Google Scholar 

  9. Latouche, Guy,Algorithmic analysis of a multiprogramming-multiprocessor computer system, J.A.C.M. 28(4), pp. 662–679 (October 1981).

    MathSciNet  MATH  Google Scholar 

  10. Lazowska, E.D and Zahorjan, J.,Multiple class memory constrained queueing networks, Proc. ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pp. 130–140 (1982).

  11. Lauzowska, E.D.; Zahorjan, J; Graham, G.Scott; and Sevcik, K.C.,Quantitative System Performance: Computer System Analysis using Queueing Network Models, Prentice Hall (1984).

  12. Menasce, D.A. and Almeida, V.A.F.,Operational analysis of multiclass systems with variable multiprogramming level and memory queueing, Computer performance 3(3), pp. 145–159 (1982).

    Google Scholar 

  13. Neuts, M.F.,Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, Johns Hopkins University Press, Baltimore (1981).

    MATH  Google Scholar 

  14. Neuts, M.F.,The caudal characteristic curve of queues, Adv. Appl. Pjob. 18, pp. 221–254 (1986).

    Article  MathSciNet  Google Scholar 

  15. Russell, E.C.,Building Simulation Models with SIMSCRIPT II.5, CACI (1992).

  16. Reiser, M.,A queueing network analysis of computer communication networks with window flow control, IEEE Trans. on Comm. COM-27(8), pp. 1199–1209 (1979).

    Article  MathSciNet  Google Scholar 

  17. Reiser, M. and Lavenberg, S.S.,Mean value analysis of closed multichain queueing networks, J.A.C.M. 27(2), pp. 313–322 (1980).

    MATH  Google Scholar 

  18. Ryan, T.A. and Coffman, E.G.,A problem in multiprogramming storage allocation, I.E.E.E. Trans. on Computers C-23(11), pp. 1116–1122 (1974).

    Article  Google Scholar 

  19. Sevcik, K.C. and Mitrani, I.,The distribution of queueing network states at input and output instant, pp. 319–335 in Performance of Computer Systems, ed.M. Arato, A. Butrimenko, and E. Gelenbe, North Holland (1979).

Download references

Author information

Authors and Affiliations

  1. Department of Information and Communication Engineering, The Sunmoon University, Asan Campus Chungnam, 337-840, Asan, Korea

    Jong-Seul Lim

Authors
  1. Jong-Seul Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The Editor has retracted this article because it shows significant overlap with a work by André B. Bondi. The author agrees to this retraction.

About this article

Cite this article

Lim, JS. RETRACTED ARTICLE: The performance of a memory restricted computer with a state-dependent job admission policy. Korean J. CAM 2, 21–46 (1995). https://doi.org/10.1007/BF03008961

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03008961

1991 AMS Mathematical Subject Classification

Search

Navigation