乐胖代购免代理版

{"id":"https://openalex.org/W2011911145","doi":"https://doi.org/10.1080/10637199308915442","title":"MAPPING TREE-STRUCTURED COMPUTATIONS ONTO MESH-CONNECTED ARRAYS OF PROCESSORS","display_name":"MAPPING TREE-STRUCTURED COMPUTATIONS ONTO MESH-CONNECTED ARRAYS OF PROCESSORS","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2011911145","doi":"https://doi.org/10.1080/10637199308915442","mag":"2011911145"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199308915442","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5112584073","display_name":"Jyh-Jong Tsay","orcid":null},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"JYH-JONG TSAY","raw_affiliation_strings":["National Chung Cheng University, Institute of Computer Science and Information Engineering , Chiayi, 621, Taiwan , ROC"],"affiliations":[{"raw_affiliation_string":"National Chung Cheng University, Institute of Computer Science and Information Engineering , Chiayi, 621, Taiwan , ROC","institution_ids":["https://openalex.org/I148099254"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112584073"],"corresponding_institution_ids":["https://openalex.org/I148099254"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":2,"citation_normalized_percentile":{"value":0.471974,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":61,"max":65},"biblio":{"volume":"1","issue":"3","first_page":"211","last_page":"220"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9992,"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.9992,"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.999,"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.9977,"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/tree","display_name":"Tree (set theory)","score":0.677844},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.46465462}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.677844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.61405843},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.58821595},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5874086},{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.5608571},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5202528},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5183976},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48839825},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.48304874},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.46465462},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39385054},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3785136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30438447},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12696129},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10984257},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199308915442","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":9,"referenced_works":["https://openalex.org/W1523679426","https://openalex.org/W1608652450","https://openalex.org/W1971869874","https://openalex.org/W1982291599","https://openalex.org/W1998336350","https://openalex.org/W2022272738","https://openalex.org/W2065261659","https://openalex.org/W74396353","https://openalex.org/W98850730"],"related_works":["https://openalex.org/W4313703117","https://openalex.org/W2366350639","https://openalex.org/W2170725231","https://openalex.org/W2108615321","https://openalex.org/W2087496541","https://openalex.org/W2085564391","https://openalex.org/W2028455732","https://openalex.org/W1985727224","https://openalex.org/W1966261337","https://openalex.org/W1557607869"],"abstract_inverted_index":{"This":[0],"paper":[1],"shows":[2],"how":[3],"to":[4,50,98,166],"parallelize":[5],"tree-structured":[6,18],"computations":[7],"for":[8,70,105,208],"d-dimensional":[9],"(d":[10],"\u2265":[11,138],"1)":[12,214],"mesh-connected":[13,87,196],"arrays":[14],"of":[15,22,33,63,89,156,179,184],"processors.":[16],"A":[17],"computation":[19,100],"T":[20,32,77,101],"consists":[21],"n":[23,34,109,123,158,211],"computational":[24],"tasks":[25],"whose":[26],"dependencies":[27],"form":[28],"a":[29,79,132,153,171,175,188],"task":[30,39,53,75],"tree":[31,76,183,203],"constant":[35,133],"degree":[36],"nodes.":[37],"Each":[38],"can":[40,94],"be":[41,60,164],"executed":[42],"in":[43,102,204],"unit":[44],"time,":[45,104,207],"and":[46,72,161,177],"sends":[47],"one":[48],"value":[49],"its":[51],"parent":[52],"after":[54],"it":[55],"has":[56],"executed.":[57],"Let":[58],"h":[59],"the":[61,74,96,128,201],"height":[62],"T.":[64],"We":[65],"present":[66],"linear":[67,154],"time":[68,116],"algorithms":[69],"partitioning":[71],"mapping":[73,176],"onto":[78],"p":[80,85,106,120,137,189,194,209],"1/d":[81,86,190,195],"\u00d7":[82,84,191,193],"\u2026":[83,192],"array":[88,155],"processors":[90,97],"so":[91],"that":[92],"we":[93,173],"schedule":[95,178],"perform":[99],"O(n/p)":[103],"\u2264":[107,210],"min{n/h,":[108,122,157],"d/(d":[110,124,212],"+":[111,125,146,213],"1)}.":[112],"The":[113,140],"O(max{h,n":[114],"1/(d+1)})":[115],"bound":[117,143],"achieved":[118,151],"when":[119],"=":[121],"1)}":[126],"is":[127],"best":[129,141],"possible":[130],"(upto":[131],"factor)":[134],"over":[135,187],"all":[136],"1.":[139],"previous":[142],"was":[144],"O((\u221an":[145],"h)":[147],"\u00b7":[148],"log":[149],"n)":[150],"on":[152],"1/2}":[159],"processors,":[160],"could":[162],"not":[163],"generalized":[165],"higher":[167],"dimensional":[168],"meshes.":[169],"As":[170],"consequence,":[172],"obtain":[174],"an":[180],"n-node":[181],"expression":[182,202],"associative":[185],"operators":[186],"processor":[197],"array,":[198],"which":[199],"evaluates":[200],"O":[205],"(n/p)":[206]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2011911145","counts_by_year":[],"updated_date":"2024-12-14T04:04:10.102124","created_date":"2016-06-24"}