{"id":"https://openalex.org/W2319849167","doi":"https://doi.org/10.1142/s012962641650002x","title":"A Randomized Scheduling Algorithm for Multiprocessor Environments Using Local Search","display_name":"A Randomized Scheduling Algorithm for Multiprocessor Environments Using Local Search","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W2319849167","doi":"https://doi.org/10.1142/s012962641650002x","mag":"2319849167"},"language":"en","primary_location":{"id":"doi:10.1142/s012962641650002x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962641650002x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5100778264","display_name":"Abhishek Mishra","orcid":"https://orcid.org/0000-0001-9545-693X"},"institutions":[{"id":"https://openalex.org/I74796645","display_name":"Birla Institute of Technology and Science, Pilani","ror":"https://ror.org/001p3jz28","country_code":"IN","type":"education","lineage":["https://openalex.org/I74796645"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Abhishek Mishra","raw_affiliation_strings":["Department of Computer Science & Information Systems, Birla Institute of Technology and Science Pilani, Pilani, India 333 031, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Information Systems, Birla Institute of Technology and Science Pilani, Pilani, India 333 031, India","institution_ids":["https://openalex.org/I74796645"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081133318","display_name":"Pramod Kumar Mishra","orcid":"https://orcid.org/0000-0003-3957-1161"},"institutions":[{"id":"https://openalex.org/I91357014","display_name":"Banaras Hindu University","ror":"https://ror.org/04cdn2797","country_code":"IN","type":"education","lineage":["https://openalex.org/I91357014"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pramod Kumar Mishra","raw_affiliation_strings":["Department of Computer Science, & Department of Science and Technology, Center for Interdisciplinary Mathematical Sciences, Banaras Hindu University, Varanasi, Uttar Pradesh 221005, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, & Department of Science and Technology, Center for Interdisciplinary Mathematical Sciences, Banaras Hindu University, Varanasi, Uttar Pradesh 221005, India","institution_ids":["https://openalex.org/I91357014"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4165,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.8349024,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":"01","first_page":"1650002","last_page":"1650002"},"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.9973999857902527,"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.9909999966621399,"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.7682836055755615},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5720533132553101},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5546268820762634},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5388514399528503},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.49340811371803284},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4894372522830963},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.48283228278160095},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4442092180252075},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.42591604590415955},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41500627994537354},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3125007152557373},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17081373929977417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14882761240005493}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7682836055755615},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5720533132553101},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5546268820762634},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5388514399528503},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.49340811371803284},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4894372522830963},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.48283228278160095},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4442092180252075},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.42591604590415955},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41500627994537354},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3125007152557373},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17081373929977417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14882761240005493},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012962641650002x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962641650002x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1973531467","https://openalex.org/W1977251985","https://openalex.org/W1992811830","https://openalex.org/W1993390735","https://openalex.org/W2023753260","https://openalex.org/W2024060531","https://openalex.org/W2027839617","https://openalex.org/W2029570564","https://openalex.org/W2037987555","https://openalex.org/W2079748944","https://openalex.org/W2084327596","https://openalex.org/W2088458800","https://openalex.org/W2092784643","https://openalex.org/W2096949818","https://openalex.org/W2113126365","https://openalex.org/W2135449963","https://openalex.org/W2139541175","https://openalex.org/W2151038512","https://openalex.org/W2154426336","https://openalex.org/W2158923044","https://openalex.org/W2169748358","https://openalex.org/W2316694970","https://openalex.org/W2408697637","https://openalex.org/W3137896427","https://openalex.org/W4242486132"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W4386580182","https://openalex.org/W3184267879","https://openalex.org/W2106332846","https://openalex.org/W2545511463","https://openalex.org/W2172075652","https://openalex.org/W2369829641","https://openalex.org/W2167842822","https://openalex.org/W2372879566"],"abstract_inverted_index":{"The":[0,94,122],"LOCAL(A,":[1],"B)":[2,22,78],"randomized":[3],"task":[4,17,58,91,96,120,124,157],"scheduling":[5,18,59,92,97,125,158],"algorithm":[6,68,77,98,126,159],"is":[7,37,82,106,113,127],"proposed":[8],"for":[9],"fully":[10],"connected":[11],"multiprocessors.":[12],"It":[13],"combines":[14],"two":[15,33],"given":[16,34],"algorithms":[19,60],"(A,":[20],"and":[21,70,79,111,146],"using":[23],"local":[24],"neighborhood":[25],"search":[26],"to":[27,38,165],"give":[28,46],"a":[29,80],"hybrid":[30,81],"of":[31,43,53,109,116,154,169],"the":[32,89,107,114,119,155],"algorithms.":[35,176],"Objective":[36],"show":[39],"that":[40,161],"such":[41],"type":[42],"hybridization":[44],"can":[45],"much":[47],"better":[48],"performance":[49],"results":[50],"in":[51,118],"terms":[52],"parallel":[54],"execution":[55],"times.":[56],"Two":[57],"are":[61],"selected:":[62],"DSC":[63],"(Dominant":[64],"Sequence":[65],"Clustering":[66],"as":[67,76],"A),":[69],"CPPS":[71],"(Cluster":[72],"Pair":[73],"Priority":[74],"Scheduling":[75],"created":[83],"(the":[84],"LOCAL(DSC,":[85],"CPPS)":[86],"or":[87],"simply":[88],"LOCAL":[90,95,123,156],"algorithm).":[93],"has":[99],"time":[100],"complexity":[101],"O(|V||E|(|V":[102],"|+|E|)),":[103],"where":[104],"V":[105],"set":[108,115],"vertices,":[110],"E":[112],"edges":[117],"graph.":[121],"compared":[128],"with":[129],"six":[130],"other":[131,175],"algorithms:":[132],"CPPS,":[133],"DCCL":[134],"(Dynamic":[135],"Computation":[136,150],"Communication":[137],"Load),":[138],"DSC,":[139],"EZ":[140],"(Edge":[141],"Zeroing),":[142],"LC":[143],"(Linear":[144],"Clustering),":[145],"RDCC":[147],"(Randomized":[148],"Dynamic":[149],"Communication).":[151],"Performance":[152],"evaluation":[153],"shows":[160],"it":[162],"gives":[163],"up":[164],"80.47":[166],"%":[167],"improvement":[168],"NSL":[170],"(Normalized":[171],"Schedule":[172],"Length)":[173],"over":[174]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}