{"id":"https://openalex.org/W2299534837","doi":null,"title":"Compilation-time data decomposition optimization for data parallel programs","display_name":"Compilation-time data decomposition optimization for data parallel programs","alternate_titles":[],"publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2299534837","mag":"2299534837"},"language":"en","primary_location":{"id":"mag:2299534837","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=921765","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2299534837"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5021357065","display_name":"Lionel Ming-shuan Ni","orcid":"https://orcid.org/0000-0002-2325-6215","observed_orcids":["https://orcid.org/0000-0002-2325-6215"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lionel M. Ni","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2325-6215","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5022420830","display_name":"Hong Li Xu","orcid":"https://orcid.org/0000-0002-9359-9571","observed_orcids":["https://orcid.org/0000-0002-9359-9571"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hong Xu","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9359-9571","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":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9970999956130981,"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.9970999956130981,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.0008999999845400453,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/data-decomposition","display_name":"data decomposition","score":0.9380000233650208},{"id":"https://openalex.org/keywords/data-parallel-applications","display_name":"data-parallel applications","score":0.9670000076293945},{"id":"https://openalex.org/keywords/spanning-tree-algorithms","display_name":"spanning tree algorithms","score":0.8920000195503235},{"id":"https://openalex.org/keywords/dataflow-optimization","display_name":"data flow optimization","score":0.8690000176429749},{"id":"https://openalex.org/keywords/segment-distribution","display_name":"segment distribution","score":0.746999979019165},{"id":"https://openalex.org/keywords/processor-allocation","display_name":"processor allocation","score":0.8289999961853027},{"id":"https://openalex.org/keywords/workload-balance","display_name":"workload balance","score":0.7480000257492065},{"id":"https://openalex.org/keywords/cost-model","display_name":"cost model","score":0.38499999046325684}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7629035711288452},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.627819299697876},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5526613593101501},{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.48596394062042236},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.44791823625564575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43871238827705383},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.41188687086105347},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3944082260131836},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3730200529098511},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3420279324054718},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3220052719116211},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.149288147687912},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10749194025993347},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2299534837","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=921765","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2111491307","https://openalex.org/W2115727232","https://openalex.org/W3170383582","https://openalex.org/W4240010000","https://openalex.org/W2009471694","https://openalex.org/W7095540577","https://openalex.org/W1523387706","https://openalex.org/W2088916376","https://openalex.org/W2032904294","https://openalex.org/W44828833"],"abstract_inverted_index":{"Data":[0,32],"decomposition":[1,17],"is":[2,54,84,136,180,238,260,267,301,317,348],"critical":[3],"to":[4,29,41,85,102,113,156,181,241,269,302,319,335,350],"the":[5,49,57,61,87,97,104,115,118,128,140,143,158,163,183,193,200,208,213,234,243,246,251,271,292,304,321,340,352,363,378],"performance":[6],"of":[7,26,51,81,89,117,142,177,185,195,215,245,253,273,298,306,339,355,362],"data":[8,16,45,98,186,196,216,254,263,299,307,325,356,380,385],"parallel":[9,13,386],"programs":[10],"on":[11,60,230],"scalable":[12],"computers.":[14],"A":[15],"model":[18,101,206,266],"can":[19,71],"be":[20,72],"viewed":[21],"as":[22,64],"a":[23,336],"two-level":[24],"mapping":[25],"array":[27,36,111],"elements":[28,37],"abstract":[30],"processors.":[31,58],"alignment":[33,62,70,76,83,120,135,152,179,259,275,295],"determines":[34],"what":[35],"are":[38,154,289],"aligned":[39,52],"relative":[40],"one":[42],"another,":[43],"and":[44,77,112,147,161,249,276,286,310,328,369],"distribution":[46,300,316,368,381],"resolves":[47],"how":[48],"group":[50],"arrays":[53],"distributed":[55],"onto":[56],"Depending":[59],"relationship":[63],"within":[65],"dimension":[66,338],"or":[67],"across":[68,359],"dimension,":[69],"classified":[73],"into":[74],"base":[75,82,132,151],"offset":[78,178,258,274,294],"alignment.\r\nThe":[79],"purpose":[80,176,297],"reduce":[86,157,182,303],"amount":[88,184,252],"unstructured":[90],"communication.":[91],"In":[92],"this":[93,170,227,231,375],"research,":[94],"we":[95],"use":[96],"reference":[99,106,264],"graph":[100,265],"describe":[103],"various":[105],"patterns":[107],"associated":[108],"with":[109,139,291,333],"each":[110],"resolve":[114,320],"conflict":[116,322],"compatible":[119],"requirements.":[121],"An":[122,343],"efficient":[123,278],"spanning":[124,279],"tree":[125,280],"algorithm":[126,237,347],"addresses":[127],"fundamental":[129],"issues":[130],"in":[131,211,226,374],"alignment.":[133],"Base":[134],"further":[137],"studied":[138],"consideration":[141],"optimal":[144,235,344,370],"expression":[145,165,284],"evaluation":[146,285],"dataflow":[148,287],"analysis.":[149],"Efficient":[150],"algorithms":[153],"proposed":[155,240,293,318,373],"redundant":[159],"communication":[160,358],"optimize":[162],"RHS":[164,283],"evaluation.":[166],"These":[167],"contributions":[168],"make":[169],"research":[171],"unique":[172],"from":[173],"related":[174],"research.\r\nThe":[175],"shift":[187,197,217,255,308,326,357],"movement.":[188],"This":[189,204],"thesis":[190,376],"successfully":[191],"models":[192],"cost":[194,205,232,354],"movement":[198,256,309,327],"using":[199],"piecewise":[201],"linear":[202],"function.":[203],"solves":[207],"accuracy":[209],"problem":[210,221,272],"measuring":[212],"quantity":[214],"movement,":[218],"an":[219],"unresolved":[220],"left":[222],"by":[223],"other":[224],"work":[225],"area.":[228],"Based":[229],"model,":[233],"post-alignment":[236],"first":[239],"exceed":[242],"limitation":[244],"owner-computes":[247],"rule":[248],"minimize":[250,351],"after":[257],"determined.":[261],"The":[262,282,366],"used":[268],"address":[270],"develop":[277],"algorithms.":[281],"optimizations":[288],"incorporated":[290],"algorithms.\r\nThe":[296],"impact":[305],"increase":[311],"processor":[312,330,345,371],"workload":[313,331],"balance.":[314],"Segment":[315],"between":[323],"reducing":[324],"increasing":[329],"balance":[332],"regard":[334],"particular":[337],"template":[341,364],"array.":[342,365],"allocation":[346,372],"introduced":[349],"overall":[353],"multiple":[360],"dimensions":[361],"segment":[367],"provide":[377],"best":[379],"support":[382],"for":[383],"most":[384],"programs.":[387]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2299534837","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
