2026-09-19T00:42:36Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/333472022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Larry Rudolph.
Roewe, James M
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2006-07-13T15:17:08Z
2006-07-13T15:17:08Z
2005
2005
http://hdl.handle.net/1721.1/33347
62412303
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Includes bibliographical references (p. 67-68).
Partial system snapshots reduce the cost per node to only depend on the size of the connected group instead of the size of the full system. These groups can be determined during system operation by using the communication patterns between nodes. The number of nodes that must rollback after a failure is limited to the size of these snapshot groups, reducing the work lost. These changes to snapshot algorithms are necessary because the cost per node for a snapshot increases and the expected time between failures decreases as the size of the system grows.
by James M. Roewe.
M.Eng.
68 p.
3070535 bytes
3073286 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Fault tolerant dynamic agent systems
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="0e47bce0-1ad6-43c8-9454-811c2c989116">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Fault tolerant dynamic agent systems</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>Roewe, James M</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Partial system snapshots reduce the cost per node to only depend on the size of the connected group instead of the size of the full system. These groups can be determined during system operation by using the communication patterns between nodes. The number of nodes that must rollback after a failure is limited to the size of these snapshot groups, reducing the work lost. These changes to snapshot algorithms are necessary because the cost per node for a snapshot increases and the expected time between failures decreases as the size of the system grows.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>