An adaptive hierarchical master–worker (AHMW) framework for grids—Application to B&B algorithms
Well-suited to embarrassingly parallel applications, the master–worker (MW) paradigm has largely and successfully used in parallel distributed computing. Nevertheless, such a paradigm is very limited in scalability in large computational grids. A natural way to improve the scalability is to add a la...
Gespeichert in:
| Veröffentlicht in: | Journal of parallel and distributed computing Jg. 72; H. 2; S. 120 - 131 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.02.2012
|
| Schlagworte: | |
| ISSN: | 0743-7315, 1096-0848 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Well-suited to embarrassingly parallel applications, the master–worker (MW) paradigm has largely and successfully used in parallel distributed computing. Nevertheless, such a paradigm is very limited in scalability in large computational grids. A natural way to improve the scalability is to add a layer of masters between the master and the workers making a hierarchical MW (HMW). In most existing HMW frameworks and algorithms, only a single layer of masters is used, the hierarchy is statically built and the granularity of tasks is fixed. Such frameworks and algorithms are not adapted to grids which are volatile, heterogeneous and large scale environments. In this paper, we revisit the HMW paradigm to match such characteristics of grids. We propose a new dynamic adaptive multi-layer hierarchical MW (
AHMW) dealing with the scalability, volatility and heterogeneity issues. The construction and deployment of the hierarchy and the task management (deployment, decomposition of work, distribution of tasks,
…
) are performed in a dynamic collaborative distributed way. The framework has been applied to the parallel Branch and Bound algorithm and experimented on the Flow-Shop scheduling problem. The implementation has been performed using the ProActive grid middleware and the large experiments have been conducted using about 2000 processors from the Grid’5000 French nation-wide grid infrastructure. The results demonstrate the high scalability of the proposed approach and its efficiency in terms of deployment cost, decomposition and distribution of work and exploration time. The results show that AHMW outperforms HMW and MW in scalability and efficiency in terms of deployment and exploration time.
► The hierarchical master–worker (HMW) paradigm is rethought to make it efficiently exploitable in large scale grids. ► HMW is built and deployed in a dynamic adaptive way to take into account the volatility of resources. ► The task management, including task decomposition and distribution, for MHW-based applications is dynamic and distributed. |
|---|---|
| AbstractList | Well-suited to embarrassingly parallel applications, the master–worker (MW) paradigm has largely and successfully used in parallel distributed computing. Nevertheless, such a paradigm is very limited in scalability in large computational grids. A natural way to improve the scalability is to add a layer of masters between the master and the workers making a hierarchical MW (HMW). In most existing HMW frameworks and algorithms, only a single layer of masters is used, the hierarchy is statically built and the granularity of tasks is fixed. Such frameworks and algorithms are not adapted to grids which are volatile, heterogeneous and large scale environments. In this paper, we revisit the HMW paradigm to match such characteristics of grids. We propose a new dynamic adaptive multi-layer hierarchical MW (
AHMW) dealing with the scalability, volatility and heterogeneity issues. The construction and deployment of the hierarchy and the task management (deployment, decomposition of work, distribution of tasks,
…
) are performed in a dynamic collaborative distributed way. The framework has been applied to the parallel Branch and Bound algorithm and experimented on the Flow-Shop scheduling problem. The implementation has been performed using the ProActive grid middleware and the large experiments have been conducted using about 2000 processors from the Grid’5000 French nation-wide grid infrastructure. The results demonstrate the high scalability of the proposed approach and its efficiency in terms of deployment cost, decomposition and distribution of work and exploration time. The results show that AHMW outperforms HMW and MW in scalability and efficiency in terms of deployment and exploration time.
► The hierarchical master–worker (HMW) paradigm is rethought to make it efficiently exploitable in large scale grids. ► HMW is built and deployed in a dynamic adaptive way to take into account the volatility of resources. ► The task management, including task decomposition and distribution, for MHW-based applications is dynamic and distributed. Well-suited to embarrassingly parallel applications, the master-worker (MW) paradigm has largely and successfully used in parallel distributed computing. Nevertheless, such a paradigm is very limited in scalability in large computational grids. A natural way to improve the scalability is to add a layer of masters between the master and the workers making a hierarchical MW (HMW). In most existing HMW frameworks and algorithms, only a single layer of masters is used, the hierarchy is statically built and the granularity of tasks is fixed. Such frameworks and algorithms are not adapted to grids which are volatile, heterogeneous and large scale environments. In this paper, we revisit the HMW paradigm to match such characteristics of grids. We propose a new dynamic adaptive multi-layer hierarchical MW (AHMW) dealing with the scalability, volatility and heterogeneity issues. The construction and deployment of the hierarchy and the task management (deployment, decomposition of work, distribution of tasks, ... ) are performed in a dynamic collaborative distributed way. The framework has been applied to the parallel Branch and Bound algorithm and experimented on the Flow-Shop scheduling problem. The implementation has been performed using the ProActive grid middleware and the large experiments have been conducted using about 2000 processors from the Grid'5000 French nation-wide grid infrastructure. The results demonstrate the high scalability of the proposed approach and its efficiency in terms of deployment cost, decomposition and distribution of work and exploration time. The results show that AHMW outperforms HMW and MW in scalability and efficiency in terms of deployment and exploration time. |
| Author | Bendjoudi, A. Melab, N. Talbi, E-G. |
| Author_xml | – sequence: 1 givenname: A. surname: Bendjoudi fullname: Bendjoudi, A. email: ahcene.bendjoudi@gmail.com organization: Centre de Recherche sur l’Information Scientifique et Technique CERIST, DTISI, 3 rue des frères Aissou, 16030 Ben-Aknoun, Algiers, Algeria – sequence: 2 givenname: N. surname: Melab fullname: Melab, N. email: Nouredine.melab@lifl.fr organization: Université Lille1, LIFL/UMR CNRS 8022, 59655 - Villeneuve d’Ascq cedex, France – sequence: 3 givenname: E-G. surname: Talbi fullname: Talbi, E-G. email: el-ghazali.talbi@lifl.fr organization: Université Lille1, LIFL/UMR CNRS 8022, 59655 - Villeneuve d’Ascq cedex, France |
| BookMark | eNp9kMFO4zAURS0EEi3wA6y8GsEixY6TOJVm06IZGAnEBsTSenGeqTtJHGxTNLv-w_CFfMkkdFYsWD3p6p4n3TMl-53rkJBTzmac8eJiPVv3tZ6ljPMhmDGW7pEJZ_MiYWVW7pMJk5lIpOD5IZmGsGZDMZflhOhFR6GGPtoN0pVFD16vrIaGthAi-vft31fnf6OnZ4vr28dzajy0OEbUOE-fvK3D-_Zt0ffNQEXrOhodXX5bUmienLdx1YZjcmCgCXjy_x6Rh58_7i-vk5u7q1-Xi5tEp4WIicwNiKpGNHlZCZijBm2MlGWq51zIrMpkVhsGRQGmlHOOHHSFQtdSiAqxEkfkbPe39-75BUNUrQ0amwY6dC9B8ULyLOd5lg3VdFfV3oXg0aje2xb8H8WZGo2qtRqNqtHomA1GB6j8BGkbPzZHD7b5Gv2-Q3HYvxk0q6Atdhpr61FHVTv7Ff4PaGaXXg |
| CitedBy_id | crossref_primary_10_1287_ijoc_2017_0762 crossref_primary_10_1002_cpe_3276 crossref_primary_10_1109_TNSE_2021_3086332 crossref_primary_10_1016_j_future_2015_10_009 crossref_primary_10_1109_TC_2013_40 |
| Cites_doi | 10.1016/0167-739X(95)00036-R 10.1109/IPDPS.2007.370217 10.1016/0377-2217(93)90182-M 10.1109/HPCC.2009.35 10.1287/opre.42.6.1042 10.1109/MC.1986.1663305 10.1109/CCGRID.2003.1199364 10.1504/IJGUC.2009.022031 10.12921/cmst.2006.12.01.69-77 10.1145/581571.581573 10.2172/771506 10.1287/opre.26.1.53 |
| ContentType | Journal Article |
| Copyright | 2011 Elsevier Inc. |
| Copyright_xml | – notice: 2011 Elsevier Inc. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.jpdc.2011.10.002 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| EndPage | 131 |
| ExternalDocumentID | 10_1016_j_jpdc_2011_10_002 S0743731511001912 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c263t-75fa3bdeef58b3a9ecacff7782c91374b474df0a66af8791e1acbe3cd733beeb3 |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000299139000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Sat Sep 27 23:52:52 EDT 2025 Sat Nov 29 07:15:24 EST 2025 Tue Nov 18 21:56:38 EST 2025 Fri Feb 23 02:27:54 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Grid computing Hierarchical master–worker Large scale experiments Branch and bound Master–worker |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c263t-75fa3bdeef58b3a9ecacff7782c91374b474df0a66af8791e1acbe3cd733beeb3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1671451544 |
| PQPubID | 23500 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_1671451544 crossref_primary_10_1016_j_jpdc_2011_10_002 crossref_citationtrail_10_1016_j_jpdc_2011_10_002 elsevier_sciencedirect_doi_10_1016_j_jpdc_2011_10_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-02-01 |
| PublicationDateYYYYMMDD | 2012-02-01 |
| PublicationDate_xml | – month: 02 year: 2012 text: 2012-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2012 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Condor, 1993. Grid’5000. Taillard (br000135) 1993; 64 OAR. Baduel, Baude, Caromel, Contes, Huet, Morel, Quilici (br000030) 2006 Baude, Caromel, Morel (br000035) 2003 Renater. J. Eckstein, C.A. Phillips, W.E. Hart, PICO: an object-oriented framework for parallel branch and bound, Technical Report, Rutgers University, Piscataway, NJ, 2000. Anderson, Cobb, Corpela, Lepofsky, Werthimer (br000020) 2002; 45 Berthold, Dieterle, Loogen, Priebe (br000045) 2008; vol. 4902 Ghasemi-Gol, Sabzekar, Deldari, Bahmani (br000085) 2009; 1 Z. Dai, F. Viale, X. Chi, D. Caromel, Z. Lu, A task-based fault-tolerance mechanism to hierarchical master/worker with divisible tasks, in: High Performance Computing and Communications, 10th IEEE International Conference on, vol. 0, 2009, pp. 672–677. ProActive. Garey, Johnson (br000075) 1979 Anderson, Cobb, Korpela, Lebofsky, Werthimer (br000025) 2002; 45 K. Aida, W. Natsume, Y. Futakata, Distributed computing with hierarchical master–worker paradigm for parallel branch and bound algorithm, in: Cluster Computing and the Grid, IEEE International Symposium on, vol. 0, 2003, p. 156. A. di Costanzo, L. Baduel, D. Caromel, S. Matsuoka, Grid’BnB: a parallel branch and bound framework for grids, in: Proceedings of the 13th International Conference on High Performance Computing, Goa, India, December 2007. Pruyne, Livny (br000125) 1996; 12 Mezmaz, Melab, Talbi (br000105) 2007 Aida, Futakata, Osumi (br000010) 2006; 47 Lenstra, Lageweg, Kan (br000100) 1978; 26 Caromel, Delbé, di Costanzo, Leyton (br000050) 2006; 12 . J.-P. Goux, J. Linderoth, M. Yoder, Metacomputing and the master–worker paradigm, Preprint MCS/ANL-P792-0200, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, 2000. M. Mezmaz, N. Melab, E-G. Talbi, A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems, in: Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symposium, Long Beach, California, March 26th–30th 2007. Bendjoudi, Melab, Talbi (br000040) 2009; 1 Gendron, Crainic (br000080) 1994; 42 Ahuja, Nicholas, David (br000005) 1986; 19 10.1016/j.jpdc.2011.10.002_br000090 Ghasemi-Gol (10.1016/j.jpdc.2011.10.002_br000085) 2009; 1 10.1016/j.jpdc.2011.10.002_br000070 Lenstra (10.1016/j.jpdc.2011.10.002_br000100) 1978; 26 Baduel (10.1016/j.jpdc.2011.10.002_br000030) 2006 Berthold (10.1016/j.jpdc.2011.10.002_br000045) 2008; vol. 4902 Ahuja (10.1016/j.jpdc.2011.10.002_br000005) 1986; 19 Garey (10.1016/j.jpdc.2011.10.002_br000075) 1979 Aida (10.1016/j.jpdc.2011.10.002_br000010) 2006; 47 Baude (10.1016/j.jpdc.2011.10.002_br000035) 2003 Taillard (10.1016/j.jpdc.2011.10.002_br000135) 1993; 64 Caromel (10.1016/j.jpdc.2011.10.002_br000050) 2006; 12 10.1016/j.jpdc.2011.10.002_br000065 10.1016/j.jpdc.2011.10.002_br000120 Pruyne (10.1016/j.jpdc.2011.10.002_br000125) 1996; 12 Bendjoudi (10.1016/j.jpdc.2011.10.002_br000040) 2009; 1 10.1016/j.jpdc.2011.10.002_br000060 Anderson (10.1016/j.jpdc.2011.10.002_br000025) 2002; 45 Mezmaz (10.1016/j.jpdc.2011.10.002_br000105) 2007 Gendron (10.1016/j.jpdc.2011.10.002_br000080) 1994; 42 10.1016/j.jpdc.2011.10.002_br000015 10.1016/j.jpdc.2011.10.002_br000115 Anderson (10.1016/j.jpdc.2011.10.002_br000020) 2002; 45 10.1016/j.jpdc.2011.10.002_br000055 10.1016/j.jpdc.2011.10.002_br000110 10.1016/j.jpdc.2011.10.002_br000095 10.1016/j.jpdc.2011.10.002_br000130 |
| References_xml | – volume: 45 start-page: 56 year: 2002 end-page: 61 ident: br000025 article-title: SETI@home: an experiment in public-resource computing publication-title: Communications of the ACM – start-page: 1226 year: 2003 end-page: 1242 ident: br000035 article-title: From distributed objects to hierarchical grid components publication-title: International Symposium on Distributed Objects and Applications – volume: 1 start-page: 159 year: 2009 end-page: 168 ident: br000040 article-title: P2P design and implementation of a parallel branch and bound algorithm for grids publication-title: International Journal of Grid and Utility Computing – volume: 45 start-page: 56 year: 2002 end-page: 61 ident: br000020 article-title: SETI@Home: an experiment in public-resource computing publication-title: Communications of the ACM – reference: Z. Dai, F. Viale, X. Chi, D. Caromel, Z. Lu, A task-based fault-tolerance mechanism to hierarchical master/worker with divisible tasks, in: High Performance Computing and Communications, 10th IEEE International Conference on, vol. 0, 2009, pp. 672–677. – volume: 47 start-page: 193 year: 2006 end-page: 206 ident: br000010 article-title: Parallel branch and bound algorithm with the hierarchical master–worker paradigm on the grid (grid) publication-title: IPSJ Transactions on High Performance Computing Systems – reference: ProActive. – volume: 19 start-page: 26 year: 1986 end-page: 34 ident: br000005 article-title: Linda and friends publication-title: Computer – volume: 12 start-page: 56 year: 1996 end-page: 61 ident: br000125 article-title: Interfacing Condor and PVM to haress the cycles of workstation clusters publication-title: Journal on Future Generation Computer Systems – reference: K. Aida, W. Natsume, Y. Futakata, Distributed computing with hierarchical master–worker paradigm for parallel branch and bound algorithm, in: Cluster Computing and the Grid, IEEE International Symposium on, vol. 0, 2003, p. 156. – volume: 64 start-page: 278 year: 1993 end-page: 285 ident: br000135 article-title: Benchmarks for basic scheduling problems publication-title: European Journal of Operational Research – reference: Grid’5000. – reference: Renater. – reference: A. di Costanzo, L. Baduel, D. Caromel, S. Matsuoka, Grid’BnB: a parallel branch and bound framework for grids, in: Proceedings of the 13th International Conference on High Performance Computing, Goa, India, December 2007. – volume: 12 start-page: 69 year: 2006 end-page: 77 ident: br000050 article-title: ProActive: an integrated platform for programming and running applications on grids and P2P systems publication-title: Computational Methods in Science and Technology – reference: Condor, 1993. – volume: 1 start-page: 1793 year: 2009 end-page: 8201 ident: br000085 article-title: A linda-based hierarchical master–worker model publication-title: International Journal of Computational Engineering Science – year: 2007 ident: br000105 article-title: A Grid-based parallel approach of the multi-objective branch and bound publication-title: Fifteen Euromicro Conference on Parallel, Distributed and Network-Based Processing – reference: J. Eckstein, C.A. Phillips, W.E. Hart, PICO: an object-oriented framework for parallel branch and bound, Technical Report, Rutgers University, Piscataway, NJ, 2000. – volume: 26 start-page: 53 year: 1978 end-page: 67 ident: br000100 article-title: A general boundind scheme for the permutation flow-shop problem publication-title: Operations Research – reference: J.-P. Goux, J. Linderoth, M. Yoder, Metacomputing and the master–worker paradigm, Preprint MCS/ANL-P792-0200, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, 2000. – year: 2006 ident: br000030 article-title: Programming, composing, deploying for the grid publication-title: Grid Computing: Software Environments and Tools – year: 1979 ident: br000075 article-title: Computers and Intractability: A Guide to the Theory of NP-Commpleteness – reference: OAR. – volume: 42 start-page: 1042 year: 1994 end-page: 1066 ident: br000080 article-title: Parallel branch-and-bound algorithms: survey and synthesis publication-title: Operations Research – reference: M. Mezmaz, N. Melab, E-G. Talbi, A grid-enabled branch and bound algorithm for solving challenging combinatorial optimization problems, in: Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symposium, Long Beach, California, March 26th–30th 2007. – volume: vol. 4902 start-page: 248 year: 2008 end-page: 264 ident: br000045 article-title: Hierarchical master–worker skeletons publication-title: LNCS – reference: . – volume: 12 start-page: 56 year: 1996 ident: 10.1016/j.jpdc.2011.10.002_br000125 article-title: Interfacing Condor and PVM to haress the cycles of workstation clusters publication-title: Journal on Future Generation Computer Systems doi: 10.1016/0167-739X(95)00036-R – ident: 10.1016/j.jpdc.2011.10.002_br000120 – ident: 10.1016/j.jpdc.2011.10.002_br000110 doi: 10.1109/IPDPS.2007.370217 – volume: vol. 4902 start-page: 248 year: 2008 ident: 10.1016/j.jpdc.2011.10.002_br000045 article-title: Hierarchical master–worker skeletons – ident: 10.1016/j.jpdc.2011.10.002_br000065 – volume: 64 start-page: 278 year: 1993 ident: 10.1016/j.jpdc.2011.10.002_br000135 article-title: Benchmarks for basic scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90182-M – ident: 10.1016/j.jpdc.2011.10.002_br000060 doi: 10.1109/HPCC.2009.35 – year: 1979 ident: 10.1016/j.jpdc.2011.10.002_br000075 – volume: 42 start-page: 1042 issue: 06 year: 1994 ident: 10.1016/j.jpdc.2011.10.002_br000080 article-title: Parallel branch-and-bound algorithms: survey and synthesis publication-title: Operations Research doi: 10.1287/opre.42.6.1042 – ident: 10.1016/j.jpdc.2011.10.002_br000095 – volume: 19 start-page: 26 issue: 8 year: 1986 ident: 10.1016/j.jpdc.2011.10.002_br000005 article-title: Linda and friends publication-title: Computer doi: 10.1109/MC.1986.1663305 – ident: 10.1016/j.jpdc.2011.10.002_br000015 doi: 10.1109/CCGRID.2003.1199364 – ident: 10.1016/j.jpdc.2011.10.002_br000055 – volume: 1 start-page: 159 issue: 2 year: 2009 ident: 10.1016/j.jpdc.2011.10.002_br000040 article-title: P2P design and implementation of a parallel branch and bound algorithm for grids publication-title: International Journal of Grid and Utility Computing doi: 10.1504/IJGUC.2009.022031 – year: 2007 ident: 10.1016/j.jpdc.2011.10.002_br000105 article-title: A Grid-based parallel approach of the multi-objective branch and bound – year: 2006 ident: 10.1016/j.jpdc.2011.10.002_br000030 article-title: Programming, composing, deploying for the grid – volume: 12 start-page: 69 issue: 1 year: 2006 ident: 10.1016/j.jpdc.2011.10.002_br000050 article-title: ProActive: an integrated platform for programming and running applications on grids and P2P systems publication-title: Computational Methods in Science and Technology doi: 10.12921/cmst.2006.12.01.69-77 – ident: 10.1016/j.jpdc.2011.10.002_br000115 – start-page: 1226 year: 2003 ident: 10.1016/j.jpdc.2011.10.002_br000035 article-title: From distributed objects to hierarchical grid components – volume: 45 start-page: 56 issue: 11 year: 2002 ident: 10.1016/j.jpdc.2011.10.002_br000020 article-title: SETI@Home: an experiment in public-resource computing publication-title: Communications of the ACM doi: 10.1145/581571.581573 – ident: 10.1016/j.jpdc.2011.10.002_br000070 doi: 10.2172/771506 – volume: 26 start-page: 53 issue: 1 year: 1978 ident: 10.1016/j.jpdc.2011.10.002_br000100 article-title: A general boundind scheme for the permutation flow-shop problem publication-title: Operations Research doi: 10.1287/opre.26.1.53 – ident: 10.1016/j.jpdc.2011.10.002_br000130 – ident: 10.1016/j.jpdc.2011.10.002_br000090 – volume: 47 start-page: 193 issue: 12 year: 2006 ident: 10.1016/j.jpdc.2011.10.002_br000010 article-title: Parallel branch and bound algorithm with the hierarchical master–worker paradigm on the grid (grid) publication-title: IPSJ Transactions on High Performance Computing Systems – volume: 1 start-page: 1793 issue: 5 year: 2009 ident: 10.1016/j.jpdc.2011.10.002_br000085 article-title: A linda-based hierarchical master–worker model publication-title: International Journal of Computational Engineering Science – volume: 45 start-page: 56 issue: 11 year: 2002 ident: 10.1016/j.jpdc.2011.10.002_br000025 article-title: SETI@home: an experiment in public-resource computing publication-title: Communications of the ACM doi: 10.1145/581571.581573 |
| SSID | ssj0011578 |
| Score | 1.9999858 |
| Snippet | Well-suited to embarrassingly parallel applications, the master–worker (MW) paradigm has largely and successfully used in parallel distributed computing.... Well-suited to embarrassingly parallel applications, the master-worker (MW) paradigm has largely and successfully used in parallel distributed computing.... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 120 |
| SubjectTerms | Algorithms Branch and bound Computer networks Decomposition Distributed processing Dynamics Exploration Grid computing Hierarchical master–worker Hierarchies Large scale experiments Master–worker Tasks |
| Title | An adaptive hierarchical master–worker (AHMW) framework for grids—Application to B&B algorithms |
| URI | https://dx.doi.org/10.1016/j.jpdc.2011.10.002 https://www.proquest.com/docview/1671451544 |
| Volume | 72 |
| WOSCitedRecordID | wos000299139000003&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 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLaqjQMXxk8xBshICIGqVE2cxMkxRYWBYOIwRG-RYztbq5BGbTrtuP8B7vxv-0t4tuMk6rSJHbhEVWRbSb-v773a33sPoddUjjORcddhPqeOT3LpZKGInBBiXQH-KoykRvoLPTqKZrP422Dwx-bCnBW0LKPz87j6r1DDPQBbpc7eAu52UbgBnwF0uALscP0n4JNyyASrtCRINbrWRwUKiZ9Md-Fo1A1EKbJUHQkvSg6__lC7A7kVamnt4clqLtZ2tJ90B90qXJ0AYyZDVpwsV_P6tKl4fjXGVYXFi0KacgRC1ehV7bWkzqSrNrV1mzpPqBTwekKLC5JRywMJLDUZYd0eQ5HpUVPn46i_aaHUH60AxNg2VRmVEpPJaQ0x9XqE83pW1fXGPQftGrdxxfabbYjFaFEJbmqzatme13k6e7q_5QBbWaJVvC1StUaq1oAbqS5WuuvRIAbLv5t8ms4-twdVbmCcvX2fJi_LSAi3n-S62GcrCtChzfF9dK_BCyeGSw_QQJYP0Z7t94Eb8_8I8aTEllq4Ty1sqHV58cuQCr9VlHqHW0JhIBTWhLq8-N2jEq6XePJmgjsiPUbfP0yP3x86TZMOh3shqR0a5IxkQso8iDLCYskZz3MKgSePXUL9zKe-yMcsDFke0diVLuOZJFxQQjIpM_IE7ZTLUj5FmI9hNvzFjXy1KSBELEnIIYgLA8EjHrj7yLVfX8qbCvaqkUqRXg_cPhq2cypTv-XG0YFFJW0iUBNZpkCyG-e9shCmYJ7VmRsr5XKzTt2Qql7Yge8_u9WTHKC73e_mOdqpVxv5At3hZ_V8vXrZsPAv312z6g |
| 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=An+adaptive+hierarchical+master%E2%80%93worker+%28AHMW%29+framework+for+grids%E2%80%94Application+to+B%26B+algorithms&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Bendjoudi%2C+A.&rft.au=Melab%2C+N.&rft.au=Talbi%2C+E-G.&rft.date=2012-02-01&rft.issn=0743-7315&rft.volume=72&rft.issue=2&rft.spage=120&rft.epage=131&rft_id=info:doi/10.1016%2Fj.jpdc.2011.10.002&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jpdc_2011_10_002 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |