Abstract
Scheduling in multichannel distributed information processing systems is studied. The problem is solved for systems-on-a-chip and is considered in its extended statement when the system architecture is specified from the point of energy efficiency prior to scheduling.
This is a preview of subscription content, access via your institution.




REFERENCES
P. E. Golosov, M. V. Kozlov, Yu. E. Malashenko, I. A. Nazarova, and A. E. Ronzhin, “Analysis of computer job control under uncertainty,” J. Comput. Syst. Sci. Int. 51, 49 (2012).
Yu. E. Malashenko and I. A. Nazarova, “Controlling computationally intensive heterogeneous computational tasks with directive deadlines,” J. Comput. Syst. Sci. Int. 51, 628 (2012).
J. W. S. Liu, Real-Time Systems (Prentice Hall, Englewood Cliffs, NJ, 2000).
M. Drozdowski, Scheduling for Parallel Processing (Springer, London, 2009).
N. V. Kolesov, M. V. Tolmacheva, and P. V. Yukhta, Real Time Systems. Planning, Analysis, Diagnosis (Elektropribor, St. Petersburg, 2014) [in Russian].
D. A. Zorin and V. A. Kostenko, “Algorithm for synthesis of real-time systems under reliability constraints,” J. Comput. Syst. Sci. Int. 51, 410 (2012).
R. Xu, R. Melhem, and D. Moss, “Energy-aware scheduling for streaming applications on chip multiprocessors,” in Proceedings of the 28th IEEE International Real-Time Systems Symposium, Tucson, 2007, pp. 25–38.
P. R. Panda, A. Shrivastava, B. V. N. Silpa, and K. Gummidipudi, Power-Efficient System Design (Springer, New York, 2010).
H. Sun, Y. He, and W. J. Hsu, “Energy-efficient multiprocessor scheduling for flow time and makespan,” Theor. Comput. Sci. 550, 1–20 (2014).
A. Rudek and R. Rudek, “On flowshop scheduling problems with the aging effect and resource allocation,” Int. J. Adv. Manuf. Technol. 62, 135–145 (2012).
G. Bocewicz and Z. A. Banaszak, “Declarative approach to cyclic steady state space refinement: periodic process scheduling,” Int. J. Adv. Manuf. Technol. 67, 137–155 (2013).
P. Korytkowski, S. Rymaszewski, and T. Wisniewski, “Ant colony optimization for job shop scheduling using multi-attribute dispatching rules,” Int. J. Adv. Manuf. Technol. 67, 231–241 (2013).
M. Nawaz, E. E. Enscore, Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega – Int. J. Manage. Sci. 11, 91–95 (1983).
N. V. Kolesov, M. V. Tolmacheva, and P. V. Yukhta, “Scheduling of computational processes in real-time distributed systems with uncertain task execution times,” J. Comput. Syst. Sci. Int. 51, 636 (2012).
A. M. Gruzlikov, N. V. Kolesov, Iu. M. Skorodumov, and M. V. Tolmacheva, “Using solvable classes in flowshop scheduling,” Int. J. Adv. Manuf. Technol. 88, 1535–1546 (2017).
R. Steuer, Multiple Criteria Optimization: Theory, Computation, and Application, Wiley Series in Probability and Statistics (Wiley, New York, 1986; Radio Svyaz’, Moscow, 1992).
G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities (Cambridge Univ. Press, Cambridge, 1952).
R. W. Conway, W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Dover Books on Computer Science (Dover, New York, 2003).
N. V. Kolesov, A. M. Gruzlikov, Yu. M. Skorodumov, and M. V. Tolmacheva, “Mixed job scheduling in distributed real time systems,” Vestn. Komp’yut. Inform. Tekhnol., No. 5, 34–40 (2016).
E. Taillard, “Benchmarks for basic scheduling problems,” Eur. J. Operat. Res. 64, 278–285 (1993).
Funding
This study was supported by the Russian Foundation for Basic Research (grant no. 19-08-00052).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by M. Talacheva
Rights and permissions
About this article
Cite this article
Gruzlikov, A.M., Kolesov, N.V., Kostygov, D.V. et al. Energy-Efficient Scheduling in Distributed Real-Time Computing Systems. J. Comput. Syst. Sci. Int. 58, 393–403 (2019). https://doi.org/10.1134/S1064230719030092
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064230719030092