Telefonaktiebolaget Lm Ericsson (publ)

Joao Monteiro Soares

Amir Roozbeh

Daniel Turull

Chakri Padala

Mozhgan Mahloo

Vinay Yadhav

Ganapathy Raman Madanagopal

Nhi Vo

Dinand Roeland

Calin Curescu

Fetahi Wuhib

A method and a supporting node () for supporting a process scheduling node () when scheduling a process to a first execution node () of a cluster () of execution nodes () are disclosed. The supporting node () receives (A), from the first execution node () being selected by the process scheduling node () for execution of the process, a request for allocation of one or more HA devices (). The supporting node () allocates at least one HA device (), being associated with a second execution node () of the cluster (), to the first execution node (). The supporting node () reduces a value representing number of HA devices () available for allocation to the first execution node () while taking said at least one HA device () into account. The supporting node () sends the value to the first execution node (). The supporting node () sends, to the first execution node (), a message indicating successful allocation of said at least one HA device (). A corresponding computer program () and a computer program carrier () are also disclosed.

Method and supporting node for supporting process scheduling in a cloud system

It is disclosed a resource sharing manager, RSM, operative to provide efficient utilization of central processing units, CPUs, within virtual servers, each virtual server having an operating system, OS. The RSM dynamically obtains () information about ownership and sharable status of said CPUs, and dynamically determines () which CPUs are sharable to which virtual servers. The RSM obtains () information about that one or more sharable CPUs are available; and obtains () information about that one or more virtual servers require more processing resources. The RSM also assigns () a first CPU of said sharable CPUs when available, to a first virtual server of said virtual servers. Information about ownership and sharable status of the first CPU, is hence provided to the OS of the first virtual server. Overhead is reduced by circumventing a hypervisor when sharing CPUs in virtual servers. An increase in efficiency of task execution is provided.

Management of dynamic sharing of central processing units

A method and a resource scheduler for enabling a computing unit to use memory resources in a remote memory pool. The resource scheduler allocates a memory unit in the remote memory pool to the computing unit for usage of memory resources in the allocated memory unit, and assigns an optical wavelength for communication between the computing unit and the allocated memory unit over an optical network. The resource scheduler further configures at least the computing unit with a first mapping between the assigned optical wavelength and the allocated memory unit. Thereby, the optical network can be utilized efficiently to achieve rapid and reliable communication of messages from the computing unit to the allocated memory unit.

Method and resource scheduler for enabling a computing unit to map remote memory resources based on optical wavelength

A computing unit, a memory pool and methods therein, for enabling the computing unit to use memory resources in the memory pool, e.g. as configured by a resource scheduler. When a memory unit in the memory pool is allocated to the computing unit and an optical wavelength is assigned for communication between the computing unit and the allocated memory unit over an optical network, the computing unit is configured with a first mapping between the assigned optical wavelength and the allocated memory unit. Thereby, the optical network can be utilized efficiently to achieve rapid and reliable communication of messages from the computing unit to the allocated memory unit.

Methods, computing unit and memory pool for enabling usage of remote memory resources

A system and method for creating and updating a distributed indexing table for peer nodes in a peer-to-peer network. In one embodiment, a method includes providing, from a first node to a second node of the peer-to-peer network, a first level of a first plurality of levels for a first designator identifying the first node and entered in a first distributed indexing table stored in the first node. The method also includes receiving, at the first node from the second node, a corresponding first level of a second plurality of levels for a second designator identifying the second node and entered in a second distributed indexing table stored in the second node, and updating the corresponding first level of the second plurality of levels for the second designator within the first distributed indexing table of the first node.

System and method for distributed indexing in peer-to-peer networks

A method and a hardware acceleration managing node for managing a request for hardware acceleration (HA). The hardware acceleration managing node receives, from a HA interfacing node, the request for hardware acceleration of processing of source data. The hardware acceleration managing node sends an indication of a source memory location(s) for storing of the source data. The hardware acceleration managing node selects one or more hardware acceleration devices. The hardware acceleration managing node receives a chunk of code to be accelerated. The hardware acceleration managing node sends, to the one hardware acceleration device, a set of acceleration instructions related to the chunk of code and the indication of the source memory location. The hardware acceleration managing node receives an indication of a result memory location indicating result data. The hardware acceleration managing node sends an indication of completed hardware acceleration to the HA interfacing node.

Method and node for managing a request for hardware acceleration by means of an accelerator device

