Nowadays, in a world full of uncertainties and the threat of digital and cyber-attacks, blockchain technology is one of the major critical developments playing a vital role in the creative professional world. Along with energy, finance, governance, etc., the healthcare sector is one of the most prominent areas where blockchain technology is being used. We all are aware that data constitute our wealth and our currency; vulnerability and security become even more significant and a vital point of concern for healthcare. Recent cyberattacks have raised the questions of planning, requirement, and implementation to develop more cyber-secure models. This paper is based on a blockchain that classifies network participants into clusters and preserves a single copy of the blockchain for every cluster. The paper introduces a novel blockchain mechanism for secure healthcare sector data management, which reduces the communicational and computational overhead costs compared to the existing bitcoin network and the lightweight blockchain architecture. The paper also discusses how the proposed design can be utilized to address the recognized threats. The experimental results show that, as the number of nodes rises, the suggested architecture speeds up ledger updates by 63% and reduces network traffic by 10 times.

Background: Nowadays, there is an immense increase in the demand for high power computation of real-time workloads and the trend towards multi-core and multiprocessor CPUs. The real-time system needs to be implemented upon multiprocessor platforms. Introduction: The nature of processors in an embedded real-time system is changing day by day. The two most significant challenges in a multiprocessor environment are scheduling and synchronization. The popularity of real-time multi-core systems has exploded in recent years, driving the rapid development of a variety of methods for multiprocessor scheduling of essential tasks, on the other hand, these systems have constraints when it comes to maintaining synchronization in order to access shared resources. Method: This research work presents a systematic review of different existing scheduling algorithms and synchronization protocols for shared resources in a real-time multiprocessor environment. The manuscript also presents a study based on various metrics of resource scheduling and comparison among different resource scheduling techniques. Result and Conclusion: The survey classifies open issues, key challenges, and likely useful research directions. Finally, we accept that there is still a lot of capacity in getting better resource management and further maintaining the overall quality. The paper considers such a future path of research in this field.

Multiprocessor real-time systems receive a great deal of attention. For better utilization of multiprocessors in a real-time context, an optimal approach for scheduling, allocation, and synchronization is required. In this research, a novel heuristic synchronization-aware scheduling has been proposed to reduce the blocking delays in a critical section and also bound to minimize multiple priority inversion. The key idea of this technique is to assign the task set in the same processor that accesses a common shared resource and also access them for the longest period of time; thereby, the global sharing of resource transforms into local sharing. From simulation results, it was concluded that the duration of blocking overheads should be minimized up to 25% to 30% and context switching between processors also reduced up to 10% to 15%. On the basis of result analysis, schedulability, minimization of context switching, and reduced blocking time indicate that the proposed method outperforms the existing methods and does not affect the task completion time.

Energy consumption of embedded applications has rapidly increased with the advancement of technology and computing. There is a little improvement in energy consumption as compared to computing and storage capacity. Although computing performance has been continuously increasing, power/energy consumption is more critical in the design of real-time embedded systems. Real-time embedded applications need a power management technique to judicially balance the energy consumption and computing performance. It should be done in such a way that the system performance improves along with an increase in the lifespan of the system. The proposed methodology presented in this paper deals with the minimization of energy for time-critical embedded applications. Simulation studies, along with theoretical analysis, have been carried out to show the effectiveness of the proposed three-phase reliable energy-aware scheduling method. It is observed that the proposed approach provides better tolerance (approximately four times) and consumes less energy (35% to 45%) for a wide range of applications.

In the published publication [...].