Research Article
Pattern-Identified Online Task Scheduling in Multitier Edge Computing for Industrial IoT Services
Algorithm 1
Pseudocode of function H(⋅).
(1) | Generate a square latency matrix V from W and M. | (2) | In each row, subtract all entries by the smallest row entry. | (3) | In each column, subtract all entries by the smallest column entry. | (4) | Find the minimum number of rows and columns that cover all zero entries. | (5) | If , the optimal solution is found. | (6) | If , Find the smallest entry in the matrix, Subtract all uncovered rows by , Add all covered columns by , Return to Line (4). |
|