Skip to main content
Log in

Prediction of dynamical, nonlinear, and unstable process behavior

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Process scheduling techniques consider the current load situation to allocate computing resources. Those techniques make approximations such as the average of communication, processing, and memory access to improve the process scheduling, although processes may present different behaviors during their whole execution. They may start with high communication requirements and later just processing. By discovering how processes behave over time, we believe it is possible to improve the resource allocation. This has motivated this paper which adopts chaos theory concepts and nonlinear prediction techniques in order to model and predict process behavior. Results confirm the radial basis function technique which presents good predictions and also low processing demands show what is essential in a real distributed environment.

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

Access this article

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. Abarbanel HDI, Brown R, Sidorowich JJ, Tsimring LS (1993) The analysis of observed chaotic data in physical systems. Rev Mod Phys 65:1331–1392

    Article  MathSciNet  Google Scholar 

  2. Amir Y (2000) An opportunity cost approach for job assignment in a scalable computing cluster. IEEE Trans Parallel Distrib Syst 11(7):760–768

    Article  Google Scholar 

  3. Brecht T, Guha K (1996) Using parallel program characteristics in dynamic processor allocation policies. Perform Eval 27/28(4):519–539

    Google Scholar 

  4. Casdagli M (1989) Nonlinear prediction of chaotic time series. Physica D: Nonlinear Phenom 35:335–356. May

    Article  MATH  MathSciNet  Google Scholar 

  5. de Mello RF, Senger LJ (2004) A new migration model based on the evaluation of processes load and lifetime on heterogeneous computing environments. In: International symposium on computer architecture and high performance computing—SBAC-PAD. IEEE Computer Society, pp 222–227

  6. de Mello RF, Andrade Filho JA, Senger LJ, Yang LT (2007) Routega: a grid load balancing algorithm with genetic support. In: AINA, pp 885–892

  7. Eckmann J-P, Ruelle D (1985) Ergodic theory of chaos and strange attractors. Rev Mod Phys 57:617–656

    Article  MathSciNet  Google Scholar 

  8. Edmonds AN (1996) Time series prediction using supervised learning and tools from chaos theory. PhD thesis, University of Luton, December 1996

  9. Elert G (2005) The chaos hypertextbook—measuring chaos, August 2005

  10. Elmer F-J (1998) The Lyapunov exponent, July 1998

  11. Fraser AM, Swinney HL (1986) Independent coordinates for strange attractors from mutual information. Phys Rev A 33(2):1134–1140

    Article  MathSciNet  Google Scholar 

  12. Harchol-Balter M, Downey AB (1997) Exploiting process lifetimes distributions for dynamic load balancing. ACM Trans Comput Syst 15(3):253–285

    Article  Google Scholar 

  13. Jackson EA (1989) Perspectives of nonlinear dynamics. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  14. Kaplan I (2003) Estimating the Hurst exponent. Available at http://www.bearcave.com/misl/misl_tech/wavelets/hurst/index.html, May 2003

  15. Kennel M (2002) The multiple-dimensions mutual information program, March 2002

  16. Kennel MB, Brown R, Abarbanel HDI (1992) Determining embedding dimension for phase-space reconstruction using a geometrical construction. Phys Rev A 45(6):3403–3411

    Article  Google Scholar 

  17. Lorenz EN (1963) Deterministic nonperiodic flow. J Atmos Sci 20:130–141

    Article  Google Scholar 

  18. Mané R (1980) On the dimension of the compact invariant sets of certain nonlinear maps. Springer, Berlin

    Google Scholar 

  19. Medio A, Gallo G (1993) Chaotic dynamics: theory and applications to economics. Cambridge University Press, Cambridge

    Google Scholar 

  20. Naik VK, Setia SK, Squillante MS (1997) Processor allocation in multiprogrammed distributed-memory parallel computer systems. J Parallel Distrib Comput 47(1):28–47

    Article  Google Scholar 

  21. Mané R, Petascale data store institute, available at http://pdsi.nersc.gov/benchmarks.htm, December 2007

  22. Rosenstein MT, Collins JJ, De Luca CJ (1993) A practical method for calculating largest Lyapunov exponents from small data sets. Physica D 65:117–134

    Article  MATH  MathSciNet  Google Scholar 

  23. Senger LJ, de Mello RF, Santana MJ, Santana RHC, Yang LT (2005) Improving scheduling decisions by using knowledge about parallel applications resource usage. In: HPCC, pp 487–498

  24. Sevcik KC (1989) Characterizations of parallelism in applications and their use in scheduling. Perform Eval Rev 17(1):171–180

    Article  Google Scholar 

  25. Shefler WC (1988) Statistics: concepts and applications. Benjamin/Cummings, Redwood City

    Google Scholar 

  26. Shenshi G, Zhiqian W, Jitai C (1999) The fractal research and predicating on the times series of sunspot relative number. Appl Math Mech 20(1):84–89

    Article  MATH  Google Scholar 

  27. Shivaratri NG, Krueger P, Singhal M (1992) Load distributing for locally distributed systems. IEEE Comput 25(12):33–44

    Google Scholar 

  28. Takens F (1980) Detecting strange attractors in turbulence. In: Dynamical systems and turbulence. Springer, Berlin, pp 366–381

    Google Scholar 

  29. Valle V Jr (2000) Chaos, complexity and deterrence. Technical report, National War College, April 2000

  30. Zey C (2006) NIST/SEMATECH e-handbook of statistical methods. May 2006

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rodrigo F. de Mello.

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Mello, R.F., Yang, L.T. Prediction of dynamical, nonlinear, and unstable process behavior. J Supercomput 49, 22–41 (2009). https://doi.org/10.1007/s11227-008-0215-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-008-0215-z

Keywords

Navigation