Dynamic load balancing with group communication

This work considers the problem of efficiently performing a set of tasks using a network of processors in the setting where the network is subject to dynamic reconfigurations, including partitions and merges. A key challenge for this setting is the implementation of dynamic load balancing that reduc...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 369; číslo 1; s. 348 - 360
Hlavní autori:	Dolev, Shlomi, Segala, Roberto, Shvartsman, Alexander
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 15.12.2006 Elsevier
Predmet:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Computer systems performance. Reliability Dynamic networks Exact sciences and technology Flows in networks. Combinatorial problems Group communications Load balancing Operational research and scientific management Operational research. Management science Scheduling Software Theoretical computing Scheduling Dynamic networks Load balancing Group communications Computer theory Redundancy Maintenance Algorithm Group communication Dynamic load Fragmentation Reconfiguration
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	This work considers the problem of efficiently performing a set of tasks using a network of processors in the setting where the network is subject to dynamic reconfigurations, including partitions and merges. A key challenge for this setting is the implementation of dynamic load balancing that reduces the number of tasks that are performed redundantly because of the reconfigurations. We explore new approaches for load balancing in dynamic networks that can be employed by applications using a group communication service (GCS). The GCS that we consider include a membership service (establishing new groups to reflect dynamic changes) but does not include maintenance of a primary component. For the n-processor, n-task load balancing problem defined in this work, the following specific results are obtained. For the case of fully dynamic changes including fragmentation and merges we show that the termination time of any on-line task assignment algorithm is greater than the termination time of an off-line task assignment algorithm by a factor greater than n / 12 . We present a load balancing algorithm that guarantees completion of all tasks in all fragments caused by partitions with work O ( n + f · n ) in the presence of f fragmentation failures. We develop an effective scheduling strategy for minimizing the task execution redundancy and we prove that our strategy provides each of the n processors with a schedule of Θ ( n 1 / 3 ) tasks such that at most one task is performed redundantly by any two processors.
AbstractList	This work considers the problem of efficiently performing a set of tasks using a network of processors in the setting where the network is subject to dynamic reconfigurations, including partitions and merges. A key challenge for this setting is the implementation of dynamic load balancing that reduces the number of tasks that are performed redundantly because of the reconfigurations. We explore new approaches for load balancing in dynamic networks that can be employed by applications using a group communication service (GCS). The GCS that we consider include a membership service (establishing new groups to reflect dynamic changes) but does not include maintenance of a primary component. For the n-processor, n-task load balancing problem defined in this work, the following specific results are obtained. For the case of fully dynamic changes including fragmentation and merges we show that the termination time of any on-line task assignment algorithm is greater than the termination time of an off-line task assignment algorithm by a factor greater than n / 12 . We present a load balancing algorithm that guarantees completion of all tasks in all fragments caused by partitions with work O ( n + f · n ) in the presence of f fragmentation failures. We develop an effective scheduling strategy for minimizing the task execution redundancy and we prove that our strategy provides each of the n processors with a schedule of Θ ( n 1 / 3 ) tasks such that at most one task is performed redundantly by any two processors.
Author	Dolev, Shlomi Segala, Roberto Shvartsman, Alexander
Author_xml	– sequence: 1 givenname: Shlomi surname: Dolev fullname: Dolev, Shlomi email: dolev@cs.bgu.ac.il organization: Department of Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel – sequence: 2 givenname: Roberto surname: Segala fullname: Segala, Roberto email: roberto.segala@univr.it organization: Dipartamento di Informatica, Università di Verona, Strada Le Grazie 15, 37134 Verona, Italy – sequence: 3 givenname: Alexander surname: Shvartsman fullname: Shvartsman, Alexander email: aas@cse.uconn.edu organization: Department of Computer Science and Engineering, University of Connecticut, 371 Fairfield Rd., Unit 2155, Storrs, CT 06269, USA
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18312636$$DView record in Pascal Francis
BookMark	eNp9kD1PwzAQhi1UJNrCD2DLwpj0zs5HIyZUPqVKLDBbl4tTXKVOZaeg_ntSihgYesst97x675mIkeucEeIaIUHAfLZOeg6JBMgTKBOQcCbGOC_KWMoyHYkxKEhjVRbZhZiEsIZhsiIfi9n93tHGctR2VEcVteTYulX0ZfuPaOW73TbibrPZOcvU285divOG2mCufvdUvD8-vC2e4-Xr08vibhmzkkUf14AE88xgJkuSio1UDZIylBYN1oxZ00g0dSpzyjLDFchKkqzzErBCYlRTcXPM3VJgaht_6BX01tsN-b3GuUKZq3y4K4537LsQvGk02_6nae_JthpBH_zotR786IMfDaUe_Awk_iP_wk8wt0fGDK9_WuN1YGscm9p6w72uO3uC_gY3hX-C
CODEN	TCSCDI
CitedBy_id	crossref_primary_10_1016_j_jpdc_2009_12_002 crossref_primary_10_1016_j_tcs_2014_10_015 crossref_primary_10_1007_s00224_022_10097_6 crossref_primary_10_1016_j_jpdc_2017_06_013
Cites_doi	10.1145/197917.198082 10.1145/377769.377776 10.1002/(SICI)1097-024X(19990725)29:9<741::AID-SPE259>3.0.CO;2-I 10.1016/S1570-8667(03)00026-1 10.1145/227210.227227 10.1007/PL00008926 10.1145/227210.227226 10.1137/S0097539793255527 10.1145/277697.277739 10.1109/SFCS.1995.492674 10.1145/250007.250010 10.1007/3-540-40026-5_8 10.1007/3-540-45414-4_11 10.1007/BFb0056495 10.1109/ICDCS.1998.679501 10.1145/227210.227229 10.1109/ICDCS.1995.500032 10.1145/259380.259424 10.1145/227210.227225 10.1145/383962.384048 10.1137/S0097539704440442 10.1145/2786.2793
ContentType	Journal Article
Copyright	2006 Elsevier B.V. 2007 INIST-CNRS
Copyright_xml	– notice: 2006 Elsevier B.V. – notice: 2007 INIST-CNRS
DBID	6I. AAFTH AAYXX CITATION IQODW
DOI	10.1016/j.tcs.2006.09.020
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science Applied Sciences
EISSN	1879-2294
EndPage	360
ExternalDocumentID	18312636 10_1016_j_tcs_2006_09_020 S0304397506006128
GroupedDBID	--K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 29Q 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HVGLF HZ~ IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW SSZ T5K TAE TN5 WH7 WUQ XJT YNT ZMT ZY4 ~G- 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 AFXIZ AGCQF AGRNS BNPGV IQODW SSH
ID	FETCH-LOGICAL-c327t-d01a085e1529a23ce23f1a3ea47f1dc15ff21ed426a55ecb02b2a2d6901b1ac13
ISICitedReferencesCount	6
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000242765000024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0304-3975
IngestDate	Mon Jul 21 09:14:22 EDT 2025 Sat Nov 29 05:14:50 EST 2025 Tue Nov 18 21:46:37 EST 2025 Fri Feb 23 02:16:40 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Scheduling Dynamic networks Load balancing Group communications Computer theory Redundancy Maintenance Algorithm Group communication Dynamic load Fragmentation Reconfiguration
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c327t-d01a085e1529a23ce23f1a3ea47f1dc15ff21ed426a55ecb02b2a2d6901b1ac13
OpenAccessLink	https://dx.doi.org/10.1016/j.tcs.2006.09.020
PageCount	13
ParticipantIDs	pascalfrancis_primary_18312636 crossref_citationtrail_10_1016_j_tcs_2006_09_020 crossref_primary_10_1016_j_tcs_2006_09_020 elsevier_sciencedirect_doi_10_1016_j_tcs_2006_09_020
PublicationCentury	2000
PublicationDate	2006-12-15
PublicationDateYYYYMMDD	2006-12-15
PublicationDate_xml	– month: 12 year: 2006 text: 2006-12-15 day: 15
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Theoretical computer science
PublicationYear	2006
Publisher	Elsevier B.V Elsevier
Publisher_xml	– name: Elsevier B.V – name: Elsevier
References	Georgiou, Russell, Shvartsman (bib18) 2005; 34 G. Malewicz, A. Russell, A. Shvartsman, Optimal scheduling for disconnected cooperation, in: Proc. Eighth Internat. Colloq. Structure of Information and Communication Complexity (SIROCCO’01), pp. 259–274, June 2001. Also brief announcement, in: Proc. 19th ACM Symp. on Principles of Distributed Computing (PODC’01), 2001. M. Hayden, The ensemble system, Doctoral Dissertation, Computer Science, Cornell University, 1998. O. Babaoglu, R. Davoli, A. Montresor, R. Segala, System support for partition-aware network applications, in: Proc. 18th Internat. Conf. on Distributed Computing Systems, May 1998. Ch. Georgiou, Cooperative distributed computing in the presence of quantified adversity, Ph.D. Thesis, University of Connecticut, 2003. A. Russell, A. Shvartsman, Distributed computation meets design theory: local scheduling for disconnected cooperation, Current Trends in Theoretical Computer Science: The Challenge of the New Century, Vol. 1: Algorithms and Complexity, World Scientific, Singapore, 2004, pp. 315–336. Ch. Georgiou, A. Russell, A.A. Shvartsman, The complexity of synchronous iterative do-all with crashes, in: Proc. 15th Internat. Symp. on Distributed Computing (DISC’01), 2001, Springer, Lecture Notes on Computer Science, Vol. 2180, pp. 151–165. Moser, Melliar-Smith, Agarawal, Budhia, Lingley-Papadopolous (bib27) 1996; 39 Fekete, Lynch, Shvartsman (bib13) 2001; 19 Babaoglu, Davoli, Montresor (bib1) 1997; 31 D. Sleator, R. Tarjan, Amortized efficiency of list update and paging rules, CACM 28, 1985, pp. 202–208. Birman, van Renesse (bib3) 1994 P. Ezhilchelvan, R. Macedo, S. Shrivastava, Newtop: a fault-tolerant group communication protocol, in: Proc. IEEE Internat. Conf. on Distributed Computing Systems, 1995, pp. 296–306. K.P. Birman, A review of experiences with reliable multicast, Software–Practice and Experience, Vol. 29(9), Wiley, New York, 1999, pp. 741–774. Georgiou, Shvartsman (bib17) 2003; 1 Lynch, Tuttle (bib22) 1989; 2 G. Malewicz, A. Russell, A. Shvartsman, Distributed cooperation during the absence of communication, in: Proc. 14th Internat. Symp. on Distributed Computing (DISC’00), 2000, pp. 119–133. van Renesse, Birman, Maffeis (bib29) 1996; 39 G. Malewicz, Distributed scheduling for disconnected cooperation, Ph.D. Thesis, University of Connecticut, 2003. R. De Prisco, A. Mayer, M. Yung, Time-optimal message-efficient work performance in the presence of faults, in: Proc. 13th ACM Symp. on Principles of Distributed Computing, 1994, pp. 161–172. Dolev, Malki (bib9) 1996; 39 N. Shavit, Concurrent time-stamping, Ph.D. Thesis, School of Mathematics and Computer Science, Hebrew University, Jerusalem, 1990. Kanellakis, Shvartsman (bib20) 1997 A. Fekete, R. Khazan, N. Lynch, Group communication as a base for a load-balancing, replicated data service, in: Proc. 12th Internat. Symp. on Distributed Computing, 1998. Comm. ACM, Special Issue on Group Communication Services, 39(4) 1996. G. Malewicz, A.C. Russell, A.A. Shvartsman, Local scheduling for distributed cooperation, in: Proc. IEEE Internat. Symp. on Network Computing and Applications, NCA’2001, 2001, pp. 244–255. Z. Galil, A. Mayer, M. Yung, Resolving message complexity of Byzantine agreement and beyond, in: Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 724–733. R. De Prisco, A. Fekete, N. Lynch, A. Shvartsman, A dynamic view-oriented group communication service, in: Proc. ACM Symp. on Principles of Distributed Computing, 1998. E.Y. Lotem, I. Keidar, D. Dolev, Dynamic voting for consistent primary components, in: Proc. 16th Ann. ACM Symp. on Principles of Distributed Computing, 1997, 63–71. C. Dwork, J. Halpern, O. Waarts, Performing work efficiently in the presence of faults, SIAM J. Computing, 27 (5) (1998) 1457–1491; Preliminary version appeared as accomplishing work in the presence of failures, in: Proc. 11th ACM Symp. on Principles of Distributed Computing, 1992, pp. 91–102. Chlebus, De Prisco, Shvartsman (bib5) 2001; 14 J. Sussman, K. Marzullo, The Bancomat problem: an example of resource allocation in a partitionable asynchronous system, in: Proc. 12th Internat. Symp. on Distributed Computing, 1998. M. Saks, N. Shavit, H. Woll, Optimal time randomized consensus—making resilient algorithms fast in practice, in: Proc. Second ACM-SIAM Symp. on Discrete Algorithms, 1991, pp. 351–362. van Renesse (10.1016/j.tcs.2006.09.020_bib29) 1996; 39 10.1016/j.tcs.2006.09.020_bib31 10.1016/j.tcs.2006.09.020_bib30 10.1016/j.tcs.2006.09.020_bib11 10.1016/j.tcs.2006.09.020_bib33 10.1016/j.tcs.2006.09.020_bib10 10.1016/j.tcs.2006.09.020_bib32 10.1016/j.tcs.2006.09.020_bib12 10.1016/j.tcs.2006.09.020_bib15 10.1016/j.tcs.2006.09.020_bib14 10.1016/j.tcs.2006.09.020_bib16 Moser (10.1016/j.tcs.2006.09.020_bib27) 1996; 39 10.1016/j.tcs.2006.09.020_bib19 Birman (10.1016/j.tcs.2006.09.020_bib3) 1994 Lynch (10.1016/j.tcs.2006.09.020_bib22) 1989; 2 Dolev (10.1016/j.tcs.2006.09.020_bib9) 1996; 39 Chlebus (10.1016/j.tcs.2006.09.020_bib5) 2001; 14 Fekete (10.1016/j.tcs.2006.09.020_bib13) 2001; 19 Georgiou (10.1016/j.tcs.2006.09.020_bib18) 2005; 34 Georgiou (10.1016/j.tcs.2006.09.020_bib17) 2003; 1 10.1016/j.tcs.2006.09.020_bib21 Kanellakis (10.1016/j.tcs.2006.09.020_bib20) 1997 10.1016/j.tcs.2006.09.020_bib24 10.1016/j.tcs.2006.09.020_bib23 10.1016/j.tcs.2006.09.020_bib7 10.1016/j.tcs.2006.09.020_bib26 10.1016/j.tcs.2006.09.020_bib8 10.1016/j.tcs.2006.09.020_bib25 10.1016/j.tcs.2006.09.020_bib28 10.1016/j.tcs.2006.09.020_bib6 10.1016/j.tcs.2006.09.020_bib4 10.1016/j.tcs.2006.09.020_bib2 Babaoglu (10.1016/j.tcs.2006.09.020_bib1) 1997; 31
References_xml	– reference: M. Saks, N. Shavit, H. Woll, Optimal time randomized consensus—making resilient algorithms fast in practice, in: Proc. Second ACM-SIAM Symp. on Discrete Algorithms, 1991, pp. 351–362. – reference: C. Dwork, J. Halpern, O. Waarts, Performing work efficiently in the presence of faults, SIAM J. Computing, 27 (5) (1998) 1457–1491; Preliminary version appeared as accomplishing work in the presence of failures, in: Proc. 11th ACM Symp. on Principles of Distributed Computing, 1992, pp. 91–102. – volume: 31 start-page: 11 year: 1997 end-page: 22 ident: bib1 article-title: Group membership and view synchrony in partitionable asynchronous distributed systems: specification publication-title: Operating Systems Rev. – volume: 39 start-page: 76 year: 1996 end-page: 83 ident: bib29 article-title: Horus: a flexible group communication system publication-title: Comm. ACM – reference: Z. Galil, A. Mayer, M. Yung, Resolving message complexity of Byzantine agreement and beyond, in: Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 724–733. – reference: G. Malewicz, A.C. Russell, A.A. Shvartsman, Local scheduling for distributed cooperation, in: Proc. IEEE Internat. Symp. on Network Computing and Applications, NCA’2001, 2001, pp. 244–255. – year: 1994 ident: bib3 article-title: Reliable distributed computing with the isis toolkit – volume: 14 start-page: 49 year: 2001 end-page: 64 ident: bib5 article-title: Performing tasks on synchronous restartable message-passing processors publication-title: Distributed Comput. – volume: 19 start-page: 171 year: 2001 end-page: 216 ident: bib13 article-title: Specifying and using a partitionable group communication service publication-title: ACM Trans. Comput. Systems – reference: G. Malewicz, A. Russell, A. Shvartsman, Distributed cooperation during the absence of communication, in: Proc. 14th Internat. Symp. on Distributed Computing (DISC’00), 2000, pp. 119–133. – reference: J. Sussman, K. Marzullo, The Bancomat problem: an example of resource allocation in a partitionable asynchronous system, in: Proc. 12th Internat. Symp. on Distributed Computing, 1998. – reference: P. Ezhilchelvan, R. Macedo, S. Shrivastava, Newtop: a fault-tolerant group communication protocol, in: Proc. IEEE Internat. Conf. on Distributed Computing Systems, 1995, pp. 296–306. – reference: Ch. Georgiou, A. Russell, A.A. Shvartsman, The complexity of synchronous iterative do-all with crashes, in: Proc. 15th Internat. Symp. on Distributed Computing (DISC’01), 2001, Springer, Lecture Notes on Computer Science, Vol. 2180, pp. 151–165. – reference: G. Malewicz, A. Russell, A. Shvartsman, Optimal scheduling for disconnected cooperation, in: Proc. Eighth Internat. Colloq. Structure of Information and Communication Complexity (SIROCCO’01), pp. 259–274, June 2001. Also brief announcement, in: Proc. 19th ACM Symp. on Principles of Distributed Computing (PODC’01), 2001. – reference: D. Sleator, R. Tarjan, Amortized efficiency of list update and paging rules, CACM 28, 1985, pp. 202–208. – reference: E.Y. Lotem, I. Keidar, D. Dolev, Dynamic voting for consistent primary components, in: Proc. 16th Ann. ACM Symp. on Principles of Distributed Computing, 1997, 63–71. – reference: Comm. ACM, Special Issue on Group Communication Services, 39(4) 1996. – reference: G. Malewicz, Distributed scheduling for disconnected cooperation, Ph.D. Thesis, University of Connecticut, 2003. – reference: M. Hayden, The ensemble system, Doctoral Dissertation, Computer Science, Cornell University, 1998. – reference: A. Russell, A. Shvartsman, Distributed computation meets design theory: local scheduling for disconnected cooperation, Current Trends in Theoretical Computer Science: The Challenge of the New Century, Vol. 1: Algorithms and Complexity, World Scientific, Singapore, 2004, pp. 315–336. – reference: O. Babaoglu, R. Davoli, A. Montresor, R. Segala, System support for partition-aware network applications, in: Proc. 18th Internat. Conf. on Distributed Computing Systems, May 1998. – reference: A. Fekete, R. Khazan, N. Lynch, Group communication as a base for a load-balancing, replicated data service, in: Proc. 12th Internat. Symp. on Distributed Computing, 1998. – volume: 1 start-page: 211 year: 2003 end-page: 235 ident: bib17 article-title: Cooperative computing with fragmentable and mergeable groups publication-title: J. Discrete Algorithms – reference: Ch. Georgiou, Cooperative distributed computing in the presence of quantified adversity, Ph.D. Thesis, University of Connecticut, 2003. – volume: 39 start-page: 54 year: 1996 end-page: 63 ident: bib27 article-title: Totem: a fault-tolerant multicast group communication system publication-title: Comm. ACM – reference: N. Shavit, Concurrent time-stamping, Ph.D. Thesis, School of Mathematics and Computer Science, Hebrew University, Jerusalem, 1990. – reference: R. De Prisco, A. Mayer, M. Yung, Time-optimal message-efficient work performance in the presence of faults, in: Proc. 13th ACM Symp. on Principles of Distributed Computing, 1994, pp. 161–172. – year: 1997 ident: bib20 article-title: Fault-Tolerant Parallel Computation – volume: 34 start-page: 848 year: 2005 end-page: 862 ident: bib18 article-title: Work-competitive scheduling for cooperative computing with dynamic groups publication-title: SIAM J. Comput. (SICOMP) – volume: 2 start-page: 219 year: 1989 end-page: 246 ident: bib22 article-title: An introduction to input/output automata publication-title: CWI Quarterly – reference: K.P. Birman, A review of experiences with reliable multicast, Software–Practice and Experience, Vol. 29(9), Wiley, New York, 1999, pp. 741–774. – reference: R. De Prisco, A. Fekete, N. Lynch, A. Shvartsman, A dynamic view-oriented group communication service, in: Proc. ACM Symp. on Principles of Distributed Computing, 1998. – volume: 39 start-page: 64 year: 1996 end-page: 70 ident: bib9 article-title: The transis approach to high availability cluster communications publication-title: Comm. ACM – ident: 10.1016/j.tcs.2006.09.020_bib15 – ident: 10.1016/j.tcs.2006.09.020_bib8 doi: 10.1145/197917.198082 – volume: 19 start-page: 171 issue: 2 year: 2001 ident: 10.1016/j.tcs.2006.09.020_bib13 article-title: Specifying and using a partitionable group communication service publication-title: ACM Trans. Comput. Systems doi: 10.1145/377769.377776 – ident: 10.1016/j.tcs.2006.09.020_bib4 doi: 10.1002/(SICI)1097-024X(19990725)29:9<741::AID-SPE259>3.0.CO;2-I – volume: 1 start-page: 211 issue: 2 year: 2003 ident: 10.1016/j.tcs.2006.09.020_bib17 article-title: Cooperative computing with fragmentable and mergeable groups publication-title: J. Discrete Algorithms doi: 10.1016/S1570-8667(03)00026-1 – year: 1997 ident: 10.1016/j.tcs.2006.09.020_bib20 – ident: 10.1016/j.tcs.2006.09.020_bib25 – volume: 39 start-page: 64 issue: 4 year: 1996 ident: 10.1016/j.tcs.2006.09.020_bib9 article-title: The transis approach to high availability cluster communications publication-title: Comm. ACM doi: 10.1145/227210.227227 – volume: 14 start-page: 49 year: 2001 ident: 10.1016/j.tcs.2006.09.020_bib5 article-title: Performing tasks on synchronous restartable message-passing processors publication-title: Distributed Comput. doi: 10.1007/PL00008926 – volume: 2 start-page: 219 issue: 3 year: 1989 ident: 10.1016/j.tcs.2006.09.020_bib22 article-title: An introduction to input/output automata publication-title: CWI Quarterly – ident: 10.1016/j.tcs.2006.09.020_bib23 – volume: 39 start-page: 54 issue: 4 year: 1996 ident: 10.1016/j.tcs.2006.09.020_bib27 article-title: Totem: a fault-tolerant multicast group communication system publication-title: Comm. ACM doi: 10.1145/227210.227226 – ident: 10.1016/j.tcs.2006.09.020_bib10 doi: 10.1137/S0097539793255527 – ident: 10.1016/j.tcs.2006.09.020_bib19 – ident: 10.1016/j.tcs.2006.09.020_bib30 – ident: 10.1016/j.tcs.2006.09.020_bib32 – ident: 10.1016/j.tcs.2006.09.020_bib7 doi: 10.1145/277697.277739 – ident: 10.1016/j.tcs.2006.09.020_bib12 – ident: 10.1016/j.tcs.2006.09.020_bib14 doi: 10.1109/SFCS.1995.492674 – volume: 31 start-page: 11 issue: 2 year: 1997 ident: 10.1016/j.tcs.2006.09.020_bib1 article-title: Group membership and view synchrony in partitionable asynchronous distributed systems: specification publication-title: Operating Systems Rev. doi: 10.1145/250007.250010 – ident: 10.1016/j.tcs.2006.09.020_bib24 doi: 10.1007/3-540-40026-5_8 – year: 1994 ident: 10.1016/j.tcs.2006.09.020_bib3 – ident: 10.1016/j.tcs.2006.09.020_bib16 doi: 10.1007/3-540-45414-4_11 – ident: 10.1016/j.tcs.2006.09.020_bib33 doi: 10.1007/BFb0056495 – ident: 10.1016/j.tcs.2006.09.020_bib2 doi: 10.1109/ICDCS.1998.679501 – volume: 39 start-page: 76 issue: 4 year: 1996 ident: 10.1016/j.tcs.2006.09.020_bib29 article-title: Horus: a flexible group communication system publication-title: Comm. ACM doi: 10.1145/227210.227229 – ident: 10.1016/j.tcs.2006.09.020_bib11 doi: 10.1109/ICDCS.1995.500032 – ident: 10.1016/j.tcs.2006.09.020_bib28 – ident: 10.1016/j.tcs.2006.09.020_bib21 doi: 10.1145/259380.259424 – ident: 10.1016/j.tcs.2006.09.020_bib6 doi: 10.1145/227210.227225 – ident: 10.1016/j.tcs.2006.09.020_bib26 doi: 10.1145/383962.384048 – volume: 34 start-page: 848 issue: 4 year: 2005 ident: 10.1016/j.tcs.2006.09.020_bib18 article-title: Work-competitive scheduling for cooperative computing with dynamic groups publication-title: SIAM J. Comput. (SICOMP) doi: 10.1137/S0097539704440442 – ident: 10.1016/j.tcs.2006.09.020_bib31 doi: 10.1145/2786.2793
SSID	ssj0000576
Score	1.8353907
Snippet	This work considers the problem of efficiently performing a set of tasks using a network of processors in the setting where the network is subject to dynamic...
SourceID	pascalfrancis crossref elsevier
SourceType	Index Database Enrichment Source Publisher
StartPage	348
SubjectTerms	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Computer systems performance. Reliability Dynamic networks Exact sciences and technology Flows in networks. Combinatorial problems Group communications Load balancing Operational research and scientific management Operational research. Management science Scheduling Software Theoretical computing
Title	Dynamic load balancing with group communication
URI	https://dx.doi.org/10.1016/j.tcs.2006.09.020
Volume	369
WOSCitedRecordID	wos000242765000024&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: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELeg4wGE-BigjY8pDzwxufgjsePHCYYAwYREkfoWOY6jbSpJtXTT_nzOseO0m5gAiZeoSpvE9f18dznf3Q-h14ykJteyxpazDKelYFiRssKqrllmU85F2Uv6izw6yudz9S2k23Y9nYBsmvzyUi3_q6jhHAjblc7-hbjjTeEEfAahwxHEDsc_Evx7zzG_v2g1OJcuc9HEgGtfw-HSyMeikHXvdLZW1WgC3cN-sJHR420XMCIXMz1etD9PYoTGgqnRY652G784voBBdiHQGutprkQbKMO-3tKHwK6VwfjSK7e9ojwFytR6TZpLhRnzDMaDquWelmUDU15xct9vM9hg7jkGrql3H2k4na5MF_aR1JQwMtqymGH43Y3JDYmI3ovLb6MtBu9GZIK2Dj4dzj-P5jqTfkM7_Idh67tPArzyoN85L_eXugPR1J4LZc1BmT1CD8KbRXLgEfEY3bLNNno4sHYkQYlvo3tfY6fe7gl6G-CSOLgkES6Jg0vSwyXZgMtT9OPD4ezdRxxINLDhTK5wRagGt9qCn6Y048YyXlPNrU5lTStDM1iU1FbgqOkss6YkrGSaVY6nrKTaUP4MTZq2sTsoETXXeeZa4hlY4RUvc8lKWfFaCiErbXcRGWanMKHDvCM6WRRDKuFpARPqmE9FQVQBE7qL3sRLlr69yk0_TocpLwL2vd9XAD5uumxvQzzjg3JOmeDi-b_d9wW6O66Ql2iyOju3r9Adc7E66c72Asx-Aclhk7o
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=Dynamic+load+balancing+with+group+communication&rft.jtitle=Theoretical+computer+science&rft.au=Dolev%2C+Shlomi&rft.au=Segala%2C+Roberto&rft.au=Shvartsman%2C+Alexander&rft.date=2006-12-15&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=369&rft.issue=1&rft.spage=348&rft.epage=360&rft_id=info:doi/10.1016%2Fj.tcs.2006.09.020&rft.externalDocID=S0304397506006128
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon