A data scheduling algorithm for autonomous distributed real-time applications in grid computing

An Efficient Algorithm for Real-Time Divisible Load Scheduling

“…With the evolution of cluster computing, researchers have begun to investigate real-time scheduling of parallel applications on a cluster [3,4,13,24,30]. However, most of these studies assume the existence of some form of task graph to describe communication and precedence relations between computational units called subtasks (i.e., nodes in a task graph).…”

Real-Time Divisible Load Scheduling with Different Processor Available Times

“…With the evolution of cluster computing, researchers have begun to investigate real-time scheduling of parallel applications [4,6,16,26,37]. However, most of these studies assume the existence of some form of task graph to describe communication and precedence relations between computational units called subtasks (i.e., nodes in the task graph).…”

Scheduling time-bounded dynamic software adaptation

“…For example, real-time tracking of storm data for air traffic management has stringent time constraints and non-trivial data scheduling issues due to the amount of flights a single avionics system controls [9].…”

“…The authors of [9] propose a scheduling algorithm that schedules the requests for data items based on a path selection heuristic. Multiple data items are transferred at the same time to different destinations.…”