Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an...
Ausführliche Beschreibung
Autor*in: |
Chen, Jian-Jia [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2006 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Springer Science + Business Media, LLC 2006 |
---|
Übergeordnetes Werk: |
Enthalten in: Real-time systems - Kluwer Academic Publishers, 1989, 34(2006), 3 vom: 31. Juli, Seite 155-172 |
---|---|
Übergeordnetes Werk: |
volume:34 ; year:2006 ; number:3 ; day:31 ; month:07 ; pages:155-172 |
Links: |
---|
DOI / URN: |
10.1007/s11241-006-8198-4 |
---|
Katalog-ID: |
OLC2054358959 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2054358959 | ||
003 | DE-627 | ||
005 | 20230504062445.0 | ||
007 | tu | ||
008 | 200819s2006 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s11241-006-8198-4 |2 doi | |
035 | |a (DE-627)OLC2054358959 | ||
035 | |a (DE-He213)s11241-006-8198-4-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
100 | 1 | |a Chen, Jian-Jia |e verfasserin |4 aut | |
245 | 1 | 0 | |a Approximation algorithms for scheduling real-time jobs with multiple feasible intervals |
264 | 1 | |c 2006 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © Springer Science + Business Media, LLC 2006 | ||
520 | |a Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. | ||
650 | 4 | |a Execution Time | |
650 | 4 | |a Completion Time | |
650 | 4 | |a Start Time | |
650 | 4 | |a Approximation Factor | |
650 | 4 | |a Feasible Schedule | |
700 | 1 | |a Wu, Jun |4 aut | |
700 | 1 | |a Shih, Chi-Sheng |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Real-time systems |d Kluwer Academic Publishers, 1989 |g 34(2006), 3 vom: 31. Juli, Seite 155-172 |w (DE-627)130955892 |w (DE-600)1064543-3 |w (DE-576)025100394 |x 0922-6443 |7 nnns |
773 | 1 | 8 | |g volume:34 |g year:2006 |g number:3 |g day:31 |g month:07 |g pages:155-172 |
856 | 4 | 1 | |u https://doi.org/10.1007/s11241-006-8198-4 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-TEC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_2006 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2057 | ||
912 | |a GBV_ILN_4036 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4318 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4700 | ||
951 | |a AR | ||
952 | |d 34 |j 2006 |e 3 |b 31 |c 07 |h 155-172 |
author_variant |
j j c jjc j w jw c s s css |
---|---|
matchkey_str |
article:09226443:2006----::prxmtoagrtmfrceuigelieosihut |
hierarchy_sort_str |
2006 |
publishDate |
2006 |
allfields |
10.1007/s11241-006-8198-4 doi (DE-627)OLC2054358959 (DE-He213)s11241-006-8198-4-p DE-627 ger DE-627 rakwb eng 004 VZ Chen, Jian-Jia verfasserin aut Approximation algorithms for scheduling real-time jobs with multiple feasible intervals 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. Execution Time Completion Time Start Time Approximation Factor Feasible Schedule Wu, Jun aut Shih, Chi-Sheng aut Enthalten in Real-time systems Kluwer Academic Publishers, 1989 34(2006), 3 vom: 31. Juli, Seite 155-172 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:34 year:2006 number:3 day:31 month:07 pages:155-172 https://doi.org/10.1007/s11241-006-8198-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2057 GBV_ILN_4036 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 31 07 155-172 |
spelling |
10.1007/s11241-006-8198-4 doi (DE-627)OLC2054358959 (DE-He213)s11241-006-8198-4-p DE-627 ger DE-627 rakwb eng 004 VZ Chen, Jian-Jia verfasserin aut Approximation algorithms for scheduling real-time jobs with multiple feasible intervals 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. Execution Time Completion Time Start Time Approximation Factor Feasible Schedule Wu, Jun aut Shih, Chi-Sheng aut Enthalten in Real-time systems Kluwer Academic Publishers, 1989 34(2006), 3 vom: 31. Juli, Seite 155-172 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:34 year:2006 number:3 day:31 month:07 pages:155-172 https://doi.org/10.1007/s11241-006-8198-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2057 GBV_ILN_4036 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 31 07 155-172 |
allfields_unstemmed |
10.1007/s11241-006-8198-4 doi (DE-627)OLC2054358959 (DE-He213)s11241-006-8198-4-p DE-627 ger DE-627 rakwb eng 004 VZ Chen, Jian-Jia verfasserin aut Approximation algorithms for scheduling real-time jobs with multiple feasible intervals 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. Execution Time Completion Time Start Time Approximation Factor Feasible Schedule Wu, Jun aut Shih, Chi-Sheng aut Enthalten in Real-time systems Kluwer Academic Publishers, 1989 34(2006), 3 vom: 31. Juli, Seite 155-172 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:34 year:2006 number:3 day:31 month:07 pages:155-172 https://doi.org/10.1007/s11241-006-8198-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2057 GBV_ILN_4036 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 31 07 155-172 |
allfieldsGer |
10.1007/s11241-006-8198-4 doi (DE-627)OLC2054358959 (DE-He213)s11241-006-8198-4-p DE-627 ger DE-627 rakwb eng 004 VZ Chen, Jian-Jia verfasserin aut Approximation algorithms for scheduling real-time jobs with multiple feasible intervals 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. Execution Time Completion Time Start Time Approximation Factor Feasible Schedule Wu, Jun aut Shih, Chi-Sheng aut Enthalten in Real-time systems Kluwer Academic Publishers, 1989 34(2006), 3 vom: 31. Juli, Seite 155-172 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:34 year:2006 number:3 day:31 month:07 pages:155-172 https://doi.org/10.1007/s11241-006-8198-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2057 GBV_ILN_4036 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 31 07 155-172 |
allfieldsSound |
10.1007/s11241-006-8198-4 doi (DE-627)OLC2054358959 (DE-He213)s11241-006-8198-4-p DE-627 ger DE-627 rakwb eng 004 VZ Chen, Jian-Jia verfasserin aut Approximation algorithms for scheduling real-time jobs with multiple feasible intervals 2006 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, LLC 2006 Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. Execution Time Completion Time Start Time Approximation Factor Feasible Schedule Wu, Jun aut Shih, Chi-Sheng aut Enthalten in Real-time systems Kluwer Academic Publishers, 1989 34(2006), 3 vom: 31. Juli, Seite 155-172 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:34 year:2006 number:3 day:31 month:07 pages:155-172 https://doi.org/10.1007/s11241-006-8198-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2057 GBV_ILN_4036 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 AR 34 2006 3 31 07 155-172 |
language |
English |
source |
Enthalten in Real-time systems 34(2006), 3 vom: 31. Juli, Seite 155-172 volume:34 year:2006 number:3 day:31 month:07 pages:155-172 |
sourceStr |
Enthalten in Real-time systems 34(2006), 3 vom: 31. Juli, Seite 155-172 volume:34 year:2006 number:3 day:31 month:07 pages:155-172 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Execution Time Completion Time Start Time Approximation Factor Feasible Schedule |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Real-time systems |
authorswithroles_txt_mv |
Chen, Jian-Jia @@aut@@ Wu, Jun @@aut@@ Shih, Chi-Sheng @@aut@@ |
publishDateDaySort_date |
2006-07-31T00:00:00Z |
hierarchy_top_id |
130955892 |
dewey-sort |
14 |
id |
OLC2054358959 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054358959</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504062445.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11241-006-8198-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054358959</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11241-006-8198-4-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chen, Jian-Jia</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation algorithms for scheduling real-time jobs with multiple feasible intervals</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science + Business Media, LLC 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Execution Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Completion Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Start Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation Factor</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feasible Schedule</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Jun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shih, Chi-Sheng</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Real-time systems</subfield><subfield code="d">Kluwer Academic Publishers, 1989</subfield><subfield code="g">34(2006), 3 vom: 31. Juli, Seite 155-172</subfield><subfield code="w">(DE-627)130955892</subfield><subfield code="w">(DE-600)1064543-3</subfield><subfield code="w">(DE-576)025100394</subfield><subfield code="x">0922-6443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:34</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:3</subfield><subfield code="g">day:31</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:155-172</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11241-006-8198-4</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">34</subfield><subfield code="j">2006</subfield><subfield code="e">3</subfield><subfield code="b">31</subfield><subfield code="c">07</subfield><subfield code="h">155-172</subfield></datafield></record></collection>
|
author |
Chen, Jian-Jia |
spellingShingle |
Chen, Jian-Jia ddc 004 misc Execution Time misc Completion Time misc Start Time misc Approximation Factor misc Feasible Schedule Approximation algorithms for scheduling real-time jobs with multiple feasible intervals |
authorStr |
Chen, Jian-Jia |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)130955892 |
format |
Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
0922-6443 |
topic_title |
004 VZ Approximation algorithms for scheduling real-time jobs with multiple feasible intervals Execution Time Completion Time Start Time Approximation Factor Feasible Schedule |
topic |
ddc 004 misc Execution Time misc Completion Time misc Start Time misc Approximation Factor misc Feasible Schedule |
topic_unstemmed |
ddc 004 misc Execution Time misc Completion Time misc Start Time misc Approximation Factor misc Feasible Schedule |
topic_browse |
ddc 004 misc Execution Time misc Completion Time misc Start Time misc Approximation Factor misc Feasible Schedule |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Real-time systems |
hierarchy_parent_id |
130955892 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Real-time systems |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 |
title |
Approximation algorithms for scheduling real-time jobs with multiple feasible intervals |
ctrlnum |
(DE-627)OLC2054358959 (DE-He213)s11241-006-8198-4-p |
title_full |
Approximation algorithms for scheduling real-time jobs with multiple feasible intervals |
author_sort |
Chen, Jian-Jia |
journal |
Real-time systems |
journalStr |
Real-time systems |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2006 |
contenttype_str_mv |
txt |
container_start_page |
155 |
author_browse |
Chen, Jian-Jia Wu, Jun Shih, Chi-Sheng |
container_volume |
34 |
class |
004 VZ |
format_se |
Aufsätze |
author-letter |
Chen, Jian-Jia |
doi_str_mv |
10.1007/s11241-006-8198-4 |
dewey-full |
004 |
title_sort |
approximation algorithms for scheduling real-time jobs with multiple feasible intervals |
title_auth |
Approximation algorithms for scheduling real-time jobs with multiple feasible intervals |
abstract |
Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. © Springer Science + Business Media, LLC 2006 |
abstractGer |
Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. © Springer Science + Business Media, LLC 2006 |
abstract_unstemmed |
Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average. © Springer Science + Business Media, LLC 2006 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_62 GBV_ILN_70 GBV_ILN_2006 GBV_ILN_2015 GBV_ILN_2021 GBV_ILN_2057 GBV_ILN_4036 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4700 |
container_issue |
3 |
title_short |
Approximation algorithms for scheduling real-time jobs with multiple feasible intervals |
url |
https://doi.org/10.1007/s11241-006-8198-4 |
remote_bool |
false |
author2 |
Wu, Jun Shih, Chi-Sheng |
author2Str |
Wu, Jun Shih, Chi-Sheng |
ppnlink |
130955892 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s11241-006-8198-4 |
up_date |
2024-07-03T22:50:37.646Z |
_version_ |
1803600042548789248 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054358959</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504062445.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2006 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11241-006-8198-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054358959</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11241-006-8198-4-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chen, Jian-Jia</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation algorithms for scheduling real-time jobs with multiple feasible intervals</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2006</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science + Business Media, LLC 2006</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. Earlier works developed an optimal off-line algorithm to schedule all the jobs in a given job set and on-line heuristics to schedule the jobs in a best effort manner. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is $${\cal N}{\cal P}$$-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm Least Earliest Completion Time First (LECF) is shown to have a 2-approximation factor; when jobs are preemptible, Algorithm Least Execution Time First (LEF) is proved being a 3-approximation algorithm. We show that our analysis for the two algorithms are tight. We also evaluate our algorithms by extensive simulations. Simulation results show that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms in average.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Execution Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Completion Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Start Time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation Factor</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Feasible Schedule</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Jun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shih, Chi-Sheng</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Real-time systems</subfield><subfield code="d">Kluwer Academic Publishers, 1989</subfield><subfield code="g">34(2006), 3 vom: 31. Juli, Seite 155-172</subfield><subfield code="w">(DE-627)130955892</subfield><subfield code="w">(DE-600)1064543-3</subfield><subfield code="w">(DE-576)025100394</subfield><subfield code="x">0922-6443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:34</subfield><subfield code="g">year:2006</subfield><subfield code="g">number:3</subfield><subfield code="g">day:31</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:155-172</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11241-006-8198-4</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">34</subfield><subfield code="j">2006</subfield><subfield code="e">3</subfield><subfield code="b">31</subfield><subfield code="c">07</subfield><subfield code="h">155-172</subfield></datafield></record></collection>
|
score |
7.3985004 |