EP4356251A1 - Procédé de surveillance - Google Patents

Procédé de surveillance

Info

Publication number
EP4356251A1
EP4356251A1 EP22764311.1A EP22764311A EP4356251A1 EP 4356251 A1 EP4356251 A1 EP 4356251A1 EP 22764311 A EP22764311 A EP 22764311A EP 4356251 A1 EP4356251 A1 EP 4356251A1
Authority
EP
European Patent Office
Prior art keywords
data
working machines
working
stored
machines
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP22764311.1A
Other languages
German (de)
English (en)
Inventor
Raoul PLETTKE
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens Mobility GmbH
Original Assignee
Siemens Mobility GmbH
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens Mobility GmbH filed Critical Siemens Mobility GmbH
Publication of EP4356251A1 publication Critical patent/EP4356251A1/fr
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3466—Performance evaluation by tracing or monitoring
    • G06F11/3495—Performance evaluation by tracing or monitoring for systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
    • G06F11/3006—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system is distributed, e.g. networked systems, clusters, multiprocessor systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/3055—Monitoring arrangements for monitoring the status of the computing system or of the computing system component, e.g. monitoring if the computing system is on, off, available, not available
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3404—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for parallel or distributed programming
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/865—Monitoring of software

Definitions

  • the invention relates to a method for monitoring work machines, a system for carrying out the method, a computer program product and a computer-readable medium.
  • the object of the invention is to implement a cost-effective and operationally reliable monitoring of working machines whose number and identity is undetermined.
  • the invention is based on the object of specifying a computer program product and a computer-readable medium.
  • various components of software are executed using different working machines.
  • different components of the software are preferably executed concurrently by means of different working machines.
  • data are stored here which are correlated with a work progress of at least one of these working machines.
  • the data mentioned have a time stamp or a status indicator, for example, which can be used to trace whether work is progressing.
  • this data can have, for example, intermediate results of calculations or information about a workload of a corresponding work machine.
  • this stored data is evaluated using one of these machines.
  • the stored data are preferably evaluated by means of changing working machines of the different working machines.
  • a successive and/or concurrent evaluation of the data by means of the changing work machines is conceivable here.
  • the method is a computer-implemented method.
  • a working machine should be understood to mean a real or virtual machine in the sense of computer science.
  • Such a working machine is set up to run software in the form of program code.
  • such a real or virtual machine can have one or more processors, each with one or more processor cores, or one or more processor cores of different processors.
  • the processors or processor cores form their own distributed system. For this purpose, these could be distributed, for example, decentrally on computers or servers that are networked with one another.
  • such a working machine can have a local main memory.
  • the switching entity is preferably an intermediate application, such as a message-oriented intermediate application.
  • the message-oriented intermediate application is a so-called message broker.
  • Monitoring that is distributed to different work machines can be easily implemented using the switching instance. Furthermore, the monitoring of work progress can also be implemented independently of a number of work machines.
  • identification data of that working machine which executes a component of the software is transmitted to the switching entity. By means of the switching instance, a working machine is selected on the basis of this identification data for the purpose of reading in and evaluating the at least part of the stored data. This makes it possible to distribute monitoring tasks to different work machines in a simple manner. It is conceivable here that instead of the identification data, an indication of a storage location for this identification data is transmitted. Pointers can be used for this, for example.
  • a further advantageous development provides for the identification data of the machine that executes a component of the software to be transmitted to the switching entity.
  • Working machines can thus flexibly participate in the monitoring or be exempted from participating in the monitoring.
  • an advantageous development provides that after the evaluation of at least part of the stored data by means of the selected machine, a further machine is selected for the purpose of reading in and evaluating at least another part of the stored data by means of the switching instance. This enables fail-safe monitoring. Furthermore, in this way, monitoring can be implemented independently of a number of working machines.
  • an advantageous further development provides for the switching instance to be used to select working machines in succession and with equal rights for the purpose of reading in and evaluating at least some of the stored data.
  • the round trip method can be chosen. This is also known in computer science as the round-robin principle. by means of lauf procedure, participants are selected consecutively from queues with equal rights. In this way, the load of the monitoring tasks can be distributed evenly among the working machines participating in the monitoring.
  • Working machines are preferably selected by means of the switching instance on the basis of their identification data in succession and with equal rights for the aforementioned purpose of reading in and evaluating at least some of the stored data. This enables easy handling of the selection even in the case of a large number of working machines.
  • the selected work machine transmits confirmation information to the switching entity for the purpose of confirming the evaluation that has taken place. This makes it possible to realize high reliability of the monitoring.
  • the switching entity is implemented as a distributed system.
  • the fact that the switching entity is implemented as a distributed system is to be understood in the present context as meaning that the switching entity itself forms a distributed system.
  • this could be implemented in a decentralized manner, for example, on computers or servers that are networked with one another.
  • the switching entity is part of a higher-level distributed system. This enables decentralized switching of the instruction for the purpose of reading in and evaluating the stored data. Reliable monitoring can be implemented in this way.
  • the data be stored on a decentralized storage device by means of the work machines.
  • the memory device is to be understood as a device on which data can be written, read from, and erased from.
  • the memory device can be, for example, volatile memory, permanent memory or semi-permanent memory.
  • the storage device can be a mechanical storage device, a semiconductor storage device, an optical storage device, a magnetic storage device and/or combinations thereof.
  • the fact that the memory device is designed in a decentralized manner should be understood in the present context to mean that it is designed as a distributed shared memory.
  • this distributed memory is designed as a distributed, replicated database system, as a distributed, replicated file system, as a virtual common memory, which is also referred to as "Virtual Shared Memory (VSM)" in information technology, or as a distributed common memory, which referred to as “Distributed Shared Memory (DSM)” in information technology.
  • VSM Virtual Shared Memory
  • DSM distributed Shared Memory
  • the distributed, replicated database system has a networked, replicated key-value database, which is also referred to as a “key-value database” in information technology.
  • the storage device is part of a virtualized hardware component of a computer cloud. This enables particularly high availability of the data. Furthermore, a robust monitoring method can be implemented in this way.
  • An advantageous embodiment variant provides for data on the progress of work in connection with the executed component to be stored on the decentralized storage device by means of the work machine which executes a component of the software while this component is being executed. This makes it possible to save the data in a direct way and thus prevent possible errors in the collection of data related to a work progress by third parties. In addition, the need for complex preconfiguration can be avoided.
  • the method according to the invention can be carried out by means of the system according to the invention.
  • the system according to the invention has a number of working machines which are set up to respectively execute at least one of a number of software components.
  • the multiple working machines are the working machines already described in more detail above in connection with the method.
  • the system according to the invention has a decentralized storage device. This is set up to store data which is correlated with a work progress of at least one work machine of the plurality of work machines.
  • the decentralized storage device should be understood to mean the decentralized storage device already described above in connection with the method.
  • the system according to the invention has a switching entity which is set up to select one of the several working machines and to transmit instructions to this selected working machine to read in and evaluate at least part of the stored data.
  • the mediation entity mentioned is the mediation entity already described above in connection with the method.
  • the system according to the invention is prompted to carry out the method according to the invention for monitoring the work machines.
  • the computer program product has instructions which, when they are executed with a data processing device as described above, cause the system according to the invention to carry out the method according to the invention.
  • the computer program product according to the invention is stored on the computer-readable medium according to the invention.
  • the computer-readable medium can be, for example, a CD-ROM, a DVD, a USB or flash memory or an intangible medium such as a data stream and/or a data carrier signal.
  • FIG. 1 shows an example of the system according to the invention in a schematic representation and an illustration of a first part of an example of the method according to the invention
  • FIG. 2 shows the example of the system according to the invention in a schematic representation and an illustration of a second part of an example of the method according to the invention
  • FIG. 3 shows a summarized illustration of the example of the method according to the invention.
  • 1 shows a schematic representation of a distributed system 18 and illustrates a first part of a method 100 for monitoring work machines 10, 12.
  • the distributed system 18 is set up to execute 120 different components of software using different work machines 10, 12 the distributed system 18 in the present exemplary embodiment has a plurality of working machines 10, 12.
  • Each of the several working machines 10, 12 is set up to execute at least one of several components of the software 120.
  • the working machine 10, 12 that executes a component of the software 120, whose identification data is sent to a Switching entity 14 of the distributed system 18 transmit 220.
  • this switching entity 14 is implemented as a message-oriented intermediate application by way of example.
  • the switching entity 14 can be, for example, a message broker or another message-oriented intermediate application known to those skilled in the art.
  • the switching entity 14 itself is implemented as a distributed system.
  • data is stored 140 during the execution 120 of this component, which data is correlated with the work progress of this work machine 10, 12.
  • the data mentioned have, for example, a time stamp or a status indicator, which can be used to determine whether work is progressing.
  • this data can have, for example, intermediate results of calculations or information about a workload of a corresponding work machine.
  • This data is stored on a distributed storage device 16 of the distributed system 18 by means of the corresponding work machine 10 , 12 .
  • the distributed memory device 16 is a distributed shared memory designed as a distributed, replicated database system.
  • the distributed shared memory is set up in a manner known to those skilled in the art.
  • the decentralized storage device 16 is set up to store data 140 which are correlated with a work progress of at least one of the plurality of work machines 10, 12.
  • FIG 2 shows the distributed system 18 by way of example and illustrates a second part of the method 100 for monitoring the plurality of working machines 10, 12.
  • the switching instance 14 selects one of the plurality of working machines 10, 12 160 in order to transfer a first part of the distributed storage device 16 evaluate stored data 200.
  • FIG 2 is illustrated by way of example for simple illustration that by means of the switching instance 14 a first working machine 10 of the plurality of working machines 10, 12 is selected 160.
  • the selection 160 is made using the identification data of those working machines 10, 12 which, as already described in connection with FIG. 1, have transmitted 220 them to the switching instance 14.
  • a selection of working machines 160 is made consecutively and with equal rights based on this identification data.
  • the round-robin method is selected for this purpose, which is known in computer science as the round-robin principle.
  • a working machine 10 , 12 can be logged off from the switching entity 14 by a connection between a corresponding working machine 10 , 12 and the switching entity 14 being terminated.
  • the logged off work machine 10, 12 is then no longer available for selection 160 for the evaluation of data 200. It is also conceivable that this logged off work machine 10, 12 can log on to the switching instance 14 again, as described above.
  • instructions for reading in 180 and evaluating 200 the first part of the stored data are transmitted to it by means of the switching entity 14 .
  • the evaluation 200 of the first part of the stored data from the first working machine 10 After the evaluation 200 of the first part of the stored data from the first working machine 10 has been carried out, this is used for the purpose of confirming the evaluation 200 confirmation information is transmitted to the mediation entity 14 240.
  • the instructions for reading 180 and evaluating 200 the first part of the stored data are sent to another Work machine 12 of the plurality of work machines 10, 12 transferred. This further working machine 12 is selected by the switching instance 14 on the basis of the identification data 160.
  • the first part of the stored data is then read in by means of the further working machine 12 180 and evaluated 200.
  • FIG 3 illustrates the entire method 100 for monitoring the working machines 10, 12.
  • the illustration shows that the method steps of selecting the working machine 160, transmitting the instruction to read 180 part of the data, evaluating 200 the part of the data and the transmission of the confirmation information 240 are run through cyclically in the present exemplary embodiment.
  • This cycle shown can be run through concurrently for various of the several working machines 10, 12.
  • the method steps of executing 120 the software components, storing 140 the data correlated with a work progress of the work machines 10, 12 and transmitting 220 the identification data mentioned to the switching instance 14 are carried out largely independently of the cycle mentioned.
  • the the last-mentioned method steps are preferably carried out in parallel by different working machines, not shown in detail.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • General Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Computer Hardware Design (AREA)
  • Mathematical Physics (AREA)
  • Hardware Redundancy (AREA)

