{"id":"https://openalex.org/W2079542285","doi":"https://doi.org/10.1002/cpe.4330070507","title":"Run\u2010time issues in program partitioning on distributed memory systems","display_name":"Run\u2010time issues in program partitioning on distributed memory systems","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W2079542285","doi":"https://doi.org/10.1002/cpe.4330070507","mag":"2079542285"},"language":"en","primary_location":{"id":"doi:10.1002/cpe.4330070507","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330070507","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","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/A5061235810","display_name":"Santosh Pande","orcid":"https://orcid.org/0000-0001-6723-8062"},"institutions":[{"id":"https://openalex.org/I4210106879","display_name":"Ohio University","ror":"https://ror.org/01jr3y717","country_code":"US","type":"education","lineage":["https://openalex.org/I4210106879"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Santosh Pande","raw_affiliation_strings":["Computer Science Department Ohio University Athens OH 45701\u20132979, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department Ohio University Athens OH 45701\u20132979, USA","institution_ids":["https://openalex.org/I4210106879"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050922407","display_name":"Dharma P. Agrawal","orcid":"https://orcid.org/0000-0002-0215-9539"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dharma P. Agrawal","raw_affiliation_strings":["Department of Electrical and Computer Engineering North Carolina State University Raleigh NC 27695\u20137911, USA","Department of Electrical & Computer Engineering, North Carolina State University, Raleigh, NC 27695-7911, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering North Carolina State University Raleigh NC 27695\u20137911, USA","institution_ids":["https://openalex.org/I137902535"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, North Carolina State University, Raleigh, NC 27695-7911, USA","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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.17032818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":"5","first_page":"429","last_page":"454"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9994999766349792,"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.9991999864578247,"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/computer-science","display_name":"Computer science","score":0.8617455959320068},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7937541604042053},{"id":"https://openalex.org/keywords/compile-time","display_name":"Compile time","score":0.7919712066650391},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6117244958877563},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5560808181762695},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4916535019874573},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.4892980754375458},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4781016707420349},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.4643436074256897},{"id":"https://openalex.org/keywords/dead-code","display_name":"Dead code","score":0.44629722833633423},{"id":"https://openalex.org/keywords/unreachable-code","display_name":"Unreachable code","score":0.4441567063331604},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4206223785877228},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.32079553604125977},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3011745512485504},{"id":"https://openalex.org/keywords/redundant-code","display_name":"Redundant code","score":0.20482221245765686}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8617455959320068},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7937541604042053},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.7919712066650391},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6117244958877563},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5560808181762695},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4916535019874573},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4892980754375458},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4781016707420349},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.4643436074256897},{"id":"https://openalex.org/C47434764","wikidata":"https://www.wikidata.org/wiki/Q1770035","display_name":"Dead code","level":5,"score":0.44629722833633423},{"id":"https://openalex.org/C50951305","wikidata":"https://www.wikidata.org/wiki/Q2482534","display_name":"Unreachable code","level":5,"score":0.4441567063331604},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4206223785877228},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.32079553604125977},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3011745512485504},{"id":"https://openalex.org/C151578736","wikidata":"https://www.wikidata.org/wiki/Q1251793","display_name":"Redundant code","level":4,"score":0.20482221245765686},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/cpe.4330070507","is_oa":false,"landing_page_url":"https://doi.org/10.1002/cpe.4330070507","pdf_url":null,"source":{"id":"https://openalex.org/S4210209928","display_name":"Concurrency Practice and Experience","issn_l":"1040-3108","issn":["1040-3108","1096-9128"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Concurrency: Practice and Experience","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338286","display_name":"Lawrence Livermore National Laboratory","ror":"https://ror.org/041nk4h53"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1499576270","https://openalex.org/W1513250879","https://openalex.org/W1974470587","https://openalex.org/W2014215072","https://openalex.org/W2033220854","https://openalex.org/W2070922326","https://openalex.org/W2110417760","https://openalex.org/W2118735733","https://openalex.org/W2140639562","https://openalex.org/W2142899035","https://openalex.org/W2142902921","https://openalex.org/W2146852595","https://openalex.org/W2150730789","https://openalex.org/W2157485500","https://openalex.org/W2167026856","https://openalex.org/W2167548825","https://openalex.org/W3007497337","https://openalex.org/W3109454929","https://openalex.org/W3143697948","https://openalex.org/W4253844633"],"related_works":["https://openalex.org/W2011669306","https://openalex.org/W2999906275","https://openalex.org/W4237382625","https://openalex.org/W2153096254","https://openalex.org/W3000649693","https://openalex.org/W2156809486","https://openalex.org/W4231368563","https://openalex.org/W2341598935","https://openalex.org/W2157961203","https://openalex.org/W1591807227"],"abstract_inverted_index":{"Abstract":[0],"Our":[1],"earlier":[2],"work":[3,19],"reported":[4,20],"a":[5,37,54,58,62,66,71,169],"Threshold":[6],"Scheduling":[7],"Method":[8],"for":[9,167],"compile\u2010time":[10,40],"mapping":[11],"of":[12,39,57,61,113,191],"functional":[13,31,171],"parallism":[14,32],"on":[15,70,131,154],"distributed\u2010memory":[16],"systems.":[17,185],"The":[18,98,138],"in":[21,27,164,177],"this":[22],"paper":[23],"discusses":[24],"run\u2010time":[25,42,136,139],"issues":[26],"efficiently":[28],"supporting":[29],"the":[30,48,107,110,114,118,125,142,159,165,189,192],"with":[33,117],"minimal":[34],"overheads,":[35],"through":[36,74],"combination":[38],"and":[41,124,144,175],"ownership":[43,76,80,155],"analysis.":[44,77],"At":[45],"compile":[46,85],"time,":[47,86],"code":[49,89,99,121,128],"generation":[50,100],"phase":[51],"determines":[52],"whether":[53],"local":[55],"copy":[56,112],"live":[59],"definition":[60],"variable":[63],"needed":[64],"by":[65,161],"task":[67],"is":[68,90,101],"available":[69],"given":[72],"processor,":[73],"an":[75,87],"In":[78],"case":[79],"cannot":[81],"be":[82],"resolved":[83],"at":[84,95,147],"appropriate":[88],"generated":[91],"to":[92,134,150,181],"perform":[93],"analysis":[94],"run":[96],"time.":[97],"carried":[102],"out":[103],"so":[104],"that":[105],"all":[106,132],"processors":[108,133],"carry":[109],"same":[111],"compiled":[115],"program":[116],"individual":[119],"processor's":[120],"being":[122,129],"isolated":[123],"universally":[126],"owned":[127],"replicated":[130],"minimize":[135],"overheads.":[137],"system":[140],"maintains":[141],"static":[143],"dynamic":[145],"ownerships":[146],"every":[148],"processor":[149],"avoid":[151],"communication":[152],"overhead":[153],"information.":[156],"We":[157],"demonstrate":[158,188],"approach":[160],"incorporating":[162],"it":[163],"compiler":[166],"targeting":[168],"parallel":[170],"language,":[172],"Sisal":[173],"(streams":[174],"iterations":[176],"single":[178],"assignment":[179],"language),":[180],"Intel":[182],"Touchstone":[183],"i860":[184],"Several":[186],"benchmarks":[187],"viability":[190],"approach.":[193]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}