{"id":"https://openalex.org/W69869292","doi":null,"title":"Improvements to First-Come-First-Served Multiprocessor Scheduling with Gang Scheduling","display_name":"Improvements to First-Come-First-Served Multiprocessor Scheduling with Gang Scheduling","publication_year":2012,"publication_date":"2012-05-22","ids":{"openalex":"https://openalex.org/W69869292","mag":"69869292"},"language":"en","primary_location":{"id":"mag:69869292","doi":null,"is_oa":true,"landing_page_url":"https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2064443","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/sol3/papers.cfm?abstract_id=2064443","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":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.44780001044273376,"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.44780001044273376,"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.3783999979496002,"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.0674000009894371,"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/first-come-first-served-scheduling","display_name":"first-come-first-served scheduling","score":0.9330000281333923},{"id":"https://openalex.org/keywords/gang-scheduling","display_name":"gang scheduling","score":0.9990000128746033},{"id":"https://openalex.org/keywords/multithreading","display_name":"multithreading","score":0.6060000061988831},{"id":"https://openalex.org/keywords/backfilling","display_name":"backfilling","score":0.800000011920929},{"id":"https://openalex.org/keywords/job-processing-times","display_name":"job processing times","score":0.5220000147819519}],"concepts":[{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.7204570174217224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7156850695610046},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6480677723884583},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6153973340988159},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5867742300033569},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5796748399734497},{"id":"https://openalex.org/C201515029","wikidata":"https://www.wikidata.org/wiki/Q5520966","display_name":"Gang scheduling","level":5,"score":0.48658740520477295},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4656231105327606},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4428198039531708},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3845469057559967},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2007991075515747},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19361063838005066},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14047744870185852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09590715169906616},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.06472885608673096}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:69869292","doi":null,"is_oa":true,"landing_page_url":"https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2064443","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}],"best_oa_location":{"id":"mag:69869292","doi":null,"is_oa":true,"landing_page_url":"https://papers.ssrn.com/sol3/papers.cfm?abstract_id=2064443","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/W2295158874","https://openalex.org/W7101208298","https://openalex.org/W7171724229","https://openalex.org/W2804209199","https://openalex.org/W2140484563","https://openalex.org/W7221440822","https://openalex.org/W112160933","https://openalex.org/W2799930771","https://openalex.org/W3217312261","https://openalex.org/W1963429867"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"improved":[4],"algorithm":[5,65],"for":[6],"the":[7,19,42,54,57,63],"multiprocessor":[8],"job":[9,20],"scheduling":[10],"problem":[11],"based":[12,40],"on":[13,18,41],"First-Come-First-Served":[14],"(FCFS)":[15],"strategy.":[16],"Depending":[17],"processing":[21],"times,":[22],"some":[23],"jobs":[24,37],"are":[25,38,66],"divided":[26],"into":[27],"multi-threads":[28],"while":[29],"others":[30],"remain":[31],"as":[32],"single":[33],"thread":[34],"jobs.":[35],"Multi-thread":[36],"processed":[39],"concept":[43],"of":[44,56,62],"gang":[45],"scheduling.":[46],"Back":[47],"filling":[48],"technique":[49],"is":[50],"used":[51],"to":[52],"improve":[53],"performance":[55],"proposed":[58,64],"algorithm.":[59],"The":[60],"results":[61],"presented":[67],"using":[68],"a":[69,73],"percentage":[70],"gap":[71],"from":[72],"lower":[74],"bound.":[75]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-06-24T00:00:00"}