An improved feasible shortest path real-time fault-tolerant scheduling algorithm.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/rtcsa/KimLJ00
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/rtcsa/KimLJ00
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Byeong-Soo_Jeong
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hyungill_Kim
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sungyoung_Lee
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FRTCSA.2000.896412
>
foaf:
homepage
<
https://doi.org/10.1109/RTCSA.2000.896412
>
dc:
identifier
DBLP conf/rtcsa/KimLJ00
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FRTCSA.2000.896412
(xsd:string)
dcterms:
issued
2000
(xsd:gYear)
rdfs:
label
An improved feasible shortest path real-time fault-tolerant scheduling algorithm.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Byeong-Soo_Jeong
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hyungill_Kim
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sungyoung_Lee
>
swrc:
pages
363-367
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/rtcsa/2000
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/rtcsa/KimLJ00/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/rtcsa/KimLJ00
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/rtcsa/rtcsa2000.html#KimLJ00
>
rdfs:
seeAlso
<
https://doi.org/10.1109/RTCSA.2000.896412
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/rtcsa
>
dc:
subject
real-time systems; fault tolerant computing; scheduling; queueing theory; computational complexity; feasible shortest path real time fault tolerant scheduling algorithm; fault tolerance; real time computer systems; timing constraints; real time single processor environment; queue based scheduling techniques; feasible shortest path algorithm; linear time heuristics; FSP algorithm; optimal fault tolerant schedules; time complexity; LTH algorithm; greedy heuristics; time interval; real time scheduling performance; backup scheduling; minimum inter-fault time; system performance; primary tasks; fault tolerant schedule; backup schedules
(xsd:string)
dc:
title
An improved feasible shortest path real-time fault-tolerant scheduling algorithm.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document