{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/81668"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/81668","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Pose: Scalable General-Purpose Parallel Discrete Event Simulation","abstract":"We propose a novel environment for PDES that facilitates the development of highly parallel models and requires minimal understanding of parallel computing concepts. We propose four primary approaches to improving the performance of PDES. We first examine the overhead required for synchronizing events to obtain correct results in parallel and develop a new approach to the structure of model entities and mechanisms for PDES that help to reduce that overhead. Secondly, we design new adaptive synchronization strategies that exploit this new model structure to obtain better cache performance and reduce context switching overhead. We then develop techniques to optimize communication in concert with these new strategies. Finally, we study load balancing in the context of optimistic synchronization and design new approaches to fit with our other techniques. These four approaches form an integrated system for handling non-ideal simulation models. We demonstrate our techniques via a highly flexible synthetic benchmark capable of mimicking a variety of simulation behaviors, as well as with simulations of network models for very large parallel computers.","abstract_html":"We propose a novel environment for PDES that facilitates the development of highly parallel models and requires minimal understanding of parallel computing concepts. We propose four primary approaches to improving the performance of PDES. We first examine the overhead required for synchronizing events to obtain correct results in parallel and develop a new approach to the structure of model entities and mechanisms for PDES that help to reduce that overhead. Secondly, we design new adaptive synchronization strategies that exploit this new model structure to obtain better cache performance and reduce context switching overhead. We then develop techniques to optimize communication in concert with these new strategies. Finally, we study load balancing in the context of optimistic synchronization and design new approaches to fit with our other techniques. These four approaches form an integrated system for handling non-ideal simulation models. We demonstrate our techniques via a highly flexible synthetic benchmark capable of mimicking a variety of simulation behaviors, as well as with simulations of network models for very large parallel computers.","abstract_has_math":false,"creators":["Wilmarth, Terry L."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Kale, Laxmikant V."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-09-25T20:19:56Z","date_published":"2015-09-25T20:19:56Z","updated_at":"2026-07-22T22:26:16Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(MiAaPQ)AAI3182422"],"render_values":[{"text":"(MiAaPQ)AAI3182422","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/81668","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Kale, Laxmikant V."]},{"key":"dc:creator","label":"Author","values":["Wilmarth, Terry L."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-09-25T20:19:56Z","10000-01-01","2005"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"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":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/81668","(MiAaPQ)AAI3182422"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["We propose a novel environment for PDES that facilitates the development of highly parallel models and requires minimal understanding of parallel computing concepts. We propose four primary approaches to improving the performance of PDES. We first examine the overhead required for synchronizing events to obtain correct results in parallel and develop a new approach to the structure of model entities and mechanisms for PDES that help to reduce that overhead. Secondly, we design new adaptive synchronization strategies that exploit this new model structure to obtain better cache performance and reduce context switching overhead. We then develop techniques to optimize communication in concert with these new strategies. Finally, we study load balancing in the context of optimistic synchronization and design new approaches to fit with our other techniques. These four approaches form an integrated system for handling non-ideal simulation models. We demonstrate our techniques via a highly flexible synthetic benchmark capable of mimicking a variety of simulation behaviors, as well as with simulations of network models for very large parallel computers.","Made available in DSpace on 2015-09-25T20:19:56Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3182422.pdf: 5102207 bytes, checksum: e74c8a90eba26868372a9ac0af48868f (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82949 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","151 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."]},{"key":"dc:title","label":"Title","values":["Pose: Scalable General-Purpose Parallel Discrete Event Simulation"]}]}],"canonical_facts":{"dc:contributor":["Kale, Laxmikant V."],"dc:creator":["Wilmarth, Terry L."],"dc:date":["2015-09-25T20:19:56Z","10000-01-01","2005"],"dc:description":["We propose a novel environment for PDES that facilitates the development of highly parallel models and requires minimal understanding of parallel computing concepts. We propose four primary approaches to improving the performance of PDES. We first examine the overhead required for synchronizing events to obtain correct results in parallel and develop a new approach to the structure of model entities and mechanisms for PDES that help to reduce that overhead. Secondly, we design new adaptive synchronization strategies that exploit this new model structure to obtain better cache performance and reduce context switching overhead. We then develop techniques to optimize communication in concert with these new strategies. Finally, we study load balancing in the context of optimistic synchronization and design new approaches to fit with our other techniques. These four approaches form an integrated system for handling non-ideal simulation models. We demonstrate our techniques via a highly flexible synthetic benchmark capable of mimicking a variety of simulation behaviors, as well as with simulations of network models for very large parallel computers.","Made available in DSpace on 2015-09-25T20:19:56Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3182422.pdf: 5102207 bytes, checksum: e74c8a90eba26868372a9ac0af48868f (MD5) Previous issue date: 2005","Embargo set by: Seth Robbins for item 82949 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","151 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2005."],"dc:identifier":["http://hdl.handle.net/2142/81668","(MiAaPQ)AAI3182422"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["Pose: Scalable General-Purpose Parallel Discrete Event Simulation"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:16Z"}