A method and a reallocation component for managing a reallocation of information from a source memory sled to a target memory sled. The source and target memory sleds comprise a respective table indicating source status for each page of the source and target memory sleds, respectively. The reallocation component initiates, for each respective source page whose status indicates that the respective source page is initialized, reallocation of the respective content allocated on each respective source page of the source memory sled to a respective target page of the target memory sled. The reallocation component sets for each respective source page whose status indicates that the respective source page is uninitialized, the respective target status for the respective target page to indicate uninitialized, while refraining from reallocating the respective content allocated on each respective source page whose status indicates that the respective source page is uninitialized.

Method and reallocation component for managing reallocation of information from source to target memory sled

To manage memory, a computer system, responsive to receiving a message indicating an availability of a memory page of the computer system, generates a mapping between a logical address of the memory page and at least two physical memory addresses at which respective copies of the memory page are available. The computer system provides one of the at least two physical memory addresses in response to a request for access to the memory page.

Managing availability of memory pages

Migrating an application executing in a source compute sled to a target compute sled. The migration component selects a first sub-set of source pages. A respective source status of each source page of the first sub-set is modified according to a source table. A target table of the target compute sled is set to indicate that a first sub-set of target pages are modified. The migration component migrates the respective content stored in the first sub-set of source pages to target pages and selects a second sub-set of source pages, wherein the respective source status of each source page of the second sub-set is modified according to the source table. The migration component sets the target table to indicate that a second sub-set of target pages is allocated in the memory and then moves the respective content stored in the second sub-set of source pages to the memory.

Method and a migration component for migrating an application

A method performed by a network node includes the network node receiving, from a first portion of a service chain, a packet having a header portion that includes a first service chain path ID and a metadata field. The method further includes the network node retrieving, according to one or more predefined rules, one or more tags included in the metadata field. The method further includes the network node generating a second service chain path ID based on the one or more retrieved tags. The method further includes the network node replacing the first service chain path ID by inserting the second service chain path ID in the header portion, where the packet is forwarded, to a second portion of the service chain, in accordance with the second service chain path ID.

Method and network nodes for scalable mapping of tags to service function chain encapsulation headers

A method and a Memory Availability Managing Module () 'MAMM' for managing availability of memory pages () are disclosed. A disaggregated hardware system () comprises sets of memory blades () and computing pools (). The MAMM () receives (A) a message relating to allocation of at least one memory page to at least one operating system (). The message comprises an indication about availability for said at least one memory page. The MAMM () translates (A) the indication about availability to a set of memory blade parameters, identifying at least one memory blade (). The MAMM () generates (A) address mapping information for said at least one memory page, including a logical address of said at least one memory page mapped to at least two physical memory addresses of said at least one memory blade (). The MAMM () provides (A) at least some of the address mapping information for use when access to said at least one memory page is requested. A corresponding computer program and a carrier therefor are also disclosed.

Method and memory availability managing module for managing availability of memory pages

A Memory Merging Function 'MMF' for merging memory pages. A hardware system comprises a set of memory blades and a set of computing pools. At least one instance of an operating system executes on the hardware system. The MMF is independent of the operating system. The MMF finds a first and a second memory page. The first and second memory pages include identical information. The first and second memory pages are associated with at least one computing unit of the computing units. The MMF obtains a respective memory blade parameter relating to memory blade of the first and second memory pages and a respective latency parameter relating to latency for accessing the first and second memory pages. The MMF releases at least one of the first and second memory pages based on the respective memory blade and latency parameters.

Method and memory merging function for merging memory pages

A method of migrating of an application from a source host to a destination host, wherein the application is associated with a plurality of memory pages, the source host comprises a first instance of the application and a source memory region, and each memory page has an associated source memory block in the source memory region, the method comprising: at the destination host, reserving a destination memory region such that each memory page has an associated destination memory block in the destination memory region, a second instance of the application at the destination host; on receipt of an input to the application, processing the input in parallel at the first and second instances at respective source and destination hosts: at the source host, if the processing requires a read or a write call to a memory page, respectively reading from or writing to the associated source memory block; the destination host, if the processing requires a write call to a memory page, writing to the associated destination memory block and if the processing requires a read call to a memory page, sending the read call to the source host requesting that the source host read the memory page from the associated source memory block and provide the memory page to the destination host, and, on receipt of the memory page by the destination host, writing the memory page to the associated destination memory block.

Growing community of inventors

Solna, Sweden

Joao Monteiro Soares