AMROFloor: An Efficient Aging Mitigation and Resource Optimization Floorplanner for Virtual Coarse-Grained Runtime Reconfigurable FPGAs

With the rapid reduction of CMOS process size, the FPGAs with high-silicon accumulation technology are becoming more sensitive to aging effects. This reduces the reliability and service life of the device. The offline aging-aware layout planning based on balance stress is an effective solution. However, the existing methods need to take a long time to solve the floorplanner, and the corresponding layout solutions occupy many on-chip resources. To this end, we proposed an efficient Aging Mitigation and Resource Optimization Floorplanner (AMROFloor) for FPGAs. First, the layout solution is implemented on the Virtual Coarse-Grained Runtime Reconfigurable Architecture, which contributes to avoiding rule constraints for placement and routing. Second, the Maximize Reconfigurable Regions Algorithm (MRRA) is proposed to quickly determine the RRs’ number and size to save the solving time and ensure an effective solution. Furthermore, the Resource Combination Algorithm (RCA) is proposed to optimize the on-chip resources, reducing the on-Chip Resource Utilization (CRU) while achieving the same aging relief effect. Experiments were simulated and implemented on Xilinx FPGA. The results demonstrate that the AMROFloor method designed in this paper can extend the Mean Time to Failure (MTTF) by 13.8% and optimize the resource overhead by 19.2% on average compared to the existing aging-aware layout solutions.

Power Resource Optimization for Backscatter-Aided Symbiotic Full-Duplex Secondary Transmission with Hardware Impairments in a Cognitive Radio Framework

This paper investigates the power resource optimization problem for a new cognitive radio framework with a symbiotic backscatter-aided full-duplex secondary link under imperfect interference cancellation and other hardware impairments. The problem is formulated using two approaches, namely, maximization of the sum rate and maximization of the primary link rate, subject to rate constraints on the secondary link, and the solution for each approach is derived. The problem of a half-duplex secondary link is also solved. Simulation results show that the sum rate and exploitation of the full-duplex capability of the secondary link are strongly affected by both the problem objective and hardware impairments.

Project scheduling and buffer management: A comprehensive review and future directions

In the project management, buffers are considered to handle uncertainties that lead to changes in project scheduling which in turn causes project delivery delay. The purpose of this survey is to discuss the state of the art on models and methods for project buffer management and time optimization of construction projects and manufacturing industries. There are not literally any surveys which review the literature of project buffer management and time optimization. This research adds to the previous literature surveys and focuses mainly on papers after 2014 but with a quick review on previous works. This research investigates the literature from project buffer sizing, project buffer consumption monitoring and project time/resource optimization perspectives.

A Deadline Constrained Time-Cost effective Salp Swarm Algorithm for Resource Optimization in Cloud Computing

Nowadays, Cloud Computing has become the most attractive platform, which provides anything as a Service (XaaS). Many applications may be developed and run on the cloud without worrying about platforms. It is a big challenge to allocate optimal resources to these applications and satisfy user's quality of service requirements. Here, in this paper, a Deadline Constrained Time-Cost effective Salp Swarm Algorithm (DTC-SSA) is proposed to achieve optimized resource allocation. DTC-SSA assigns the user's task to an appropriate virtual machine (Vm) and achieves a trade-off between cost and makespan while satisfying the deadline constraints. Rigorous examination of the algorithm is conducted on the various scale and cloud resources. The proposed algorithm is compared with Particle Swarm Optimization (PSO), Grey Wolf Optimizer(GWO), Bat Algorithm(BAT), and Genetic Algorithm(GA). Simulation results prove that it outperforms others by minimizing makespan, execution cost, Response time, and improving resource utilization throughput.