{"id":"https://openalex.org/W575212265","doi":null,"title":"The Tree Machine: An evaluation of program loading strategies","display_name":"The Tree Machine: An evaluation of program loading strategies","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W575212265","mag":"575212265"},"language":"en","primary_location":{"id":"mag:575212265","doi":null,"is_oa":false,"landing_page_url":"http://www.diva-portal.org/smash/record.jsf?pid=diva2:483663","pdf_url":null,"source":{"id":"https://openalex.org/S4210174133","display_name":"Proceedings of the International Conference on Parallel Processing","issn_l":"0190-3918","issn":["0190-3918","2332-5690"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the International Conference on Parallel Processing","raw_type":null},"volume":null,"type":"conference-paper","indexed_in":[],"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/A5044397510","display_name":"Peggy Li","orcid":"https://orcid.org/0000-0001-6067-7580","observed_orcids":["https://orcid.org/0000-0001-6067-7580"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peggy Li","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-6067-7580","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073745784","display_name":"Lennart Johnsson","orcid":"https://orcid.org/0000-0003-0337-879X","observed_orcids":["https://orcid.org/0000-0003-0337-879X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lennart Johnsson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.19749216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"202","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9599999785423279,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9599999785423279,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.01899999938905239,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.012600000016391277,"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/program-loading","display_name":"program loading","score":0.8259999752044678},{"id":"https://openalex.org/keywords/binary-tree-architecture","display_name":"binary tree architecture","score":0.6069999933242798},{"id":"https://openalex.org/keywords/ensemble-architecture","display_name":"ensemble architecture","score":0.5059999823570251},{"id":"https://openalex.org/keywords/code-compression","display_name":"code compression","score":0.4749999940395355},{"id":"https://openalex.org/keywords/message-passing","display_name":"message passing","score":0.515999972820282},{"id":"https://openalex.org/keywords/loading-time","display_name":"loading time","score":0.3089999854564667}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7433769106864929},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6517861485481262},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6394078135490417},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5960825681686401},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5425686240196228},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5419164896011353},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4751736521720886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4632495641708374},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.45577454566955566},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.43800097703933716},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.429311603307724},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4112567901611328},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4011394679546356},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.357195645570755},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.33944135904312134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18477940559387207},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1400948166847229},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1071980893611908},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.10152781009674072},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08639883995056152},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:575212265","doi":null,"is_oa":false,"landing_page_url":"http://www.diva-portal.org/smash/record.jsf?pid=diva2:483663","pdf_url":null,"source":{"id":"https://openalex.org/S4210174133","display_name":"Proceedings of the International Conference on Parallel Processing","issn_l":"0190-3918","issn":["0190-3918","2332-5690"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["jufo-1","norway-1"],"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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the International Conference on Parallel Processing","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1649730771","https://openalex.org/W2189401016","https://openalex.org/W2162469738","https://openalex.org/W1660812717","https://openalex.org/W2074999353","https://openalex.org/W7097182525","https://openalex.org/W2042679826","https://openalex.org/W1817672977","https://openalex.org/W1585016596","https://openalex.org/W2118663179"],"abstract_inverted_index":{"The":[0,130,189,228],"Caltech":[1],"Tree":[2,105],"Machine":[3,106],"has":[4],"an":[5],"ensemble":[6],"architecture,":[7],"Processors":[8],"are":[9,30,86,108],"interconnected":[10],"into":[11],"a":[12,83,88,134,193,223,231,240],"binary":[13],"tree.":[14],"Each":[15],"node":[16],"executes":[17],"its":[18],"own":[19],"code.":[20,28,104],"No":[21],"two":[22],"nodes":[23,41,123,221],"need":[24],"to":[25,44,55,62,139,161,209],"execute":[26,102],"identical":[27,103],"Nodes":[29,85,97],"synchronized":[31],"by":[32,76],"messages":[33],"between":[34],"adjacent":[35],"nodes.":[36],"Since":[37],"the":[38,48,64,77,92,99,119,125,137,145,148,154,162,165,173,180,187,210,217,246,249],"number":[39,219],"of":[40,50,98,118,121,133,147,164,186,197,201,207,212,220],"is":[42,73,167,178,216],"intended":[43],"be":[45,56,128],"large,":[46],"in":[47,58,124,144,169,222,236],"order":[49],"thousands,":[51],"great":[52],"care":[53],"needs":[54],"exercised":[57],"devising":[59],"loading":[60,65,158],"strategies":[61],"make":[63],"time":[66,159,177],"as":[67,69],"short":[68],"possible.":[70],"A":[71,157],"constraint":[72],"also":[74,179],"imposed":[75],"very":[78,110],"limited":[79,131],"storage":[80,132],"associated":[81],"with":[82,172,225,230,248],"processor.":[84],"assigned":[87],"type":[89,101],"that":[90],"identifies":[91],"code":[93],"it":[94],"shall":[95],"execute.":[96],"same":[100],"programs":[107],"frequently":[109],"regular.":[111],"By":[112],"exploiting":[113],"this":[114],"regularity,":[115],"compact":[116,242],"descriptions":[117],"types":[120],"all":[122],"tree":[126,166,224,243],"can":[127],"created.":[129],"node,":[135],"and":[136,203],"desire":[138],"only":[140],"use":[141],"local":[142],"information":[143],"expansion":[146],"compacted":[149],"description":[150],"implies":[151],"constraints":[152],"on":[153],"compression/decompression":[155],"algorithms.":[156,188],"proportional":[160],"height":[163],"attainable":[168],"many":[170],"cases":[171,238],"algorithms":[174,191,229],"presented.":[175],"This":[176],"worst":[181,194],"case":[182,195],"performance":[183,196],"for":[184],"one":[185],"other":[190],"have":[192],"0":[198],"square":[199,205],"root":[200,206],"N/f":[202],"O":[204],"(N":[208],"power":[211],"1/log2f),":[213],"where":[214],"N":[215],"total":[218],"fanout":[226],"f.":[227],"less":[232],"favorable":[233],"upper":[234,251],"bound,":[235],"some":[237],"allow":[239],"more":[241],"description,":[244],"than":[245],"algorithm":[247],"best":[250],"bound.":[252]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2016-06-24T00:00:00"}