Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Turkish Journal of Electrical Engineering and Computer Sciences

2017

Scheduling

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

A Data-Aware Cognitive Engine For Scheduling Data Intensive Applications In A Grid, Vijaya Nagarajan, Maluk Mohamed Mulk Abdul Jan 2017

A Data-Aware Cognitive Engine For Scheduling Data Intensive Applications In A Grid, Vijaya Nagarajan, Maluk Mohamed Mulk Abdul

Turkish Journal of Electrical Engineering and Computer Sciences

Data-intensive applications produce huge amounts of data that need to be stored, analyzed, and interpreted. A data grid serves as a cost-effective infrastructure for solving these data-intensive applications. Existing scheduling strategies are best suited for handling compute-intensive applications, although they lack in performance while handling data-intensive applications. In this work, a novel mechanism of incorporating cognitive science in a data grid is proposed for scheduling data-intensive workflows. A unique model is derived in which a cognitive engine (CE) is built into the middleware of the data grid. The intelligent agents present in the CE handle the request for data sets …


Minimizing Scheduling Overhead In Lre-Tl Real-Time Multiprocessor Scheduling Algorithm, Hitham Seddig Alhassan Alhussian, Mohamed Nordin Bin Zakaria, Fawnizu Azmadi Bin Hussin Jan 2017

Minimizing Scheduling Overhead In Lre-Tl Real-Time Multiprocessor Scheduling Algorithm, Hitham Seddig Alhassan Alhussian, Mohamed Nordin Bin Zakaria, Fawnizu Azmadi Bin Hussin

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we present a modification of the local remaining execution-time and local time domain (LRE-TL) real-time multiprocessor scheduling algorithm, aimed at reducing the scheduling overhead in terms of task migrations. LRE-TL achieves optimality by employing the fairness rule at the end of each time slice in a fluid schedule model. LRE-TL makes scheduling decisions using two scheduling events. The bottom (B) event, which occurs when a task consumes its local utilization, has to be preempted in order to resume the execution of another task, if any, or to idle the processor if none exist. The critical (C) event …