{"id":"https://openalex.org/W2104667110","doi":"https://doi.org/10.1109/ispan.2002.1004262","title":"Online real-time job scheduling with rate of progress guarantees","display_name":"Online real-time job scheduling with rate of progress guarantees","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2104667110","doi":"https://doi.org/10.1109/ispan.2002.1004262","mag":"2104667110"},"language":"en","primary_location":{"id":"doi:10.1109/ispan.2002.1004262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","raw_type":"proceedings-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/A5035570882","display_name":"Michael A. Palis","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M.A. Palis","raw_affiliation_strings":["Department of Computer Science, Rutgers University, Canden, NJ, USA","[Department of Computer Science, Rutgers University, Camden, NJ, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, Canden, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"[Department of Computer Science, Rutgers University, Camden, NJ, USA]","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035570882"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":null,"apc_paid":null,"fwci":1.2577,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.80642962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9991999864578247,"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.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9922999739646912,"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.7110795378684998},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5812274217605591},{"id":"https://openalex.org/keywords/granularity","display_name":"Granularity","score":0.5663935542106628},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.5340456366539001},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5075186491012573},{"id":"https://openalex.org/keywords/job-queue","display_name":"Job queue","score":0.42824065685272217},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4243181049823761},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.42162856459617615},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.41688868403434753},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4145127534866333},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.39097076654434204},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3526431918144226},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1480993926525116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14524754881858826},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.11314278841018677},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08983033895492554},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08832132816314697}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7110795378684998},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5812274217605591},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.5663935542106628},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.5340456366539001},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5075186491012573},{"id":"https://openalex.org/C171627638","wikidata":"https://www.wikidata.org/wiki/Q6206744","display_name":"Job queue","level":4,"score":0.42824065685272217},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4243181049823761},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.42162856459617615},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.41688868403434753},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4145127534866333},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.39097076654434204},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3526431918144226},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1480993926525116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14524754881858826},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.11314278841018677},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08983033895492554},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08832132816314697},{"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/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ispan.2002.1004262","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2002.1004262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W194244820","https://openalex.org/W1484346035","https://openalex.org/W1485093219","https://openalex.org/W1527826243","https://openalex.org/W1561429731","https://openalex.org/W1879402272","https://openalex.org/W1941732106","https://openalex.org/W1964047916","https://openalex.org/W1984591711","https://openalex.org/W1987285916","https://openalex.org/W1990180428","https://openalex.org/W1997595976","https://openalex.org/W2049033541","https://openalex.org/W2051216594","https://openalex.org/W2062875287","https://openalex.org/W2067297441","https://openalex.org/W2068428611","https://openalex.org/W2074557115","https://openalex.org/W2081954069","https://openalex.org/W2108432635","https://openalex.org/W2109488193","https://openalex.org/W2117876074","https://openalex.org/W2119809695","https://openalex.org/W2120945246","https://openalex.org/W2142888121","https://openalex.org/W2154814482","https://openalex.org/W2262960161","https://openalex.org/W3003755412","https://openalex.org/W3163474831","https://openalex.org/W6629205730","https://openalex.org/W6646323346","https://openalex.org/W6649662083","https://openalex.org/W6663190830"],"related_works":["https://openalex.org/W2401183800","https://openalex.org/W3005973922","https://openalex.org/W4391898412","https://openalex.org/W2735859668","https://openalex.org/W3135770504","https://openalex.org/W2927104664","https://openalex.org/W4385069207","https://openalex.org/W4400936653","https://openalex.org/W1989778799","https://openalex.org/W2078824716"],"abstract_inverted_index":{"Investigates":[0],"the":[1,6,33,41,61,65,71,77,123,137],"job":[2,25,34,72,85],"scheduling":[3,90],"problem":[4],"within":[5],"context":[7],"of":[8,15,29,101,106,132],"reservation-based":[9],"real-time":[10],"systems":[11],"that":[12,36,58,70,94,126,128],"provide":[13],"quality":[14],"service":[16],"(QoS)":[17],"guarantees.":[18],"In":[19],"such":[20],"a":[21,27,98,118,129],"system,":[22],"each":[23],"incoming":[24],"specifies":[26],"rate":[28,69,110],"progress":[30],"requirement":[31],"on":[32,84,122],"execution":[35,68],"must":[37],"be":[38,48],"met":[39],"by":[40],"system":[42],"in":[43,67,81],"order":[44],"for":[45,103,136],"computation":[46],"to":[47],"deemed":[49],"usable.":[50],"A":[51],"new":[52],"metric,":[53],"called":[54],"granularity,":[55],"is":[56,92,95,134],"introduced":[57],"quantifies":[59],"both":[60],"maximum":[62,109],"slowdown":[63],"and":[64,112],"variance":[66],"allows.":[73],"This":[74,115],"metric":[75,79,125],"generalizes":[76,117],"stretch":[78,124],"used":[80],"recent":[82],"research":[83],"scheduling.":[86],"An":[87],"online":[88],"pre-emptive":[89],"algorithm":[91],"presented":[93],"shown":[96],"achieve":[97],"competitive":[99,130],"ratio":[100,131],"g(1-r)":[102],"every":[104],"set":[105],"jobs":[107],"with":[108],"r":[111],"granularity":[113],"g.":[114],"result":[116,120],"previous":[119],"based":[121],"showed":[127],"1-r":[133],"achievable":[135],"case":[138],"when":[139],"g=1.":[140]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}