{"id":"https://openalex.org/W2990633757","doi":"https://doi.org/10.23919/softcom.2019.8903794","title":"Multi-way Divide and Conquer Parallel Programming based on PLists","display_name":"Multi-way Divide and Conquer Parallel Programming based on PLists","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2990633757","doi":"https://doi.org/10.23919/softcom.2019.8903794","mag":"2990633757"},"language":"en","primary_location":{"id":"doi:10.23919/softcom.2019.8903794","is_oa":false,"landing_page_url":"https://doi.org/10.23919/softcom.2019.8903794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","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/A5047626796","display_name":"Virginia Niculescu","orcid":"https://orcid.org/0000-0002-9981-0139"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Virginia Niculescu","raw_affiliation_strings":["Babe&#x015F;-Bolyai University,Computer Science Department,Cluj-Napoca,Romania","Computer Science Department, Babe\u015f-Bolyai University, Cluj-Napoca, Romania"],"affiliations":[{"raw_affiliation_string":"Babe&#x015F;-Bolyai University,Computer Science Department,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I3125347698"]},{"raw_affiliation_string":"Computer Science Department, Babe\u015f-Bolyai University, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I3125347698"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086663908","display_name":"Darius Bufnea","orcid":"https://orcid.org/0000-0003-0935-3243"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Darius Bufnea","raw_affiliation_strings":["Babe&#x015F;-Bolyai University,Computer Science Department,Cluj-Napoca,Romania","Computer Science Department, Babe\u015f-Bolyai University, Cluj-Napoca, Romania"],"affiliations":[{"raw_affiliation_string":"Babe&#x015F;-Bolyai University,Computer Science Department,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I3125347698"]},{"raw_affiliation_string":"Computer Science Department, Babe\u015f-Bolyai University, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I3125347698"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024739530","display_name":"Adrian Sterca","orcid":"https://orcid.org/0000-0002-5911-0269"},"institutions":[{"id":"https://openalex.org/I3125347698","display_name":"Babe\u0219-Bolyai University","ror":"https://ror.org/02rmd1t30","country_code":"RO","type":"education","lineage":["https://openalex.org/I3125347698"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Adrian Sterca","raw_affiliation_strings":["Babe&#x015F;-Bolyai University,Computer Science Department,Cluj-Napoca,Romania","Computer Science Department, Babe\u015f-Bolyai University, Cluj-Napoca, Romania"],"affiliations":[{"raw_affiliation_string":"Babe&#x015F;-Bolyai University,Computer Science Department,Cluj-Napoca,Romania","institution_ids":["https://openalex.org/I3125347698"]},{"raw_affiliation_string":"Computer Science Department, Babe\u015f-Bolyai University, Cluj-Napoca, Romania","institution_ids":["https://openalex.org/I3125347698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064288686","display_name":"Robert Silimon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Silimon","raw_affiliation_strings":["Frequentis Romania,Cluj-Napoca,Romania","Frequentis Romania, Cluj-Napoca, Romania"],"affiliations":[{"raw_affiliation_string":"Frequentis Romania,Cluj-Napoca,Romania","institution_ids":[]},{"raw_affiliation_string":"Frequentis Romania, Cluj-Napoca, Romania","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047626796"],"corresponding_institution_ids":["https://openalex.org/I3125347698"],"apc_list":null,"apc_paid":null,"fwci":0.4815,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63044613,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9987999796867371,"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.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.8806353807449341},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.81939697265625},{"id":"https://openalex.org/keywords/embarrassingly-parallel","display_name":"Embarrassingly parallel","score":0.77324378490448},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.6003508567810059},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5143619775772095},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.5044294595718384},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5022304058074951},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4941919147968292},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.4807291328907013},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47559913992881775},{"id":"https://openalex.org/keywords/parallel-programming-model","display_name":"Parallel programming model","score":0.44976478815078735},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4179508686065674},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3779168128967285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1369951069355011}],"concepts":[{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.8806353807449341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.81939697265625},{"id":"https://openalex.org/C126909462","wikidata":"https://www.wikidata.org/wiki/Q5369501","display_name":"Embarrassingly parallel","level":3,"score":0.77324378490448},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.6003508567810059},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5143619775772095},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.5044294595718384},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5022304058074951},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4941919147968292},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.4807291328907013},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47559913992881775},{"id":"https://openalex.org/C137364921","wikidata":"https://www.wikidata.org/wiki/Q27929394","display_name":"Parallel programming model","level":3,"score":0.44976478815078735},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4179508686065674},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3779168128967285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1369951069355011},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/softcom.2019.8903794","is_oa":false,"landing_page_url":"https://doi.org/10.23919/softcom.2019.8903794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W183639852","https://openalex.org/W1482133123","https://openalex.org/W1489689515","https://openalex.org/W1558180172","https://openalex.org/W1649645444","https://openalex.org/W1974621770","https://openalex.org/W2035218567","https://openalex.org/W2055893308","https://openalex.org/W2061171222","https://openalex.org/W2071094321","https://openalex.org/W2085598584","https://openalex.org/W2105918908","https://openalex.org/W2136031991","https://openalex.org/W2155882878","https://openalex.org/W2156523571","https://openalex.org/W2168353136","https://openalex.org/W2171569614","https://openalex.org/W2173213060","https://openalex.org/W2280540821","https://openalex.org/W2537952073","https://openalex.org/W2794470920"],"related_works":["https://openalex.org/W1974621770","https://openalex.org/W2335518626","https://openalex.org/W141404642","https://openalex.org/W1177194838","https://openalex.org/W2385377444","https://openalex.org/W2353488209","https://openalex.org/W2045886945","https://openalex.org/W3162219659","https://openalex.org/W2074473197","https://openalex.org/W3090298140"],"abstract_inverted_index":{"Divide":[0,68],"and":[1,25,49,69,99,134],"Conquer":[2,70],"with":[3],"all":[4],"its":[5,92],"variants":[6,108],"represents":[7],"an":[8,19,31],"important":[9,151],"paradigm":[10],"of":[11,21,33,78,81,103,113,131,137,153],"parallel":[12,36,83],"programming.":[13],"In":[14],"this":[15],"paper":[16],"we":[17,59],"present":[18],"implementation":[20],"PLists":[22,87],"data":[23,115],"structures":[24],"functions,":[26],"which":[27],"is":[28,95,109,125],"introduced":[29],"as":[30,123],"extension":[32],"a":[34,129],"Java":[35],"programming":[37],"framework":[38,43],"-":[39,122,133],"JPLF.":[40],"The":[41,111,144],"JPLF":[42,90],"was":[44],"initially":[45],"based":[46,64],"on":[47,57,65],"PowerLists":[48,127],"their":[50,73],"associated":[51],"theory.":[52],"By":[53,85],"using":[54],"functions":[55],"defined":[56],"PLists,":[58],"may":[60],"easily":[61],"define":[62],"programs":[63],"the":[66,76,89,101,105,114,135,154],"multi-way":[67],"paradigm.":[71],"Also,":[72],"definition":[74],"allows":[75],"description":[77],"any":[79,120],"kind":[80],"embarrassingly":[82],"computation.":[84],"introducing":[86],"into":[88],"framework,":[91],"application":[93],"domain":[94],"very":[96],"much":[97,141],"enlarged,":[98],"also":[100],"flexibility":[102],"choosing":[104],"best":[106],"computation":[107],"increased.":[110],"sizes":[112],"lists":[116],"are":[117],"not":[118],"constrained":[119],"more":[121],"it":[124],"for":[126,147],"to":[128],"power":[130],"two":[132],"level":[136],"parallelism":[138],"could":[139],"be":[140],"easier":[142],"controlled.":[143],"experiments":[145],"done":[146],"several":[148],"applications":[149],"reveal":[150],"improvements":[152],"obtained":[155],"performance.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
