Skip to main content

2019 | OriginalPaper | Buchkapitel

Distribution of Workload in IMA Systems by Solving a Modified Multiple Knapsack Problem

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we address the problem of workload distribution in Integrated Modular Avionics (IMA) systems. IMA system is a real-time computer system consisting of computing modules connected by a communications network. Each module has a multicore central processor unit (CPU). Workload for an IMA system is a set of periodic computational tasks grouped into partitions. Tasks from different partitions communicate by message passing. During workload distribution, each partition is assigned to a single CPU core of some module. Message passing between partitions assigned to cores of different modules creates network load. To guarantee system scalability, the network load must be minimized, while keeping all core loads within specified limits. We represent the workload distribution problem as a modified multiple knapsack problem and propose a branch and bound algorithm for solving this problem, along with a specific scheme of upper estimate calculation and an optimization which improves the algorithm performance. Results of experimental evaluation of the algorithm are also presented. The proposed algorithm is implemented in a tool system accepted for operation by one of the leading Russian aircraft design companies.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Gaska, T., Watkins, C., Chen, Y.: Integrated modular avionics—past, present, and future. IEEE Aerosp. Electron. Syst. Mag. 30(9), 12–23 (2015)CrossRef Gaska, T., Watkins, C., Chen, Y.: Integrated modular avionics—past, present, and future. IEEE Aerosp. Electron. Syst. Mag. 30(9), 12–23 (2015)CrossRef
2.
Zurück zum Zitat Ghaddar, B., Anjos, M.F., Liers, F.: A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Ann. Oper. Res. 188(1), 155–174 (2011)MathSciNetCrossRef Ghaddar, B., Anjos, M.F., Liers, F.: A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Ann. Oper. Res. 188(1), 155–174 (2011)MathSciNetCrossRef
3.
Zurück zum Zitat Gaur, D.R., Krishnamurti, R., Kohli, R.: The capacitated max k-cut problem. Math. Program. 115(1), 65–72 (2008)MathSciNetCrossRef Gaur, D.R., Krishnamurti, R., Kohli, R.: The capacitated max k-cut problem. Math. Program. 115(1), 65–72 (2008)MathSciNetCrossRef
4.
Zurück zum Zitat Watrigant, R., Bougeret, M., Giroudeau, R., Kunig, J.-C.: Sum-max graph partitioning problem. In: ISCO 2012: Combinatorial Optimization, LNCS, vol. 7422, pp. 297–308. Springer, Heidelberg (2012) Watrigant, R., Bougeret, M., Giroudeau, R., Kunig, J.-C.: Sum-max graph partitioning problem. In: ISCO 2012: Combinatorial Optimization, LNCS, vol. 7422, pp. 297–308. Springer, Heidelberg (2012)
5.
Zurück zum Zitat Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)MATH Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York (1990)MATH
6.
Zurück zum Zitat Dawande, M., Kalagnanam, J.: Approximation algorithms for the multiple knapsack problem with assignment restrictions. J. Comb. Optim. 4(2), 171–186 (2000)MathSciNetCrossRef Dawande, M., Kalagnanam, J.: Approximation algorithms for the multiple knapsack problem with assignment restrictions. J. Comb. Optim. 4(2), 171–186 (2000)MathSciNetCrossRef
7.
Zurück zum Zitat Balashov, V., Balakhanov, V., Kostenko, V.: Scheduling of computational tasks in switched network-based IMA systems. In: Proceedings of the International Conference on Engineering and Applied Sciences Optimization (OPTI 2014), pp. 1001–1014 (2014) Balashov, V., Balakhanov, V., Kostenko, V.: Scheduling of computational tasks in switched network-based IMA systems. In: Proceedings of the International Conference on Engineering and Applied Sciences Optimization (OPTI 2014), pp. 1001–1014 (2014)
8.
Zurück zum Zitat Balashov, V., Balakhanov, V., Kostenko, V., Tutelian, S.: Tool system and algorithms for scheduling of computations in integrated modular onboard embedded systems. In: Proceedings of the 14th IFAC Conference on Programmable Devices and Embedded Systems (PDeS 2016), pp. 345–350 (2016) Balashov, V., Balakhanov, V., Kostenko, V., Tutelian, S.: Tool system and algorithms for scheduling of computations in integrated modular onboard embedded systems. In: Proceedings of the 14th IFAC Conference on Programmable Devices and Embedded Systems (PDeS 2016), pp. 345–350 (2016)
Metadaten
Titel
Distribution of Workload in IMA Systems by Solving a Modified Multiple Knapsack Problem
verfasst von
Vasily Balashov
Ekaterina Antipina
Copyright-Jahr
2019
DOI
https://doi.org/10.1007/978-3-319-97773-7_101

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.