{"id":"https://openalex.org/W100566344","doi":null,"title":"A fast, effective scheduling framework for parallel computing systems","display_name":"A fast, effective scheduling framework for parallel computing systems","alternate_titles":[],"publication_year":1990,"publication_date":"1990-01-01","ids":{"openalex":"https://openalex.org/W100566344","mag":"100566344"},"language":"en","primary_location":{"id":"pmh:oai:etd.ohiolink.edu:osu1487676261013122","doi":null,"is_oa":true,"landing_page_url":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261013122","pdf_url":"https://etd.ohiolink.edu/acprod/odb_etd/ws/send_file/send?accession=osu1487676261013122&disposition=inline","source":{"id":"https://openalex.org/S4377196344","display_name":"OhioLink ETD Center (Ohio Library and Information Network)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210155183","host_organization_name":"Ohio Library and Information Network","host_organization_lineage":["https://openalex.org/I4210155183"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261013122","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W100566344"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://etd.ohiolink.edu/acprod/odb_etd/ws/send_file/send?accession=osu1487676261013122&disposition=inline","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002929310","display_name":"Ben A. Blake","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Ben Blake","raw_affiliation_strings":["The Ohio State University Columbus"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University Columbus","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5002929310"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":0.5141,"has_fulltext":true,"cited_by_count":3,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.66696942,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6675000190734863,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6675000190734863,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.20010000467300415,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.10729999840259552,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-scheduling","display_name":"parallel scheduling","score":0.925000011920929},{"id":"https://openalex.org/keywords/real-time-scheduling","display_name":"real-time scheduling","score":0.8489999771118164},{"id":"https://openalex.org/keywords/dynamic-scheduling","display_name":"dynamic scheduling","score":0.6359999775886536},{"id":"https://openalex.org/keywords/process-migration","display_name":"task migration","score":0.5289999842643738},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"multiprocessor scheduling","score":0.6620000004768372},{"id":"https://openalex.org/keywords/scheduling-heuristics","display_name":"heuristic scheduling","score":0.5870000123977661},{"id":"https://openalex.org/keywords/deadline-constraints","display_name":"deadline constraints","score":0.6389999985694885},{"id":"https://openalex.org/keywords/completion-time-minimization","display_name":"completion time minimization","score":0.8360000252723694},{"id":"https://openalex.org/keywords/precedence-constraints","display_name":"precedence constraints","score":0.7360000014305115},{"id":"https://openalex.org/keywords/group-scheduling","display_name":"group scheduling","score":0.8130000233650208},{"id":"https://openalex.org/keywords/task-criticality","display_name":"task criticality","score":0.8339999914169312},{"id":"https://openalex.org/keywords/scheduling-overhead","display_name":"scheduling overhead","score":0.7269999980926514},{"id":"https://openalex.org/keywords/latency","display_name":"latency","score":0.5090000033378601},{"id":"https://openalex.org/keywords/message-passing","display_name":"message passing","score":0.5210000276565552},{"id":"https://openalex.org/keywords/scheduling-framework","display_name":"scheduling framework","score":0.45100000500679016}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8504002094268799},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6996050477027893},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6930162310600281},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6059791445732117},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.5483353137969971},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5381605625152588},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5241767764091492},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5100739598274231},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.49817585945129395},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.4762953817844391},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.47473272681236267},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4590436816215515},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4238324761390686},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4184448719024658},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13942775130271912},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1238049566745758},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10485997796058655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"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":2,"locations":[{"id":"pmh:oai:etd.ohiolink.edu:osu1487676261013122","doi":null,"is_oa":true,"landing_page_url":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261013122","pdf_url":"https://etd.ohiolink.edu/acprod/odb_etd/ws/send_file/send?accession=osu1487676261013122&disposition=inline","source":{"id":"https://openalex.org/S4377196344","display_name":"OhioLink ETD Center (Ohio Library and Information Network)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210155183","host_organization_name":"Ohio Library and Information Network","host_organization_lineage":["https://openalex.org/I4210155183"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261013122","raw_type":"text"},{"id":"mag:100566344","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=99700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:etd.ohiolink.edu:osu1487676261013122","doi":null,"is_oa":true,"landing_page_url":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261013122","pdf_url":"https://etd.ohiolink.edu/acprod/odb_etd/ws/send_file/send?accession=osu1487676261013122&disposition=inline","source":{"id":"https://openalex.org/S4377196344","display_name":"OhioLink ETD Center (Ohio Library and Information Network)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210155183","host_organization_name":"Ohio Library and Information Network","host_organization_lineage":["https://openalex.org/I4210155183"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1487676261013122","raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W100566344.pdf","grobid_xml":"https://content.openalex.org/works/W100566344.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W3502473","https://openalex.org/W33274397","https://openalex.org/W36750305","https://openalex.org/W74870764","https://openalex.org/W95020578","https://openalex.org/W99246831","https://openalex.org/W127543348","https://openalex.org/W176375125","https://openalex.org/W180879654","https://openalex.org/W183785788","https://openalex.org/W190452896","https://openalex.org/W195587297","https://openalex.org/W247409750","https://openalex.org/W1486083926","https://openalex.org/W1575880783","https://openalex.org/W1589576271","https://openalex.org/W1715984472","https://openalex.org/W1829003113","https://openalex.org/W1933254333","https://openalex.org/W1965067804","https://openalex.org/W1967392937","https://openalex.org/W1976193514","https://openalex.org/W1978732961","https://openalex.org/W2001200190","https://openalex.org/W2022142019","https://openalex.org/W2022286812","https://openalex.org/W2022975943","https://openalex.org/W2043792807","https://openalex.org/W2050095811","https://openalex.org/W2051674080","https://openalex.org/W2057412510","https://openalex.org/W2058736839","https://openalex.org/W2064263864","https://openalex.org/W2067242805","https://openalex.org/W2070634651","https://openalex.org/W2071680704","https://openalex.org/W2072863557","https://openalex.org/W2075301351","https://openalex.org/W2088899347","https://openalex.org/W2105628511","https://openalex.org/W2126734353","https://openalex.org/W2142063030","https://openalex.org/W2526045470","https://openalex.org/W2570030068"],"related_works":["https://openalex.org/W2665672841","https://openalex.org/W2523171090","https://openalex.org/W7097601086","https://openalex.org/W200053361","https://openalex.org/W1589576271","https://openalex.org/W92187638","https://openalex.org/W7098665213","https://openalex.org/W58456694","https://openalex.org/W207189076","https://openalex.org/W289230639"],"abstract_inverted_index":{"We":[0,85,130],"would":[1],"like":[2],"fast,":[3],"effective":[4,74,220,327],"schedulers":[5,51,62,191,215,297,329],"to":[6,82,106,188,236,245,289,319],"be":[7,28,43,56],"available":[8],"for":[9,23,39,52,63,79,89,138,192,207,331],"all":[10],"classes":[11,194],"of":[12,92,150,160,195,213,241,248,308],"concurrent":[13],"applications":[14,38,54,139],"and":[15,21,58,73,110,123,154,185,219,226,229,251,276,282,301],"parallel":[16,40,64,209],"computer":[17],"architectures.":[18],"Task":[19],"assignment":[20],"scheduling":[22,136,144,170,173,243,252,275,291,304,332],"arbitrarily":[24],"large":[25],"multicomputers":[26],"cannot":[27,42],"performed":[29],"efficiently":[30],"with":[31,127,140,223],"a":[32,87,108,111,272],"single,":[33],"sequential":[34],"scheduler.":[35],"Also,":[36],"dynamic":[37,242,333],"systems":[41,65,137],"scheduled":[44],"optimally":[45],"under":[46],"reasonable":[47],"assumptions.":[48],"Therefore,":[49],"efficient":[50,72,218,300],"such":[53],"must":[55],"distributed":[57],"use":[59],"heuristics.":[60],"Building":[61],"involves":[66],"addressing":[67],"two":[68,141],"problems":[69],"simultaneously--(1)":[70],"developing":[71,208],"heuristics":[75],"while":[76],"(2)":[77,155],"allowing":[78],"various":[80],"scheduler":[81,310],"machine":[83],"mappings.":[84],"present":[86],"framework":[88,202],"the":[90,148,151,157,161,189,204,239,246,255,268,278,285],"construction":[91],"highly":[93,299],"flexible":[94],"parallel,":[95],"real-time":[96,228],"schedulers.":[97,210],"The":[98,306],"framework's":[99],"flexibility":[100,133,165],"is":[101,115,166,262,280,311],"demonstrated":[102,167],"by":[103,118,134,168,221,313],"mapping":[104],"it":[105],"both":[107,193,265],"multiprocessor":[109],"multi-computer":[112],"architecture.":[113,129],"Flexibility":[114],"further":[116],"displayed":[117,312],"using":[119],"different":[120,143],"message":[121],"passing":[122],"process":[124],"migration":[125,250],"facilities":[126],"each":[128,309],"also":[131],"display":[132],"building":[135],"vastly":[142],"objectives:":[145],"(1)":[146],"upholding":[147],"deadlines":[149],"application's":[152],"tasks":[153],"minimizing":[156],"completion":[158],"time":[159,269,287],"entire":[162],"application.":[163],"Finally,":[164],"adding":[169],"constraints":[171],"(i.e.,":[172,267,284],"resources":[174],"other":[175],"than":[176],"CPU":[177],"time,":[178],"precedence":[179],"constraints,":[180],"group":[181],"scheduling,":[182],"task":[183,249,273,279],"criticalities":[184],"hardware":[186],"constraints)":[187],"basic":[190],"applications.":[196,231,334],"These":[197],"facts":[198],"verify":[199],"that":[200,325],"our":[201,295],"encapsulates":[203],"essential":[205],"features":[206],"Furthermore,":[211],"implementations":[212],"on-line":[214],"are":[216,234,259,298],"shown":[217,235],"experimentation":[222],"workload":[224],"generators":[225],"sample":[227],"non-real-time":[230],"First,":[232],"limitations":[233],"exist":[237,330],"regarding":[238],"benefits":[240],"due":[244],"cost":[247],"overhead.":[253,305],"Next,":[254],"implemented":[256,296],"schedulers'":[257],"performances":[258],"measured.":[260],"Efficiency":[261],"measured":[263],"as":[264],"latency":[266],"between":[270],"when":[271,277],"seeks":[274],"scheduled)":[281],"overhead":[283],"processing":[286],"used":[288],"make":[290],"decisions).":[292],"Measurements":[293],"indicate":[294,324],"create":[302],"little":[303],"effectiveness":[307],"favorably":[314],"comparing":[315],"its":[316],"computed":[317],"schedules":[318],"optimal":[320],"schedules.":[321],"All":[322],"results":[323],"efficient,":[326],"heuristic":[328]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W100566344","counts_by_year":[],"updated_date":"2026-11-18T13:11:19.462570","created_date":"2016-06-24T00:00:00"}
