Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems

Large-scale distributed systems such as supercomputers and peer-to-peer systems typically have a fully connected logical topology over a large number of processors. Existing snapshot algorithms in such systems have high response time and/or require a large number of messages, typically O(n 2 ), wher...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems Jg. 21; H. 9; S. 1281 - 1289
1. Verfasser: Kshemkalyani, Ajay D
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.09.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Balancing
Channels
checkpoint
Checkpointing
cluster
Clustering algorithms
Computer networks
Delay
distributed snapshot
Distributed system
global state
hypercube
Hypercubes
Joining processes
Large-scale systems
Message passing
Messages
overlay
Peer to peer computing
Response time
supercomputer
Supercomputers
Topology
Workload
ISSN:1045-9219, 1558-2183
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Large-scale distributed systems such as supercomputers and peer-to-peer systems typically have a fully connected logical topology over a large number of processors. Existing snapshot algorithms in such systems have high response time and/or require a large number of messages, typically O(n 2 ), where n is the number of processes. In this paper, we present a suite of two algorithms: simple_tree, and hypercube, that are both fast and require a small number of messages. This makes the algorithms highly scalable. Simple_tree requires O(n) messages and has O(log n) response time. Hypercube requires O(n log n) messages and has O(log n) response time, in addition to having the property that the roles of all the processes are symmetrical. Process symmetry implies greater potential for balanced workload and congestion-freedom. All the algorithms assume non-FIFO channels.
AbstractList Large-scale distributed systems such as supercomputers and peer-to-peer systems typically have a fully connected logical topology over a large number of processors. Existing snapshot algorithms in such systems have high response time and/or require a large number of messages, typically O(n^2), where n is the number of processes. In this paper, we present a suite of two algorithms: simple_tree, and hypercube, that are both fast and require a small number of messages. This makes the algorithms highly scalable. Simple_tree requires O(n) messages and has O(\log n) response time. Hypercube requires O(n \log n) messages and has O(\log n) response time, in addition to having the property that the roles of all the processes are symmetrical. Process symmetry implies greater potential for balanced workload and congestion-freedom. All the algorithms assume non-FIFO channels.
Large-scale distributed systems such as supercomputers and peer-to-peer systems typically have a fully connected logical topology over a large number of processors. Existing snapshot algorithms in such systems have high response time and/or require a large number of messages, typically O(n arrow up ), where n is the number of processes. In this paper, we present a suite of two algorithms: simple_tree, and hypercube, that are both fast and require a small number of messages. This makes the algorithms highly scalable. Simple_tree requires O(n) messages and has O(\log n) response time. Hypercube requires O(n \log n) messages and has O(\log n) response time, in addition to having the property that the roles of all the processes are symmetrical. Process symmetry implies greater potential for balanced workload and congestion-freedom. All the algorithms assume non-FIFO channels.
Author Kshemkalyani, Ajay D
Author_xml – sequence: 1
  givenname: Ajay D
  surname: Kshemkalyani
  fullname: Kshemkalyani, Ajay D
  email: ajay@uic.edu
  organization: Comput. Sci. Dept., Univ. of Illinois at Chicago, Chicago, IL, USA
