{"id":"https://openalex.org/W6944458517","doi":"https://doi.org/10.2312/eggh/eggh04/035-044","title":"Mio: Fast Multipass Partitioning via Priority-Based Instruction Scheduling","display_name":"Mio: Fast Multipass Partitioning via Priority-Based Instruction Scheduling","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W6944458517","doi":"https://doi.org/10.2312/eggh/eggh04/035-044"},"language":"en","primary_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt7ff751pf","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7ff751pf","pdf_url":"https://escholarship.org/uc/item/7ff751pf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/uc/item/7ff751pf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Riffel, Andrew","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Riffel, Andrew","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Lefohn, Aaron E.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lefohn, Aaron E.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Vidimce, Kiril","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vidimce, Kiril","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Leone, Mark","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leone, Mark","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Owens, John D.","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Owens, John D.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44281886,"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_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.23350000381469727,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.23350000381469727,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.19539999961853027,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.16140000522136688,"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/shader","display_name":"Shader","score":0.9247999787330627},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6304000020027161},{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.616100013256073},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5437999963760376},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4726000130176544},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.4366999864578247},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.34369999170303345},{"id":"https://openalex.org/keywords/real-time-rendering","display_name":"Real-time rendering","score":0.33009999990463257}],"concepts":[{"id":"https://openalex.org/C177681979","wikidata":"https://www.wikidata.org/wiki/Q633182","display_name":"Shader","level":3,"score":0.9247999787330627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.864300012588501},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6304000020027161},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.616100013256073},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5867000222206116},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5437999963760376},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4726000130176544},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.4366999864578247},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3614000082015991},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.34369999170303345},{"id":"https://openalex.org/C116921373","wikidata":"https://www.wikidata.org/wiki/Q2816483","display_name":"Real-time rendering","level":3,"score":0.33009999990463257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31850001215934753},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C18945957","wikidata":"https://www.wikidata.org/wiki/Q5597193","display_name":"Graphics hardware","level":3,"score":0.29249998927116394},{"id":"https://openalex.org/C186772499","wikidata":"https://www.wikidata.org/wiki/Q7135017","display_name":"Parallel rendering","level":3,"score":0.2728999853134155},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.2720000147819519},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.26510000228881836},{"id":"https://openalex.org/C201515029","wikidata":"https://www.wikidata.org/wiki/Q5520966","display_name":"Gang scheduling","level":5,"score":0.26350000500679016},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C173552908","wikidata":"https://www.wikidata.org/wiki/Q1366289","display_name":"Graphics pipeline","level":4,"score":0.2558000087738037},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.2515999972820282}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:escholarship.org/ark:/13030/qt7ff751pf","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7ff751pf","pdf_url":"https://escholarship.org/uc/item/7ff751pf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:qt7ff751pf","is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/7ff751pf","pdf_url":"http://www.escholarship.org/uc/item/7ff751pf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Riffel, Andrew; Lefohn, Aaron; Vidimce, Kiril; Leone, Mark; & Owens, John D.(2004). Mio: Fast Multipass Partitioning via Priority-Based Instruction Scheduling. UC Davis: Institute for Data Analysis and Visualization. Retrieved from: http://www.escholarship.org/uc/item/7ff751pf","raw_type":"article"},{"id":"doi:10.2312/eggh/eggh04/035-044","is_oa":true,"landing_page_url":"https://doi.org/10.2312/eggh/eggh04/035-044","pdf_url":null,"source":{"id":"https://openalex.org/S7407052899","display_name":"Eurographics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:escholarship.org/ark:/13030/qt7ff751pf","is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/7ff751pf","pdf_url":"https://escholarship.org/uc/item/7ff751pf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6944458517.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Real-time":[0],"graphics":[1,125],"hardware":[2,173],"continues":[3],"to":[4,18,33,38,43,109,158,162],"offer":[5],"improved":[6],"resources":[7,24,36],"for":[8,62,96,119,171],"programmable":[9],"vertex":[10],"and":[11,59,81,107,136,145,160,167],"fragment":[12],"shaders.":[13],"However,":[14,102],"shader":[15],"programmers":[16],"continue":[17],"write":[19],"shaders":[20,41,46,95],"that":[21,90,140],"require":[22],"more":[23],"than":[25],"are":[26,87],"available":[27],"in":[28,89,148],"the":[29,35,45,54,63,130],"hardware.":[30,126],"One":[31],"way":[32],"virtualize":[34],"necessary":[37],"run":[39],"complex":[40],"is":[42,155],"partition":[44,94],"into":[47],"multiple":[48,111],"rendering":[49],"passes.":[50],"This":[51,127],"problem,":[52,64],"called":[53],"\u0093Multi-Pass":[55],"Partitioning":[56],"Problem\u0094":[57],"(MPP),":[58],"a":[60,133],"solution":[61],"Recursive":[65],"Dominator":[66],"Split":[67],"(RDS),":[68],"have":[69,163],"been":[70],"presented":[71],"by":[72],"Eric":[73],"Chan":[74],"et":[75],"al.":[76],"The":[77],"O(n3)":[78],"RDS":[79,159],"algorithm":[80],"its":[82],"heuristic-based":[83],"O(n2)":[84],"cousin,":[85],"RDSh,":[86],"robust":[88],"they":[91],"can":[92],"efficiently":[93],"many":[97],"architectures":[98],"with":[99],"varying":[100],"resources.":[101],"RDS\u0092s":[103],"high":[104],"runtime":[105],"cost":[106],"inability":[108],"handle":[110],"outputs":[112],"per":[113],"pass":[114,146],"make":[115],"it":[116],"less":[117],"desirable":[118],"real-time":[120],"use":[121],"on":[122],"today\u0092s":[123],"latest":[124],"paper":[128],"redefines":[129],"MPP":[131],"as":[132],"scheduling":[134,138,152],"problem":[135],"uses":[137],"algorithms":[139],"allow":[141],"incremental":[142],"resource":[143],"estimation":[144],"computation":[147],"O(nlogn)":[149],"time.":[150],"Our":[151],"algorithm,":[153],"Mio,":[154],"experimentally":[156],"compared":[157],"shown":[161],"better":[164],"run-time":[165],"scaling":[166],"produce":[168],"comparable":[169],"partitions":[170],"emerging":[172],"architectures.":[174]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}