{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_51971"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_51971","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"Tracing Distributed Algorithms Using Replay Clocks","abstract":"Thesis (M.S.)--Michigan State University. Computer Science - Master of Science, 2024","abstract_html":"Thesis (M.S.)--Michigan State University. Computer Science - Master of Science, 2024","abstract_has_math":false,"creators":["Lagwankar, Ishaan Kiran"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Kulkarni, Sandeep S","Xiao, Li","McKinley, Phillip K"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024","date_published":"2024","updated_at":"2026-11-18T18:58:46Z","subjects":["Computer science"],"languages":["eng"],"rights":["Attribution 4.0 International"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:51971","local:Lagwankar_grad.msu_0128N_20850"],"render_values":[{"text":"etd:51971","href":null,"code":true},{"text":"local:Lagwankar_grad.msu_0128N_20850","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/cbq9-be16","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/cbq9-be16","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_51971","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kulkarni, Sandeep S","Xiao, Li","McKinley, Phillip K"]},{"key":"dc:creator","label":"Author","values":["Lagwankar, Ishaan Kiran"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2024"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["text","Electronic dissertations"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution 4.0 International"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:51971","local:Lagwankar_grad.msu_0128N_20850","https://doi.org/doi:10.25335/cbq9-be16"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M.S.)--Michigan State University. Computer Science - Master of Science, 2024","In this thesis, we introduce replay clocks ($\\repcl$), a novel clock infrastructure that allows us to do offline analyses of distributed computations. The replay clock structure provides a methodology to \\textit{replay} a computation as it happened, with the ability to represent concurrent events effectively. It builds on the structures introduced by vector clocks ($\\vc$) and the Hybrid Logical Clock ($\\hlc$), combining their infrastructures to provide efficient replay. With such a clock, a user can replay a computation whilst considering multiple paths of executions, and check for constraint violations and properties that potential pathways could take, especially in the presence of concurrent events. Specifically, if event $e$ must occur before $f$ then the replay clock must ensure that $e$ is replayed before $f$. On the other hand, if $e$ and $f$ could occur in any order, replay should not force an order between them. After identifying the limitations of existing clocks to provide the replay primitive, we present the $\\repcl$ structure and identify an efficient representation for the same. We demonstrate that $\\repcl$ can be implemented with less than four integers for 64 processes for various system parameters if clocks are synchronized within $1ms$. Furthermore, the overhead of $\\repcl$ (for computing/comparing timestamps and message size) is proportional to the size of the clock. Using simulations in a custom distributed system and NS-3, a state-of-the-art network simulator, we identify the expected overhead of $\\repcl$ based on the given system settings. We also identify how a user can then identify feasibility region for $\\repcl$. Specifically, given the desired overhead of $\\repcl$, it identifies the region where unabridged replay is possible. Using the $\\repcl$, we provide a tracer for distributed computations, that allows any computation using the $\\repcl$ to be replayed efficiently. The visualization allows users to analyze specific properties and constraints in an online fashion, with the ability to consider concurrent paths independently. The visualization provides per-process views and an overarching view of the whole computation based on the time recorded by the $\\repcl$ for each event.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf","1 online resource (64 p.) : ill."]},{"key":"dc:title","label":"Title","values":["Tracing Distributed Algorithms Using Replay Clocks"]}]}],"canonical_facts":{"dc:contributor":["Kulkarni, Sandeep S","Xiao, Li","McKinley, Phillip K"],"dc:creator":["Lagwankar, Ishaan Kiran"],"dc:date":["2024"],"dc:description":["Thesis (M.S.)--Michigan State University. Computer Science - Master of Science, 2024","In this thesis, we introduce replay clocks ($\\repcl$), a novel clock infrastructure that allows us to do offline analyses of distributed computations. The replay clock structure provides a methodology to \\textit{replay} a computation as it happened, with the ability to represent concurrent events effectively. It builds on the structures introduced by vector clocks ($\\vc$) and the Hybrid Logical Clock ($\\hlc$), combining their infrastructures to provide efficient replay. With such a clock, a user can replay a computation whilst considering multiple paths of executions, and check for constraint violations and properties that potential pathways could take, especially in the presence of concurrent events. Specifically, if event $e$ must occur before $f$ then the replay clock must ensure that $e$ is replayed before $f$. On the other hand, if $e$ and $f$ could occur in any order, replay should not force an order between them. After identifying the limitations of existing clocks to provide the replay primitive, we present the $\\repcl$ structure and identify an efficient representation for the same. We demonstrate that $\\repcl$ can be implemented with less than four integers for 64 processes for various system parameters if clocks are synchronized within $1ms$. Furthermore, the overhead of $\\repcl$ (for computing/comparing timestamps and message size) is proportional to the size of the clock. Using simulations in a custom distributed system and NS-3, a state-of-the-art network simulator, we identify the expected overhead of $\\repcl$ based on the given system settings. We also identify how a user can then identify feasibility region for $\\repcl$. Specifically, given the desired overhead of $\\repcl$, it identifies the region where unabridged replay is possible. Using the $\\repcl$, we provide a tracer for distributed computations, that allows any computation using the $\\repcl$ to be replayed efficiently. The visualization allows users to analyze specific properties and constraints in an online fashion, with the ability to consider concurrent paths independently. The visualization provides per-process views and an overarching view of the whole computation based on the time recorded by the $\\repcl$ for each event.","Description based on online resource. Title from PDF t.p. (Michigan State University Fedora Repository, viewed ).","Includes bibliographical references."],"dc:format":["application/pdf","1 online resource (64 p.) : ill."],"dc:identifier":["etd:51971","local:Lagwankar_grad.msu_0128N_20850","https://doi.org/doi:10.25335/cbq9-be16"],"dc:language":["eng"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["Attribution 4.0 International"],"dc:subject":["Computer science"],"dc:title":["Tracing Distributed Algorithms Using Replay Clocks"],"dc:type":["text","Electronic dissertations"]},"updated_at":"2026-11-18T18:58:46Z"}