BookMark eNp1kL1PwzAQxS1UJGhhY2OxxMBCiu3Y-RhRy5dUBFJhYIouzqU1SuNiOwP_Pa6KGJC45e6k33t3emMy6m2PhJxxNuWcldevL_PlVLC4CnlAjrlSRSJ4kY7izKRKSsHLIzL2_oMxLhWTx-T9Dnyg0Df0Cb2HFSa3bWu0wT7Q-87W0NFlD1u_toHedCvrTFhvPG2towtwEV9q6JDOjQ_O1EPAhi6_fMCNPyGHLXQeT3_6hLzd3b7OHpLF8_3j7GaR6JSrkGQ1pKxOa4mZRmSl5kqiUEVTgGprWZSaxQLIVKozWWZ1WeYN1K3UDUOWQTohl3vfrbOfA_pQbYzX2HXQox18lRe5SOOpIpIXf8gPO7g-PldxJvK84CqSE3K1p7Sz3jtsq60zG3BfEap2MVe7mKtdzJWQERd_cG0CBGP74MB0_4nO9yKDiL_-SjLOVZZ-Awtbisg
CODEN ITDSEO
CitedBy_id crossref_primary_10_1007_s00224_014_9599_8
crossref_primary_10_1016_j_jpdc_2013_01_003
crossref_primary_10_1155_2013_970597
crossref_primary_10_1109_TPDS_2012_139
crossref_primary_10_1016_j_jpdc_2013_09_009
crossref_primary_10_1587_transfun_E95_A_2309
crossref_primary_10_4018_IJACI_2019070103
crossref_primary_10_1002_cpe_5647
crossref_primary_10_3390_s20226446
crossref_primary_10_1177_0037549713485499
crossref_primary_10_3390_electronics11071127
crossref_primary_10_1049_2024_6582682
Cites_doi 10.1007/s12083-008-0025-3
10.1145/258492.258523
10.1109/COLCOM.2005.1651214
10.1109/ICDCS.1989.37930
10.1109/SASO.2008.44
10.1145/1363686.1363800
10.1016/j.comnet.2005.12.009
10.1109/SCC.2006.2
10.1145/339331.339345
10.1109/NCM.2008.117
10.1109/SC.2004.29
10.1145/1273340.1273350
10.1145/1183401.1183406
10.1109/P2P.2006.17
10.1109/ISPDC.2006.31
10.1007/3-540-45074-2_11
10.1109/JSAC.2003.818784
10.1109/GCC.2006.9
10.1109/71.595580
10.1145/1230040.1230058
10.1109/TPDS.2009.108
10.1145/1323293.1294281
10.1145/1186675.1186679
10.1016/0020-0190(87)90125-6
10.1145/1408654.1408658
10.1007/3-540-45748-8_5
10.1088/0967-1846/2/4/005
10.1145/1542245.1542273
10.1109/TKDE.2007.190641
10.1109/TSE.2007.1000
10.1109/MPIDC.1996.534093
10.1145/1183401.1183439
10.1145/1582716.1582741
10.1109/71.737697
10.1109/71.752783
10.1145/1290672.1290674
10.1109/71.798312
10.1145/781512.781513
10.1145/782814.782847
10.1145/568522.568525
10.1109/ICN.2007.65
10.1109/CLUSTR.2009.5289139
10.1109/NCM.2008.120
10.1145/780542.780626
10.1016/j.jpdc.2008.04.006
10.1006/jpdc.1993.1075
10.1145/1242572.1242618
10.1145/4221.4227
10.1007/11549468_109
10.1145/214451.214456
10.1145/1006209.1006248
10.1016/j.comnet.2006.02.001
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2010
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Sep 2010
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TPDS.2010.24
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications 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
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1558-2183
EndPage 1289
ExternalDocumentID 2720456021
10_1109_TPDS_2010_24
5401156
Genre orig-research
GroupedDBID --Z
-~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
ICLAB
IEDLZ
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNI
RNS
RZB
TN5
TWZ
UHB
VH1
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
RIG
F28
FR3
ID FETCH-LOGICAL-c315t-6ba30b3b4e6cee09c154e258d8a5fb489c0000aa653c6496b997dabf4cd0e06a3
IEDL.DBID RIE
ISICitedReferencesCount 19
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000280169200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1045-9219
IngestDate Thu Sep 25 08:52:55 EDT 2025
Sun Jun 29 12:21:09 EDT 2025
Tue Nov 18 22:31:03 EST 2025
Sat Nov 29 03:36:03 EST 2025
Wed Aug 27 02:52:20 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c315t-6ba30b3b4e6cee09c154e258d8a5fb489c0000aa653c6496b997dabf4cd0e06a3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
PQID 1027781523
PQPubID 85437
PageCount 9
ParticipantIDs ieee_primary_5401156
proquest_journals_1027781523
proquest_miscellaneous_787233158
crossref_primary_10_1109_TPDS_2010_24
crossref_citationtrail_10_1109_TPDS_2010_24
PublicationCentury 2000
PublicationDate 2010-09-01
PublicationDateYYYYMMDD 2010-09-01
PublicationDate_xml – month: 09
  year: 2010
  text: 2010-09-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev TPDS
