We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
Piyush Garyali, Matthew Dellinger, Binoy Ravindran
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
The paper addresses the problem of matching and scheduling of DAG-structured application to both minimize the makespan and maximize the robustness in a heterogeneous computing sys...
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...
In this paper we introduce the Semi-Cooperative Extended Incremental Multiagent Agreement Problem with Preferences (SC-EIMAPP). In SC-EIMAPPs, variables arise over time. For each ...