{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/112956"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/112956","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Temporal synchronization of emulated and simulated models for assessment of networked systems","abstract":"\"Network experimentation practices rely on emulation or simulation methods to test new ideas. But it is difficult to exclusively simulate or emulate a broad class of emerging cyber-physical applications without incurring significant cost or loss of fidelity. This is because they involve complex interactions between cyber-entities/nodes and live physical environments over different types of networks. Analysis of such applications can be greatly simplified by constructing co-simulated models of the system where cost-effective simulations of a physical environment and the underlying network are temporally integrated with high fidelity emulations of the core application logic. In a co-simulation, certain components of the system are simulated while others are emulated. The execution of emulated and simulated components is synchronized to a shared virtual clock. The practical utility of a co-simulation platform depends on some crucial factors. Precise control over the scheduling order of emulated processes is required to make the behavior of the co-simulation independent of the CPU resources of the platform hosting it. The accuracy of ascribed virtual time for each emulated execution burst controls the rate of advancement of time perceived by the application, and the overhead associated with time synchronization between emulated and simulated components of the model affects the overall time taken for each unit of virtual time advancement. This dissertation is an attempt to tackle these challenges. We propose kernel level modifications and compiler based instrumentation of emulated code for precise instruction level tracking of process execution and control over execution order of emulated containers. This is combined with a mechanism to ascribe virtual time for each execution burst based on the sequence of executed instructions. We also discuss novel approaches to reduce virtual time synchronization overhead. This relies on compiler-based estimation of \"\"lookahead\"\", which identifies epochs of emulated execution during which a process can be predicted to act independently of any other. Through evaluations, we show that our approaches enable fast, accurate and reproducible execution of co-simulated models.\"","abstract_html":""Network experimentation practices rely on emulation or simulation methods to test new ideas. But it is difficult to exclusively simulate or emulate a broad class of emerging cyber-physical applications without incurring significant cost or loss of fidelity. This is because they involve complex interactions between cyber-entities/nodes and live physical environments over different types of networks. Analysis of such applications can be greatly simplified by constructing co-simulated models of the system where cost-effective simulations of a physical environment and the underlying network are temporally integrated with high fidelity emulations of the core application logic. In a co-simulation, certain components of the system are simulated while others are emulated. The execution of emulated and simulated components is synchronized to a shared virtual clock. The practical utility of a co-simulation platform depends on some crucial factors. Precise control over the scheduling order of emulated processes is required to make the behavior of the co-simulation independent of the CPU resources of the platform hosting it. The accuracy of ascribed virtual time for each emulated execution burst controls the rate of advancement of time perceived by the application, and the overhead associated with time synchronization between emulated and simulated components of the model affects the overall time taken for each unit of virtual time advancement. This dissertation is an attempt to tackle these challenges. We propose kernel level modifications and compiler based instrumentation of emulated code for precise instruction level tracking of process execution and control over execution order of emulated containers. This is combined with a mechanism to ascribe virtual time for each execution burst based on the sequence of executed instructions. We also discuss novel approaches to reduce virtual time synchronization overhead. This relies on compiler-based estimation of ""lookahead"", which identifies epochs of emulated execution during which a process can be predicted to act independently of any other. Through evaluations, we show that our approaches enable fast, accurate and reproducible execution of co-simulated models."","abstract_has_math":false,"creators":["Babu, Vignesh"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Nicol, David Malcom","Borisov, Nikita","Caesar, Matthew","Kalbarczyk, Zbigniew","Liu, Jason"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-01-12T21:45:15Z","date_published":"2022-01-12T21:45:15Z","updated_at":"2026-07-22T22:24:52Z","subjects":["Virtual Time","Modeling","Simulation","Network Emulation","Lookahead Extraction","Virtualization","Synchronization"],"languages":["en"],"rights":["Copyright 2021 Vignesh Babu"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/112956","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nicol, David Malcom","Borisov, Nikita","Caesar, Matthew","Kalbarczyk, Zbigniew","Liu, Jason"]},{"key":"dc:creator","label":"Author","values":["Babu, Vignesh"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2022-01-12T21:45:15Z","2021-06-03","2021-08"]},{"key":"dc:type","label":"Dc Type","values":["text","Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Virtual Time","Modeling","Simulation","Network Emulation","Lookahead Extraction","Virtualization","Synchronization"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2021 Vignesh Babu"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/112956"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["\"Network experimentation practices rely on emulation or simulation methods to test new ideas. But it is difficult to exclusively simulate or emulate a broad class of emerging cyber-physical applications without incurring significant cost or loss of fidelity. This is because they involve complex interactions between cyber-entities/nodes and live physical environments over different types of networks. Analysis of such applications can be greatly simplified by constructing co-simulated models of the system where cost-effective simulations of a physical environment and the underlying network are temporally integrated with high fidelity emulations of the core application logic. In a co-simulation, certain components of the system are simulated while others are emulated. The execution of emulated and simulated components is synchronized to a shared virtual clock. The practical utility of a co-simulation platform depends on some crucial factors. Precise control over the scheduling order of emulated processes is required to make the behavior of the co-simulation independent of the CPU resources of the platform hosting it. The accuracy of ascribed virtual time for each emulated execution burst controls the rate of advancement of time perceived by the application, and the overhead associated with time synchronization between emulated and simulated components of the model affects the overall time taken for each unit of virtual time advancement. This dissertation is an attempt to tackle these challenges. We propose kernel level modifications and compiler based instrumentation of emulated code for precise instruction level tracking of process execution and control over execution order of emulated containers. This is combined with a mechanism to ascribe virtual time for each execution burst based on the sequence of executed instructions. We also discuss novel approaches to reduce virtual time synchronization overhead. This relies on compiler-based estimation of \"\"lookahead\"\", which identifies epochs of emulated execution during which a process can be predicted to act independently of any other. Through evaluations, we show that our approaches enable fast, accurate and reproducible execution of co-simulated models.\"","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-01-12 without embargo terms","The student, Vignesh Babu, accepted the attached license on 2021-06-02 at 16:37.","The student, Vignesh Babu, submitted this Dissertation for approval on 2021-06-02 at 16:55.","This Dissertation was approved for publication on 2021-06-03 at 14:23.","DSpace SAF Submission Ingestion Package generated from Vireo submission #16668 on 2022-01-12 at 12:42:54","Made available in DSpace on 2022-01-12T21:45:15Z (GMT). No. of bitstreams: 4 BABU-DISSERTATION-2021.pdf: 3764030 bytes, checksum: 94e62301b7dff6cff7807ff9aedeea41 (MD5) Vignesh-Babu-PhD-Thesis-Latex-Source-Files.zip: 3882224 bytes, checksum: aabd8fadd75bdc66522e231058123e90 (MD5) LICENSE.txt: 4209 bytes, checksum: b47f809807258310eb9263572ba19007 (MD5) PROQUEST_LICENSE.txt: 4555 bytes, checksum: afa871998f36acf29089d3a45dc54712 (MD5) Previous issue date: 2021-06-03"]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Temporal synchronization of emulated and simulated models for assessment of networked systems"]}]}],"canonical_facts":{"dc:contributor":["Nicol, David Malcom","Borisov, Nikita","Caesar, Matthew","Kalbarczyk, Zbigniew","Liu, Jason"],"dc:creator":["Babu, Vignesh"],"dc:date":["2022-01-12T21:45:15Z","2021-06-03","2021-08"],"dc:description":["\"Network experimentation practices rely on emulation or simulation methods to test new ideas. But it is difficult to exclusively simulate or emulate a broad class of emerging cyber-physical applications without incurring significant cost or loss of fidelity. This is because they involve complex interactions between cyber-entities/nodes and live physical environments over different types of networks. Analysis of such applications can be greatly simplified by constructing co-simulated models of the system where cost-effective simulations of a physical environment and the underlying network are temporally integrated with high fidelity emulations of the core application logic. In a co-simulation, certain components of the system are simulated while others are emulated. The execution of emulated and simulated components is synchronized to a shared virtual clock. The practical utility of a co-simulation platform depends on some crucial factors. Precise control over the scheduling order of emulated processes is required to make the behavior of the co-simulation independent of the CPU resources of the platform hosting it. The accuracy of ascribed virtual time for each emulated execution burst controls the rate of advancement of time perceived by the application, and the overhead associated with time synchronization between emulated and simulated components of the model affects the overall time taken for each unit of virtual time advancement. This dissertation is an attempt to tackle these challenges. We propose kernel level modifications and compiler based instrumentation of emulated code for precise instruction level tracking of process execution and control over execution order of emulated containers. This is combined with a mechanism to ascribe virtual time for each execution burst based on the sequence of executed instructions. We also discuss novel approaches to reduce virtual time synchronization overhead. This relies on compiler-based estimation of \"\"lookahead\"\", which identifies epochs of emulated execution during which a process can be predicted to act independently of any other. Through evaluations, we show that our approaches enable fast, accurate and reproducible execution of co-simulated models.\"","Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-01-12 without embargo terms","The student, Vignesh Babu, accepted the attached license on 2021-06-02 at 16:37.","The student, Vignesh Babu, submitted this Dissertation for approval on 2021-06-02 at 16:55.","This Dissertation was approved for publication on 2021-06-03 at 14:23.","DSpace SAF Submission Ingestion Package generated from Vireo submission #16668 on 2022-01-12 at 12:42:54","Made available in DSpace on 2022-01-12T21:45:15Z (GMT). No. of bitstreams: 4 BABU-DISSERTATION-2021.pdf: 3764030 bytes, checksum: 94e62301b7dff6cff7807ff9aedeea41 (MD5) Vignesh-Babu-PhD-Thesis-Latex-Source-Files.zip: 3882224 bytes, checksum: aabd8fadd75bdc66522e231058123e90 (MD5) LICENSE.txt: 4209 bytes, checksum: b47f809807258310eb9263572ba19007 (MD5) PROQUEST_LICENSE.txt: 4555 bytes, checksum: afa871998f36acf29089d3a45dc54712 (MD5) Previous issue date: 2021-06-03"],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/112956"],"dc:language":["en"],"dc:rights":["Copyright 2021 Vignesh Babu"],"dc:subject":["Virtual Time","Modeling","Simulation","Network Emulation","Lookahead Extraction","Virtualization","Synchronization"],"dc:title":["Temporal synchronization of emulated and simulated models for assessment of networked systems"],"dc:type":["text","Thesis"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:52Z"}