{"id":"https://openalex.org/W2988838119","doi":"https://doi.org/10.1145/3295500.3356160","title":"Understanding priority-based scheduling of graph algorithms on a shared-memory platform","display_name":"Understanding priority-based scheduling of graph algorithms on a shared-memory platform","publication_year":2019,"publication_date":"2019-11-07","ids":{"openalex":"https://openalex.org/W2988838119","doi":"https://doi.org/10.1145/3295500.3356160","mag":"2988838119"},"language":"en","primary_location":{"id":"doi:10.1145/3295500.3356160","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3295500.3356160","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3295500.3356160","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3295500.3356160","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051612723","display_name":"\u015eerif Ye\u015fil","orcid":"https://orcid.org/0000-0002-7947-2451"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Serif Yesil","raw_affiliation_strings":["University of Illinois at Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041504562","display_name":"Azin Heidarshenas","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Azin Heidarshenas","raw_affiliation_strings":["University of Illinois at Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101431627","display_name":"Adam Morrison","orcid":"https://orcid.org/0000-0002-5586-2615"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Adam Morrison","raw_affiliation_strings":["Tel Aviv University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055909708","display_name":"Josep Torrellas","orcid":"https://orcid.org/0000-0003-2595-5228"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Josep Torrellas","raw_affiliation_strings":["University of Illinois at Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5084,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.70244225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9979000091552734,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.8598815202713013},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.5698323249816895},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5426341891288757},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.5147135853767395},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.5049439072608948},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5041795969009399},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4783465564250946},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.46074026823043823},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.4528624713420868},{"id":"https://openalex.org/keywords/power-graph-analysis","display_name":"Power graph analysis","score":0.4439443349838257},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3808903098106384},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.29638272523880005},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25829625129699707},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.20502620935440063},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14995551109313965},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08570626378059387}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8598815202713013},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.5698323249816895},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5426341891288757},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.5147135853767395},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.5049439072608948},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5041795969009399},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4783465564250946},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.46074026823043823},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.4528624713420868},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.4439443349838257},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3808903098106384},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.29638272523880005},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25829625129699707},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.20502620935440063},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14995551109313965},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08570626378059387},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3295500.3356160","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3295500.3356160","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3295500.3356160","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3295500.3356160","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3295500.3356160","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3295500.3356160","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1570238416","display_name":null,"funder_award_id":"CNS 1763658","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4563241224","display_name":null,"funder_award_id":"1725734","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5496682546","display_name":null,"funder_award_id":"2005/17","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G6253194138","display_name":null,"funder_award_id":"CNS 1763658, CCF 1725734","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6961096449","display_name":null,"funder_award_id":"grant 2005/17","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G7453695159","display_name":null,"funder_award_id":"1763658","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8684135863","display_name":null,"funder_award_id":"2005/17","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2988838119.pdf","grobid_xml":"https://content.openalex.org/works/W2988838119.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W14558443","https://openalex.org/W1979201594","https://openalex.org/W2000041758","https://openalex.org/W2009600579","https://openalex.org/W2034102265","https://openalex.org/W2057112598","https://openalex.org/W2061394399","https://openalex.org/W2070991879","https://openalex.org/W2087530649","https://openalex.org/W2101196063","https://openalex.org/W2115693940","https://openalex.org/W2119407198","https://openalex.org/W2129017891","https://openalex.org/W2131376597","https://openalex.org/W2132220514","https://openalex.org/W2132473764","https://openalex.org/W2139142311","https://openalex.org/W2140908587","https://openalex.org/W2144085134","https://openalex.org/W2146591355","https://openalex.org/W2156847247","https://openalex.org/W2169528473","https://openalex.org/W2187800381","https://openalex.org/W2235134718","https://openalex.org/W2409471617","https://openalex.org/W2432978112","https://openalex.org/W2469279958","https://openalex.org/W2619040869","https://openalex.org/W2625050767","https://openalex.org/W2739409954","https://openalex.org/W3003026210","https://openalex.org/W3098691752","https://openalex.org/W4254608805","https://openalex.org/W4291018031"],"related_works":["https://openalex.org/W1591583623","https://openalex.org/W2372058405","https://openalex.org/W2001673593","https://openalex.org/W2383192442","https://openalex.org/W2074138750","https://openalex.org/W2364408853","https://openalex.org/W2364096214","https://openalex.org/W2159642117","https://openalex.org/W2035053602","https://openalex.org/W2385139534"],"abstract_inverted_index":{"Many":[0],"task-based":[1],"graph":[2,18,72],"algorithms":[3],"benefit":[4],"from":[5],"executing":[6],"tasks":[7,32],"according":[8,33],"to":[9,34,42,67],"some":[10],"programmer-specified":[11],"priority":[12,36],"order.":[13,37],"To":[14],"support":[15],"such":[16],"algorithms,":[17],"frameworks":[19],"use":[20],"Concurrent":[21],"Priority":[22],"Schedulers":[23],"(CPSs),":[24],"which":[25],"attempt---but":[26],"do":[27],"not":[28],"guarantee---to":[29],"execute":[30],"the":[31,49,55,60],"their":[35],"While":[38],"CPSs":[39,70],"are":[40],"critical":[41],"performance,":[43],"there":[44],"is":[45],"insufficient":[46],"insight":[47],"on":[48],"relative":[50],"strengths":[51],"and":[52],"weaknesses":[53],"of":[54],"different":[56],"CPS":[57],"designs":[58],"in":[59],"literature.":[61],"Such":[62],"insights":[63],"would":[64],"be":[65],"valuable":[66],"design":[68],"better":[69],"for":[71],"processing.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}