{"id":"https://openalex.org/W112160933","doi":null,"title":"Performance of a Few Gang Scheduling Algorithms for Multiprocessor Scheduling","display_name":"Performance of a Few Gang Scheduling Algorithms for Multiprocessor Scheduling","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W112160933","mag":"112160933"},"language":"en","primary_location":{"id":"mag:112160933","doi":null,"is_oa":true,"landing_page_url":"https://papers.ssrn.com/abstract=2358293","pdf_url":null,"source":{"id":"https://openalex.org/S4210172589","display_name":"SSRN Electronic Journal","issn_l":"1556-5068","issn":["1556-5068"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1318003438","host_organization_name":"RELX Group (Netherlands)","host_organization_lineage":["https://openalex.org/I1318003438"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SSRN Electronic Journal","raw_type":null},"volume":null,"type":"preprint","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://papers.ssrn.com/abstract=2358293","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087267757","display_name":"Ruwanthini Siyambalapitiya","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I111199411","display_name":"University of Peradeniya","ror":"https://ror.org/025h79t26","country_code":"LK","type":"education","lineage":["https://openalex.org/I111199411"]}],"countries":["LK"],"is_corresponding":false,"raw_author_name":"R. Siyambalapitiya","raw_affiliation_strings":["University of peradeniya"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of peradeniya","institution_ids":["https://openalex.org/I111199411"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073301364","display_name":"Manjula Sandirigama","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I111199411","display_name":"University of Peradeniya","ror":"https://ror.org/025h79t26","country_code":"LK","type":"education","lineage":["https://openalex.org/I111199411"]}],"countries":["LK"],"is_corresponding":false,"raw_author_name":"Manjula Sandirigama","raw_affiliation_strings":["University of peradeniya"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of peradeniya","institution_ids":["https://openalex.org/I111199411"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111199411"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":"3","first_page":"7","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.6371999979019165,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.6371999979019165,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.12630000710487366,"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.057999998331069946,"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/gang-scheduling","display_name":"gang scheduling","score":0.8190000057220459},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"multiprocessor scheduling","score":0.9909999966621399},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9980000257492065},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.8069999814033508},{"id":"https://openalex.org/keywords/large-scale-scheduling-problems","display_name":"large-scale scheduling","score":0.6240000128746033},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.6029999852180481}],"concepts":[{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.7998279333114624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7615213394165039},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6645866632461548},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5614491701126099},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5296197533607483},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5053415894508362},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4785780906677246},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.45397093892097473},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.45155584812164307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4112457036972046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39697277545928955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13659241795539856},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07186052203178406},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:112160933","doi":null,"is_oa":true,"landing_page_url":"https://papers.ssrn.com/abstract=2358293","pdf_url":null,"source":{"id":"https://openalex.org/S4210172589","display_name":"SSRN Electronic Journal","issn_l":"1556-5068","issn":["1556-5068"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1318003438","host_organization_name":"RELX Group (Netherlands)","host_organization_lineage":["https://openalex.org/I1318003438"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SSRN Electronic Journal","raw_type":null},{"id":"mag:3125676923","doi":null,"is_oa":false,"landing_page_url":"https://econpapers.repec.org/RePEc:icf:icfjcs:v:7:y:2013:i:3:p:7-26","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"mag:112160933","doi":null,"is_oa":true,"landing_page_url":"https://papers.ssrn.com/abstract=2358293","pdf_url":null,"source":{"id":"https://openalex.org/S4210172589","display_name":"SSRN Electronic Journal","issn_l":"1556-5068","issn":["1556-5068"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1318003438","host_organization_name":"RELX Group (Netherlands)","host_organization_lineage":["https://openalex.org/I1318003438"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SSRN Electronic Journal","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2803865975","https://openalex.org/W55610023","https://openalex.org/W2101105807","https://openalex.org/W7001207536","https://openalex.org/W2056742716","https://openalex.org/W2371932969","https://openalex.org/W7171724229","https://openalex.org/W1966275651","https://openalex.org/W2393993281","https://openalex.org/W2154949349"],"abstract_inverted_index":{"In":[0],"this":[1,34,45],"study,":[2],"the":[3,50,60],"performance":[4],"of":[5,40],"several":[6],"approximation":[7,41],"algorithms":[8,31,42,55,82],"for":[9],"multiprocessor":[10],"scheduling":[11,15,62],"is":[12,16,66],"considered.":[13],"Multiprocessor":[14],"an":[17],"NP-hard":[18],"problem":[19,35,46],"which":[20],"means":[21],"that":[22,80],"it":[23],"may":[24],"not":[25],"be":[26,49,84],"possible":[27],"to":[28,32,36,43,48,68,72,86],"design":[29],"exact":[30],"solve":[33,44,87],"optimality.":[37],"Therefore,":[38],"designing":[39],"appears":[47],"only":[51],"option":[52],"available.":[53],"The":[54,77],"considered":[56],"are":[57],"designed":[58],"incorporating":[59],"gang":[61],"approach.":[63],"An":[64],"attempt":[65],"made":[67],"obtain":[69],"solutions":[70],"close":[71],"optimal":[73],"using":[74],"these":[75,81],"algorithms.":[76],"study":[78],"shows":[79],"can":[83],"used":[85],"even":[88],"large-scale":[89],"problems":[90],"occurring":[91],"in":[92],"practice.":[93]},"counts_by_year":[],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-06-24T00:00:00"}