PublicationYear 2010
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References grolimund (ref26) 2006
ref13
ref56
ref12
grama (ref25) 2003
ref53
ref52
ref11
ref54
ref10
crowther (ref15) 2001
ref17
rowstron (ref57) 2001
ref19
ref18
maymounkov (ref49) 2002
fan (ref21) 2008
ref50
berndt (ref8) 2008
ref46
ref45
ref41
ref43
de candia (ref16) 2007
(ref66) 2009
ref7
coti (ref14) 2006
ref9
ref4
ref3
mattern (ref47) 1988
ref6
ref5
ref40
ref35
ref34
ref37
ref36
ref31
ref30
fahrenholtz (ref20) 2008
kuhn (ref38) 2005
ref33
locher (ref44) 2007
ref32
mattern (ref48) 1993; 18
ref2
ref1
ref39
ref24
ref67
ref23
naor (ref51) 2007; 3
ref64
ref63
ref22
ref65
schandl (ref58) 2004
liu (ref42) 2003
ref28
ref27
ref29
ren (ref55) 2006
schlosser (ref59) 2002
ref60
ref62
ref61
References_xml – ident: ref41
  doi: 10.1007/s12083-008-0025-3
– ident: ref54
  doi: 10.1145/258492.258523
– ident: ref19
  doi: 10.1109/COLCOM.2005.1651214
– ident: ref65
  doi: 10.1109/ICDCS.1989.37930
– ident: ref3
  doi: 10.1109/SASO.2008.44
– year: 2003
  ident: ref42
  article-title: Neighbour Table Construction and Update in a Dynamic Peer-to-Peer Network
  publication-title: Proc IEEE Int'l Conf Distributed Computing Systems
– year: 2008
  ident: ref20
  publication-title: A Hypercube-Based Peer-to-Peer Data Store Resilient against Peer Population Fluctuation
– year: 2004
  ident: ref58
  publication-title: OPAX?An Open Peer-to-Peer Architecture for XML Message Exchange
– ident: ref50
  doi: 10.1145/1363686.1363800
– ident: ref40
  doi: 10.1016/j.comnet.2005.12.009
– ident: ref63
  doi: 10.1109/SCC.2006.2
– ident: ref9
  doi: 10.1145/339331.339345
– ident: ref29
  doi: 10.1109/NCM.2008.117
– ident: ref61
  doi: 10.1109/SC.2004.29
– volume: 3
  year: 2007
  ident: ref51
  article-title: Novel Achitectures for P2P Applications: The Continuous-Discrete Approach
  publication-title: ACM Trans Algorithms
  doi: 10.1145/1273340.1273350
– ident: ref53
  doi: 10.1145/1183401.1183406
– ident: ref43
  doi: 10.1109/P2P.2006.17
– ident: ref18
  doi: 10.1109/ISPDC.2006.31
– ident: ref60
  doi: 10.1007/3-540-45074-2_11
– ident: ref67
  doi: 10.1109/JSAC.2003.818784
– year: 2003
  ident: ref25
  publication-title: Introduction to Parallel Computing
– start-page: 508
  year: 2006
  ident: ref55
  article-title: A Hypercube Based P2P Information Service for Data Grid
  publication-title: Proc Fifth Int'l Conf Grid and Cooperative Computing
  doi: 10.1109/GCC.2006.9
– ident: ref46
  doi: 10.1109/71.595580
– year: 2006
  ident: ref14
  article-title: Blocking vs. Non-Blocking Coordinated Checkpointing for Large-Scale Fault Tolerant MPI
  publication-title: Proc Int'l Conf Supercomputing
– year: 2008
  ident: ref8
  article-title: Using Symmetric Distributed Processing for Peer-to-Peer VoIP Conferencing in Auditory Virtual Environments
  publication-title: Proc Int'l Workshop on Peer-to-Peer Systems (IPTPS)
– ident: ref27
  doi: 10.1145/1230040.1230058
– ident: ref24
  doi: 10.1109/TPDS.2009.108
– start-page: 205
  year: 2007
  ident: ref16
  article-title: Dynamo: Amazon's Highly Available Key-Value Store
  publication-title: Proc 7th ACM SIGOPS Symp Operating Systems Principles
  doi: 10.1145/1323293.1294281
