Tidalscale, Inc.

Hewlett Packard Enterprise Development LP

Apple Inc.

I-Chun Fang

Isaac Robert Nassi

Mark Hill

Kleoni Ioannidou

David P Reed

Michael Berman

Brian Moffet

Jeffrey Paul Radick

Keith Reynolds

Lakshmi N Kavuri

Madhusudan Chaudhary

Thanigaivelu Elangovan

Yifan Zhu

Rajesh Ambati

Harshit Chuttani

Keith R Reynolds

Sindhu Sivasankaran Nair

Gaurav Arya

Gaurav Khanna

Emmanuel Grenier-Raud

Handling frequently accessed pages is disclosed. An indication is received of a stalling event caused by a requested portion of memory being inaccessible. It is determined that the requested portion of memory is a frequently updated portion of memory. The stalling event is handled based at least in part on the determination that the requested portion of memory is a frequently updated portion of memory.

Handling frequently accessed pages

Dynamic scheduling is disclosed. A plurality of physical nodes is included in a computer system. Each node includes a plurality of processors. Each processor includes a plurality of hyperthreads. In response to receiving an indication of an event occurring, a search is performed for a queue in a set of queues on which to place a virtual processor that had been waiting on the event. Queues in the set of queues correspond to hyperthreads in a physical node in the plurality of physical nodes. The queues in the set of queues are visited according to a predetermined traversal order.

Scheduling resuming of ready to run virtual processors in a distributed system

Associating working sets and threads is disclosed. An indication of a stalling event is received. In response to receiving the indication of the stalling event, a state of a processor associated with the stalling event is saved. At least one of an identifier of a guest thread running in the processor and a guest physical address referenced by the processor is obtained from the saved processor state.

Associating working sets and threads

Dynamic scheduling of virtual processors in a distributed system

Apparatuses, systems, and methods for user equipment (UE) devices to perform a radio access technology (RAT) upgrade. A UE may initiate a background scan to upgrade RAT while camped on a first system in response to an occurrence of a first condition. The first system may include a first PLMN that operates according a first RAT. The UE may determine a second system operates according to a second RAT that provides upgraded service as compared to the first RAT. The second system may be included in one or more systems found during the background scan. The UE may attempt to register on the second system based on the second PLMN operating according to the second RAT. The first and second PLMNs may each have an associated operator preference and the first PLMN may be preferred over the second PLMN.

Mobile device with improved network selection while roaming

Growing community of inventors

San Jose, CA, United States of America

I-Chun Fang