{"id":"https://openalex.org/W2000533899","doi":"https://doi.org/10.1109/tc.1987.1676923","title":"Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds","display_name":"Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds","publication_year":1987,"publication_date":"1987-04-01","ids":{"openalex":"https://openalex.org/W2000533899","doi":"https://doi.org/10.1109/tc.1987.1676923","mag":"2000533899"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1987.1676923","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1987.1676923","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-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/A5097532167","display_name":"Polychoronopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I4210135837","display_name":"National Center for Supercomputing Applications","ror":"https://ror.org/03r10zj06","country_code":"US","type":"facility","lineage":["https://openalex.org/I157725225","https://openalex.org/I4210135837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Polychoronopoulos","raw_affiliation_strings":["Center for Supercomputing Research and Development, and with the Department of Electrical and Computer Engineering, the University of Illinois"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Supercomputing Research and Development, and with the Department of Electrical and Computer Engineering, the University of Illinois","institution_ids":["https://openalex.org/I157725225","https://openalex.org/I4210135837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077851078","display_name":"Banerjee","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]},{"id":"https://openalex.org/I4210135837","display_name":"National Center for Supercomputing Applications","ror":"https://ror.org/03r10zj06","country_code":"US","type":"facility","lineage":["https://openalex.org/I157725225","https://openalex.org/I4210135837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Banerjee","raw_affiliation_strings":["Center for Supercomputing Research and Development, University of Illinois, Urbana-Champaign, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Supercomputing Research and Development, University of Illinois, Urbana-Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225","https://openalex.org/I4210135837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":18.6453,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.99242054,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"C-36","issue":"4","first_page":"410","last_page":"420"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"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.9984999895095825,"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.996999979019165,"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.9968000054359436,"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/speedup","display_name":"Speedup","score":0.8917375802993774},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.8504028916358948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8309566378593445},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.6393020153045654},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6310265064239502},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5851536989212036},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.46900674700737},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.44702720642089844},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.37675121426582336},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0912855863571167}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8917375802993774},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.8504028916358948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8309566378593445},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.6393020153045654},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6310265064239502},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5851536989212036},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.46900674700737},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.44702720642089844},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.37675121426582336},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0912855863571167}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1987.1676923","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1987.1676923","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-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":31,"referenced_works":["https://openalex.org/W30164083","https://openalex.org/W81404060","https://openalex.org/W81642381","https://openalex.org/W134228823","https://openalex.org/W137591327","https://openalex.org/W634463279","https://openalex.org/W1500590019","https://openalex.org/W1536051636","https://openalex.org/W1584529690","https://openalex.org/W1685698149","https://openalex.org/W1738193403","https://openalex.org/W1973478806","https://openalex.org/W1977590451","https://openalex.org/W2006328515","https://openalex.org/W2011039300","https://openalex.org/W2019133545","https://openalex.org/W2025896589","https://openalex.org/W2036568508","https://openalex.org/W2135593247","https://openalex.org/W2150871235","https://openalex.org/W2154523940","https://openalex.org/W2177082073","https://openalex.org/W2598017819","https://openalex.org/W3179560038","https://openalex.org/W4242899040","https://openalex.org/W6601189472","https://openalex.org/W6605448540","https://openalex.org/W6634993717","https://openalex.org/W6643654285","https://openalex.org/W6659744302","https://openalex.org/W6734981195"],"related_works":["https://openalex.org/W2003935582","https://openalex.org/W2950520577","https://openalex.org/W74409296","https://openalex.org/W1229628","https://openalex.org/W2468095077","https://openalex.org/W2105992728","https://openalex.org/W1991844655","https://openalex.org/W2009213655","https://openalex.org/W2494130044","https://openalex.org/W2593878938"],"abstract_inverted_index":{"The":[0],"main":[1],"aim":[2],"of":[3,10,33,39,42,62,148,162,180],"the":[4,21,48,74,146,149,178,192],"paper":[5],"is":[6,97,118,145,152,185,188],"to":[7,72,125,154,169],"study":[8],"allocation":[9,136],"processors":[11,121,168],"to,":[12],"parallel":[13,28,43,95,164],"programs":[14,79],"executing":[15],"on":[16,47,50,58],"a":[17,27,31,40,51,89,94,100,160,174,181],"multiprocessor":[18],"system,":[19],"and":[20,128,140,151],"resulting":[22],"speedups.":[23],"First,":[24],"we":[25],"consider":[26],"program":[29,96],"as":[30,99],"sequence":[32],"steps":[34],"where":[35],"each":[36],"step":[37],"consists":[38],"set":[41,161],"operations.":[44],"General":[45],"bounds":[46],"speedup":[49,179],"p-":[52],"processor":[53,135,157],"system":[54],"are":[55,70,105,142],"derived":[56],"based":[57],"this":[59],"model.":[60],"Measurements":[61],"code":[63],"parallelism":[64,83,130],"for":[65,159,177],"the,":[66],"LINPACK":[67],"numerical":[68,78],"package":[69],"presented":[71],"support":[73],"belief":[75],"that":[76,84,187],"typical":[77],"contain":[80],"much":[81],"potential":[82],"can":[85,113,122],"be":[86,114,123],"discovered":[87],"by":[88],"good":[90],"restructuring":[91],"compiler.":[92],"Next,":[93],"represented":[98],"task":[101,171],"graph":[102],"whose":[103,111],"nodes":[104],"do":[106],"across":[107,183],"loops":[108,110],"(i.e.,":[109],"iterations":[112],"partially,":[115],"overlapped).":[116],"It":[117],"shown":[119],"how":[120],"allocated":[124],"exploit":[126],"horizontal":[127],"vertical":[129],"in":[131],"such":[132],"graphs.":[133,172],"Two":[134],"heuristic":[137],"algorithms":[138],"(WP":[139],"PA)":[141],"presented.":[143],"PA":[144],"heart":[147],"WP":[150,166],"used":[153],"obtain":[155],"efficient":[156],"allocations":[158],"independent":[163],"tasks.":[165],"allocates":[167],"general":[170,175],"Finally,":[173],"formula":[176],"DO":[182],"loop":[184],"given":[186],"more":[189],"accurate":[190],"than":[191],"known":[193],"formula.":[194]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}