– ident: ref52
  doi: 10.1145/1186675.1186679
– ident: ref39
  doi: 10.1016/0020-0190(87)90125-6
– ident: ref34
  doi: 10.1145/1408654.1408658
– start-page: 329
  year: 2001
  ident: ref57
  article-title: Pastry: Scalable Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems
  publication-title: Proc 1F1P/ACM Int'l Conf Distributed Systems Platforms
– start-page: 53
  year: 2002
  ident: ref49
  article-title: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
  publication-title: Proc First Int'l Workshop Peer-to-Peer Systems (IPTPS)
  doi: 10.1007/3-540-45748-8_5
– start-page: 13
  year: 2005
  ident: ref38
  article-title: A Self-Repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
  publication-title: Proc Int'l Workshop on Peer-to-Peer Systems (IPTPS)
– ident: ref35
  doi: 10.1088/0967-1846/2/4/005
– ident: ref45
  doi: 10.1145/1542245.1542273
– ident: ref33
  doi: 10.1109/TKDE.2007.190641
– year: 2009
  ident: ref66
  publication-title: TOP 500 Supercomputer Sites
– year: 2008
  ident: ref21
  article-title: Design Issues for Peer-to-Peer Massively Multiplayer Online Games
  publication-title: Proc Second Int'l Workshop Massively Multiplayer Virtual Environments
– ident: ref36
  doi: 10.1109/TSE.2007.1000
– ident: ref62
  doi: 10.1109/MPIDC.1996.534093
– ident: ref23
  doi: 10.1145/1183401.1183439
– ident: ref32
  doi: 10.1145/1582716.1582741
– ident: ref12
  doi: 10.1109/71.737697
– ident: ref7
  doi: 10.1109/71.752783
– start-page: 215
  year: 1988
  ident: ref47
  article-title: Virtual Time and Global States of Distributed Systems
  publication-title: Proc Workshop Parallel and Distributed Algorithms
– ident: ref4
  doi: 10.1145/1290672.1290674
– ident: ref31
  doi: 10.1109/71.798312
– start-page: 388
  year: 2007
  ident: ref44
  article-title: Push-to-Pull Peer-to-Peer Live Streaming
  publication-title: Proc 21st Int'l Symp Distributed Computing (DISC)
– ident: ref10
  doi: 10.1145/781512.781513
– ident: ref11
  doi: 10.1145/782814.782847
– ident: ref17
  doi: 10.1145/568522.568525
– ident: ref28
  doi: 10.1109/ICN.2007.65
– ident: ref37
  doi: 10.1109/CLUSTR.2009.5289139
– year: 2001
  ident: ref15
  article-title: Hypercubes: A Superior Topology for Real-Time Genealogical Collaboration Networks
  publication-title: Proc Family History Technology Workshop
– ident: ref30
  doi: 10.1109/NCM.2008.120
– ident: ref1
  doi: 10.1145/780542.780626
– ident: ref6
  doi: 10.1016/j.jpdc.2008.04.006
– volume: 18
  start-page: 423
  year: 1993
  ident: ref48
  article-title: Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation
  publication-title: J Parallel and Distributed Computing
  doi: 10.1006/jpdc.1993.1075
– year: 2002
  ident: ref59
  article-title: Ontology-Based Search and Broadcast in HyperCuP
  publication-title: Proc Int'l Semantic Web Conf
– year: 2006
  ident: ref26
  article-title: Havelaar: A Robust and Efficient Reputation System for Active Peer-to-Peer Systems
  publication-title: Proc First Workshop Economics of Netioorked Systems (NetEcon)
– ident: ref64
  doi: 10.1145/1242572.1242618
– ident: ref5
  doi: 10.1145/4221.4227
– ident: ref22
  doi: 10.1007/11549468_109
– ident: ref13
  doi: 10.1145/214451.214456
– ident: ref2
  doi: 10.1145/1006209.1006248
– ident: ref56
  doi: 10.1016/j.comnet.2006.02.001
