{"id":"https://openalex.org/W2141344883","doi":"https://doi.org/10.1155/1994/715918","title":"Graph Contraction for Mapping Data on Parallel Computers: A Quality\u2013Cost Tradeoff","display_name":"Graph Contraction for Mapping Data on Parallel Computers: A Quality\u2013Cost Tradeoff","publication_year":1993,"publication_date":"1993-12-30","ids":{"openalex":"https://openalex.org/W2141344883","doi":"https://doi.org/10.1155/1994/715918","mag":"2141344883"},"language":"en","primary_location":{"id":"doi:10.1155/1994/715918","is_oa":true,"landing_page_url":"https://doi.org/10.1155/1994/715918","pdf_url":"https://downloads.hindawi.com/journals/sp/1994/715918.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://downloads.hindawi.com/journals/sp/1994/715918.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043587757","display_name":"R. Ponnusamy","orcid":null},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ponnusamy","raw_affiliation_strings":["Northeast Parallel Architectures Center, Syracuse University, Syracuse, NY 13244, USA","syracuse University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeast Parallel Architectures Center, Syracuse University, Syracuse, NY 13244, USA","institution_ids":["https://openalex.org/I70983195"]},{"raw_affiliation_string":"syracuse University","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109916749","display_name":"N. Mansour","orcid":"https://orcid.org/0009-0007-0887-6751"},"institutions":[{"id":"https://openalex.org/I4401726952","display_name":"University of Kut","ror":"https://ror.org/0520xdp94","country_code":"IQ","type":"education","lineage":["https://openalex.org/I4401726952"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"N. Mansour","raw_affiliation_strings":["Beirut University College, Lebanon","Beirut University College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beirut University College, Lebanon","institution_ids":[]},{"raw_affiliation_string":"Beirut University College","institution_ids":["https://openalex.org/I4401726952"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074976770","display_name":"Alok Choudhary","orcid":"https://orcid.org/0000-0001-8152-6319"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Choudhary","raw_affiliation_strings":["ECE Department, Syracuse University, Syracuse, NY 13244, USA","Syracuse University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Department, Syracuse University, Syracuse, NY 13244, USA","institution_ids":["https://openalex.org/I70983195"]},{"raw_affiliation_string":"Syracuse University","institution_ids":["https://openalex.org/I70983195"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108016089","display_name":"Geoffrey Fox","orcid":"https://orcid.org/0000-0001-8198-4117"},"institutions":[{"id":"https://openalex.org/I70983195","display_name":"Syracuse University","ror":"https://ror.org/025r5qe02","country_code":"US","type":"education","lineage":["https://openalex.org/I70983195"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. C. Fox","raw_affiliation_strings":["Northeast Parallel Architectures Center, Syracuse University, Syracuse, NY 13244, USA","syracuse University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeast Parallel Architectures Center, Syracuse University, Syracuse, NY 13244, USA","institution_ids":["https://openalex.org/I70983195"]},{"raw_affiliation_string":"syracuse University","institution_ids":["https://openalex.org/I70983195"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1800,"currency":"USD","value_usd":1800},"apc_paid":{"value":1800,"currency":"USD","value_usd":1800},"fwci":0.0,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.22145726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":"1","first_page":"73","last_page":"82"},"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.9979000091552734,"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.9979000091552734,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9848999977111816,"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.9835000038146973,"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.7175071835517883},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.582198977470398},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5342492461204529},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.5312076807022095},{"id":"https://openalex.org/keywords/graph-reduction","display_name":"Graph reduction","score":0.5188454389572144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4798019230365753},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4339008927345276},{"id":"https://openalex.org/keywords/edge-contraction","display_name":"Edge contraction","score":0.4176381528377533},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41353103518486023},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34049588441848755},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2270807921886444},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20843195915222168},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17499315738677979},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.09272634983062744}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7175071835517883},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.582198977470398},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5342492461204529},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.5312076807022095},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.5188454389572144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4798019230365753},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4339008927345276},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.4176381528377533},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41353103518486023},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34049588441848755},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2270807921886444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20843195915222168},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17499315738677979},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.09272634983062744},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1155/1994/715918","is_oa":true,"landing_page_url":"https://doi.org/10.1155/1994/715918","pdf_url":"https://downloads.hindawi.com/journals/sp/1994/715918.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:fa3bf31435014b42b9ddadd7f7f41a8b","is_oa":false,"landing_page_url":"https://doaj.org/article/fa3bf31435014b42b9ddadd7f7f41a8b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scientific Programming, Vol 3, Iss 1, Pp 73-82 (1994)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/1994/715918","is_oa":true,"landing_page_url":"https://doi.org/10.1155/1994/715918","pdf_url":"https://downloads.hindawi.com/journals/sp/1994/715918.pdf","source":{"id":"https://openalex.org/S166774750","display_name":"Scientific Programming","issn_l":"1058-9244","issn":["1058-9244","1875-919X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Scientific Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2804948308","display_name":null,"funder_award_id":"CCR-9357840","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G303388382","display_name":null,"funder_award_id":"DABT63-91-C-0028","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5303880902","display_name":null,"funder_award_id":"DABT63-91-C-0028","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G5414192241","display_name":"RIA: Design, Analysis, Simulation and Evaluation of         Multi-Level Caches for Scalable Multiprocessors","funder_award_id":"9110810","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7990264300","display_name":null,"funder_award_id":"MIP-9110810","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G8877259947","display_name":"NSF Young Investigator: Compiler and Runtime Optimization   Techniques for Parallel Programming on Distributed          Memory Machines","funder_award_id":"9357840","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8970971673","display_name":null,"funder_award_id":"CCR-9357840","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G909445243","display_name":null,"funder_award_id":"MIP-9110810","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2141344883.pdf","grobid_xml":"https://content.openalex.org/works/W2141344883.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W338375802","https://openalex.org/W1490227249","https://openalex.org/W1539215248","https://openalex.org/W1559533846","https://openalex.org/W1560068970","https://openalex.org/W1585455900","https://openalex.org/W1981893977","https://openalex.org/W1987937537","https://openalex.org/W2037423558","https://openalex.org/W2043889645","https://openalex.org/W2052809699","https://openalex.org/W2086691505","https://openalex.org/W2096159022","https://openalex.org/W2111516947","https://openalex.org/W2114030927","https://openalex.org/W2131701894","https://openalex.org/W2752885492","https://openalex.org/W4246632434","https://openalex.org/W4256548610","https://openalex.org/W7037377122"],"related_works":["https://openalex.org/W2067147118","https://openalex.org/W2392013129","https://openalex.org/W2025427163","https://openalex.org/W2113777112","https://openalex.org/W2884994975","https://openalex.org/W1945908304","https://openalex.org/W2007503867","https://openalex.org/W2946972079","https://openalex.org/W3105424255","https://openalex.org/W4288345683"],"abstract_inverted_index":{"Mapping":[0],"data":[1],"to":[2,64,100,130,151,158],"parallel":[3,86],"computers":[4],"aims":[5],"at":[6],"minimizing":[7],"the":[8,12,27,31,34,37,47,57,67,98,110,146,159,173],"execution":[9,28],"time":[10,23,29],"of":[11,22,30,36,97],"associated":[13],"application.":[14],"However,":[15],"it":[16],"can":[17,70],"take":[18],"an":[19],"unacceptable":[20],"amount":[21],"in":[24,167,176],"comparison":[25],"with":[26],"application":[32],"if":[33],"size":[35],"problem":[38,58,68,99,112],"is":[39,103,113],"large.":[40],"In":[41],"this":[42],"article,":[43],"first":[44],"we":[45,82,171],"motivate":[46],"case":[48],"for":[49,55,109],"graph":[50,75,87,178],"contraction":[51,88],"as":[52,128],"a":[53,74,84,94,116,152,164],"means":[54],"reducing":[56],"size.":[59],"We":[60,119],"restrict":[61],"our":[62],"discussion":[63],"applications":[65],"where":[66],"domain":[69],"be":[71],"described":[72],"using":[73,125],"(e.g.,":[76],"computational":[77],"fluid":[78],"dynamics":[79],"applications).":[80],"Then":[81],"present":[83,121],"mapping\u2010oriented":[85],"(PGC)":[89],"heuristic":[90],"algorithm":[91,137,148],"that":[92,145],"yields":[93],"smaller":[95],"representation":[96],"which":[101],"mapping":[102,107,156,168],"then":[104,120],"applied.":[105],"The":[106,141],"solution":[108],"original":[111,160],"obtained":[114],"by":[115],"straightforward":[117],"interpolation.":[118],"experimental":[122,142],"results":[123,143],"on":[124],"contracted":[126],"graphs":[127],"inputs":[129],"two":[131],"physical":[132],"optimization":[133],"methods;":[134],"namely,":[135],"genetic":[136],"and":[138],"simulated":[139],"annealing.":[140],"show":[144],"PGC":[147],"still":[149],"leads":[150],"reasonably":[153],"good":[154],"quality":[155],"solutions":[157],"problem,":[161],"while":[162],"producing":[163],"substantial":[165],"reduction":[166],"time.":[169],"Finally,":[170],"discuss":[172],"cost\u2010quality":[174],"tradeoffs":[175],"performing":[177],"contraction.":[179]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}