{"id":"https://openalex.org/W2170841196","doi":"https://doi.org/10.1109/tpds.2002.1019863","title":"P-3PC: a point-to-point communication model for automatic and optimal decomposition of regular domain problems","display_name":"P-3PC: a point-to-point communication model for automatic and optimal decomposition of regular domain problems","publication_year":2002,"publication_date":"2002-07-01","ids":{"openalex":"https://openalex.org/W2170841196","doi":"https://doi.org/10.1109/tpds.2002.1019863","mag":"2170841196"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2002.1019863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2002.1019863","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","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/A5073170852","display_name":"F.J. Seinstra","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"F.J. Seinstra","raw_affiliation_strings":["Faculty of Science, University of Amsterdam, Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Science, University of Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030074849","display_name":"D.C. Koelma","orcid":"https://orcid.org/0000-0002-2207-5682"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"D. Koelma","raw_affiliation_strings":["Faculty of Science, University of Amsterdam, Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Science, University of Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073170852"],"corresponding_institution_ids":["https://openalex.org/I887064364"],"apc_list":null,"apc_paid":null,"fwci":1.6427,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.84872992,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"13","issue":"7","first_page":"758","last_page":"768"},"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.9998000264167786,"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.9998000264167786,"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.9965000152587891,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9952999949455261,"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.8303583860397339},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.7395807504653931},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.6460608243942261},{"id":"https://openalex.org/keywords/point-to-point","display_name":"Point-to-point","score":0.6230517029762268},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5882390141487122},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5644321441650391},{"id":"https://openalex.org/keywords/domain-decomposition-methods","display_name":"Domain decomposition methods","score":0.5319925546646118},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5107719898223877},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.5021007061004639},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48172906041145325},{"id":"https://openalex.org/keywords/models-of-communication","display_name":"Models of communication","score":0.47079649567604065},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4643896520137787},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45726168155670166},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4315219521522522},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.41643622517585754},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33606523275375366},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10720327496528625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10248640179634094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8303583860397339},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.7395807504653931},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.6460608243942261},{"id":"https://openalex.org/C174440990","wikidata":"https://www.wikidata.org/wiki/Q681349","display_name":"Point-to-point","level":2,"score":0.6230517029762268},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5882390141487122},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5644321441650391},{"id":"https://openalex.org/C198880260","wikidata":"https://www.wikidata.org/wiki/Q5289813","display_name":"Domain decomposition methods","level":3,"score":0.5319925546646118},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5107719898223877},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.5021007061004639},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48172906041145325},{"id":"https://openalex.org/C158156997","wikidata":"https://www.wikidata.org/wiki/Q1416645","display_name":"Models of communication","level":2,"score":0.47079649567604065},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4643896520137787},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45726168155670166},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4315219521522522},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.41643622517585754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33606523275375366},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10720327496528625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10248640179634094},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"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/C135628077","wikidata":"https://www.wikidata.org/wiki/Q220184","display_name":"Finite element method","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C46312422","wikidata":"https://www.wikidata.org/wiki/Q11024","display_name":"Communication","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tpds.2002.1019863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2002.1019863","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/7d6e6643-7a53-446a-84e8-b1b43ffc399d","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/p3pc-a-pointtopoint-communication-model-for-automatic-and-optimal-decomposition-of-regular-domain-problems(7d6e6643-7a53-446a-84e8-b1b43ffc399d).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seinstra, F J & Koelma, D C 2002, 'P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems', IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 7, pp. 758-768. https://doi.org/10.1109/TPDS.2002.1019863","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.11.1028","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.science.uva.nl/~fjseins/Papers/Journals/i3e-tpds.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.9518","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.9518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.science.uva.nl/~koelma/PUBS/PDF/2002/seinstraTPDS2002.pdf","raw_type":"text"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/7d6e6643-7a53-446a-84e8-b1b43ffc399d","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/p3pc-a-pointtopoint-communication-model-for-automatic-and-optimal-decomposition-of-regular-domain-problems(7d6e6643-7a53-446a-84e8-b1b43ffc399d).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems, 13(7), 758 - 768. IEEE Computer Society","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1487529118","https://openalex.org/W1490009831","https://openalex.org/W1570906644","https://openalex.org/W1580684925","https://openalex.org/W1938868125","https://openalex.org/W1974299554","https://openalex.org/W1997621883","https://openalex.org/W2014956284","https://openalex.org/W2026181001","https://openalex.org/W2030039609","https://openalex.org/W2042120213","https://openalex.org/W2045271686","https://openalex.org/W2045580243","https://openalex.org/W2081612620","https://openalex.org/W2101057612","https://openalex.org/W2102061396","https://openalex.org/W2109778761","https://openalex.org/W2124439758","https://openalex.org/W2130785652","https://openalex.org/W2151136241","https://openalex.org/W2157949437","https://openalex.org/W2166906892","https://openalex.org/W3201199382","https://openalex.org/W4247100129","https://openalex.org/W6640656648"],"related_works":["https://openalex.org/W2135105983","https://openalex.org/W2951568860","https://openalex.org/W2107729822","https://openalex.org/W4307317035","https://openalex.org/W2963943254","https://openalex.org/W4312101228","https://openalex.org/W2170841196","https://openalex.org/W2479429978","https://openalex.org/W2023924583","https://openalex.org/W2119094934"],"abstract_inverted_index":{"One":[0],"of":[1,50,84,133,144,186],"the":[2,47,81,113,134,179],"most":[3],"fundamental":[4],"problems":[5,26],"automatic":[6,142],"parallelization":[7,143],"tools":[8],"are":[9,150],"confronted":[10],"with":[11,96],"is":[12,87,102,115,123,136],"to":[13,53,90,125,183],"find":[14],"an":[15],"optimal":[16],"domain":[17,25,60,187],"decomposition":[18],"for":[19,141],"a":[20,57,70,139,158,163],"given":[21],"application.":[22],"For":[23],"regular":[24],"(such":[27],"as":[28,129],"simple":[29],"matrix":[30],"manipulations),":[31],"this":[32,66,92],"task":[33],"may":[34,62],"seem":[35],"trivial.":[36],"However,":[37],"communication":[38,73,180],"costs":[39,181],"in":[40,104,109,138],"message-passing":[41,127],"programs":[42],"often":[43],"depend":[44],"significantly":[45],"on":[46,80,152],"memory":[48],"layout":[49],"data":[51],"blocks":[52],"be":[54,63],"transmitted.":[55],"As":[56],"consequence,":[58],"straightforward":[59],"decompositions":[61],"non-optimal.":[64],"In":[65,94],"paper,":[67],"we":[68],"introduce":[69],"new":[71],"point-to-point":[72,120],"model,":[74],"called":[75],"P-3PC":[76,101,176],"(Parameterized":[77],"model":[78,114,135],"based":[79],"Three":[82],"Paths":[83],"Communication),":[85],"that":[86],"specifically":[88],"designed":[89],"overcome":[91],"problem.":[93],"comparison":[95],"related":[97,182],"models":[98,173],"(e.g.":[99],"LogGP),":[100],"similar":[103,126],"complexity,":[105],"but":[106],"more":[107],"accurate":[108],"many":[110],"situations.":[111],"Although":[112],"aimed":[116],"at":[117],"MPI's":[118],"standard":[119],"operations,":[121],"it":[122],"applicable":[124],"definitions":[128],"well.":[130],"The":[131,167],"effectiveness":[132],"tested":[137],"framework":[140],"low-level":[145],"image":[146],"processing":[147],"applications.":[148],"Experiments":[149],"performed":[151],"two":[153],"Beowulf-type":[154],"systems,":[155],"each":[156],"having":[157],"different":[159,164],"interconnection":[160],"network":[161],"and":[162],"MPI":[165],"implementation.":[166],"results":[168],"show":[169],"that,":[170],"where":[171],"other":[172],"frequently":[174],"fail,":[175],"correctly":[177],"predicts":[178],"any":[184],"type":[185],"decomposition.":[188]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}