Abstract: An aspect of the invention relates to a method for a plurality of clients to access a file in a distributed file system, the file being replicated on at least one other server, the method comprising the steps of: Receiving, by an access management device, a request to access the part of the file sent by a first client from the plurality of clients, Selecting a first server based on at least one parameter, Authorization the first client to access the file stored by the first server Receiving, following authorization, a request to access the same file sent by a second client, the second client being different from the first client, Selecting a second server based on the parameter, the second server being different from the first server, Authorizing the second client to access the file stored by the second server.

Abstract: An aspect of the invention relates to a method for a plurality of clients to access a file in a distributed file system, the file being replicated on at least one other server, the method comprising the steps of: Receiving, by an access management device, a request to access the part of the file sent by a first client from the plurality of clients, Selecting a first server based on at least one parameter, Authorization the first client to access the file stored by the first server Receiving, following authorization, a request to access the same file sent by a second client, the second client being different from the first client, Selecting a second server based on the parameter, the second server being different from the first server, Authorizing the second client to access the file stored by the second server.

Abstract: A method for obtaining a quorum vote by a first node using a quorum cable, wherein the quorum cable comprises a first end connected to the first node and a second end connected to a second node, including determining whether the quorum cable is reserved by the second node using a remote reservation input (RRI) on the first end, if the quorum cable is not reserved by the second node asserting a local reservation input (LRI) on the first end by the first node, monitoring a local reservation output (LRO) on the first end by the first node to determine whether the LRO on the first end is asserted in response to asserting the LRI on the first end, and obtaining the quorum vote by the first node, if the LRO on the first end is asserted.

Abstract: A method for obtaining a quorum vote by a first node using a Universal Serial Bus (USB) quorum cable, wherein the USB quorum cable comprises a first end connected to a first node and a second end connected to a second node, including determining whether the USB quorum cable is reserved by the second node by querying a memory located in the USB quorum cable, if the USB quorum cable is not reserved by the second node attempting to reserve the USB quorum cable, determining whether the attempt to reserve the USB quorum cable was successful, and obtaining the quorum vote by the first node, if the attempt to reserve the USB quorum cable is successful.

Abstract: A method for obtaining a quorum vote by a first node using a quorum cable, wherein the quorum cable comprises a first end connected to the first node and a second end connected to a second node, including determining whether the quorum cable is reserved by the second node using a remote reservation input (RRI) on the first end, if the quorum cable is not reserved by the second node asserting a local reservation input (LRI) on the first end by the first node, monitoring a local reservation output (LRO) on the first end by the first node to determine whether the LRO on the first end is asserted in response to asserting the LRI on the first end, and obtaining the quorum vote by the first node, if the LRO on the first end is asserted.

Abstract: A method for obtaining a quorum vote by a first node using a Universal Serial Bus (USB) quorum cable, wherein the USB quorum cable comprises a first end connected to a first node and a second end connected to a second node, including determining whether the USB quorum cable is reserved by the second node by querying a memory located in the USB quorum cable, if the USB quorum cable is not reserved by the second node attempting to reserve the USB quorum cable, determining whether the attempt to reserve the USB quorum cable was successful, and obtaining the quorum vote by the first node, if the attempt to reserve the USB quorum cable is successful.

Abstract: A method and system of node location management in a distributed node system. A management server of a distributed node system includes a table manager, a node location manager, and a client manager. The table manager is adapted to load a first table including various information for node identifiers. The information includes: a location identifier, a hardware identifier, and configuration parameters. The node location manager is adapted to detect a new hardware identifier for a location identifier and to send a modification message to the table manager. The modification message comprises a new hardware identifier for a location identifier. Further, the table manager is adapted to update the first table responsive to a such modification message. The client manager is adapted to generate at least a second table in a client server according to the first table and to update the second table when the first table is updated.

Abstract: On a machine with non-uniform memory access distributed over several modules, each module includes one or more processors for executing tasks on a virtual or physical addressing space by effective addresses generating logical page numbers to which it is possible to make physical page numbers correspond in the memory by a correlation tale. The generation of a logical page number causes a first-level page-fault type exception when the logical page number is absent from the correlation table. The method includes a step for activating a function (Trace), following each first-level page-fault type exception, a trace function, which records the value of the effective address that has generated the logical page number that has caused the exception, the date when the exception is caused, an identifier of the task using the effective address, an identifier of the processor executing the task and the physical page number corresponding to the logical page number that has caused the exception.

Abstract: In executing data processing operations, a data processing system has a physical memory that is divided into a plurality of physical memory zones, each corresponding to a contiguous series of physical page numbers (NPP). A physical memory allocation method, in response to a request from a current process, activates a first function (Resa) which checks the number of available pages in a memory zone that iii distinguished from other memory zones by a name (z) specified by the current process and places the current process in a queue that corresponds to the zone designated (z) if the number of available pages is not sufficient in the zone designated (z), and then activates a second function (Allocate) which extracts a physical page number (NPP) from a list of available pages in the zone identified by the name (z) so that it can be used by the current process.

Abstract: A computer system comprises a nonuniform access memory distributed in several places of residence. The memory accesses a physical resource of the memory at a physical address constituted by a field of i bits and a field of j bits. The memory comprises a table with a number of rows equal to a power (i−j) of two, each row being accessible by a field of (i−k) bits of the physical address containing an identifier of the place of residence of the resource. The process for identifying a place of residence of a physical memory resource thereof consists of simply reading the identifier in the row of the table referenced by the field of (i−k) bits.

Abstract: On a machine with non-uniform memory access distributed over several modules, each module includes one or more processors for executing tasks on a virtual or physical addressing space by means of effective addresses generating logical page numbers to which it is possible to make physical page numbers correspond in the memory by means of a correlation table. The generation of a logical page number causes a first-level page-fault type exception when the logical page number is absent from the correlation table. The method includes a step for activating, following each first-level page-fault type exception, a trace function, which records the value of the effective address that has generated the logical page number that has caused the exception, the date when the exception is caused, an identifier of the task using the effective address, an identifier of the processor executing the task and the physical page number corresponding to the logical page number that has caused the exception.

Abstract: The invention relates to a process for accessing a storage area of a digital data processing machine (19) in a physical addressing mode the storage arena also being accessible in a virtual addressing mode by means of virtual addresses, each constituted by a logical page number (LPN) and a relative address (SPRA). A first logical page number (i) in question corresponds to a first given physical page number (q), and a second logical page number (i+1) contiguous to the first logical page number (i) in question corresponds to a second physical page number (s), not necessarily contiguous to the first given physical page number (q). The process is comprised of writing, at the address constituted by the first logical page number (i) in question and by a relative address having a first predetermined value, the second physical page number (s).