2026-09-19T03:45:17Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/664492022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

David Robinson and Frans Kaashoek. Mutiso, Herman M Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2011-10-17T21:27:16Z 2011-10-17T21:27:16Z 2011 2011 http://hdl.handle.net/1721.1/66449 755803763 Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011. Cataloged from PDF version of thesis. Includes bibliographical references (p. 33). The demand for increased data availability and reliability of storage systems has contributed to the design and deployment of multi-node data storage clusters. This paper presents a simulator of one such multi-node, multi-machine cluster. The simulator is architected by extending the NetApp, Inc. 2-node cluster architecture to an N-node design. Data availability is provided by mirroring client requests to a subset of peers in the multi-node cluster. Using this simulator, this thesis explores the relationship between the number of peers that each node mirrors to and the overall mirroring latency. This thesis also explores the performance cost incurred when, in response to a mirroring request from a peer node, a node stores the mirrored data in nonvolatile storage before acknowledgment. Using a workload consisting of multiple write requests to different nodes in the simulator, this thesis finds that there exists a linear relationship between the number of mirroring peers in a cluster and the resulting mirroring latency. Experiments using this workload also reveal a 40% increase in mirroring latency when the mirroring requests are stored on peer nodes persistent storage as opposed to volatile memory. by Herman M. Mutiso. M.Eng. 33 p. 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. Multi-node mirrored NVRAM in a virtualized environment Multi-node mirrored non-volatile random-access memory in a virtualized environment Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ea9f5d40-d51f-4b96-8bbf-53798c06754d"> <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>Multi-node mirrored NVRAM in a virtualized environment</Title> <Subtitle>Multi-node mirrored non-volatile random-access memory in a virtualized environment</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2011</PublicationDate> <Authors> <Author> <DisplayName>Mutiso, Herman 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>The demand for increased data availability and reliability of storage systems has contributed to the design and deployment of multi-node data storage clusters. This paper presents a simulator of one such multi-node, multi-machine cluster. The simulator is architected by extending the NetApp, Inc. 2-node cluster architecture to an N-node design. Data availability is provided by mirroring client requests to a subset of peers in the multi-node cluster. Using this simulator, this thesis explores the relationship between the number of peers that each node mirrors to and the overall mirroring latency. This thesis also explores the performance cost incurred when, in response to a mirroring request from a peer node, a node stores the mirrored data in nonvolatile storage before acknowledgment. Using a workload consisting of multiple write requests to different nodes in the simulator, this thesis finds that there exists a linear relationship between the number of mirroring peers in a cluster and the resulting mirroring latency. Experiments using this workload also reveal a 40% increase in mirroring latency when the mirroring requests are stored on peer nodes persistent storage as opposed to volatile memory.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>