{"id":"https://openalex.org/W2094708479","doi":"https://doi.org/10.1007/s004530010034","title":"Fault-Tolerant Real-Time Scheduling","display_name":"Fault-Tolerant Real-Time Scheduling","publication_year":2000,"publication_date":"2000-09-01","ids":{"openalex":"https://openalex.org/W2094708479","doi":"https://doi.org/10.1007/s004530010034","mag":"2094708479"},"language":"en","primary_location":{"id":"doi:10.1007/s004530010034","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010034","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036642435","display_name":"Bala Kalyanasundaram","orcid":null},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Kalyanasundaram","raw_affiliation_strings":["Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. kalyan@cs.pitt.edu,  kirk@cs.pitt.edu., US","Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. kalyan@cs.pitt.edu, kirk@cs.pitt.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. kalyan@cs.pitt.edu,  kirk@cs.pitt.edu., US","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. kalyan@cs.pitt.edu, kirk@cs.pitt.edu., US","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046525615","display_name":"Kirk Pruhs","orcid":"https://orcid.org/0000-0001-5680-1753"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Pruhs","raw_affiliation_strings":["Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. kalyan@cs.pitt.edu,  kirk@cs.pitt.edu., US","Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. kalyan@cs.pitt.edu, kirk@cs.pitt.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. kalyan@cs.pitt.edu,  kirk@cs.pitt.edu., US","institution_ids":["https://openalex.org/I170201317"]},{"raw_affiliation_string":"Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA. kalyan@cs.pitt.edu, kirk@cs.pitt.edu., US","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036642435"],"corresponding_institution_ids":["https://openalex.org/I170201317"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.6274,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.73519889,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"28","issue":"1","first_page":"125","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9990000128746033,"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.9976999759674072,"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/competitive-analysis","display_name":"Competitive analysis","score":0.902458906173706},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.8160507678985596},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7956876754760742},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.630207896232605},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5846459269523621},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5480853915214539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5094397664070129},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.49911999702453613},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.4778442084789276},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4614153802394867},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45655837655067444},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4542534649372101},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.44656825065612793},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4332755506038666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40672966837882996},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3306037485599518},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2826763093471527},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.17004528641700745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12703603506088257}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.902458906173706},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.8160507678985596},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7956876754760742},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.630207896232605},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5846459269523621},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5480853915214539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5094397664070129},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.49911999702453613},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.4778442084789276},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4614153802394867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45655837655067444},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4542534649372101},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44656825065612793},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4332755506038666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40672966837882996},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3306037485599518},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2826763093471527},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.17004528641700745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12703603506088257},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s004530010034","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s004530010034","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W276536446","https://openalex.org/W1720140439","https://openalex.org/W1980135493","https://openalex.org/W1997595976","https://openalex.org/W2002345807","https://openalex.org/W2023171863","https://openalex.org/W2076364559","https://openalex.org/W2099261768","https://openalex.org/W3163474831"],"related_works":["https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2058681277","https://openalex.org/W2781235162","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2772037640","https://openalex.org/W2951573806","https://openalex.org/W2088826026","https://openalex.org/W96431103"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}