{"id":"https://openalex.org/W2157339744","doi":"https://doi.org/10.1109/tc.2003.1176990","title":"Comments on \"A fast and efficient processor allocation scheme for mesh-connected multicomputers\"","display_name":"Comments on \"A fast and efficient processor allocation scheme for mesh-connected multicomputers\"","publication_year":2003,"publication_date":"2003-02-01","ids":{"openalex":"https://openalex.org/W2157339744","doi":"https://doi.org/10.1109/tc.2003.1176990","mag":"2157339744"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2003.1176990","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1176990","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/A5020014198","display_name":"Lu Zhang","orcid":"https://orcid.org/0000-0002-3970-3788"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Lu Zhang","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020014198"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.24305539,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"52","issue":"2","first_page":"255","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7573626041412354},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7530971169471741},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.5911556482315063},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5752310752868652},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5180023312568665},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4533717632293701},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4445273280143738},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41719311475753784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37203162908554077},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32275110483169556},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27798908948898315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2187679409980774},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.12733444571495056}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7573626041412354},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7530971169471741},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.5911556482315063},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5752310752868652},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5180023312568665},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4533717632293701},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4445273280143738},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41719311475753784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37203162908554077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32275110483169556},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27798908948898315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2187679409980774},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.12733444571495056},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2003.1176990","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1176990","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":[{"display_name":"Industry, innovation and infrastructure","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1986053068","https://openalex.org/W1989633053","https://openalex.org/W2100740649","https://openalex.org/W2104991792","https://openalex.org/W2164207679"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":{"In":[0,26],"a":[1],"recent":[2],"paper":[3],"by":[4],"B.S.":[5],"Yoo":[6],"and":[7],"C.R.":[8],"Das":[9],"(2002),":[10],"the":[11,35,49,52],"so-called":[12],"stack-based":[13],"allocation":[14],"(SBA)":[15],"algorithm":[16],"is":[17,40],"claimed":[18],"to":[19],"be,":[20],"at":[21,41],"worst,":[22],"O(B/sup":[23,43],"2/)":[24],"expensive.":[25],"this":[27],"paper,":[28],"we":[29,46],"present":[30],"an":[31],"exception":[32],"for":[33],"which":[34],"time":[36],"complexity":[37,53],"of":[38],"SBA":[39],"least":[42],"3/).":[44],"Furthermore,":[45],"point":[47],"out":[48],"discrepancy":[50],"in":[51],"analysis.":[54]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}