Research Article
PACAM: A Pairwise-Allocated Strategy and Capability Average Matrix-Based Task Scheduling Approach for Edge Computing
| Input: The set of devices D; the workload and ; the maximal consecutive services k | | Output: The feasible schedule fs | (1) | for each serviceindo | (2) | available_Didentify_device (D, k, ) | (3) | number_ estimate_quantity (, available_D) | (4) | estimate_quantity (, available_D) | (5) | fssearch_schedule (, , number_, number_) | (6) | Return fs |
|