Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Mechanism Design For Strategic Project Scheduling, Pradeep Varakantham, Na Fu
Mechanism Design For Strategic Project Scheduling, Pradeep Varakantham, Na Fu
Research Collection School Of Computing and Information Systems
Organizing large scale projects (e.g., Conferences, IT Shows, F1 race) requires precise scheduling of multiple dependent tasks on common resources where multiple selfish entities are competing to execute the individual tasks. In this paper, we consider a well studied and rich scheduling model referred to as RCPSP (Resource Constrained Project Scheduling Problem). The key change to this model that we consider in this paper is the presence of selfish entities competing to perform individual tasks with the aim of maximizing their own utility. Due to the selfish entities in play, the goal of the scheduling problem is no longer only …
Minimizing Scheduling Overhead In Lre-Tl Real-Time Multiprocessor Scheduling Algorithm, Hitham Seddig Alhassan Alhussian, Mohamed Nordin Bin Zakaria, Fawnizu Azmadi Bin Hussin
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 …
A Data-Aware Cognitive Engine For Scheduling Data Intensive Applications In A Grid, Vijaya Nagarajan, Maluk Mohamed Mulk Abdul
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 …