# US 2025/0147808 A1 · Resource optimization method and device through dynamic spinlock

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

- Number: US 2025/0147808 A1
- Document ID: US20250147808A1
- Status: Published application
- Kind: A1
- Application number: 18/932,900
- Filed: 2024-10-31
- Published: 2025-05-08
- Earliest claimed: 2023-11-08
- Assignees: Hyundai Autoever Corp.
- Applicants: Hyundai AutoEver Corp.
- Inventors: Jun Ho CHO; Ki Young YOON
- Web page: https://patentgrep.com/patent/US20250147808A1

## CPC

- G06F 9/5027: {the resource being a machine, e.g. CPUs, Servers, Terminals}
- G06F 9/526: {Mutual exclusion algorithms}
- G06F 9/52: Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F 9/524: {Deadlock detection or avoidance}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Described herein are resource optimization methods and devices using a dynamic spinlock. According to one embodiment, a method includes generating a plurality of spinlock resources depending on data sharers, measuring a spinlock time for each spinlock resource among the plurality of spinlock resources, and integrating at least two spinlock resources of the plurality of spinlock resources with short spinlock times.

## Claims

### Claim 1

A resource optimization method using a dynamic spinlock, the method comprising:
generating a plurality of spinlock resources depending on data sharers;
measuring a spinlock time for each spinlock resource among the plurality of spinlock resources; and
integrating at least two spinlock resources of the plurality of spinlock resources with short spinlock times.

### Claim 2 (depends on 1)

The resource optimization method of claim 1, wherein the generating the plurality of spinlock resources comprises generating the plurality of spinlock resources which correspond with all cases of the data sharers.

### Claim 3 (depends on 2)

The resource optimization method of claim 2, wherein one bit is allocated for each of the data sharers, and an identifier for the each spinlock resource is generated using a value of a corresponding bit.

### Claim 4 (depends on 1)

The resource optimization method of claim 1, wherein identifiers of the at least two spinlock resources are made identical when the integrating the at least two spinlock resources is performed.

### Claim 5 (depends on 4)

The resource optimization method of claim 4, wherein the identifiers are stored in a Random Access Memory (RAM).

### Claim 6 (depends on 1)

The resource optimization method of claim 1, wherein the at least two spinlock resources having the short spinlock times are continuously integrated until a sum of the first shortest spinlock time and the second shortest spinlock time becomes longer than the longest spinlock time when the integrating the at least two spinlock resources is performed.

### Claim 7 (depends on 1)

The resource optimization method of claim 1, wherein the data sharers operate on different cores of at least one microcontroller.

### Claim 8

A resource optimization device using a dynamic spinlock, the device comprising:
a plurality of applications to run on different cores; and
a Runtime Environment (RTE) to support data sharing between the plurality of applications,
wherein the RTE generates a plurality of spinlock resources depending on data sharing cases of the plurality of applications, measures a spinlock time for each one of the plurality of spinlock resources, and then integrates at least two spinlock resources of the plurality of spinlock resources with short spinlock times.

### Claim 9 (depends on 8)

The resource optimization device of claim 8, wherein the plurality of spinlock resources are stored and managed in a RAM.

### Claim 10 (depends on 8)

The resource optimization device of claim 8, wherein:
the RTE manages data sharing between the plurality of applications as a pair information, and
wherein the pair information is expressed as a bit value.

### Claim 11 (depends on 8)

The resource optimization device of claim 8, wherein the data sharing cases comprise a 1:1 sharing and a 1:N (N is a natural number of 2 or more) sharing.

### Claim 12 (depends on 8)

The resource optimization device of claim 8, wherein the RTE runs on an Automotive Open System Architecture (AUTOSAR) OS.

### Claim 13 (depends on 8)

The resource optimization device of claim 8, wherein the RTE independently allocates the each one of the plurality of spinlock resources depending on the data sharing cases.

### Claim 14 (depends on 8)

The resource optimization device of claim 8, wherein the spinlock time is measured at runtime.

### Claim 15 (depends on 8)

The resource optimization device of claim 8, wherein the RTE allocates one bit for each one of the plurality of applications, and the RTE generates an identifier for the each one of the plurality of spinlock resources based on a value of a corresponding bit.

### Claim 16 (depends on 15)

The resource optimization device of claim 15, wherein the RTE makes identifiers for the plurality of spinlock resources to be integrated identically.

### Claim 17 (depends on 16)

The resource optimization device of claim 16, wherein the identifiers are stored in a RAM variable.

### Claim 18

A non-transitory computer-readable medium, comprising a set of instructions stored thereon, that when executed by a processor, perform steps of:
generating a plurality of spinlock resources depending on data sharers;
measuring a spinlock time for each spinlock resource among the plurality of spinlock resources; and
integrating at least two spinlock resources of the plurality of spinlock resources with short spinlock times.
