{"id":{"repo_id":"texas-state","oai_identifier":"oai:digital.library.txst.edu:10877/5550"},"canonical_url":"https://search.dev.ndltd.org/etd/texas-state/oai:digital.library.txst.edu:10877/5550","repository":{"repo_id":"texas-state","name":"Texas State University","base_url":"https://digital.library.txst.edu/server/oai/request"},"display":{"title":"Unobtrusive Real-Time Tracing of Parallel Programs","abstract":"The US loses approximately 20 to 60 billion a year due to software bugs and glitches, many of which could be avoided if software developers had perfect visibility of the system state during program execution. However, achieving complete visibility of all internal signals in real time in modern systems is not feasible due to limited I/O bandwidth, high internal complexity, and high operating frequencies. This thesis aims to develop a method that can be implemented in hardware to enable unobtrusive real-time tracing. The proposed method exploits several components (e.g., predictors, reductors, etc.) to reduce the size of the trace information through a tree-shape multiple level algorithm. The results show that with this method traces can be compressed with a relatively high ratios.","abstract_html":"The US loses approximately 20 to 60 billion a year due to software bugs and glitches, many of which could be avoided if software developers had perfect visibility of the system state during program execution. However, achieving complete visibility of all internal signals in real time in modern systems is not feasible due to limited I/O bandwidth, high internal complexity, and high operating frequencies. This thesis aims to develop a method that can be implemented in hardware to enable unobtrusive real-time tracing. The proposed method exploits several components (e.g., predictors, reductors, etc.) to reduce the size of the trace information through a tree-shape multiple level algorithm. The results show that with this method traces can be compressed with a relatively high ratios.","abstract_has_math":false,"creators":["Hesaaraki, Farbod"],"institution":"Texas State University","degree_name":"Master of Science","degree_level":"Masters","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":["Burtscher, Martin"],"committee_chairs":[],"committee_members":["Qasem, Apan","Zong, Ziliang"],"year":2015,"date_issued":"2015-04","date_published":"2015-04","updated_at":"2026-07-27T21:22:37Z","subjects":["debugging in computer science","parallel programming","compression","tracing","parallel","program","unobtrusive","real-time"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10877/5550","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Burtscher, Martin"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Qasem, Apan","Zong, Ziliang"]},{"key":"dc:creator","label":"Author","values":["Hesaaraki, Farbod"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-06-02T20:01:07Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-06-02T20:01:07Z"]},{"key":"dc:date.issued","label":"Date","values":["2015-04"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Texas State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["debugging in computer science","parallel programming","compression","tracing","parallel","program","unobtrusive","real-time"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10877/5550"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The US loses approximately 20 to 60 billion a year due to software bugs and glitches, many of which could be avoided if software developers had perfect visibility of the system state during program execution. However, achieving complete visibility of all internal signals in real time in modern systems is not feasible due to limited I/O bandwidth, high internal complexity, and high operating frequencies. This thesis aims to develop a method that can be implemented in hardware to enable unobtrusive real-time tracing. The proposed method exploits several components (e.g., predictors, reductors, etc.) to reduce the size of the trace information through a tree-shape multiple level algorithm. The results show that with this method traces can be compressed with a relatively high ratios."]},{"key":"dc:format","label":"Dc Format","values":["Text"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["1 file (.pdf)"]},{"key":"dc:title","label":"Title","values":["Unobtrusive Real-Time Tracing of Parallel Programs"]}]}],"canonical_facts":{"dc:contributor.advisor":["Burtscher, Martin"],"dc:contributor.committeemember":["Qasem, Apan","Zong, Ziliang"],"dc:creator":["Hesaaraki, Farbod"],"dc:date.accessioned":["2015-06-02T20:01:07Z"],"dc:date.available":["2015-06-02T20:01:07Z"],"dc:date.issued":["2015-04"],"dc:description.abstract":["The US loses approximately 20 to 60 billion a year due to software bugs and glitches, many of which could be avoided if software developers had perfect visibility of the system state during program execution. However, achieving complete visibility of all internal signals in real time in modern systems is not feasible due to limited I/O bandwidth, high internal complexity, and high operating frequencies. This thesis aims to develop a method that can be implemented in hardware to enable unobtrusive real-time tracing. The proposed method exploits several components (e.g., predictors, reductors, etc.) to reduce the size of the trace information through a tree-shape multiple level algorithm. The results show that with this method traces can be compressed with a relatively high ratios."],"dc:format":["Text"],"dc:format.medium":["1 file (.pdf)"],"dc:identifier.uri":["https://hdl.handle.net/10877/5550"],"dc:language.iso":["en"],"dc:subject":["debugging in computer science","parallel programming","compression","tracing","parallel","program","unobtrusive","real-time"],"dc:title":["Unobtrusive Real-Time Tracing of Parallel Programs"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Texas State University"]},"updated_at":"2026-07-27T21:22:37Z"}