Adopting the FAIR Guidelines – that data should be Findable, Accessible, Interoperable and Reusable (FAIR) – in the health data system in Nigeria will help protect data against use by unauthorised parties, while also making data more accessible to legitimate users. However, little is known about the FAIR Guidelines and their compatibility with data and health laws and policies in Nigeria. This study assesses the governance framework for digital and health/eHealth policies in Nigeria and explores the possibility of a policy window opening for the FAIR Guidelines to be adopted and implemented in Nigeria's eHealth sector. Ten Nigerian policy documents were examined for mention of the FAIR Guidelines (or FAIR Equivalent terminology) and the 15 sub-criteria or facets. The analysis found that although the FAIR Guidelines are not explicitly mentioned, 70% of the documents contain FAIR Equivalent terminology. The Nigeria Data Protection Regulation contained the most FAIR Equivalent principles (73%) and some of the remaining nine documents also contained some FAIR Equivalent principles (between 0–60%). Accordingly, it can be concluded that a policy window is open for the FAIR Guidelines to be adopted and implemented in Nigeria's eHealth sector.

Immediate/on-line and Batch mode heuristics are two methods used for scheduling in the computational grid environment. In the former, task is mapped onto a resource as soon as it arrives at the scheduler, while the later, tasks are not mapped onto resource as they arrive, instead they are collected into a set that is examined for mapping at prescheduled times called mapping events. This paper reviews the literature concerning Minimum Execution Time (MET) along with Minimum Completion Time (MCT) algorithms of online mode heuristics and more emphasis on Min-Min along with Max-Min algorithms of batch mode heuristics, while focusing on the details of their basic concepts, approaches, techniques, and open problems.

No abstract

No abstract

Cloud computing is a new archetype that provides dynamic computing services to cloud users through the support of datacenters that employs the services of datacenter brokers which discover resources and assign them Virtually. The focus of this research is to efficiently optimize resource allocation in the cloud by exploiting the Max-Min scheduling algorithm and enhancing it to increase efficiency in terms of completion time (makespan). This is key to enhancing the performance of cloud scheduling and narrowing the performance gap between cloud service providers and cloud resources consumers/users. The current Max-Min algorithm selects tasks with maximum execution time on a faster available machine or resource that is capable of giving minimum completion time. The concern of this algorithm is to give priority to tasks with maximum execution time first before assigning those with the minimum execution time for the purpose of minimizing makespan. The drawback of this algorithm is that, the execution of tasks with maximum execution time first may increase the makespan, and leads to a delay in executing tasks with minimum execution time if the number of tasks with maximum execution time exceeds that of tasks with minimum execution time, hence the need to improve it to mitigate the delay in executing tasks with minimum execution time. CloudSim is used to compare the effectiveness of the improved Max-Min algorithm with the traditional one. The experimented results show that the improved algorithm is efficient and can produce better makespan than Max-Min and DataAware.

No abstract