Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
As cloud computing is gaining popularity, an important question is how to optimally deploy software applications on the offered infrastructure in the cloud. Especially in the context of mobile computing where software components could be offloaded from the mobile device to the cloud, it is important...
Gespeichert in:
| Veröffentlicht in: | Future generation computer systems Jg. 29; H. 2; S. 451 - 459 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.02.2013
|
| Schlagworte: | |
| ISSN: | 0167-739X, 1872-7115 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | As cloud computing is gaining popularity, an important question is how to optimally deploy software applications on the offered infrastructure in the cloud. Especially in the context of mobile computing where software components could be offloaded from the mobile device to the cloud, it is important to optimize the deployment, by minimizing the network usage. Therefore we have designed and evaluated graph partitioning algorithms that allocate software components to machines in the cloud while minimizing the required bandwidth. Contrary to the traditional graph partitioning problem our algorithms are not restricted to balanced partitions and take into account infrastructure heterogenity. To benchmark our algorithms we evaluated their performance and found they produce 10%–40% smaller graph cut sizes than METIS 4.0 for typical mobile computing scenarios.
► Algorithms for partitioning software on the cloud are presented. ► KL-based algorithm allows fast partitioning for realtime use. ► Simulated annealing improves solution quality at the cost of computation capacity. ► Hybrid approach combines both. ► Comparison to METIS shows our algorithms find 10%–40% better graph cuts. |
|---|---|
| AbstractList | As cloud computing is gaining popularity, an important question is how to optimally deploy software applications on the offered infrastructure in the cloud. Especially in the context of mobile computing where software components could be offloaded from the mobile device to the cloud, it is important to optimize the deployment, by minimizing the network usage. Therefore we have designed and evaluated graph partitioning algorithms that allocate software components to machines in the cloud while minimizing the required bandwidth. Contrary to the traditional graph partitioning problem our algorithms are not restricted to balanced partitions and take into account infrastructure heterogenity. To benchmark our algorithms we evaluated their performance and found they produce 10%–40% smaller graph cut sizes than METIS 4.0 for typical mobile computing scenarios.
► Algorithms for partitioning software on the cloud are presented. ► KL-based algorithm allows fast partitioning for realtime use. ► Simulated annealing improves solution quality at the cost of computation capacity. ► Hybrid approach combines both. ► Comparison to METIS shows our algorithms find 10%–40% better graph cuts. |
| Author | Verbelen, Tim De Turck, Filip Stevens, Tim Dhoedt, Bart |
| Author_xml | – sequence: 1 givenname: Tim surname: Verbelen fullname: Verbelen, Tim email: tim.verbelen@intec.ugent.be – sequence: 2 givenname: Tim surname: Stevens fullname: Stevens, Tim – sequence: 3 givenname: Filip surname: De Turck fullname: De Turck, Filip – sequence: 4 givenname: Bart surname: Dhoedt fullname: Dhoedt, Bart |
| BookMark | eNqFkEFLwzAYhoNMcJv-Aw_5A61f0nZpPQgydAqCFwXxErLky5bRNiXNlPnrbZknD3r6Du_7vPA9MzJpfYuEXDJIGbDF1S61-7gPmHJgPAWRAmQnZMpKwRPBWDEh06EmEpFVb2dk1vc7AGAiY1Pyvgqq29JOheii861rN1TVGx9c3DY9tT5Q30XXuK8x6b2NnyogNdjV_tBgG6lraePXrkaqa783VPum28ehfU5Orap7vPi5c_J6f_eyfEienlePy9unROesjMmiMKBMVXGT88wKY4GB1YZZ5EVlwIpMcVuCqNalhRxyVKUtdJYXfIGGaZbNSX7c1cH3fUAru-AaFQ6SgRz9yJ08-pGjHwlCDn4G7PoXpl1Uo4MYlKv_g2-OMA6PfTgMstcOW43GBdRRGu_-HvgGCAyJJQ |
| CitedBy_id | crossref_primary_10_1007_s11042_015_2498_4 crossref_primary_10_1007_s12065_019_00285_8 crossref_primary_10_1007_s10586_018_2303_z crossref_primary_10_4018_IJITWE_2019040104 crossref_primary_10_1109_TGCN_2021_3067309 crossref_primary_10_1007_s00607_018_0608_7 crossref_primary_10_1155_2021_8846239 crossref_primary_10_1016_j_future_2020_03_064 crossref_primary_10_1109_TSC_2018_2843366 crossref_primary_10_1016_j_future_2019_09_059 crossref_primary_10_1016_j_jnca_2015_12_018 crossref_primary_10_1016_j_sysarc_2020_101799 crossref_primary_10_1109_ACCESS_2023_3264828 crossref_primary_10_1109_TR_2019_2909279 crossref_primary_10_1007_s11277_014_2107_2 crossref_primary_10_1016_j_compeleceng_2018_07_018 crossref_primary_10_1016_j_jnca_2014_09_009 crossref_primary_10_1007_s00500_023_08281_y crossref_primary_10_1016_j_jss_2015_05_050 crossref_primary_10_1007_s00607_019_00733_4 crossref_primary_10_1016_j_simpat_2014_05_006 crossref_primary_10_1109_ACCESS_2023_3280415 crossref_primary_10_1007_s11227_015_1425_9 crossref_primary_10_3390_fi11100209 crossref_primary_10_1186_s13677_022_00363_w crossref_primary_10_1007_s00779_018_1163_0 crossref_primary_10_1016_j_jnca_2018_10_021 crossref_primary_10_1007_s10723_019_09492_0 crossref_primary_10_1007_s10107_015_0881_6 crossref_primary_10_3390_jsan11030047 crossref_primary_10_1007_s10723_017_9406_2 crossref_primary_10_1016_j_future_2017_01_014 crossref_primary_10_1016_j_comcom_2020_05_001 crossref_primary_10_1016_j_jnca_2016_10_023 crossref_primary_10_1007_s10586_018_1769_z crossref_primary_10_1016_j_jnca_2018_06_009 crossref_primary_10_1016_j_jnca_2013_12_002 crossref_primary_10_1155_2018_6509275 crossref_primary_10_1145_2464526_2464533 crossref_primary_10_20965_jaciii_2019_p0005 crossref_primary_10_1016_j_future_2016_06_018 crossref_primary_10_1016_j_adhoc_2017_06_002 crossref_primary_10_1109_TPDS_2019_2891695 crossref_primary_10_1155_2016_2784548 |
| Cites_doi | 10.1007/978-3-540-71701-0_16 10.1287/opre.37.6.865 10.1016/j.future.2007.07.013 10.1145/1538902.1538903 10.1016/S0305-0548(97)00054-3 10.1126/science.220.4598.671 10.1145/1143997.1144193 10.1016/j.pmcj.2007.04.004 10.1137/0611030 10.1007/978-3-540-74198-5_1 10.1007/978-3-540-73871-8_8 10.1016/j.jss.2011.06.063 10.1016/j.future.2008.12.001 10.1109/TC.2004.3 10.1016/j.parco.2009.09.006 10.1109/IPDPS.2002.1015564 10.1016/0167-9260(95)00008-4 10.1007/BF00940812 10.1007/s00453-006-1223-0 10.1145/224170.224228 10.1016/j.jpdc.2007.09.006 10.1109/71.980027 10.1137/S1064827595287997 10.1109/TC.2007.70760 10.1109/PERCOM.2010.5466972 10.1145/2307849.2307858 10.1002/j.1538-7305.1970.tb01770.x 10.1007/s10878-006-9026-4 10.1007/s10723-005-9018-0 10.1016/0020-0190(92)90140-Q 10.1145/1721654.1721672 10.1016/S0167-8191(00)00048-X |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier B.V. |
| Copyright_xml | – notice: 2012 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.future.2012.07.003 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-7115 |
| EndPage | 459 |
| ExternalDocumentID | 10_1016_j_future_2012_07_003 S0167739X12001513 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29H 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W KOM LG9 M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SES SEW SPC SPCBC SSV SSZ T5K UHS WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ADNMO AEIPS AFJKZ AGQPQ AIIUN ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c418t-65d0ad992d423f7df010fcd1fe259d0f73a2f8079b8f0404ea8f5c34526ed1c13 |
| ISICitedReferencesCount | 58 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000312974500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-739X |
| IngestDate | Sat Nov 29 02:59:36 EST 2025 Tue Nov 18 22:30:27 EST 2025 Fri Feb 23 02:31:36 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Cloud computing Graph algorithms Distributed systems Deployment optimization Mobile computing |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c418t-65d0ad992d423f7df010fcd1fe259d0f73a2f8079b8f0404ea8f5c34526ed1c13 |
| OpenAccessLink | https://linkinghub.elsevier.com/science/article/pii/S0167739X12001513 |
| PageCount | 9 |
| ParticipantIDs | crossref_primary_10_1016_j_future_2012_07_003 crossref_citationtrail_10_1016_j_future_2012_07_003 elsevier_sciencedirect_doi_10_1016_j_future_2012_07_003 |
| PublicationCentury | 2000 |
| PublicationDate | February 2013 2013-02-00 |
| PublicationDateYYYYMMDD | 2013-02-01 |
| PublicationDate_xml | – month: 02 year: 2013 text: February 2013 |
| PublicationDecade | 2010 |
| PublicationTitle | Future generation computer systems |
| PublicationYear | 2013 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Chardaire, Barake, McKeown (br000140) 2007; 56 D. Eppstein, J. Wang, A steady state model for graph power laws, in: 2nd International Workshop on Web Dynamics, 2002. Kernighan, Lin (br000075) 1970; 49 Walshaw, Cross (br000130) 2007 J.G. Martin, Spectral techniques for graph bisection in genetic algorithms, in: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation—GECCO’06, 2006, p. 1249. Aykanat, Cambazoglu, Ucar (br000110) 2007; 68 Pothen, Simon, Liou (br000115) 1990; 11 B. Arafeh, K. Day, A. Touzene, A paradigm for allocating parallel application tasks to heterogeneous computing resources on the grid, in: Proceedings of the International Conference ParCo’05, 2005. Hendrickson (br000050) 2000; 26 S. Kumar, S. Das, R. Biswas, Graph partitioning for parallel applications in heterogeneous grid environments, in: Proceedings of the 16th International Parallel and Distributed Processing Symposium, vol. 00, 2002, p. 167. Phinjaroenphan, Bevinakoppa, Zeephongsekul (br000165) 2005; 3470 Fiduccia, Mattheyses (br000080) 1988 Bui, Jones (br000060) 1992; 42 T. Verbelen, P. Simoens, F. De Turck, B. Dhoedt, Cloudlets: bringing the cloud to the mobile user, in: Proc. of the 3rd ACM Workshop on Mobile Cloud Computing & Services, MCS’12, 2012. Schloegel, Karypis, Kumar (br000070) 2003 M. Kristensen, Scavenger: transparent development of efficient cyber foraging applications, in: 2010 IEEE International Conference on Pervasive Computing and Communications, PerCom, 2010, pp. 217–226. M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, M. Zaharia, Above the clouds: a Berkeley view of cloud computing, Tech. Rep., 2009. Karypis, Kumar (br000120) 1999; 20 Loureiro, Amaral (br000145) 2007; 13 Johnson, Aragon, McGeoch, Schevon (br000200) 1989; 37 Khandekar, Rao, Vazirani (br000135) 2009; 56 Park, Kim (br000205) 1998; 25 Ou, Yang, Zhang (br000025) 2007; 3 Sun, Leng, Yu (br000090) 2007; 4632 Harvey, Das, Biswas (br000175) 2006; 45 Fjallstrom (br000065) 1998; 3 F. Pellegrini, Scotch and libScotch 5.1 user’s guide, LaBRI, Université Bordeaux I, August 2008. Saab (br000105) 2004; 53 . Alpert (br000045) 1995; 19 IBM ILOG CPLEX. Buyya, Yeo, Venugopal, Broberg, Brandic (br000005) 2009; 25 Cerny (br000195) 1985; 45 Han, Zhang, Cao, Wen, Zhang (br000040) 2008; 24 Noesis solutions, optimus. Kirkpatrick, Gelatt, Vecchi (br000190) 1983; 220 B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, CDROM-Supercomputing’95, 1995, 28-es. Verbelen, Stevens, Simoens, De Turck, Dhoedt (br000020) 2011; 84 Chen, Taylor (br000180) 2002; 13 Meyerhenke, Monien, Schamberger (br000055) 2009; 35 Sun, Leng (br000085) 2007; 4679 Huang, Aubanel, Bhavsar (br000170) 2006; 4 Leng, Yu (br000095) 2007; 4426 Pothen (10.1016/j.future.2012.07.003_br000115) 1990; 11 Chen (10.1016/j.future.2012.07.003_br000180) 2002; 13 Ou (10.1016/j.future.2012.07.003_br000025) 2007; 3 Harvey (10.1016/j.future.2012.07.003_br000175) 2006; 45 10.1016/j.future.2012.07.003_br000185 Buyya (10.1016/j.future.2012.07.003_br000005) 2009; 25 Fiduccia (10.1016/j.future.2012.07.003_br000080) 1988 10.1016/j.future.2012.07.003_br000160 10.1016/j.future.2012.07.003_br000015 Verbelen (10.1016/j.future.2012.07.003_br000020) 2011; 84 10.1016/j.future.2012.07.003_br000035 Walshaw (10.1016/j.future.2012.07.003_br000130) 2007 10.1016/j.future.2012.07.003_br000155 10.1016/j.future.2012.07.003_br000210 Schloegel (10.1016/j.future.2012.07.003_br000070) 2003 Phinjaroenphan (10.1016/j.future.2012.07.003_br000165) 2005; 3470 Sun (10.1016/j.future.2012.07.003_br000090) 2007; 4632 Huang (10.1016/j.future.2012.07.003_br000170) 2006; 4 Loureiro (10.1016/j.future.2012.07.003_br000145) 2007; 13 Park (10.1016/j.future.2012.07.003_br000205) 1998; 25 Saab (10.1016/j.future.2012.07.003_br000105) 2004; 53 Chardaire (10.1016/j.future.2012.07.003_br000140) 2007; 56 Leng (10.1016/j.future.2012.07.003_br000095) 2007; 4426 10.1016/j.future.2012.07.003_br000010 10.1016/j.future.2012.07.003_br000030 Karypis (10.1016/j.future.2012.07.003_br000120) 1999; 20 Kernighan (10.1016/j.future.2012.07.003_br000075) 1970; 49 10.1016/j.future.2012.07.003_br000150 Cerny (10.1016/j.future.2012.07.003_br000195) 1985; 45 Fjallstrom (10.1016/j.future.2012.07.003_br000065) 1998; 3 Han (10.1016/j.future.2012.07.003_br000040) 2008; 24 Aykanat (10.1016/j.future.2012.07.003_br000110) 2007; 68 Hendrickson (10.1016/j.future.2012.07.003_br000050) 2000; 26 Khandekar (10.1016/j.future.2012.07.003_br000135) 2009; 56 Meyerhenke (10.1016/j.future.2012.07.003_br000055) 2009; 35 10.1016/j.future.2012.07.003_br000125 10.1016/j.future.2012.07.003_br000100 Kirkpatrick (10.1016/j.future.2012.07.003_br000190) 1983; 220 Bui (10.1016/j.future.2012.07.003_br000060) 1992; 42 Alpert (10.1016/j.future.2012.07.003_br000045) 1995; 19 Sun (10.1016/j.future.2012.07.003_br000085) 2007; 4679 Johnson (10.1016/j.future.2012.07.003_br000200) 1989; 37 |
| References_xml | – volume: 4679 start-page: 1 year: 2007 ident: br000085 article-title: An effective multi-level algorithm based on simulated annealing for bisecting graph publication-title: Lecture Notes in Computer Science – reference: M. Armbrust, A. Fox, R. Griffith, A.D. Joseph, R.H. Katz, A. Konwinski, G. Lee, D.A. Patterson, A. Rabkin, M. Zaharia, Above the clouds: a Berkeley view of cloud computing, Tech. Rep., 2009. – start-page: 27 year: 2007 end-page: 58 ident: br000130 article-title: JOSTLE: parallel multilevel graph-partitioning software an overview publication-title: Mesh Partitioning Techniques and Domain Decomposition Techniques – volume: 45 start-page: 41 year: 1985 end-page: 51 ident: br000195 article-title: Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm publication-title: Journal of Optimization Theory and Applications – reference: F. Pellegrini, Scotch and libScotch 5.1 user’s guide, LaBRI, Université Bordeaux I, August 2008. – volume: 11 start-page: 430 year: 1990 end-page: 452 ident: br000115 article-title: Partitioning sparse matrices with eigenvectors of graphs publication-title: SIAM Journal on Matrix Analysis and Applications – volume: 42 start-page: 153 year: 1992 end-page: 159 ident: br000060 article-title: Finding good approximate vertex and edge partitions is NP-hard publication-title: Information Processing Letters – volume: 3 year: 1998 ident: br000065 article-title: Algorithms for graph partitioning: a survey publication-title: Computer and Information Science – volume: 25 start-page: 207 year: 1998 end-page: 217 ident: br000205 article-title: A systematic procedure for setting parameters in simulated annealing algorithms publication-title: Computers & Operations Research – volume: 68 start-page: 609 year: 2007 end-page: 625 ident: br000110 article-title: Multi-level direct publication-title: Journal of Parallel and Distributed Computing – volume: 35 start-page: 544 year: 2009 end-page: 569 ident: br000055 article-title: Graph partitioning and disturbed diffusion publication-title: Parallel Computing – reference: M. Kristensen, Scavenger: transparent development of efficient cyber foraging applications, in: 2010 IEEE International Conference on Pervasive Computing and Communications, PerCom, 2010, pp. 217–226. – volume: 3 start-page: 362 year: 2007 end-page: 385 ident: br000025 article-title: An effective offloading middleware for pervasive services on mobile devices publication-title: Pervasive and Mobile Computing – volume: 20 start-page: 359 year: 1999 end-page: 392 ident: br000120 article-title: A fast and high quality multilevel scheme for partitioning irregular graphs publication-title: SIAM Journal on Scientific Computing – volume: 56 start-page: 1707 year: 2007 end-page: 1720 ident: br000140 article-title: A PROBE-based heuristic for graph partitioning publication-title: IEEE Transactions on Computers – volume: 4426 start-page: 138 year: 2007 ident: br000095 article-title: An effective multi-level algorithm based on ant colony optimization for bisecting graph publication-title: Lecture Notes in Computer Science – volume: 53 start-page: 641 year: 2004 end-page: 652 ident: br000105 article-title: An effective multilevel algorithm for bisecting graphs and hypergraphs publication-title: IEEE Transactions on Computers – volume: 84 start-page: 1871 year: 2011 end-page: 1882 ident: br000020 article-title: Dynamic deployment and quality adaptation for mobile augmented reality applications publication-title: Journal of Systems and Software – reference: J.G. Martin, Spectral techniques for graph bisection in genetic algorithms, in: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation—GECCO’06, 2006, p. 1249. – reference: S. Kumar, S. Das, R. Biswas, Graph partitioning for parallel applications in heterogeneous grid environments, in: Proceedings of the 16th International Parallel and Distributed Processing Symposium, vol. 00, 2002, p. 167. – volume: 4632 start-page: 69 year: 2007 ident: br000090 article-title: A new multi-level algorithm based on particle swarm optimization for bisecting graph publication-title: Lecture Notes in Computer Science – volume: 24 start-page: 512 year: 2008 end-page: 529 ident: br000040 article-title: A resource aware software partitioning algorithm based on mobility constraints in pervasive grid environments publication-title: Future Generation Computer Systems – reference: B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: Proceedings of the 1995 ACM/IEEE Conference on Supercomputing, CDROM-Supercomputing’95, 1995, 28-es. – volume: 37 start-page: 865 year: 1989 end-page: 892 ident: br000200 article-title: Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning publication-title: Operations Research – volume: 13 start-page: 289 year: 2007 end-page: 320 ident: br000145 article-title: An efficient approach for large scale graph partitioning publication-title: Journal of Combinatorial Optimization – reference: IBM ILOG CPLEX. – volume: 26 start-page: 1519 year: 2000 end-page: 1534 ident: br000050 article-title: Graph partitioning models for parallel computing publication-title: Parallel Computing – volume: 56 start-page: 1 year: 2009 end-page: 15 ident: br000135 article-title: Graph partitioning using single commodity flows publication-title: Journal of the ACM – volume: 4 start-page: 71 year: 2006 end-page: 88 ident: br000170 article-title: PaGrid: a mesh partitioner for computational grids publication-title: Journal of Grid Computing – reference: . – reference: T. Verbelen, P. Simoens, F. De Turck, B. Dhoedt, Cloudlets: bringing the cloud to the mobile user, in: Proc. of the 3rd ACM Workshop on Mobile Cloud Computing & Services, MCS’12, 2012. – volume: 13 start-page: 67 year: 2002 end-page: 78 ident: br000180 article-title: Mesh partitioning for efficient use of distributed systems publication-title: IEEE Transactions on Parallel and Distributed Systems – volume: 49 start-page: 291 year: 1970 end-page: 307 ident: br000075 article-title: An efficient heuristic procedure for partitioning graphs publication-title: Bell System Technical Journal – reference: Noesis solutions, optimus. – volume: 220 start-page: 671 year: 1983 end-page: 680 ident: br000190 article-title: Optimization by simulated annealing publication-title: Science – year: 2003 ident: br000070 article-title: The Sourcebook of Parallel Computing – reference: B. Arafeh, K. Day, A. Touzene, A paradigm for allocating parallel application tasks to heterogeneous computing resources on the grid, in: Proceedings of the International Conference ParCo’05, 2005. – reference: D. Eppstein, J. Wang, A steady state model for graph power laws, in: 2nd International Workshop on Web Dynamics, 2002. – volume: 25 start-page: 599 year: 2009 end-page: 616 ident: br000005 article-title: Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility publication-title: Future Generation Computer Systems – start-page: 247 year: 1988 ident: br000080 article-title: A linear-time heuristic for improving network partitions publication-title: Papers on Twenty-Five Years of Electronic Design Automation – volume: 19 start-page: 1 year: 1995 end-page: 81 ident: br000045 article-title: Recent directions in netlist partitioning: a survey publication-title: Integration, The VLSI Journal – volume: 3470 start-page: 1086 year: 2005 end-page: 1096 ident: br000165 article-title: A heuristic algorithm for mapping parallel applications on computational grids publication-title: Advances in Grid Computing – volume: 45 start-page: 509 year: 2006 end-page: 530 ident: br000175 article-title: Design and performance of a heterogeneous grid partitioner publication-title: Algorithmica – volume: 4426 start-page: 138 year: 2007 ident: 10.1016/j.future.2012.07.003_br000095 article-title: An effective multi-level algorithm based on ant colony optimization for bisecting graph publication-title: Lecture Notes in Computer Science doi: 10.1007/978-3-540-71701-0_16 – volume: 37 start-page: 865 issue: 6 year: 1989 ident: 10.1016/j.future.2012.07.003_br000200 article-title: Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning publication-title: Operations Research doi: 10.1287/opre.37.6.865 – volume: 24 start-page: 512 issue: 6 year: 2008 ident: 10.1016/j.future.2012.07.003_br000040 article-title: A resource aware software partitioning algorithm based on mobility constraints in pervasive grid environments publication-title: Future Generation Computer Systems doi: 10.1016/j.future.2007.07.013 – volume: 56 start-page: 1 issue: 4 year: 2009 ident: 10.1016/j.future.2012.07.003_br000135 article-title: Graph partitioning using single commodity flows publication-title: Journal of the ACM doi: 10.1145/1538902.1538903 – volume: 25 start-page: 207 issue: 3 year: 1998 ident: 10.1016/j.future.2012.07.003_br000205 article-title: A systematic procedure for setting parameters in simulated annealing algorithms publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(97)00054-3 – volume: 220 start-page: 671 issue: 4598 year: 1983 ident: 10.1016/j.future.2012.07.003_br000190 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – ident: 10.1016/j.future.2012.07.003_br000125 – ident: 10.1016/j.future.2012.07.003_br000150 doi: 10.1145/1143997.1144193 – volume: 3 start-page: 362 issue: 4 year: 2007 ident: 10.1016/j.future.2012.07.003_br000025 article-title: An effective offloading middleware for pervasive services on mobile devices publication-title: Pervasive and Mobile Computing doi: 10.1016/j.pmcj.2007.04.004 – volume: 11 start-page: 430 issue: 3 year: 1990 ident: 10.1016/j.future.2012.07.003_br000115 article-title: Partitioning sparse matrices with eigenvectors of graphs publication-title: SIAM Journal on Matrix Analysis and Applications doi: 10.1137/0611030 – start-page: 247 year: 1988 ident: 10.1016/j.future.2012.07.003_br000080 article-title: A linear-time heuristic for improving network partitions – volume: 4679 start-page: 1 year: 2007 ident: 10.1016/j.future.2012.07.003_br000085 article-title: An effective multi-level algorithm based on simulated annealing for bisecting graph publication-title: Lecture Notes in Computer Science doi: 10.1007/978-3-540-74198-5_1 – volume: 4632 start-page: 69 year: 2007 ident: 10.1016/j.future.2012.07.003_br000090 article-title: A new multi-level algorithm based on particle swarm optimization for bisecting graph publication-title: Lecture Notes in Computer Science doi: 10.1007/978-3-540-73871-8_8 – volume: 84 start-page: 1871 year: 2011 ident: 10.1016/j.future.2012.07.003_br000020 article-title: Dynamic deployment and quality adaptation for mobile augmented reality applications publication-title: Journal of Systems and Software doi: 10.1016/j.jss.2011.06.063 – volume: 25 start-page: 599 issue: 6 year: 2009 ident: 10.1016/j.future.2012.07.003_br000005 article-title: Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility publication-title: Future Generation Computer Systems doi: 10.1016/j.future.2008.12.001 – volume: 53 start-page: 641 issue: 6 year: 2004 ident: 10.1016/j.future.2012.07.003_br000105 article-title: An effective multilevel algorithm for bisecting graphs and hypergraphs publication-title: IEEE Transactions on Computers doi: 10.1109/TC.2004.3 – volume: 35 start-page: 544 issue: 10–11 year: 2009 ident: 10.1016/j.future.2012.07.003_br000055 article-title: Graph partitioning and disturbed diffusion publication-title: Parallel Computing doi: 10.1016/j.parco.2009.09.006 – ident: 10.1016/j.future.2012.07.003_br000155 doi: 10.1109/IPDPS.2002.1015564 – volume: 19 start-page: 1 issue: 1–2 year: 1995 ident: 10.1016/j.future.2012.07.003_br000045 article-title: Recent directions in netlist partitioning: a survey publication-title: Integration, The VLSI Journal doi: 10.1016/0167-9260(95)00008-4 – volume: 45 start-page: 41 issue: 1 year: 1985 ident: 10.1016/j.future.2012.07.003_br000195 article-title: Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm publication-title: Journal of Optimization Theory and Applications doi: 10.1007/BF00940812 – volume: 45 start-page: 509 issue: 3 year: 2006 ident: 10.1016/j.future.2012.07.003_br000175 article-title: Design and performance of a heterogeneous grid partitioner publication-title: Algorithmica doi: 10.1007/s00453-006-1223-0 – ident: 10.1016/j.future.2012.07.003_br000015 – ident: 10.1016/j.future.2012.07.003_br000100 doi: 10.1145/224170.224228 – ident: 10.1016/j.future.2012.07.003_br000210 – volume: 68 start-page: 609 issue: 5 year: 2007 ident: 10.1016/j.future.2012.07.003_br000110 article-title: Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices publication-title: Journal of Parallel and Distributed Computing doi: 10.1016/j.jpdc.2007.09.006 – volume: 3470 start-page: 1086 year: 2005 ident: 10.1016/j.future.2012.07.003_br000165 article-title: A heuristic algorithm for mapping parallel applications on computational grids publication-title: Advances in Grid Computing – volume: 13 start-page: 67 issue: 1 year: 2002 ident: 10.1016/j.future.2012.07.003_br000180 article-title: Mesh partitioning for efficient use of distributed systems publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/71.980027 – volume: 20 start-page: 359 issue: 1 year: 1999 ident: 10.1016/j.future.2012.07.003_br000120 article-title: A fast and high quality multilevel scheme for partitioning irregular graphs publication-title: SIAM Journal on Scientific Computing doi: 10.1137/S1064827595287997 – volume: 56 start-page: 1707 issue: 12 year: 2007 ident: 10.1016/j.future.2012.07.003_br000140 article-title: A PROBE-based heuristic for graph partitioning publication-title: IEEE Transactions on Computers doi: 10.1109/TC.2007.70760 – ident: 10.1016/j.future.2012.07.003_br000030 doi: 10.1109/PERCOM.2010.5466972 – start-page: 27 year: 2007 ident: 10.1016/j.future.2012.07.003_br000130 article-title: JOSTLE: parallel multilevel graph-partitioning software an overview – ident: 10.1016/j.future.2012.07.003_br000035 doi: 10.1145/2307849.2307858 – volume: 49 start-page: 291 issue: 2 year: 1970 ident: 10.1016/j.future.2012.07.003_br000075 article-title: An efficient heuristic procedure for partitioning graphs publication-title: Bell System Technical Journal doi: 10.1002/j.1538-7305.1970.tb01770.x – volume: 13 start-page: 289 issue: 4 year: 2007 ident: 10.1016/j.future.2012.07.003_br000145 article-title: An efficient approach for large scale graph partitioning publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-006-9026-4 – volume: 4 start-page: 71 issue: 1 year: 2006 ident: 10.1016/j.future.2012.07.003_br000170 article-title: PaGrid: a mesh partitioner for computational grids publication-title: Journal of Grid Computing doi: 10.1007/s10723-005-9018-0 – volume: 42 start-page: 153 issue: 3 year: 1992 ident: 10.1016/j.future.2012.07.003_br000060 article-title: Finding good approximate vertex and edge partitions is NP-hard publication-title: Information Processing Letters doi: 10.1016/0020-0190(92)90140-Q – ident: 10.1016/j.future.2012.07.003_br000010 doi: 10.1145/1721654.1721672 – ident: 10.1016/j.future.2012.07.003_br000160 – ident: 10.1016/j.future.2012.07.003_br000185 – volume: 26 start-page: 1519 issue: 12 year: 2000 ident: 10.1016/j.future.2012.07.003_br000050 article-title: Graph partitioning models for parallel computing publication-title: Parallel Computing doi: 10.1016/S0167-8191(00)00048-X – volume: 3 issue: 10 year: 1998 ident: 10.1016/j.future.2012.07.003_br000065 article-title: Algorithms for graph partitioning: a survey publication-title: Computer and Information Science – year: 2003 ident: 10.1016/j.future.2012.07.003_br000070 |
| SSID | ssj0001731 |
| Score | 2.3052127 |
| Snippet | As cloud computing is gaining popularity, an important question is how to optimally deploy software applications on the offered infrastructure in the cloud.... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 451 |
| SubjectTerms | Cloud computing Deployment optimization Distributed systems Graph algorithms Mobile computing |
| Title | Graph partitioning algorithms for optimizing software deployment in mobile cloud computing |
| URI | https://dx.doi.org/10.1016/j.future.2012.07.003 |
| Volume | 29 |
| WOSCitedRecordID | wos000312974500001&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: 1872-7115 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001731 issn: 0167-739X databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JbtswECUMp4deuhdNN_DQm6BCC2WSxyBNuhyCAnULoxdB4tIocCTDkdMgf9M_7XCT3CboBvRC2JQpy5zHGXI8Mw-hF1lSkUySPJZE5XBAAVkwrcy6gpZrThLJLNkEPTpiiwV_P5l8C7kw50vatuzigq_-q6ihD4RtUmf_QtzDTaEDXoPQoQWxQ_tHgn9tSlBHK3MlOFur5Zdu3fTHrvhC1IGaOG0urScBtPBXE_wllWH-tZEBTRuddjVoi0gsu43Neltt-mDiAqWnrUViCJiVx5Dw_BC-OPSwV_8EgjO2zSNjcOlYOrWzn3pfqWi-WTsVfWhcPcOF407J3v9D0m_7KgxvxA9xH1eTaJxPE3Q1zS2jLpgkp4cZhY1_6jI9g6L2rpFm67zstC7xNWuVf8evtQ3OTXHy0hVrMVF9ma3bmuSjLRwiFD-YpzIPlZqgs8LwIu9ktOBsinb23h4s3g3mPqWe9NL_ipCfaYMIr37X9fufrT3N_A665Q8jeM-B6C6aqPYeuh2IPrDX-_fRZ4spvI0pPGIKA6bwiCkcMIVHTOGmxQ5T2GIKD5h6gD4eHsz338SelCMWJGV9PCtkUknOYYFnuaZSw4FeCwlLGw7SMtE0rzLNEsprpsFAEFUxXYjcMNkrmYo0f4imbdeqRwiTQpOqzoRIuCS1lrwq6nqWsrrWVMx4uovyMFWl8BXrDXHKsgyhiSelm-DSTHCZmFCKfBfFw6iVq9jym8_TIIXS7zrdbrIE4Pxy5ON_HvkE3RyXx1M07dcb9QzdEOd9c7Z-7hH2HQFcr8I |
| 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=Graph+partitioning+algorithms+for+optimizing+software+deployment+in+mobile+cloud+computing&rft.jtitle=Future+generation+computer+systems&rft.au=Verbelen%2C+Tim&rft.au=Stevens%2C+Tim&rft.au=De+Turck%2C+Filip&rft.au=Dhoedt%2C+Bart&rft.date=2013-02-01&rft.pub=Elsevier+B.V&rft.issn=0167-739X&rft.eissn=1872-7115&rft.volume=29&rft.issue=2&rft.spage=451&rft.epage=459&rft_id=info:doi/10.1016%2Fj.future.2012.07.003&rft.externalDocID=S0167739X12001513 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-739X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-739X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-739X&client=summon |