{"id":"https://openalex.org/W1995997415","doi":"https://doi.org/10.1002/cpe.4330070708","title":"Symmetrical hopping: A scalable scheduling algorithm for irregular problems","display_name":"Symmetrical hopping: A scalable scheduling algorithm for irregular problems","publication_year":1995,"publication_date":"1995-10-01","ids":{"openalex":"https://openalex.org/W1995997415","doi":"https://doi.org/10.1002/cpe.4330070708","mag":"1995997415"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330070708","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330070708","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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/A5102938931","display_name":"Min\u2010You Wu","orcid":"https://orcid.org/0000-0001-6221-5558"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Min\u2010You Wu","raw_affiliation_strings":["Department of Computer Science State University of New York at Buffalo Buffalo, NY 14260, USA","Department of Computer Science,  State University of New York at Buffalo, Buffalo, NY 14260, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science State University of New York at Buffalo Buffalo, NY 14260, USA","institution_ids":["https://openalex.org/I63190737"]},{"raw_affiliation_string":"Department of Computer Science,  State University of New York at Buffalo, Buffalo, NY 14260, USA","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102938931"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":1.5193,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.84615385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"7","first_page":"689","last_page":"706"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9998999834060669,"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.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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.993399977684021,"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.809441089630127},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6904410719871521},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6207161545753479},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6035473942756653},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5823961496353149},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.526292622089386},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5029875636100769},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49857211112976074},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48663100600242615},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.46896541118621826},{"id":"https://openalex.org/keywords/context-switch","display_name":"Context switch","score":0.4538813531398773},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4482090473175049},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4118374288082123},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15810155868530273},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10513782501220703},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.09857821464538574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08068019151687622},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.06568560004234314}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.809441089630127},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6904410719871521},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6207161545753479},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6035473942756653},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5823961496353149},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.526292622089386},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5029875636100769},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49857211112976074},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48663100600242615},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.46896541118621826},{"id":"https://openalex.org/C53833338","wikidata":"https://www.wikidata.org/wiki/Q1061424","display_name":"Context switch","level":2,"score":0.4538813531398773},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4482090473175049},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4118374288082123},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15810155868530273},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10513782501220703},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.09857821464538574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08068019151687622},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.06568560004234314},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/cpe.4330070708","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330070708","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.5773","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.5773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.buffalo.edu/pub/tech-reports/./95-47.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.8098","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.8098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.buffalo.edu/pub/WWW/faculty/wu/psfile/symhop.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W29136603","https://openalex.org/W54074059","https://openalex.org/W63775848","https://openalex.org/W99271082","https://openalex.org/W104486731","https://openalex.org/W104971177","https://openalex.org/W1544118636","https://openalex.org/W1561144995","https://openalex.org/W1563201052","https://openalex.org/W1589943916","https://openalex.org/W1964145938","https://openalex.org/W1989256030","https://openalex.org/W1991716724","https://openalex.org/W1998841106","https://openalex.org/W2002076654","https://openalex.org/W2006305793","https://openalex.org/W2012223233","https://openalex.org/W2018100839","https://openalex.org/W2022049964","https://openalex.org/W2044550248","https://openalex.org/W2080635191","https://openalex.org/W2108493163","https://openalex.org/W2118663179","https://openalex.org/W2139571722","https://openalex.org/W2150470619","https://openalex.org/W2155859954","https://openalex.org/W2158042725","https://openalex.org/W2165104827","https://openalex.org/W2171189596","https://openalex.org/W2921847140","https://openalex.org/W3013120782","https://openalex.org/W4237079297","https://openalex.org/W4256363426","https://openalex.org/W6684132689"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4300092030","https://openalex.org/W2167574351","https://openalex.org/W4386580182","https://openalex.org/W2225350526","https://openalex.org/W2383668729","https://openalex.org/W2341323008","https://openalex.org/W2695617386","https://openalex.org/W4308301330","https://openalex.org/W2941188264"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"run\u2010time":[2,23],"support":[3,19],"is":[4,21,47,58,96],"necessary":[5],"for":[6,40],"parallel":[7],"computations":[8],"with":[9],"irregular":[10],"and":[11,52,60,83],"dynamic":[12,41],"structures.":[13],"One":[14],"important":[15],"component":[16],"in":[17,30,70],"the":[18,22,27,31,74,77,80,84,103],"system":[20],"scheduler":[24],"which":[25],"balances":[26],"working":[28],"load":[29],"system.":[32],"We":[33],"present":[34],"a":[35,48],"new":[36],"algorithm,":[37],"Symmetrical":[38,104],"Hopping,":[39],"scheduling":[42,54],"of":[43,89],"ultra\u2010lightweight":[44],"processes.":[45],"It":[46],"dynamic,":[49],"distributed,":[50],"adaptive":[51],"scalable":[53],"algorithm.":[55],"This":[56],"algorithm":[57,106],"described":[59],"compared":[61],"to":[62,112],"four":[63],"other":[64],"algorithms":[65,91],"that":[66,102],"have":[67],"been":[68],"proposed":[69],"this":[71],"context,":[72],"namely":[73],"randomized":[75],"allocation,":[76],"sender\u2010initiated":[78],"scheduling,":[79,82],"receiver\u2010initiated":[81],"gradient":[85],"model.":[86],"The":[87,98],"performance":[88,110],"these":[90],"on":[92],"Intel":[93],"Touchstone":[94],"Delta":[95],"presented.":[97],"experimental":[99],"results":[100],"show":[101],"Hopping":[105],"achieves":[107],"much":[108],"better":[109],"due":[111],"its":[113],"adaptiveness.":[114]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}