Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Timing-Anomaly Free Dynamic Scheduling of Conditional DAG Tasks on Multi-Core Systems

Timing-Anomaly Free Dynamic Scheduling of Conditional DAG Tasks on Multi-Core Systems In this paper, we propose a novel approach to schedule conditional DAG parallel tasks, with which we can derive safe response time upper bounds significantly better than the state-of-the-art counterparts. The main idea is to eliminate the notorious timing anomaly in scheduling parallel tasks by enforcing certain order constraints among the vertices, and thus the response time bound can be accurately predicted off-line by somehow “simulating” the runtime scheduling. A key challenge to apply the timing-anomaly free scheduling approach to conditional DAG parallel tasks is that at runtime it may generate exponentially many instances from a conditional DAG structure. To deal with this problem, we develop effective abstractions, based on which a safe response time upper bound is computed in polynomial time. We also develop algorithms to explore the vertex orders to shorten the response time bound. The effectiveness of the proposed approach is evaluated by experiments with randomly generated DAG tasks with different parameter configurations. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Embedded Computing Systems (TECS) Association for Computing Machinery

Timing-Anomaly Free Dynamic Scheduling of Conditional DAG Tasks on Multi-Core Systems

Download PDF
19 pages

Loading next page...
 
/lp/association-for-computing-machinery/timing-anomaly-free-dynamic-scheduling-of-conditional-dag-tasks-on-6NoGoPjZtM

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2019 ACM
ISSN
1539-9087
eISSN
1558-3465
DOI
10.1145/3358236
Publisher site
See Article on Publisher Site

Abstract

In this paper, we propose a novel approach to schedule conditional DAG parallel tasks, with which we can derive safe response time upper bounds significantly better than the state-of-the-art counterparts. The main idea is to eliminate the notorious timing anomaly in scheduling parallel tasks by enforcing certain order constraints among the vertices, and thus the response time bound can be accurately predicted off-line by somehow “simulating” the runtime scheduling. A key challenge to apply the timing-anomaly free scheduling approach to conditional DAG parallel tasks is that at runtime it may generate exponentially many instances from a conditional DAG structure. To deal with this problem, we develop effective abstractions, based on which a safe response time upper bound is computed in polynomial time. We also develop algorithms to explore the vertex orders to shorten the response time bound. The effectiveness of the proposed approach is evaluated by experiments with randomly generated DAG tasks with different parameter configurations.

Journal

ACM Transactions on Embedded Computing Systems (TECS) – Association for Computing Machinery

Published: Oct 8, 2019

Keywords: Timing anomaly

References

  • List scheduling algorithm for heterogeneous systems by an optimistic cost table
    Arabnejad, Hamid; Barbosa, Jorge G.
  • Response-time analysis of parallel fork-join workloads with real-time constraints
    Axer, Philip; Quinton, Sophie; Neukirchner, Moritz; Ernst, Rolf; Döbel, Björn; Härtig, Hermann
  • The federated scheduling of systems of conditional sporadic DAG tasks
    Baruah, Sanjoy
  • Multiprocessor Scheduling for Real-time Systems
    Baruah, Sanjoy; Bertogna, Marko; Buttazzo, Giorgio
  • The global EDF scheduling of systems of conditional sporadic DAG tasks
    Baruah, Sanjoy; Bonifaci, Vincenzo; Marchetti-Spaccamela, Alberto
  • A generalized parallel task model for recurrent real-time processes
    Baruah, Sanjoy; Bonifaci, Vincenzo; Marchetti-Spaccamela, Alberto; Stougie, Leen; Wiese, Andreas
  • Embedded Real-time Systems
    Calvez, Jean Paul; Wyche, Alan; Edmundson, Charles
  • Global edf schedulability analysis for synchronous parallel tasks on multicore platforms
    Chwa, Hoon Sung; Lee, Jinkyu; Phan, Kieu-My; Easwaran, Arvind; Shin, Insik
  • Random graph generation for scheduling simulations
    Cordeiro, Daniel; Mounié, Grégory; Perarnau, Swann; Trystram, Denis; Vincent, Jean-Marc; Wagner, Frédéric
  • Bounds on multiprocessing timing anomalies
    Graham, R. L.
  • Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors
    Kwok, Yu-Kwong; Ahmad, Ishfaq
  • Static scheduling algorithms for allocating directed task graphs to multiprocessors
    Kwok, Yu-Kwong; Ahmad, Ishfaq
  • Scheduling parallel real-time tasks on multi-core processors
    Lakshmanan, Karthik; Kato, Shinpei; Rajkumar, Ragunathan
  • Analysis of federated and global scheduling for parallel real-time tasks
    Li, Jing; Chen, Jian Jia; Agrawal, Kunal; Lu, Chenyang; Gill, Chris; Saifullah, Abusayeed
  • Timing anomalies in dynamically scheduled microprocessors
    Lundqvist, Thomas; Stenstrom, Per
  • Schedulability analysis of conditional parallel task graphs in multicore systems
    Melani, Alessandra; Bertogna, Marko; Bonifaci, Vincenzo; Marchetti-Spaccamela, Alberto; Buttazzo, Giorgio
  • Response-time analysis of conditional DAG tasks in multiprocessor systems
    Melani, Alessandra; Bertogna, Marko; Bonifaci, Vincenzo; Marchetti-Spaccamela, Alberto; Buttazzo, Giorgio C.
  • Scheduling parallel real-time recurrent tasks on multicore platforms
    Pathan, Risat Mahmud; Voudouris, Petros; Stenstrom, Per
  • A definition and classification of timing anomalies
    Reineke, Jan; Wachter, Björn; Thesing, Stefan; Wilhelm, Reinhard; Polian, Ilia; Eisinger, Jochen; Becker, Bernd
  • Multi-core real-time scheduling for generalized parallel task models
    Saifullah, Abusayeed; Li, Jing; Agrawal, Kunal; Lu, Chenyang; Gill, Christopher
  • Timing-anomaly free dynamic scheduling of task-based parallel applications
    Voudouris, Petros; Stenström, Per; Pathan, Risat