Abstract:
The invention relates to a method for managing access to shared resources within a multi-processor or multi-computer environment, including while these processors are working in a physical parallelism. Such an access management is particularly useful for carrying out a control of the accesses to such resources, for example for shared memory, in order to stabilise or optimise the functioning of a process within a multi-task application using such a parallel environment. This method comprises in particular, during at least one (SchA) of its activation periods, a first task termed accessing (TA), in response to a request for access (InstrA) to said target resource, allocates an access termed continuous to said target resource, i.e. in order to exclude any access to said target resource (ShMPi) by at least one second task (TB) during the entire activation period (SchA) of the accessing task immediately after said request for access.
Abstract:
This invention relates to a system and method for the management, more particularly by external, transparent and non-intrusive control, of the running of one or more software tasks within a multi-task application executed on a computer or a network of computers. This management comprises in particular a recording of the running of these tasks in the form of logging data, as well as a replay of this running from such logging data in order to present a behaviour and a result corresponding to those obtained while logging. The invention also relates to a system implementing such a method in the management of the functioning of the software applications that it executes.
Abstract:
A method, computer program and system for controlling accesses to memory by threads created by a process executing on a multiprocessor computer. A pa ge table structure is allocated for each new thread and copied from the exis ting threads. The page access is controlled by a present bit and a writable bit. Upon a page fault the access is provided to one thread. The kernel hand les the new page entry creation process and set the page present bits to zer o which creates page faults. In a second embodiment, two page table structur es are created, one for one thread having access to the address space and th e other page table structure shared by all the other threads having not acce ss to the address space.
Abstract:
Una ejecución del método en un sistema informático para duplicar una ejecución de programa en dicho sistema informático que tiene unos primeros medios de almacenamiento, un destino que es accesible desde dicho sistema informático, dicho método que comprende los pasos de: - si ocurre un suceso no determinístico, bloquear la petición de un programa en ejecución correspondiente a ese suceso; - comprobar si el suceso no determinístico corresponde tanto a un mensaje que es una petición de entrada para el programa en ejecución a ser duplicado como si corresponde a una petición de salida de un programa en ejecución para enviar un mensaje de salida, denominado Suceso No Abortable o NAE que son sucesos que cambian irremediablemente el estado del mundo exterior, que no podemos hacer retroceder, - si no ocurre la notificación NAE, registrar el suceso en los primeros medios de almacenamiento, entregando el suceso al programa en ejecución a ser duplicado y desbloquear la petición de entrada; - si ocurre una notificación NAE, transferir el contenido de los primeros medios de almacenamiento al destino, esperando el reconocimiento y, cuando se recibe el reconocimiento, desbloquear la petición de salida e ir al primer paso.
Abstract:
A mechanism for replicating programs executing on a computer system having a first storage means is provided. The mechanism identifies the events corresponding to requests from one executing program, which may be different from the executing program to be replicated, which are non-deterministic and identifies the ‘Non Abortable Events’ (NAE's), which change irremediably the state of the external world that need to be reproduced in the replay of the programs. These events are immediately transferred for replay and the executing program is blocked until the transfer is acknowledged. For the other non-deterministic events, they are logged and sent to the executing program, the executing programs remaining blocked only if the log is full and/or if a timer between two NAEs expires, in this case a log transfer to the standby machine is performed to prepare replication before unblocking of the executing program.
Abstract:
A mechanism for replicating programs executing on a computer system having a first storage means is provided. The mechanism identifies the events corresponding to requests from one executing program, which may be different from the executing program to be replicated, which are non-deterministic and identifies the ‘Non Abortable Events’ (NAE's), which change irremediably the state of the external world that need to be reproduced in the replay of the programs. These events are immediately transferred for replay and the executing program is blocked until the transfer is acknowledged. For the other non-deterministic events, they are logged and sent to the executing program, the executing programs remaining blocked only if the log is full and/or if a timer between two NAEs expires, in this case a log transfer to the standby machine is performed to prepare replication before unblocking of the executing program.
Abstract:
This invention relates to a system and method for the management, more particularly by external, transparent and non-intrusive control, of the running of one or more software tasks within a multi-task application executed on a computer or a network of computers. This management comprises in particular a recording of the running of these tasks in the form of logging data, as well as a replay of this running from such logging data in order to present a behaviour and a result corresponding to those obtained while logging. The invention also relates to a system implementing such a method in the management of the functioning of the software applications that it executes.