Considering reconfiguration overhead in scheduling of dependent tasks on 2D reconfigurable FPGA

Author(s):  
Quang-Hai Khuat ◽  
Daniel Chillet ◽  
Michael Hubner
1988 ◽  
Vol 11 (1) ◽  
pp. 1-19
Author(s):  
Andrzej Rowicki

The purpose of the paper is to consider an algorithm for preemptive scheduling for two-processor systems with identical processors. Computations submitted to the systems are composed of dependent tasks with arbitrary execution times and contain no loops and have only one output. We assume that preemptions times are completely unconstrained, and preemptions consume no time. Moreover, the algorithm determines the total execution time of the computation. It has been proved that this algorithm is optimal, that is, the total execution time of the computation (schedule length) is minimized.


Author(s):  
Yang Huang ◽  
Honglong Chen ◽  
Guoqi Ma ◽  
Kai Lin ◽  
Zhichen Ni ◽  
...  

2021 ◽  
Author(s):  
Vahid Jamali

Most algorithms developed so far for the optimization of Intelligent Reflecting Surfaces (IRSs) require knowledge of full Channel State Information (CSI). However, the resulting acquisition overhead constitutes a major bottleneck for the realization of IRS-assisted wireless systems in practice. In contrast, in this paper, focusing on downlink transmissions from a Base Station (BS) to a Mobile User (MU) that is located in a blockage region, we propose to optimize the IRS for illumination of the area centered around the MU. Hence, the proposed design requires the estimation of the MU’s position and not the full CSI. For a given IRS phase-shift configuration, the end-to-end BS-IRS-MU channel can then be estimated using conventional channel estimation techniques. The IRS reconfiguration overhead for the proposed scheme depends on the MU mobility as well as how wide the coverage of the IRS illumination is. Therefore, we develop a general IRS phase-shift design, which is valid for both the near- and far-field regimes and features a parameter for tuning the size of the illumination area. Moreover, we study a special case where the IRS illuminates the entire blockage area, which implies that the IRS phase shifts do not change over time leading to zero overhead for IRS reconfiguration.


2021 ◽  
Vol 27 (2) ◽  
Author(s):  
H. Hamza ◽  
A.F.D Kana ◽  
M.Y. Tanko ◽  
S. Aliyu

Cloud computing is a model that aims to deliver a reliable, customizable and scalable computing environment for end-users. Cloud computing is one of the most widely used technologies embraced by sectors and academia, offering a versatile and effective way to store and retrieve documents. The performance and efficiency of cloud computing services always depend upon the performance of the execution of user tasks submitted to the cloud system. Scheduling of user tasks plays a significant role in improving the performance of cloud services. Accordingly, many dependent task scheduling algorithms have been proposed to improve the performance of cloud services and resource utilization; however, most of the techniques for determining which task should be scheduled next are inefficient. This research provided an enhanced algorithm for scheduling dependent tasks in cloud that aims at improving the overall performance of the system. The Dependent tasks were represented as a directed acyclic graph (DAG) and the number of dependent tasks and their total running time were used as a heuristic for determining which path should be explored first. Best first search approach based on the defined heuristic was used to traverse the graph to determine which task should be scheduled next. The results of the simulation using WorkflowSim toolkit showed an average improvement of 18% and 19% on waiting time and turnaround time were achieved respectively.


Sign in / Sign up

Export Citation Format

Share Document