{"id":"https://openalex.org/W7139079351","doi":"https://doi.org/10.1109/globecom59602.2025.11432507","title":"A Parallel Boundary-Based Algorithm for Efficient Cellular Potts Model Simulation","display_name":"A Parallel Boundary-Based Algorithm for Efficient Cellular Potts Model Simulation","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7139079351","doi":"https://doi.org/10.1109/globecom59602.2025.11432507"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11432507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-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/A5101421108","display_name":"Jiewen Wang","orcid":"https://orcid.org/0000-0002-1747-1859"},"institutions":[{"id":"https://openalex.org/I4387152983","display_name":"Osaka Metropolitan University","ror":"https://ror.org/01hvx5h04","country_code":"JP","type":"education","lineage":["https://openalex.org/I4387152983"]},{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Jiewen Wang","raw_affiliation_strings":["Osaka Metropolitan University,Graduate School of Informatics,Japan"],"affiliations":[{"raw_affiliation_string":"Osaka Metropolitan University,Graduate School of Informatics,Japan","institution_ids":["https://openalex.org/I69740276","https://openalex.org/I4387152983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005546566","display_name":"Tadashi Nakano","orcid":"https://orcid.org/0000-0003-3354-8964"},"institutions":[{"id":"https://openalex.org/I4387152983","display_name":"Osaka Metropolitan University","ror":"https://ror.org/01hvx5h04","country_code":"JP","type":"education","lineage":["https://openalex.org/I4387152983"]},{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tadashi Nakano","raw_affiliation_strings":["Osaka Metropolitan University,Graduate School of Informatics,Japan"],"affiliations":[{"raw_affiliation_string":"Osaka Metropolitan University,Graduate School of Informatics,Japan","institution_ids":["https://openalex.org/I69740276","https://openalex.org/I4387152983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101421108"],"corresponding_institution_ids":["https://openalex.org/I4387152983","https://openalex.org/I69740276"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.73223433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4167","last_page":"4172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11829","display_name":"Mathematical Biology Tumor Growth","score":0.6449000239372253,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11829","display_name":"Mathematical Biology Tumor Growth","score":0.6449000239372253,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10379","display_name":"Cellular Mechanics and Interactions","score":0.07360000163316727,"subfield":{"id":"https://openalex.org/subfields/1307","display_name":"Cell Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11187","display_name":"Nonlinear Dynamics and Pattern Formation","score":0.048500001430511475,"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/computation","display_name":"Computation","score":0.6717000007629395},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6018000245094299},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5626999735832214},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.47279998660087585},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.44040000438690186},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.41620001196861267},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.3490000069141388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7281000018119812},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6717000007629395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6685000061988831},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6018000245094299},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5690000057220459},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5626999735832214},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.47279998660087585},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.44040000438690186},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.41620001196861267},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.30979999899864197},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2892000079154968},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.2750000059604645},{"id":"https://openalex.org/C112675119","wikidata":"https://www.wikidata.org/wiki/Q2992284","display_name":"Periodic boundary conditions","level":3,"score":0.2743000090122223},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11432507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2002785668","https://openalex.org/W2020644315","https://openalex.org/W2024161345","https://openalex.org/W2040163651","https://openalex.org/W2045277539","https://openalex.org/W2100345558","https://openalex.org/W2139802217","https://openalex.org/W2140096109","https://openalex.org/W2161590805","https://openalex.org/W2511630048","https://openalex.org/W2623620232"],"related_works":[],"abstract_inverted_index":{"The":[0],"Cellular":[1],"Potts":[2],"Model":[3],"(CPM)":[4],"is":[5],"a":[6,28,44,75,88,102],"powerful":[7],"computational":[8],"framework":[9],"for":[10],"simulating":[11],"collective":[12],"cell":[13,17],"behavior,":[14],"including":[15],"morphogenesis,":[16],"migration,":[18],"and":[19,117],"tissue":[20],"dynamics.":[21],"However,":[22],"conventional":[23,110],"CPM":[24,50],"implementations":[25],"rely":[26],"on":[27],"sequential":[29],"Modified":[30],"Metropolis":[31],"Algorithm":[32],"(MMA),":[33],"making":[34],"large-scale":[35],"simulations":[36,51],"computationally":[37],"expensive.":[38],"In":[39],"this":[40],"work,":[41],"we":[42],"present":[43],"parallel":[45],"boundary-based":[46],"algorithm":[47,69],"that":[48],"accelerates":[49],"by":[52],"restricting":[53],"copy":[54,85],"attempts":[55],"to":[56,96,109],"boundary":[57],"sites":[58,61],"(i.e.,":[59],"lattice":[60],"located":[62],"at":[63],"cell-cell":[64],"or":[65],"cell-substrate":[66],"interfaces).":[67],"Our":[68],"combines":[70],"local":[71],"energy":[72],"evaluation":[73],"with":[74],"thread-safe":[76],"parallelization":[77],"strategy":[78],"in":[79,105],"which":[80],"multiple":[81],"threads":[82],"independently":[83],"assess":[84],"attempts,":[86],"while":[87],"central":[89],"core":[90],"thread":[91],"applies":[92],"accepted":[93],"updates":[94],"sequentially":[95],"ensure":[97],"consistency.":[98],"Benchmark":[99],"results":[100],"demonstrate":[101],"significant":[103],"reduction":[104],"computation":[106],"time":[107],"compared":[108],"implementations,":[111],"enabling":[112],"efficient":[113],"simulation":[114],"of":[115],"larger":[116],"more":[118],"complex":[119],"cellular":[120],"systems.":[121]},"counts_by_year":[],"updated_date":"2026-03-20T20:54:20.808490","created_date":"2026-03-20T00:00:00"}