Skip to main content
Log in

Controlling computationally intensive heterogeneous computational tasks with directive deadlines

  • Computer Methods
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

A dynamic control model for processing computationally intensive tasks that allow for arbitrary data parallelization in the heterogeneous computing system is considered. Although execution times are not known for tasks, their deadlines should be approved and given. Guaranteed estimates of when each task is completed in the worst case are obtained. The model helps take into account and minimize the maximal possible excess in the assigned deadlines for any set of original tasks.

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.

Similar content being viewed by others

References

  1. V. Yu. Zotov, “Peculiarities of High-Performance Xilinx Virtex-6 FPGA New-Generation Architecture,” Komponenty i Tekhnologii, No. 97, 78–85 (2009).

  2. M. O. Kuzelin, D. A. Knyshev, and V. Yu. Zotov, Modern Xilinx FPGA Families. Reference Book (Goryachaya liniya — Telekom, Moscow, 2004) [in Russian].

    Google Scholar 

  3. Yu. E. Malashenko and I. A. Nazarova, “Control Model for Heterogeneous Computational Tasks Based on Guaranteed Estimates of Execution Times,” J. Comput. Syst. Sci. Int. 51(4), (2012).

  4. A. A. Krasilov, Computer Science: Vol. 3 of 7. Conceptual Computer Science. Computer Science of Sense (Glossary of Computer Science) (Intellsist, Moscow, 1997) [in Russian].

    Google Scholar 

  5. Sourcebook of Parallel Computing, Ed. by J. Dongarra and I. Foster (Morgan Kaufmann Publishers Inc., San Francisco, 2003).

    Google Scholar 

  6. L. Sha, T. Abdelzaher, K. E. Arzen, et al., “Real Time Scheduling Theory: A Historical Perspective,” Real-Time Systems 28(2–3), 101–155.

  7. J. A. Stankovic, M. Spuri, K. Ramamritham, et al., Deadline Scheduling for Real-Time Systems, EDF and Related Algorithms (Kluwer, Boston, 1998).

    Book  MATH  Google Scholar 

  8. P. E. Golosov, M. V. Kozlov, Yu. E. Malashenko, et al., “Analysis of Computer Job Control under Uncertainty,” J. Comput. Syst. Sci. Int. 51, 49–64 (2012).

    Article  MathSciNet  Google Scholar 

  9. M. V. Kozlov, Yu. E. Malashenko, and I. A. Nazarova, Guaranteed Estimates of Allocation of Computational Resources under Uncertainty (Vychisl. Tsentr Ross. Akad. Nauk, Moscow, 2011) [in Russian].

    Google Scholar 

  10. M. V. Kozlov, Yu. E. Malashenko, I. A. Nazarova, et al., Analysis of a Computer System Control Modes under Uncertainty (Vychisl. Tsentr Ross. Akad. Nauk, Moscow, 2011) [in Russian].

    Google Scholar 

  11. A. G. Sukharev, A. V. Timokhov, and V. V. Fedorov, A Course in Optimization Methods (Nauka, Moscow, 1986) [in Russian].

    Google Scholar 

  12. Yu. B. Germeier, An Introduction to Operations Research Theory (Nauka, Moscow, 1971) [in Russian].

    Google Scholar 

  13. G. Dantzig, Linear Programming and Extensions (Princeton University Press, New Jersey, 1963).

    MATH  Google Scholar 

  14. S. Gass, Linear Programming: Methods and Applications (Mc Graw Hill, New York, 1958).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © Yu.E. Malashenko, I.A. Nazarova, 2012, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2012, No. 5, pp. 15–22.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Malashenko, Y.E., Nazarova, I.A. Controlling computationally intensive heterogeneous computational tasks with directive deadlines. J. Comput. Syst. Sci. Int. 51, 628–635 (2012). https://doi.org/10.1134/S1064230712050024

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230712050024

Keywords

Navigation