## 4 The Scheduler Architecture
### Allocation of Resource Blocks  
In the system, a beam is needed to be selected for the purpose of packets transmission. In this work, the beams are taken to be static while each of the beams possesses at least \begin{table}
\begin{tabular}{c c c c c} \hline \hline
**Reference** & **Algorithm Employed** & **Complexity** & **Description** & **Environment** \\ \hline \multirow{8}{*}{[32]} & Optimal deadline & & & To maximize the overall profit, & \\  & scheduling algorithm & & which is the total value of the & \\  & with commitment & & Simple & admitted task completed before & \\  & & scheduling algorithm & their deadlines, while taking into & \\  & with commitment & & & consideration the penalty paid for & \\  & & & the admitted jobs that miss & \\  & & & their deadlines. & \\ \hline \multirow{8}{*}{[39]} & Priority fair algorithm & & & Using priority fair algorithm & \\  & with First come first & & Complexity depends & combined with three other & \\  & serve as base algorithm & & on the task scheduled. & algorithms to reduce overheads & \\  & & & and the distribution of scheduled & & \\  & & & jobs on the Edge & \\ \hline \multirow{2}{*}{[40]} & Highest Level First & & & It is a priority-based algorithm & Various Systems, \\  & with Estimated & & scheduling algorithm & that uses the static b-level for & \\  & Times Algorithm & & assigning priorities to tasks. & grid environment \\ \hline \multirow{8}{*}{[41]} & & & & The algorithm assigns priorities to & \\  & & & tasks using a single fuzzy & \\  & & & inference engine (FIS). The inputs & \\  & & & to the FIS are the task’s arrival & \\  & & & depends on & time, deadline, and computation & \\  & & & time, while the output is the & \\  & & & runtime priority of the task which & \\  & & & is used to schedule tasks on & \\  & & & the system. & \\ \hline \multirow{8}{*}{[42]} & Priority-Fuzzy-B- & & & Employs a single of fuzzy & \\  & Level Algorithm & & inference engine along with the & \\  & & & bottom-level parameter to solve & \\  & & & on the task & \\  & & to scheduled & real-time systems with & \\  & & & non-preemptive tasks that have & \\  & & & precedence relations and & \\  & & & timing constraints. & \\ \hline \multirow{8}{*}{Proposed} & Optimal Usage and & & & Employs an approach that utilizes & \\  & Dropping & & the highest throughput ratio to & \\ \cline{1-1}  & (OUD) Scheduling & & & schedule tasks while maintaining & \\ \cline{1-1}  & & & a predefined queue order and & \\ \cline{1-1}  & & & avoid missing deadlines. & \\ \hline \hline \end{tabular}
\end{table} 
Table 1: _Cont._one or several queues that store packets that are meant for transmission. The mechanism responsible for selection automatically selects the beam that delivers the optimal channel performance. The metric employed to determine the optimal beam is the one that delivers the maximum SINR as amply illustrated in equation 4. The Resource Block Allocator oversees allocating available channels to the packets. Channels with a higher bit rate are usually allocated before channels with lower bit rates. The process is then brought to a halt when the UE transmission is allocated to \(Y_{RB}\) sub-channels. When the transmission of packets ends, the resource blocks is then vacated. These RBs are then assigned to the packet that has the shortest deadline. Algorithm 4 describes the module in charge of the resource block allocation process of the system. The matrix \(E\) characterizes the allocation of Resource Blocks; that is, each element \(E_{k,~{}~{}p_{j}}\) demonstrates if the sub-channel and the corresponding beam are available \(\left(E_{k,~{}~{}p_{j}}=0\right)\) or if it is in use by a UE, \(n\)\(\left(E_{k,~{}~{}p_{j}}=u\right)\). At every iteration, the RB allocation process for the transmission of packet \(A_{i}\) is carried out until \(Y_{RB}\) subchannels have been allocated for transmitting packets. \(\chi_{A_{i}}\) is considered as the number of subchannels which are allocated for transmitting packet \(A_{i}\).