# US 2021/0334653 A1 · Hybrid deep learning scheduling method for accelerated processing of multi-ami data stream in edge computing

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

- Number: US 2021/0334653 A1
- Document ID: US20210334653A1
- Status: Published application
- Kind: A1
- Application number: 17/231,738
- Filed: 2021-04-15
- Published: 2021-10-28
- Earliest claimed: 2020-04-22
- Assignees: Korea Advanced Institute of Science and Technology
- Applicants: Korea Advanced Institute of Science and Technology
- Inventors: Chan Hyun Youn; Chang Ha Lee; Seong Hwan Kim
- Web page: https://patentgrep.com/patent/US20210334653A1

## CPC

- G06N 3/08: Learning methods
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06N 3/04: Architecture, e.g. interconnection topology
- G06N 3/09: Supervised learning
- G06N 3/098: Distributed learning, e.g. federated learning
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Disclosed is a hybrid deep learning scheduling method for accelerated processing of a multi-advanced metering infrastructure (AMI) data stream in edge computing, wherein a skewed data distribution change, which occurs in AMI data, is detected, an edge server computes an online gradient, which is comparatively quickly computed, on the basis of the detected change, a cloud server computes a normalized gradient, which requires a large amount of computation, according to selection by a hybrid scheduler, and the hybrid scheduler performs a total of three operations: (1) a data stream distribution profiling operation, (2) a memory buffer update operation, and (3) a hybrid scheduling operation.

## Claims

### Claim 1

A hybrid deep learning scheduling method for accelerated processing of a multi-advanced metering infrastructure (AMI) data stream in edge computing, wherein
a skewed data distribution change, which occurs in AMI data, is detected,
an edge server computes an online gradient, which is comparatively quickly computed, on the basis of the detected change,
a cloud server computes a normalized gradient, which requires a large amount of computation, according to selection by a hybrid scheduler, and
the hybrid scheduler performs a total of three operations: (1) a data stream distribution profiling operation, (2) a memory buffer update operation, and (3) a hybrid scheduling operation.

### Claim 2 (depends on 1)

The hybrid deep learning scheduling method of claim 1, wherein in (1) the data stream distribution profiling operation, the hybrid scheduler determines whether a distribution change occurs by recognizing a frequency distribution on the basis of cosine similarity in a stream set Si={xi,1p, xi,2p, . . . , xi,kp} in which p-dimensional power consumption AMI data xip is collected for each stream arrangement i.

### Claim 3 (depends on 1)

The hybrid deep learning scheduling method of claim 1, wherein, in (2) the memory buffer update operation, the hybrid scheduler stores a new data distribution in a memory buffer when it is determined that a distribution change has occurred.

### Claim 4 (depends on 1)

The hybrid deep learning scheduling method of claim 1, wherein, in (3) the hybrid scheduling operation, the hybrid scheduler performs a scheduling technique to solve a problem related to the skewed data distribution change according to a new data distribution.

### Claim 5 (depends on 1)

The hybrid deep learning scheduling method of claim 1, wherein
the hybrid scheduler instructs the edge server to compute an online gradient when a new data stream is input, and in the (1) data stream distribution profiling operation,
the hybrid scheduler computes a cosine similarity index from a data stream with respect to a vector {right arrow over (1)} that is spaced the same distance from all axes capable of expressing power consumption well in consideration that power consumption data is composed of positive numbers using Equation 1 below, and
the hybrid scheduler generates a set D={D1,D2, . . . ,Dj, . . . ,Dn} composed of histogram buffers Dj indicating a frequency distribution using Equation 2 below:
C
i
=
{
c
k
❘
c
k
=
1
→
*
x
k
p
〚
1
→
〛
·

x
k
p

}
[
Equation
⁢
⁢
1
]
D
i
=
{
x
i
,
k
p
❘
c
min
+
(
j
-
1
)
⁢
ϵ
n
≤
c
k
≤
c
min
+
j
⁢
ϵ
n
}
[
Equation
⁢
⁢
2
]
where n is a size of a memory buffer, cmin=min(ci), cmax=max(ci), and
∈
=
c
max
-
c
min
n
.

### Claim 6 (depends on 1)

The hybrid deep learning scheduling method of claim 1, wherein, in (2) the memory buffer update operation, the hybrid scheduler generates a set U in which a cosine similarity-based distribution is uniformly distributed using a discrete uniform distribution with a skewness of zero in order to reduce a distribution skewed by the current stream set.

### Claim 7 (depends on 6)

The hybrid deep learning scheduling method of claim 6, wherein in order to maintain various distributions of data selected to generate the set U in which the cosine similarity-based distribution is uniformly distributed, the hybrid scheduler is randomly selected in each similarity section using Equation 3 below:
U
=
{
x
1
,
U
p
,
x
2
,
U
p
,
…
⁢
,
x
j
,
U
p
,
…
⁢
,
x
n
,
U
p
}
⁢
⁢
where
⁢
⁢
P
⁡
(
x
=
x
j
,
U
p
)
=
1

D
j

[
Equation
⁢
⁢
3
]
where a j-th piece of data of the uniform distribution set U selected from data included in a histogram buffer Dj is referred to as xj,Up.

### Claim 8 (depends on 6)

The hybrid deep learning scheduling method of claim 6, wherein the hybrid scheduler compares a uniform distribution set, which is the set U in which the cosine similarity-based distribution is uniformly distributed, and a cosine similarity distribution of the previous memory buffer Bi-1 in which actual data is stored and then updates a data set of the previous memory buffer Bi-1 with the uniform distribution set using Equation 4 below when the uniform distribution set has a greater distribution than the previous memory buffer:
Bi=argmaxx(cx)×∈ {Bi-1, U} [Equation 4]

### Claim 9 (depends on 8)

The hybrid deep learning scheduling method of claim 8, wherein the update of the memory buffer refers to there being a distribution to be remembered by the hybrid scheduler, and a buffer switching indicator τ indicating the update is set as expressed in Equation 5 below:
τ
=
{
0
,
⁢
if
⁢
⁢
B
i
=
B
i
-
1
1
,
⁢
otherwise
.
[
Equation
⁢
⁢
5
]

### Claim 10 (depends on 1)

The hybrid deep learning scheduling method of claim 1, wherein in (3) the hybrid scheduling operation, considering the distribution of the current data stream,
when the distribution increases and a buffer switching indicator τ indicates 1, the cloud server computes an offline gradient, and the hybrid scheduler computes a gradient reflecting normalization using the offline gradient and the online gradient computed by the edge server and updates model parameters using the computation result, and
when the buffer switching indicator τ does not indicate 1, the hybrid scheduler immediately updates the model parameters using the online gradient computed by the edge server.
