Publication | Closed Access
Online scheduling and placement of real-time tasks to partially reconfigurable devices
77
Citations
11
References
2004
Year
Unknown Venue
Online Scheduling ProblemCluster ComputingEngineeringComputer ArchitectureReal-time TasksReconfigurable DevicesOperations ResearchOnline SchedulingSuch DevicesSystems EngineeringParallel ComputingJob SchedulerCloud SchedulingComputer EngineeringScheduling (Computing)Computer ScienceReal-time ComputingReal-time AlgorithmScheduling AnalysisOperating SystemsScheduling ProblemEdge ComputingAutomationCloud ComputingReal-time Systems
This paper deals with online scheduling of tasks to partially reconfigurable devices. Such devices are able to execute several tasks in parallel. All tasks share the reconfigurable surface as a single resource which leads to highly dynamic allocation situations. To manage such devices at runtime, we propose a reconfigurable operating system that splits into three main modules: scheduler, placer, and loader. The main characteristic of the resulting online scheduling problem is the strong nexus between scheduling and placement. We discuss a fast online placement technique and then focus on scheduling real-time tasks. We devise guarantee-based schedulers for two scenarios, namely tasks with arbitrary and synchronous arrival times. The schedulers exploit the knowledge about task properties to improve the system's performance. The experiments show that the developed schedulers lead to substantial performance gains at an acceptable runtime overhead.
| Year | Citations | |
|---|---|---|
Page 1
Page 1