Abstract

L'invention concerne un procédé (100) de surveillance de machines de travail (10, 12), différents composants d'un logiciel étant réalisés (120) à l'aide de différentes machines de travail (10, 12). En outre, des données sont stockées (140) dans le processus qui est en corrélation avec une progression de travail d'au moins une des machines de travail susmentionnées. Au moins une partie des données stockées est également évaluée (200) à l'aide de l'une des machines de travail (10, 12) susmentionnées.
EP22764311.1A 2021-08-30 2022-07-25 Procédé de surveillance Pending EP4356251A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102021209498 2021-08-30
PCT/EP2022/070729 WO2023030757A1 (fr) 2021-08-30 2022-07-25 Procédé de surveillance

Publications (1)

Publication Number Publication Date
EP4356251A1 true EP4356251A1 (fr) 2024-04-24

Family

ID=83188238

Family Applications (1)

Application Number Title Priority Date Filing Date
EP22764311.1A Pending EP4356251A1 (fr) 2021-08-30 2022-07-25 Procédé de surveillance

Country Status (2)

Country Link
EP (1) EP4356251A1 (fr)
WO (1) WO2023030757A1 (fr)

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7703106B2 (en) * 2003-12-02 2010-04-20 Sap Aktiengesellschaft Discovering and monitoring process executions
US9507682B2 (en) * 2012-11-16 2016-11-29 Ab Initio Technology Llc Dynamic graph performance monitoring
US9081629B2 (en) * 2013-05-19 2015-07-14 Frank Eliot Levine Excluding counts on software threads in a state
US10924538B2 (en) * 2018-12-20 2021-02-16 The Boeing Company Systems and methods of monitoring software application processes

