{"id":"https://openalex.org/W1974880582","doi":"https://doi.org/10.1137/s0097539792233634","title":"On-Line Scheduling of Imprecise Computations to Minimize Error","display_name":"On-Line Scheduling of Imprecise Computations to Minimize Error","publication_year":1996,"publication_date":"1996-10-01","ids":{"openalex":"https://openalex.org/W1974880582","doi":"https://doi.org/10.1137/s0097539792233634","mag":"1974880582"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792233634","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792233634","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5047897840","display_name":"Wei\u2010Kuan Shih","orcid":"https://orcid.org/0000-0001-8356-2495"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wei-Kuan Shih","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048750937","display_name":"Jane W. S. Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jane W. S. Liu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047897840"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4017,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.6608601,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"5","first_page":"1105","last_page":"1121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9983000159263611,"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.9983000159263611,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9965999722480774,"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/computer-science","display_name":"Computer science","score":0.707231342792511},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6698065996170044},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6449441313743591},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5325191617012024},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5280961394309998},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4584794044494629},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4247645139694214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4175351560115814},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3396874964237213},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2857149839401245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1781550645828247},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17145425081253052}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.707231342792511},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6698065996170044},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6449441313743591},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5325191617012024},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5280961394309998},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4584794044494629},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4247645139694214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4175351560115814},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3396874964237213},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2857149839401245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1781550645828247},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17145425081253052},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792233634","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792233634","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":5,"referenced_works":["https://openalex.org/W1982759900","https://openalex.org/W1985907895","https://openalex.org/W1991708881","https://openalex.org/W2107216979","https://openalex.org/W2164448820"],"related_works":["https://openalex.org/W1992741870","https://openalex.org/W2790478050","https://openalex.org/W3174582865","https://openalex.org/W2997221951","https://openalex.org/W1585407510","https://openalex.org/W2980054296","https://openalex.org/W2046459844","https://openalex.org/W1992519595","https://openalex.org/W3068261568","https://openalex.org/W2162534229"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"three":[3,98,103],"algorithms":[4,45,82,99],"for":[5,84,102],"scheduling":[6],"preemptive,":[7],"imprecise":[8,19],"tasks":[9,34,64,86,134,143],"on":[10],"a":[11,23],"processor":[12,41],"to":[13,66,76],"minimize":[14],"the":[15,33,40,58,62,70],"total":[16,90],"error.":[17],"Each":[18],"task":[20,25,52,56,106,111,124],"consists":[21],"of":[22,32,60,105],"mandatory":[24,55,63],"followed":[26],"by":[27,78],"an":[28],"optional":[29],"task.":[30],"Some":[31],"are":[35,92,100,131,151],"on-line;":[36],"they":[37],"arrive":[38],"after":[39],"begins":[42],"execution.":[43],"The":[44,81,97],"assume":[46],"that":[47],"when":[48,109,121,141],"each":[49],"new":[50],"on-line":[51,113,123,142],"arrives,":[53],"its":[54,118],"and":[57,114,139,156],"portions":[59],"all":[61],"yet":[65],"be":[67,73],"completed":[68],"at":[69],"time":[71],"can":[72],"feasibly":[74],"scheduled":[75],"complete":[77],"their":[79],"deadlines.":[80],"produce":[83],"such":[85],"feasible":[87],"schedules":[88],"whose":[89],"errors":[91],"as":[93,95],"small":[94],"possible.":[96],"designed":[101],"types":[104],"systems:":[107],"(1)":[108],"every":[110,122],"is":[112,115,125],"ready":[116,126,137,146],"upon":[117,127],"arrival,":[119],"(2)":[120],"arrival":[128],"but":[129],"there":[130],"also":[132],"off-line":[133],"with":[135],"arbitrary":[136,145],"times,":[138],"(3)":[140],"have":[144],"times.":[147],"Their":[148],"running":[149],"times":[150],"$O(n\\log":[152,154,157],"n)$,":[153,155,159],"^2":[158],"respectively.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
