{"id":"https://openalex.org/W1996897074","doi":"https://doi.org/10.1145/1399583.1399585","title":"Feedback scheduling of real-time divisible loads in clusters","display_name":"Feedback scheduling of real-time divisible loads in clusters","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W1996897074","doi":"https://doi.org/10.1145/1399583.1399585","mag":"1996897074"},"language":"en","primary_location":{"id":"doi:10.1145/1399583.1399585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1399583.1399585","pdf_url":null,"source":{"id":"https://openalex.org/S4210187018","display_name":"ACM SIGBED Review","issn_l":"1551-3688","issn":["1551-3688"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGBED Review","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/A5034235300","display_name":"Duc Thanh Anh Luong","orcid":"https://orcid.org/0000-0003-4768-5089"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Duc Luong","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071975084","display_name":"Jitender S. Deogun","orcid":"https://orcid.org/0000-0001-6402-2549"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jitender Deogun","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110433428","display_name":"Steve Goddard","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steve Goddard","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034235300"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":1.0361,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79761275,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"5","issue":"2","first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9994000196456909,"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.9994000196456909,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9984999895095825,"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.9948999881744385,"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.8578916192054749},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.8158612847328186},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7145037651062012},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6854222416877747},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6364561319351196},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6183193922042847},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5072471499443054},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5018355846405029},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.44523248076438904},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.43742895126342773},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.419489324092865},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.41003769636154175},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.3588305711746216},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.25496578216552734},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1244117021560669},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10047769546508789}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8578916192054749},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.8158612847328186},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7145037651062012},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6854222416877747},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6364561319351196},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6183193922042847},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5072471499443054},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5018355846405029},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.44523248076438904},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.43742895126342773},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.419489324092865},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.41003769636154175},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.3588305711746216},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.25496578216552734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1244117021560669},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10047769546508789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1399583.1399585","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1399583.1399585","pdf_url":null,"source":{"id":"https://openalex.org/S4210187018","display_name":"ACM SIGBED Review","issn_l":"1551-3688","issn":["1551-3688"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGBED Review","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.543.6954","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.543.6954","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.virginia.edu/~sigbed/archives/2008-07/6.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.41999998688697815,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1494547925","https://openalex.org/W1546772898","https://openalex.org/W1570895331","https://openalex.org/W2076285066","https://openalex.org/W2103595069","https://openalex.org/W2163878603","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W2184166483","https://openalex.org/W2167574351","https://openalex.org/W3184267879","https://openalex.org/W1545991362","https://openalex.org/W2076947091","https://openalex.org/W2245286458","https://openalex.org/W2404383452","https://openalex.org/W2172075652","https://openalex.org/W2545511463"],"abstract_inverted_index":{"Quality":[0],"of":[1,31,47,53,70,107,116,123],"Service":[2],"(QoS)":[3],"provisioning":[4,115],"for":[5],"divisible":[6,58,117],"loads":[7,59,118],"in":[8,34,75],"clusters":[9,61],"can":[10],"be":[11],"enabled":[12],"using":[13],"real-time":[14],"scheduling":[15,57,92],"theory,":[16],"but":[17],"is":[18,62,99,111],"based":[19,63],"on":[20,56,60,64],"an":[21,87],"important":[22],"assumption:":[23],"that":[24,43,98],"the":[25,28,35,54,108],"scheduler":[26],"knows":[27],"execution":[29,45,121],"time":[30],"every":[32],"task":[33],"workload.":[36],"Information":[37],"from":[38],"production":[39],"clusters,":[40],"however,":[41],"shows":[42],"estimated":[44,120],"times":[46,122],"tasks":[48,124],"are":[49,125],"often":[50],"inaccurate.":[51,126],"Most":[52],"work":[55,84],"this":[65,78,103],"information,":[66],"and":[67],"therefore":[68],"maybe":[69],"limited":[71],"use":[72],"when":[73,119],"applied":[74],"practice.":[76],"In":[77],"paper,":[79],"we":[80],"present":[81],"our":[82],"ongoing":[83],"to":[85,101,112],"develop":[86],"EDF":[88],"(earliest":[89],"deadline":[90],"first)":[91],"algorithm":[93,110],"with":[94],"a":[95],"feedback":[96],"mechanism":[97],"able":[100],"solve":[102],"problem.":[104],"The":[105],"objective":[106],"new":[109],"provide":[113],"QoS":[114]},"counts_by_year":[{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}