Also Published As

Publication number Publication date
WO2023030757A1 (fr) 2023-03-09

Similar Documents

Publication Publication Date Title
DE2908316C2 (de) Modular aufgebaute Multiprozessor-Datenverarbeitungsanlage
DE112012000797B4 (de) Mehrfach-Modellierungsparadigma für eine Vorhersageanalytik
DE69837130T2 (de) Vorrichtung und Verfahren zum Simulieren mehrerer Knoten auf einer einzelnen Maschine
DE69317982T2 (de) Verfahren und Anlage zur Realzeitdatensammlung und Anzeigevorrichtung
DE3611223A1 (de) Verfahren und vorrichtung zum verhindern einer blockierung in einem datenbank-verwaltungssystem
DE2244402A1 (de) Datenverarbeitungsanlage
DE3201768C2 (fr)
WO2016141998A1 (fr) Dispositif et procédé pour produire une représentation numérique d'une entité physique
DE19617976A1 (de) Kommunikationssystem mit Mitteln zum Austausch von Softwareprozessen
DE202017106569U1 (de) Analyse grossangelegter Datenverarbeitungsaufträge
EP2648094B1 (fr) Procédé et système de production d'un code source pour un programme informatique pour l'exécution et la simulation d'un processus
DE112011100168T5 (de) Erfassen von Diagnosedaten in einer Datenverarbeitungsumgebung
DE112019000189T5 (de) Programmausführungs-steuerverfahren und fahrzeugsteuervorrichtung
EP4356251A1 (fr) Procédé de surveillance
DE102018123563B4 (de) Verfahren zur Zwischenkernkommunikation in einem Mehrkernprozessor
EP3705993B1 (fr) Système et procédé de détection et d'identification des n uds de calcul dans un réseau
DE102021200491A1 (de) Verfahren und Vorrichtung zum Verwalten von mit wenigstens einem technischen Erzeugnis assoziierten Daten
EP3588849A1 (fr) Procédé de quantification de la fiabilité d'une fonction de commande, laquelle étant fournie à l'aide d'une pluralité d'unités fonctionnelles indépendantes ainsi que dispositif de commande
DE69627821T2 (de) Geordnete und verlässliche signalauslieferung in einem verteilten multiprozessorsystem
DE102020123911A1 (de) Synchronisierung des verhaltens mehrerer instrumente mithilfe von aufträgen und zwischenzielen
DE69127592T2 (de) Dialogverfahren zwischen den Prozessoren eines Systems, System zu seiner Durchführung und zu seinem Einsatz für die Verteilung von Prozessen auf Prozessoren
DE19625841A1 (de) Medizinische Systemarchitektur, basierend auf Microsoft OLE/OCX und Automation, bzw. Atomic
DE69420782T2 (de) Verfahren um den Informationsaustausch zwischen Prozessen mittels eines Kommunikationsgerätes zu bewerkstelligen
DE102021112661A1 (de) Verfahren, Vorrichtung, Computerprogramm und computerlesbares Speichermedium zur Ermittlung von fehlerbehafteten Fahrzeugen
EP3172671B1 (fr) Procédé de traitement de données en parallèle dans un système de calcul comportant une pluralité d'unités de calcul et système de calcul comportant une pluralité d'unités de calcul

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20240117

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR