{"id":"https://openalex.org/W1976344941","doi":"https://doi.org/10.1137/0206014","title":"Task Scheduling on a Multiprocessor System with Independent Memories","display_name":"Task Scheduling on a Multiprocessor System with Independent Memories","publication_year":1977,"publication_date":"1977-03-01","ids":{"openalex":"https://openalex.org/W1976344941","doi":"https://doi.org/10.1137/0206014","mag":"1976344941"},"language":"en","primary_location":{"id":"doi:10.1137/0206014","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206014","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5020453711","display_name":"Dennis Kafura","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D. G. Kafura","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108637547","display_name":"V. Y. Shen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V. Y. Shen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020453711"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.8505,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.97039848,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"6","issue":"1","first_page":"167","last_page":"187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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.7739676237106323},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.726234495639801},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6619226336479187},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6433708667755127},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.599871814250946},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5128681659698486},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5100231766700745},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.49719956517219543},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.49151715636253357},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.47601157426834106},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4687986969947815},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.46221086382865906},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.43679705262184143},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2618461847305298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12749052047729492},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.10045915842056274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7739676237106323},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.726234495639801},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6619226336479187},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6433708667755127},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.599871814250946},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5128681659698486},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5100231766700745},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.49719956517219543},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.49151715636253357},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.47601157426834106},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4687986969947815},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.46221086382865906},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.43679705262184143},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2618461847305298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12749052047729492},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.10045915842056274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0206014","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206014","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1502251260","https://openalex.org/W1973538756","https://openalex.org/W1988658598","https://openalex.org/W2027077493","https://openalex.org/W2028754841","https://openalex.org/W2031612682","https://openalex.org/W2043862089","https://openalex.org/W2052110143","https://openalex.org/W2084814858","https://openalex.org/W2092333800","https://openalex.org/W2100172689","https://openalex.org/W2104680817","https://openalex.org/W2401610261","https://openalex.org/W2796584886"],"related_works":["https://openalex.org/W2545511463","https://openalex.org/W2245286458","https://openalex.org/W2106332846","https://openalex.org/W2956094179","https://openalex.org/W2468395309","https://openalex.org/W2172075652","https://openalex.org/W2167842822","https://openalex.org/W2587092711","https://openalex.org/W2541348386","https://openalex.org/W3082963403"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"a":[3,6,17,74],"model":[4],"of":[5,20],"computing":[7],"system":[8],"with":[9,16,77],"several":[10],"independent":[11],"but":[12],"identical":[13],"processors,":[14],"each":[15],"private":[18],"memory":[19,41],"limited,":[21],"and":[22,40,52,57],"possibly":[23],"different,":[24],"storage":[25],"capacity.":[26],"The":[27],"tasks":[28],"are":[29,46,60],"assumed":[30],"to":[31,68],"have":[32],"known":[33],"resource":[34],"demands":[35],"expressed":[36],"as":[37],"processing":[38],"times":[39],"requirements.":[42],"Several":[43],"scheduling":[44,59],"strategies":[45],"evaluated":[47],"by":[48],"worst-case":[49],"performance":[50],"bounds":[51],"simulation":[53],"results.":[54],"Both":[55],"preemptive":[56,64],"nonpreemptive":[58],"considered.":[61],"An":[62],"optimal":[63],"algorithm":[65],"is":[66],"given":[67],"find":[69],"the":[70],"shortest":[71],"schedule":[72],"for":[73],"task":[75],"set":[76],"no":[78],"precedence":[79],"constraints.":[80]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}