{"id":"https://openalex.org/W2167384564","doi":"https://doi.org/10.1109/tc.1972.5008918","title":"Optimal Scheduling Strategies in a Multiprocessor System","display_name":"Optimal Scheduling Strategies in a Multiprocessor System","publication_year":1972,"publication_date":"1972-02-01","ids":{"openalex":"https://openalex.org/W2167384564","doi":"https://doi.org/10.1109/tc.1972.5008918","mag":"2167384564"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1972.5008918","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1972.5008918","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5038231385","display_name":"C. V. Ramamoorthy","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. V. Ramamoorthy","raw_affiliation_strings":["Department of Electrical Engineering, University of Technology, Austin, TX, USA","Department of Electrical Engineering, University of Texas at Austin, Austin, Tex. 78712"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Technology, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Texas at Austin, Austin, Tex. 78712","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033569113","display_name":"K. Mani Chandy","orcid":"https://orcid.org/0000-0001-9190-1290"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. M. Chandy","raw_affiliation_strings":["Department of Computer Science, University of Technology, Austin, TX, USA","Department of Electrical Engineering, University of Texas at Austin, Austin, Tex. 78712"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Technology, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Texas at Austin, Austin, Tex. 78712","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103427383","display_name":"Mario J. Gonzalez","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mario J. Gonzalez","raw_affiliation_strings":["Department of Electrical Engineering, University of Technology, Austin, TX, USA","Department of Computer Sciences, University of Texas at Austin, Austin, Tex. 78712.#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Technology, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Department of Computer Sciences, University of Texas at Austin, Austin, Tex. 78712.#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":31.6746,"has_fulltext":false,"cited_by_count":209,"citation_normalized_percentile":{"value":0.9954792,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"C-21","issue":"2","first_page":"137","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9972000122070312,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.841521143913269},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.8046022653579712},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7878519892692566},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.621494472026825},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6166750192642212},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5871725678443909},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5793655514717102},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4986910820007324},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4893645644187927},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42101356387138367},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.24796375632286072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2387275993824005},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20684710144996643},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.17931696772575378},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14475226402282715},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.113288015127182},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10448846220970154}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.841521143913269},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8046022653579712},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7878519892692566},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.621494472026825},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6166750192642212},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5871725678443909},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5793655514717102},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4986910820007324},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4893645644187927},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42101356387138367},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.24796375632286072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2387275993824005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20684710144996643},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.17931696772575378},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14475226402282715},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.113288015127182},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10448846220970154}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1972.5008918","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1972.5008918","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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":14,"referenced_works":["https://openalex.org/W1966965469","https://openalex.org/W2020905544","https://openalex.org/W2027077493","https://openalex.org/W2048586177","https://openalex.org/W2052110143","https://openalex.org/W2060953022","https://openalex.org/W2063248972","https://openalex.org/W2088803703","https://openalex.org/W2103412683","https://openalex.org/W2104680817","https://openalex.org/W2105100741","https://openalex.org/W2106001218","https://openalex.org/W2152720686","https://openalex.org/W4298300677"],"related_works":["https://openalex.org/W1640420690","https://openalex.org/W2155564881","https://openalex.org/W2062808533","https://openalex.org/W1833217363","https://openalex.org/W1809394610","https://openalex.org/W1511880291","https://openalex.org/W2101300711","https://openalex.org/W2134658009","https://openalex.org/W2153689068","https://openalex.org/W2618418901"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,14,21,26,32,43,83],"set":[4,44],"of":[5,16,45,69,82,106],"techniques":[6],"that":[7,58,95],"can":[8],"be":[9],"used":[10],"to":[11,30,72,104],"optimally":[12],"schedule":[13,75],"sequence":[15],"interrelated":[17],"computational":[18,33,46],"tasks":[19,47,54,91,105],"on":[20],"multiprocessor":[22],"computer":[23],"system.":[24],"Using":[25],"directed":[27],"graph":[28],"model":[29],"represent":[31],"process,":[34],"two":[35],"basic":[36],"problems":[37],"are":[38,55,92],"solved":[39],"here.":[40],"First,":[41],"given":[42,103],"and":[48,65,108,111],"the":[49,53,59,66,90],"relationships":[50],"between":[51],"them,":[52],"scheduled":[56,93],"such":[57,94],"total":[60],"execution":[61,96],"time":[62,97],"is":[63,76,81,98,102,114],"minimized,":[64],"minimum":[67],"number":[68],"processors":[70],"required":[71],"realize":[73],"this":[74],"obtained.":[77],"The":[78],"second":[79],"problem":[80],"more":[84],"general":[85],"nature.":[86],"Given":[87],"k":[88],"processors,":[89],"again":[99],"minimized.":[100],"Consideration":[101],"equal":[107],"unequal":[109],"duration,":[110],"task":[112],"preemption":[113],"not":[115],"allowed.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}