US Patent Application 18249925. METHOD AND SYSTEM FOR REFRESHING MEMORY OF A PORTABLE COMPUTING DEVICE simplified abstract

From WikiPatents
Jump to navigation Jump to search

METHOD AND SYSTEM FOR REFRESHING MEMORY OF A PORTABLE COMPUTING DEVICE

Organization Name

QUALCOMM Incorporated==Inventor(s)==

[[Category:Pranav Agrawal of San Diego CA (US)]]

[[Category:Akash Suthar of Sirohi (IN)]]

[[Category:Aman Chhetry of Hazaribagh (IN)]]

[[Category:Kunal Desai of Bagalore (IN)]]

METHOD AND SYSTEM FOR REFRESHING MEMORY OF A PORTABLE COMPUTING DEVICE - A simplified explanation of the abstract

This abstract first appeared for US patent application 18249925 titled 'METHOD AND SYSTEM FOR REFRESHING MEMORY OF A PORTABLE COMPUTING DEVICE

Simplified Explanation

The abstract describes a system for managing memory refresh requests in a high-level operating system (HLOS).

  • The HLOS kernel can generate memory refresh requests with specific address ranges and sizes.
  • A resource power manager is connected to the kernel and the memory, which consists of multiple memory ranks.
  • When the resource power manager receives a memory refresh request, it checks if the memory ranks are symmetrical or asymmetrical.
  • If the memory ranks are symmetrical, the resource power manager evenly distributes the memory refresh request across all ranks in a parallel manner.
  • If the memory ranks are asymmetrical, the resource power manager determines the appropriate type of memory refresh: linear only, interleave with linear, or interleave only.


Original Abstract Submitted

A kernel of an HLOS may originate one or more memory refresh requests. Each memory refresh request may have a first memory address range and a size value. A resource power manager may be coupled to the kernel and coupled to memory. The memory may have a plurality of memory ranks. The resource power manger may receive a memory refresh request from the kernel. The resource power manager may then determine if the plurality of memory ranks is either symmetrical or asymmetrical. If the memory ranks are symmetrical, then the resource power manager distributes the memory refresh request evenly and in a parallel manner across the symmetrical memory ranks. If the memory ranks are asymmetrical, then the resource power manager will then determine if the memory refresh request should be one of: a linear only memory refresh; an interleave with linear memory refresh; or an interleave only memory refresh.