We propose a computation that compensates the weakness of the processing power and storage capacity of the dew and edge servers. In the proposed computation, the nodes near to each other, which can be the dew, edge, or cloud servers, form a computational grid. The dew servers can be mobile devices, laptops, or computers. Their processing power and storage capacity can be used when they are idle. Our goal is to achieve load balancing of different nodes (servers). A server of the grid with proper processing power, storage capacity, remained energy, and low task load is selected as the grid head (each server of grid shares its specification with the other servers of grid periodically). The grid head (server) is responsible for grid communications. The grid head shares the specification of the grid, with the neighbor nodes (we suppose that the end device is aware of the specification of the nearest dew, edge, and cloud grid heads to itself). The end device decides about sending its created tasks to the grid head of a dew or edge or cloud grid, with attention to the distance between itself and the grid head, and the free processing power and storage capacity of the grid. The scheduling algorithm of a grid is the combination of first‐come–first‐served and priority scheduling algorithms. The simulation results show that the proposed computation has less delay and energy consumption and more efficiency than the cloud and edge computations.