{"id":"https://openalex.org/W1974022580","doi":"https://doi.org/10.1007/s10951-009-0126-8","title":"Algorithms for testing fault-tolerance of sequenced jobs","display_name":"Algorithms for testing fault-tolerance of sequenced jobs","publication_year":2009,"publication_date":"2009-08-24","ids":{"openalex":"https://openalex.org/W1974022580","doi":"https://doi.org/10.1007/s10951-009-0126-8","mag":"1974022580"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-009-0126-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-009-0126-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-009-0126-8.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10951-009-0126-8.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["Department of Computer Science, University of California, Riverside, CA, USA","Department of Computer Science, University of California - Riverside, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"Department of Computer Science, University of California - Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078555930","display_name":"Mathilde Hurand","orcid":null},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mathilde Hurand","raw_affiliation_strings":["Department d\u2019Informatique (LIX), Ecole Polytechnique, Palaiseau, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department d\u2019Informatique (LIX), Ecole Polytechnique, Palaiseau, France","institution_ids":["https://openalex.org/I142476485","https://openalex.org/I4210139461"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061997850","display_name":"Ji\u0159\u0131\u0301 Sgall","orcid":"https://orcid.org/0000-0003-3658-4848"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Sgall","raw_affiliation_strings":["Department of Applied Mathematics, Charles University, Malostransk\u00e9 n\u00e1m. 25, 11800, Praha 1, Czech Republic","Department of Applied Mathematics, Charles University, Praha 1, Czech Republic 11800#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Malostransk\u00e9 n\u00e1m. 25, 11800, Praha 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Praha 1, Czech Republic 11800#TAB#","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024529572"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14282166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"5","first_page":"501","last_page":"515"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6302143335342407},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5901694297790527},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5896422863006592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5707851052284241},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.533492386341095},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.49338093400001526},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.49085527658462524},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48170000314712524},{"id":"https://openalex.org/keywords/fault","display_name":"Fault (geology)","score":0.444691002368927},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42023593187332153},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3556140661239624},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2786794900894165},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.14128926396369934}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6302143335342407},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5901694297790527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5896422863006592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5707851052284241},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.533492386341095},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.49338093400001526},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.49085527658462524},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48170000314712524},{"id":"https://openalex.org/C175551986","wikidata":"https://www.wikidata.org/wiki/Q47089","display_name":"Fault (geology)","level":2,"score":0.444691002368927},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42023593187332153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3556140661239624},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2786794900894165},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.14128926396369934},{"id":"https://openalex.org/C127313418","wikidata":"https://www.wikidata.org/wiki/Q1069","display_name":"Geology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C165205528","wikidata":"https://www.wikidata.org/wiki/Q83371","display_name":"Seismology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s10951-009-0126-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-009-0126-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-009-0126-8.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.7801","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.7801","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://matsrv.math.cas.cz/~sgall/ps/faults.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.6776","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.6776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cas.cz/preprint/pre-2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.569.8072","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.569.8072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lix.polytechnique.fr/~hurand/Publications/FTS/FTS.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.588.7619","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.588.7619","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://kam.mff.cuni.cz/~sgall/ps/faults.pdf","raw_type":"text"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt16f8z66b","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/16f8z66b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Scheduling, vol 12, iss 5","raw_type":"article"},{"id":"pmh:qt16f8z66b","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/16f8z66b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chrobak, Marek; Hurand, Mathilde; & Sgall, Ji\u00c5\u0099\u00c3\u00ad. (2009). Algorithms for testing fault-tolerance of sequenced jobs. Journal of Scheduling, 12(5), pp 501-515. doi: 10.1007/s10951-009-0126-8. Retrieved from: http://www.escholarship.org/uc/item/16f8z66b","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10951-009-0126-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-009-0126-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-009-0126-8.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G1574593218","display_name":"Institute for Theoretical Computer Science","funder_award_id":"1M0545","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G2565024621","display_name":"US-France Cooperative Research:  Offline and Online Algorithms for Job Scheduling Problems","funder_award_id":"0340752","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4872888458","display_name":"Online Competitive Algorithms","funder_award_id":"0208856","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5044006363","display_name":null,"funder_award_id":"AV0Z10190503","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G7474161113","display_name":"On-Line Competitive Algorithms","funder_award_id":"9988360","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8051148489","display_name":"Approximation Algorithms for Combinatorial Optimization","funder_award_id":"0729071","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8118483970","display_name":null,"funder_award_id":"CCF-0729071","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321005","display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","ror":"https://ror.org/037n8p820"},{"id":"https://openalex.org/F4320337370","display_name":"Office of International Science and Engineering","ror":"https://ror.org/01k638r21"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1974022580.pdf","grobid_xml":"https://content.openalex.org/works/W1974022580.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1481495003","https://openalex.org/W1548819781","https://openalex.org/W1987371008","https://openalex.org/W2002304529","https://openalex.org/W2059985428","https://openalex.org/W2094708479","https://openalex.org/W2115147070","https://openalex.org/W2115544146","https://openalex.org/W2116214478","https://openalex.org/W2124870954","https://openalex.org/W2138348011","https://openalex.org/W2153972724","https://openalex.org/W2162561614","https://openalex.org/W2169322619","https://openalex.org/W4238014149","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2165143308","https://openalex.org/W3086618278","https://openalex.org/W1967767358","https://openalex.org/W4360764540","https://openalex.org/W2139348078","https://openalex.org/W2048385336","https://openalex.org/W4231657010","https://openalex.org/W2101184050","https://openalex.org/W2398738602","https://openalex.org/W2965171438"],"abstract_inverted_index":{"We":[0,17],"study":[1,173],"the":[2,84,98,123,189,204],"problem":[3,23],"of":[4,10,34,46,86,112,213],"testing":[5,75],"whether":[6],"a":[7,58,91,110,210],"given":[8,92],"set":[9],"sequenced":[11],"jobs":[12],"can":[13,53,65],"tolerate":[14],"transient":[15],"faults.":[16],"present":[18],"efficient":[19],"algorithms":[20],"for":[21,77],"this":[22,164,176,214],"in":[24,100,107,203],"several":[25],"fault":[26,29],"models.":[27],"A":[28],"model":[30,99],"describes":[31],"what":[32],"types":[33,45],"faults":[35,47,87,104],"are":[36,48,105,154],"allowed":[37],"and":[38,61,80,147],"specifies":[39],"assumptions":[40],"on":[41,209],"their":[42],"frequency.":[43],"Two":[44],"considered:":[49],"hidden":[50,81,136],"faults,":[51,63,82,129,137],"that":[52,64,150,175,187],"only":[54],"be":[55,66,194],"detected":[56,67],"after":[57],"job":[59,125,152],"completes,":[60],"exposed":[62,79,128],"immediately.":[68],"First,":[69],"we":[70,96,130,138,148,184],"give":[71,131,139],"an":[72,132,140,158,198],"O(n)-time":[73,133],"fault-tolerance":[74],"algorithm,":[76],"both":[78],"if":[83,151],"number":[85],"does":[88],"not":[89,193],"exceed":[90],"parameter":[93],"k.":[94],"Then":[95],"consider":[97],"which":[101],"any":[102],"two":[103],"separated":[106],"time":[108,144,168],"by":[109,196],"gap":[111],"length":[113],"at":[114,120],"least":[115,121],"\u0394,":[116],"where":[117],"\u0394":[118],"is":[119,169],"twice":[122],"maximum":[124],"length.":[126],"For":[127,135],"algorithm.":[134],"algorithm":[141],"with":[142],"running":[143,167],"O(n":[145],"2),":[146],"prove":[149],"lengths":[153],"distributed":[155],"uniformly":[156],"over":[157],"interval":[159],"[0,p":[160],"max":[161],"],":[162],"then":[163],"algorithm\u2019s":[165],"expected":[166],"O(n).":[170],"Our":[171],"experimental":[172],"shows":[174],"linear-time":[177],"performance":[178,191],"extends":[179],"to":[180],"other":[181],"distributions.":[182],"Finally,":[183],"provide":[185],"evidence":[186],"improving":[188],"worst-case":[190],"may":[192],"possible,":[195],"proving":[197],"\u03a9(n":[199],"2)":[200],"lower":[201],"bound,":[202],"algebraic":[205],"computation":[206],"tree":[207],"model,":[208],"slight":[211],"generalization":[212],"problem.":[215]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}