uniprocessor feasibility of sporadic tasks with

play

Uniprocessor Feasibility of Sporadic Tasks with Constrained - PowerPoint PPT Presentation

Dec 26, 2022 •471 likes •1.19k views

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly coNP-complete Pontus Ekberg & Wang Yi Uppsala University ECRTS 2015 Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP

Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly coNP-complete Pontus Ekberg & Wang Yi Uppsala University ECRTS 2015
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
Context on the Uniprocessor Feasibility Problem ? coNP -complete ? Strongly coNP -complete ? Pseudo-poly. solution exists 1980 ? 1990 2000 2010 Leung & Merrill Baruah et al. Eisenbrand & Rothvoß Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete (Weakly) coNP -complete General case ? Utilization bounded by a Asynchronous periodic Synchronous periodic (or sporadic) (Weakly) Strongly coNP -hard ? Strongly coNP -complete ? (Weakly) coNP -hard ? 2 constant c < 1
How? SCP SCP Strongly NP -complete (Baruah et al., 1990) Pseudo-polynomial transformation in- Feasibility in- Feasibility Strongly NP -hard Strongly coNP -hard Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 3 ∝
How? SCP SCP Strongly NP -complete (Baruah et al., 1990) Pseudo-polynomial transformation in- Feasibility in- Feasibility Strongly NP -hard Strongly coNP -hard Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 3 ∝
How? SCP SCP Strongly NP -complete (Baruah et al., 1990) Pseudo-polynomial transformation in- Feasibility in- Feasibility Strongly NP -hard Strongly coNP -hard Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 3 ∝
How? SCP SCP Strongly NP -complete (Baruah et al., 1990) Pseudo-polynomial transformation in- Feasibility in- Feasibility Strongly NP -hard Strongly coNP -hard Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 3 ∝
How? SCP SCP Strongly NP -complete (Baruah et al., 1990) Pseudo-polynomial transformation in- Feasibility in- Feasibility Strongly NP -hard Strongly coNP -hard Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 3 ∝
The Simultaneous Congruences Problem (SCP) An SCP instance is given by a pair A k . Example: A k A ? Yes A ? No Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 4
The Simultaneous Congruences Problem (SCP) Example: A k A ? Yes A ? No Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 4 An SCP instance is given by a pair ( A , k ) .
The Simultaneous Congruences Problem (SCP) Example: k A ? Yes A ? No Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 4 An SCP instance is given by a pair ( A , k ) . A = { (2 , 4) , (4 , 6) , (3 , 8) , (0 , 3) }
The Simultaneous Congruences Problem (SCP) Example: A ? Yes A ? No Pontus Ekberg Sporadic Feasibility is Strongly coNP-complete 4 An SCP instance is given by a pair ( A , k ) . A = { (2 , 4) , (4 , 6) , (3 , 8) , (0 , 3) } k = 2
The Simultaneous Congruences Problem (SCP) A Sporadic Feasibility is Strongly coNP-complete Pontus Ekberg No ? A Yes ? 4 Example: An SCP instance is given by a pair ( A , k ) . A = { (2 , 4) , (4 , 6) , (3 , 8) , (0 , 3) } k = 2 0 2 4 6 8 10 12 14 16 18 20
The Simultaneous Congruences Problem (SCP) A Sporadic Feasibility is Strongly coNP-complete Pontus Ekberg No ? A Yes ? 4 Example: An SCP instance is given by a pair ( A , k ) . A = { (2 , 4) , (4 , 6) , (3 , 8) , (0 , 3) } k = 2 (2 , 4) 0 2 4 6 8 10 12 14 16 18 20
The Simultaneous Congruences Problem (SCP) A Sporadic Feasibility is Strongly coNP-complete Pontus Ekberg No ? A Yes ? 4 Example: An SCP instance is given by a pair ( A , k ) . A = { (2 , 4) , (4 , 6) , (3 , 8) , (0 , 3) } k = 2 (2 , 4) (4 , 6) 0 2 4 6 8 10 12 14 16 18 20
The Simultaneous Congruences Problem (SCP) A Sporadic Feasibility is Strongly coNP-complete Pontus Ekberg No ? A Yes ? 4 Example: An SCP instance is given by a pair ( A , k ) . A = { (2 , 4) , (4 , 6) , (3 , 8) , (0 , 3) } k = 2 (2 , 4) (4 , 6) (3 , 8) 0 2 4 6 8 10 12 14 16 18 20

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

More recommend