Distributed algorithm for parallel computation of the n queens solutions
The n-queen problem represents a classic challenge in artificial intelligence (AI) research. It involves the placement of n queens on an n x n chessboard, with the objective of ensuring that no queen threatens another. This problem has long been a source of fascination for mathematicians and compute...
Uloženo v:
| Vydáno v: | Expert systems with applications Ročník 255; s. 124677 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.12.2024
|
| Témata: | |
| ISSN: | 0957-4174 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The n-queen problem represents a classic challenge in artificial intelligence (AI) research. It involves the placement of n queens on an n x n chessboard, with the objective of ensuring that no queen threatens another. This problem has long been a source of fascination for mathematicians and computer scientists alike due to its inherent complexity. It is a well-known fact that as the value of ‘n’ increases, the problem becomes more challenging and falls into the NP problem class. Given the computational demands of the problem, parallel methods are of critical importance. It is noteworthy that scalable and parallel approaches for the n-queen problem remain to be developed. The majority of existing methods working on graphs attempt to parallelize a recursive sequential algorithm. However, the unpredictable nature of these algorithms makes it challenging to parallelize them on modern computer architectures. Consequently, we have selected an iterative algorithm from the literature in order to facilitate parallelization. This paper presents an innovative approach to parallelization that differs from traditional matrix-based strategies. The n-queen graph is distributed among a network of nodes, ensuring effective load balancing through dynamic partitioning and real-time computation. Our bespoke distributed algorithm, designed for the maximum clique problem on the n-queen graph, operates with true concurrency, thus obviating the necessity for resource or data sharing. The results of our assessment demonstrate that the parallel algorithm outperforms a cutting-edge sequential algorithm in terms of task completion time. The findings demonstrate that the speedups are almost perfect and that the workloads are distributed evenly across the network nodes. Furthermore, the results demonstrate high scalability, with task completion times decreasing as the number of nodes increases. |
|---|---|
| AbstractList | The n-queen problem represents a classic challenge in artificial intelligence (AI) research. It involves the placement of n queens on an n x n chessboard, with the objective of ensuring that no queen threatens another. This problem has long been a source of fascination for mathematicians and computer scientists alike due to its inherent complexity. It is a well-known fact that as the value of ‘n’ increases, the problem becomes more challenging and falls into the NP problem class. Given the computational demands of the problem, parallel methods are of critical importance. It is noteworthy that scalable and parallel approaches for the n-queen problem remain to be developed. The majority of existing methods working on graphs attempt to parallelize a recursive sequential algorithm. However, the unpredictable nature of these algorithms makes it challenging to parallelize them on modern computer architectures. Consequently, we have selected an iterative algorithm from the literature in order to facilitate parallelization. This paper presents an innovative approach to parallelization that differs from traditional matrix-based strategies. The n-queen graph is distributed among a network of nodes, ensuring effective load balancing through dynamic partitioning and real-time computation. Our bespoke distributed algorithm, designed for the maximum clique problem on the n-queen graph, operates with true concurrency, thus obviating the necessity for resource or data sharing. The results of our assessment demonstrate that the parallel algorithm outperforms a cutting-edge sequential algorithm in terms of task completion time. The findings demonstrate that the speedups are almost perfect and that the workloads are distributed evenly across the network nodes. Furthermore, the results demonstrate high scalability, with task completion times decreasing as the number of nodes increases. |
| ArticleNumber | 124677 |
| Author | Bouneb, Zine El Abidine |
| Author_xml | – sequence: 1 givenname: Zine El Abidine orcidid: 0000-0001-6281-3515 surname: Bouneb fullname: Bouneb, Zine El Abidine email: bouneb.zineabidine@univ-oeb.dz organization: Oum el Bouaghi University, Algeria |
| BookMark | eNp9j8tOwzAURL0oEm3hB1j5BxJ8nYdjiQ0qjyJVYgNry7FvqKs0LrYD4u9pFNasZjE6ozkrshj8gITcAMuBQX17yDF-65wzXubAy1qIBVkyWYmsBFFeklWMB8ZAMCaWZPvgYgquHRNaqvsPH1zaH2nnAz3poPsee2r88TQmnZwfqO9o2iMd6OeIOEQafT9ORbwiF53uI17_5Zq8Pz2-bbbZ7vX5ZXO_ywyvIGVCAtjWmLJCDaIBrQWTHKVoWq5NUTZVUcvGdBLBYi0tVtw2QmKtjRWWQbEmfN41wccYsFOn4I46_ChgavJXBzX5q8lfzf5n6G6G8Pzsy2FQ0TgcDFoX0CRlvfsP_wXpoGk0 |
| Cites_doi | 10.1613/jair.5512 10.1002/cpe.8004 10.1007/BF01782776 10.1145/3571808 10.1016/j.parco.2021.102769 10.1080/09728600.2022.2148589 10.1371/journal.pone.0288457 10.1109/TSC.2015.2479225 10.1145/3380936 10.1007/s11227-023-05492-w |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier Ltd |
| Copyright_xml | – notice: 2024 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.eswa.2024.124677 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_eswa_2024_124677 S0957417424015446 |
| GroupedDBID | --K --M .DC .~1 0R~ 13V 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABBOA ABFNM ABMAC ABMVD ABUCO ACDAQ ACGFS ACHRH ACNTT ACRLP ACZNC ADBBV ADEZE ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGUMN AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJOXV AKRWK ALEQD ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM AXJTR BJAXD BKOJK BLXMC BNSAS CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSL SST SSV SSZ T5K TN5 ~G- 29G 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABJNI ABKBG ABUFD ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FEDTE FGOYB G-2 HLZ HVGLF HZ~ LG9 LY1 LY7 R2- SBC SET WUQ XPP ZMT ~HD |
| ID | FETCH-LOGICAL-c251t-7911dbcc45ea1781aa7092e978b2ac34853698cf9e1de69de52d879e6acd7d013 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001271887600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0957-4174 |
| IngestDate | Sat Nov 29 03:07:40 EST 2025 Sat Aug 31 16:00:37 EDT 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Graph partitioning Maximum cliques Refinement Scalability Load balancing n queens |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c251t-7911dbcc45ea1781aa7092e978b2ac34853698cf9e1de69de52d879e6acd7d013 |
| ORCID | 0000-0001-6281-3515 |
| ParticipantIDs | crossref_primary_10_1016_j_eswa_2024_124677 elsevier_sciencedirect_doi_10_1016_j_eswa_2024_124677 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-12-01 2024-12-00 |
| PublicationDateYYYYMMDD | 2024-12-01 |
| PublicationDate_xml | – month: 12 year: 2024 text: 2024-12-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Expert systems with applications |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Wu, Hou (b16) 2023; 20 Pantekis, James, Kullmann, O’Reilly (b13) 2024 Bouneb (b5) 2024 Sagharichian, Alipour Langouri (b14) 2023; 79 Aboulnaga, Xiang, Guo (b1) 2013 Mattern (b11) 1987; 2 Gent, Jefferson, Nightingale (b9) 2017; 59 Bouneb (b4) 2023; 35 Acer, Boman, Glusa, Rajamanickam (b2) 2021; 106 Xu, Cheng, Fu (b17) 2016; 9 Çatalyürek, Devine, Faraj, Gottesbüren, Heuer, Meyerhenke (b6) 2023; 55 Kneser (b10) 1955; 58 Garg, Chauhan Gonder, Singh (b8) 2022 Sanders, Seemaier (b15) 2023 Maurya, Ravindran (b12) 2023; 18 Das, Sanei-Mehri, Tirthapura (b7) 2020; 7 Bouneb (b3) 2023; 26 Garg (10.1016/j.eswa.2024.124677_b8) 2022 Çatalyürek (10.1016/j.eswa.2024.124677_b6) 2023; 55 Bouneb (10.1016/j.eswa.2024.124677_b3) 2023; 26 Maurya (10.1016/j.eswa.2024.124677_b12) 2023; 18 Bouneb (10.1016/j.eswa.2024.124677_b5) 2024 Aboulnaga (10.1016/j.eswa.2024.124677_b1) 2013 Bouneb (10.1016/j.eswa.2024.124677_b4) 2023; 35 Sagharichian (10.1016/j.eswa.2024.124677_b14) 2023; 79 Xu (10.1016/j.eswa.2024.124677_b17) 2016; 9 Das (10.1016/j.eswa.2024.124677_b7) 2020; 7 Kneser (10.1016/j.eswa.2024.124677_b10) 1955; 58 Pantekis (10.1016/j.eswa.2024.124677_b13) 2024 Acer (10.1016/j.eswa.2024.124677_b2) 2021; 106 Gent (10.1016/j.eswa.2024.124677_b9) 2017; 59 Mattern (10.1016/j.eswa.2024.124677_b11) 1987; 2 Sanders (10.1016/j.eswa.2024.124677_b15) 2023 Wu (10.1016/j.eswa.2024.124677_b16) 2023; 20 |
| References_xml | – volume: 55 year: 2023 ident: b6 article-title: More recent advances in (hyper)graph partitioning publication-title: ACM Computing Surveys – start-page: 91 year: 2022 end-page: 99 ident: b8 article-title: Hybrid crossover operator in genetic algorithm for solving N-queens problem publication-title: Soft computing: theories and applications – volume: 59 start-page: 815 year: 2017 end-page: 848 ident: b9 article-title: Complexity of N-queens completion publication-title: Journal of Artificial Intelligence Research – volume: 9 start-page: 110 year: 2016 end-page: 122 ident: b17 article-title: Distributed maximal clique computation and management publication-title: IEEE Transactions on Services Computing – volume: 35 start-page: 1 year: 2023 end-page: 7 ident: b4 article-title: An incremental approach to the n-queen problem with polynomial time publication-title: Journal of King Saud University: Computer and Information Sciences – year: 2024 ident: b5 article-title: Distributed n queen project – volume: 58 start-page: 27 year: 1955 ident: b10 article-title: Aufgabe 360 publication-title: Jahresbericht der Deutschen Mathematiker-Vereinigung – start-page: 443 year: 2023 end-page: 457 ident: b15 article-title: Distributed deep multilevel graph partitioning publication-title: Euro-par 2023: parallel processing – year: 2024 ident: b13 article-title: Optimized massively parallel solving of N-queens on GPGPUs publication-title: Concurrency Computations: Practice and Experience – volume: 2 start-page: 161 year: 1987 end-page: 175 ident: b11 article-title: Algorithms for distributed termination detection publication-title: Distributed Computing – start-page: 74 year: 2013 end-page: 85 ident: b1 article-title: Scalable maximum clique computation using MapReduce publication-title: Proceedings of the 2013 IEEE international conference on data engineering – volume: 26 start-page: 1 year: 2023 end-page: 11 ident: b3 article-title: An efficient algorithm for maximum cliques problem on IoT devices publication-title: International Journal of Computer Sciences and Engineering – volume: 79 start-page: 21116 year: 2023 end-page: 21143 ident: b14 article-title: Ipartition: A distributed partitioning algorithm for block-centric graph processing systems publication-title: Journal of Supercomputing – volume: 106 year: 2021 ident: b2 article-title: Sphynx: A parallel multi-GPU graph partitioner for distributed-memory systems publication-title: Parallel Computing – volume: 20 start-page: 9 year: 2023 end-page: 19 ident: b16 article-title: Graph partitioning: An updated survey publication-title: AKCE International Journal of Graphs and Combinatorics – volume: 7 year: 2020 ident: b7 article-title: Shared-memory parallel maximal clique enumeration from static and dynamic graphs publication-title: ACM Transactions on Parallel Computing – volume: 18 year: 2023 ident: b12 article-title: Hypergraph partitioning using tensor eigenvalue decomposition publication-title: PLoS One – volume: 26 start-page: 1 issue: 1 year: 2023 ident: 10.1016/j.eswa.2024.124677_b3 article-title: An efficient algorithm for maximum cliques problem on IoT devices publication-title: International Journal of Computer Sciences and Engineering – volume: 59 start-page: 815 issue: 1 year: 2017 ident: 10.1016/j.eswa.2024.124677_b9 article-title: Complexity of N-queens completion publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.5512 – year: 2024 ident: 10.1016/j.eswa.2024.124677_b5 – year: 2024 ident: 10.1016/j.eswa.2024.124677_b13 article-title: Optimized massively parallel solving of N-queens on GPGPUs publication-title: Concurrency Computations: Practice and Experience doi: 10.1002/cpe.8004 – volume: 2 start-page: 161 year: 1987 ident: 10.1016/j.eswa.2024.124677_b11 article-title: Algorithms for distributed termination detection publication-title: Distributed Computing doi: 10.1007/BF01782776 – start-page: 91 year: 2022 ident: 10.1016/j.eswa.2024.124677_b8 article-title: Hybrid crossover operator in genetic algorithm for solving N-queens problem – volume: 58 start-page: 27 issue: 2 year: 1955 ident: 10.1016/j.eswa.2024.124677_b10 article-title: Aufgabe 360 publication-title: Jahresbericht der Deutschen Mathematiker-Vereinigung – volume: 55 issue: 12 year: 2023 ident: 10.1016/j.eswa.2024.124677_b6 article-title: More recent advances in (hyper)graph partitioning publication-title: ACM Computing Surveys doi: 10.1145/3571808 – volume: 106 year: 2021 ident: 10.1016/j.eswa.2024.124677_b2 article-title: Sphynx: A parallel multi-GPU graph partitioner for distributed-memory systems publication-title: Parallel Computing doi: 10.1016/j.parco.2021.102769 – volume: 35 start-page: 1 issue: 3 year: 2023 ident: 10.1016/j.eswa.2024.124677_b4 article-title: An incremental approach to the n-queen problem with polynomial time publication-title: Journal of King Saud University: Computer and Information Sciences – start-page: 443 year: 2023 ident: 10.1016/j.eswa.2024.124677_b15 article-title: Distributed deep multilevel graph partitioning – volume: 20 start-page: 9 issue: 1 year: 2023 ident: 10.1016/j.eswa.2024.124677_b16 article-title: Graph partitioning: An updated survey publication-title: AKCE International Journal of Graphs and Combinatorics doi: 10.1080/09728600.2022.2148589 – volume: 18 year: 2023 ident: 10.1016/j.eswa.2024.124677_b12 article-title: Hypergraph partitioning using tensor eigenvalue decomposition publication-title: PLoS One doi: 10.1371/journal.pone.0288457 – volume: 9 start-page: 110 issue: 1 year: 2016 ident: 10.1016/j.eswa.2024.124677_b17 article-title: Distributed maximal clique computation and management publication-title: IEEE Transactions on Services Computing doi: 10.1109/TSC.2015.2479225 – volume: 7 issue: 1 year: 2020 ident: 10.1016/j.eswa.2024.124677_b7 article-title: Shared-memory parallel maximal clique enumeration from static and dynamic graphs publication-title: ACM Transactions on Parallel Computing doi: 10.1145/3380936 – start-page: 74 year: 2013 ident: 10.1016/j.eswa.2024.124677_b1 article-title: Scalable maximum clique computation using MapReduce – volume: 79 start-page: 21116 issue: 18 year: 2023 ident: 10.1016/j.eswa.2024.124677_b14 article-title: Ipartition: A distributed partitioning algorithm for block-centric graph processing systems publication-title: Journal of Supercomputing doi: 10.1007/s11227-023-05492-w |
| SSID | ssj0017007 |
| Score | 2.455704 |
| Snippet | The n-queen problem represents a classic challenge in artificial intelligence (AI) research. It involves the placement of n queens on an n x n chessboard, with... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 124677 |
| SubjectTerms | Graph partitioning Load balancing Maximum cliques n queens Refinement Scalability |
| Title | Distributed algorithm for parallel computation of the n queens solutions |
| URI | https://dx.doi.org/10.1016/j.eswa.2024.124677 |
| Volume | 255 |
| WOSCitedRecordID | wos001271887600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0957-4174 databaseCode: AIEXJ dateStart: 19950101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0017007 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8QwEA66evDiW3yTg7elsu2mTXMUXVEPIqiweCnZJPXB2l3c-vj5zjRJXR-ICl5KCSQN86XhS2bmG0J2VKxSpnLMWMaUnNjoIDVCB6rVZirMlYpjVRWb4KenabcrzlxtvlFVToAXRfryIob_CjW0AdiYOvsLuOtBoQHeAXR4Auzw_BHwByiFi1WsgErK_vUATv8391U0Icp89_umX8WRP5Y1WUTuWTTtkbZZT-7dnT0KIpdO9tknxI25vutDPewdpvLwXCF77QD8vVvtXffuciFiHwI16qyXtxAje3XIAxba6jp-F42s2u6nHdleDtztmtEzyjxFbBcYReJKt7xXuj7HgXFcYBkoEpRMkqmIxyJtkKm94073pHYP8ZbNg_cTcdlQNnDv45e-ZhxjLOJinsw6-k_3LGwLZMIUi2TOl9agbqddIkdjKNIaRQooUo8iHUORDnIKKNKCWhRpjeIyuTzsXOwfBa7oRaCAapYoHxrqnlLw28iQp6GUvCUiA4f9XiRVmwG9SkSqcmFCbRKhTRzplAuTSKW5BkK_QhrFoDCrhDItNcrzGfSe5gaGkig-lMgeV4yZ9hppesNkQ6ttkvmgv7sMzZihGTNrxjUSe9tljp1Z1pUB1N_0W_9jvw0y87YiN0mjfHg0W2RaPZW3o4dttyJeAdOPYkU |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Distributed+algorithm+for+parallel+computation+of+the+n+queens+solutions&rft.jtitle=Expert+systems+with+applications&rft.au=Bouneb%2C+Zine+El+Abidine&rft.date=2024-12-01&rft.pub=Elsevier+Ltd&rft.issn=0957-4174&rft.volume=255&rft_id=info:doi/10.1016%2Fj.eswa.2024.124677&rft.externalDocID=S0957417424015446 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0957-4174&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0957-4174&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0957-4174&client=summon |