# US 2025/0156290 A1 · Method and apparatus for performing periodic task

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0156290 A1
- Document ID: US20250156290A1
- Status: Published application
- Kind: A1
- Application number: 18/835,755
- Filed: 2022-02-18
- Published: 2025-05-15
- Earliest claimed: 2022-02-18
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Applicants: Telefonaktiebolaget LM Ericsson (publ)
- Inventors: Tonghai Gao; Qirong Tang; Zhanhong Xia
- Web page: https://patentgrep.com/patent/US20250156290A1

## CPC

- G06F 11/3037: {where the computing system component is a memory, e.g. virtual memory, cache (accessing, addressing or allocating within memory systems or architectures G06F12/00; checking stores for correct operation G11C29/00)}
- H04Q 11/04: for time-division multiplexing {(H04Q11/0001 takes precedence)}
- G06F 9/485: {Task life-cycle, e.g. stopping, restarting, resuming execution (G06F9/4881 takes precedence)}
- G06F 9/52: Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F 9/526: {Mutual exclusion algorithms}
- G06F 2201/88: Monitoring involving counting
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04Q: SELECTING (switches, relays, selectors H01H; wireless communication networks H04W)

## Abstract

The present disclosure relates to a method and an apparatus for performing periodic task. A method (100) for performing a periodic task may comprise: determining (S102) a time unit, based on a time period needed for scanning a first random access memory. RAM: scanning (S104) circularly the first RAM; and performing (S106) a task with a predetermined periodicity, based at least on a cycle number for scanning the first RAM. The cycle number is determined, based on the time unit and the predetermined periodicity. According to embodiments of the present disclosure, an improvement for performing a periodic task may be provided. Particularly, embodiments of the present disclosure may be applied not only in slow and small-scale periodicities, but also applicable even when the periodicities have values varying in a large range, and/or when some periodicities have very small values.

## Claims

### Claim 1

A method for performing a periodic task, comprising:
determining a time unit, based on a time period needed for scanning a first random access memory, RAM;
scanning circularly the first RAM; and
performing a task with a predetermined periodicity, based at least on a cycle number for scanning the first RAM;
wherein the cycle number is determined, based on the time unit and the predetermined periodicity.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the time period is needed for scanning a first RAM one time.

### Claim 3 (depends on 1)

The method according to claim 1, wherein the cycle number equals to the predetermined periodicity divided by the time unit.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the cycle number is stored in a second RAM.

### Claim 5 (depends on 1)

The method according to claim 1, wherein scanning the first RAM comprises:
reading a value stored in a memory unit in the first RAM;
comparing the value to the cycle number; and
incrementing the value, and writing the incremented value to the memory unit, if the value is less than the cycle number.

### Claim 6 (depends on 5)

The method according to claim 5, wherein the task is performed, if the value is greater than or equal to the cycle number.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the first RAM comprises a plurality of memory units, with each memory unit being used for one task.

### Claim 8 (depends on 7)

The method according to claim 7, wherein the plurality of memory units are scanned sequentially or in parallel, during each cycle for scanning the first RAM.

### Claim 9 (depends on 7)

The method according to claim 7, wherein scanning the first RAM comprises:
sequentially reading m values stored respectively in m memory units in the plurality of memory units; wherein m is an integer;
sequentially writing m incremented or reset values respectively to the m memory units;
wherein following actions are performed in parallel with the sequentially reading action and/or the sequentially writing actions;
for an ith value stored in an ith memory unit, wherein i is an integer equal to or greater than 1, and equal to or less than m,
comparing the ith value to a corresponding ith cycle number; and
incrementing the ith value, if the ith value is less than the ith cycle number; or resetting the ith value, if the ith value is equal to or greater than the ith cycle number.

### Claim 10 (depends on 9)

The method according to claim 9, wherein an ith task corresponding to the ith memory unit is performed, if the ith value is equal to or greater than the ith cycle number.

### Claim 11 (depends on 9)

The method according to claim 9,
wherein a comparing step, an incrementing step, and/or a resetting step for the ith value are performed in parallel with a reading step, a comparing step, an incrementing step, a resetting step and/or a writing step for a jth value; and
wherein j is an integer equal to or greater than 1, equal to or less than m, and different from i.

### Claim 12 (depends on 9)

The method according to claim 9, wherein m+1 is a number of clock cycles needed to sequentially perform a reading step, a comparing step, an incrementing step or a resetting step, and a writing step for one value stored in one memory unit.

### Claim 13 (depends on 9)

The method according to claim 9,
wherein the first RAM comprises a plurality of groups, each group including m memory units; and
wherein the plurality of groups are scanned sequentially.

### Claim 14 (depends on 9)

The method according to claim 9,
wherein the time unit equals to 2*k*clock cycle period, when k is greater than or equal to 2*m; and
wherein k is a total number of memory units in the first RAM.

### Claim 15 (depends on 1)

The method according to claim 1, wherein the first RAM is associated with a field programmable gate array, FPGA, or an application specific integrated circuit, ASIC.

### Claim 16 (depends on 1)

The method according to claim 1,
wherein the task comprises transmitting data packets periodically; or
wherein the task comprises transmitting a report periodically: or
wherein the task comprises detecting a timeout of a report periodically.

### Claim 17

An apparatus for performing a periodic task, comprising:
a processor; and a memory;
wherein the processor is configured for:
determining a time unit, based on a time period needed for scanning a first random access memory, RAM;
scanning circularly the first RAM; and
performing a task with a predetermined periodicity, based at least on a cycle number for scanning the first RAM;
wherein the cycle number is determined, based on the time unit and the predetermined periodicity.

### Claim 18 (depends on 17)

The apparatus according to claim 17, wherein the time period is needed for scanning a first RAM one time.

### Claim 19

A computer readable storage medium having a computer program stored thereon, the computer program executable by an apparatus to cause the apparatus to:
determine a time unit, based on a time period needed for scanning a first random access memory, RAM;
scan circularly the first RAM; and
perform a task with a predetermined periodicity, based at least on a cycle number for scanning the first RAM;
wherein the cycle number is determined, based on the time unit and the predetermined periodicity.

### Claim 20 (depends on 18)

The apparatus of claim 18, wherein the cycle number equals to the predetermined periodicity divided by the time unit.