SSID ssj0014504
Score 2.0621293
Snippet Large-scale distributed systems such as supercomputers and peer-to-peer systems typically have a fully connected logical topology over a large number of...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1281
SubjectTerms Algorithms
Balancing
Channels
checkpoint
Checkpointing
cluster
Clustering algorithms
Computer networks
Delay
distributed snapshot
Distributed system
global state
hypercube
Hypercubes
Joining processes
Large-scale systems
Message passing
Messages
overlay
Peer to peer computing
Response time
supercomputer
Supercomputers
Topology
Workload
Title Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems
URI https://ieeexplore.ieee.org/document/5401156
https://www.proquest.com/docview/1027781523
https://www.proquest.com/docview/787233158
Volume 21
WOSCitedRecordID wos000280169200005&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: PRVIEE
  databaseName: IEEE Xplore
  customDbUrl:
  eissn: 1558-2183
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014504
  issn: 1045-9219
  databaseCode: RIE
  dateStart: 19900101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB5UPOjBt7i-yEFPWq1tmsdR1MWDirAKeippMquCtrLt-vudtN2iqAdvhaah5OtkvulMvgHYM1pZLxoTKGMFBSjOBhojClwl5478y0krmX8lb27Uw4O-nYLD7iwMItbFZ3jkL-tcvivs2P8qOyZ2QQRGTMO0lLI5q9VlDHhStwqk6CIJNJlhV-Suj-9uzwdNEVfEv7mfup_Kj0249iz9xf-90xIstAySnTaQL8MU5iuwOOnOwFpjXYH5L1KDq_DYN2XFTO7YtW968oTBRS0eQZOzRvefDXLzXj4XFTt9fSpGL9XzW8mI0rIrXyweDAhMZOdeZ9e3yELHWrHzNbjvX9ydXQZtW4XAxidJFYjMxGEWZxwFechQW2JRGCXKKZMMM6609U7MGJHEVnAtMq2lM9mQWxdiKEy8DjN5keMGsMQ6Ch8RhRomXIZDnVGE42hKFIaYFPbgYLLaqW01x33ri9e0jj1CnXpsUo9NGvEe7Hej3xutjT_GrXocujEtBD3YngCZtoZY0vORlIpIStwD1t0mE_J5EZNjMS5T2rOimJZGbf4-8RbMNTUDvrJsG2aq0Rh3YNZ-VC_laLf-DD8BZ1zbdw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fT9swED4BQ2J7WMePiW5s88N4GqFpYjv2IxpUnVYqpHYSPEWOfQUkSFCT7u_fOUmjoW0Pe4sUx4r85Xzf5c7fAXw2WlkvGhMoYyUFKM4GGiMKXBPOHfmXYSuZP0mmU3V9ra824KQ7C4OIdfEZnvrLOpfvCrvyv8oGxC6IwMhNeCE4j4bNaa0uZ8BF3SyQ4gsRaDLErsxdD-ZX57OmjCvizxxQ3VHlj2249i2j3v-91Rt43XJIdtaAvgsbmO9Bb92fgbXmugevfhMb3IebkSkrZnLHLn3bk1sMLmr5CJqcNcr_bJabp_KuqNjZw22xvK_uHktGpJZNfLl4MCM4kZ17pV3fJAsda-XOD-DH6GL-dRy0jRUCGw9FFcjMxGEWZxwl-chQW-JRGAnllBGLjCttvRszRorYSq5lpnXiTLbg1oUYShO_ha28yPEQmLCOAkhEqRaCJ-FCZxTjOJoSpSEuhX34sl7t1Laq4775xUNaRx-hTj02qccmjXgfjrvRT43axj_G7XscujEtBH04WgOZtqZY0vNRkiiiKXEfWHebjMhnRkyOxapMadeKYloa9e7vE3-CnfH8cpJOvk2_v4eXTQWBrzM7gq1qucIPsG1_Vvfl8mP9Sf4C9azevg
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=Fast+and+Message-Efficient+Global+Snapshot+Algorithms+for+Large-Scale+Distributed+Systems&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Kshemkalyani%2C+Ajay+D&rft.date=2010-09-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1045-9219&rft.eissn=1558-2183&rft.volume=21&rft.issue=9&rft.spage=1281&rft_id=info:doi/10.1109%2FTPDS.2010.24&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2720456021
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon