Parallel discrete event simulation on shared memory multiprocessors:
Abstract: "This thesis presents the implementation and the performance study of various parallel discrete event simulation (PDES) methods on a centralized shared memory machine (an Alliant FX-80). One of the most important features of this implementation is that it provides a single user interf...
Saved in:
Main Author: | |
---|---|
Format: | Book |
Language: | English |
Published: |
Urbana, Ill.
1991
|
Series: | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report
1074 |
Subjects: | |
Summary: | Abstract: "This thesis presents the implementation and the performance study of various parallel discrete event simulation (PDES) methods on a centralized shared memory machine (an Alliant FX-80). One of the most important features of this implementation is that it provides a single user interface for all the implemented methods. These methods include the Chandy-Misra paradigm with deadlock avoidance (using a shared memory model), the Time Warp approach with direct, aggressive and lazy cancellation, and a hybrid approach, which exploits the parallelism available at each point in simulated time Two issues proved to be significant in the efficient implementation of the above methods: partitioning the tasks among the available processors, and processor self-scheduling. In this thesis, we examine various partitioning and scheduling strategies and assess their impact on the performance of the system. To study the performance of the implemented simulation methods, we simulated two kinds of systems: a synchronous multiprocessor machine with an Omega interconnection network, and an asynchronous toroid network where each node is a simple first-come- first-serve server. The performance of the implemented methods is discussed and conclusions are drawn from the obtained results. |
Physical Description: | 79 S. |
Staff View
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009224765 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940313s1991 |||| 00||| eng d | ||
035 | |a (OCoLC)27130046 | ||
035 | |a (DE-599)BVBBV009224765 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Konas, Pavlos |e Verfasser |4 aut | |
245 | 1 | 0 | |a Parallel discrete event simulation on shared memory multiprocessors |c Pavlos Konas |
264 | 1 | |a Urbana, Ill. |c 1991 | |
300 | |a 79 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 1074 | |
520 | 3 | |a Abstract: "This thesis presents the implementation and the performance study of various parallel discrete event simulation (PDES) methods on a centralized shared memory machine (an Alliant FX-80). One of the most important features of this implementation is that it provides a single user interface for all the implemented methods. These methods include the Chandy-Misra paradigm with deadlock avoidance (using a shared memory model), the Time Warp approach with direct, aggressive and lazy cancellation, and a hybrid approach, which exploits the parallelism available at each point in simulated time | |
520 | 3 | |a Two issues proved to be significant in the efficient implementation of the above methods: partitioning the tasks among the available processors, and processor self-scheduling. In this thesis, we examine various partitioning and scheduling strategies and assess their impact on the performance of the system. To study the performance of the implemented simulation methods, we simulated two kinds of systems: a synchronous multiprocessor machine with an Omega interconnection network, and an asynchronous toroid network where each node is a simple first-come- first-serve server. The performance of the implemented methods is discussed and conclusions are drawn from the obtained results. | |
650 | 4 | |a Computer simulation | |
650 | 4 | |a Multiprocessors | |
830 | 0 | |a Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |v 1074 |w (DE-604)BV008930033 |9 1074 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006133938 |
Record in the Search Index
_version_ | 1804123667827785728 |
---|---|
any_adam_object | |
author | Konas, Pavlos |
author_facet | Konas, Pavlos |
author_role | aut |
author_sort | Konas, Pavlos |
author_variant | p k pk |
building | Verbundindex |
bvnumber | BV009224765 |
ctrlnum | (OCoLC)27130046 (DE-599)BVBBV009224765 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02277nam a2200313 cb4500</leader><controlfield tag="001">BV009224765</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27130046</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224765</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Konas, Pavlos</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel discrete event simulation on shared memory multiprocessors</subfield><subfield code="c">Pavlos Konas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">79 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">1074</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This thesis presents the implementation and the performance study of various parallel discrete event simulation (PDES) methods on a centralized shared memory machine (an Alliant FX-80). One of the most important features of this implementation is that it provides a single user interface for all the implemented methods. These methods include the Chandy-Misra paradigm with deadlock avoidance (using a shared memory model), the Time Warp approach with direct, aggressive and lazy cancellation, and a hybrid approach, which exploits the parallelism available at each point in simulated time</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Two issues proved to be significant in the efficient implementation of the above methods: partitioning the tasks among the available processors, and processor self-scheduling. In this thesis, we examine various partitioning and scheduling strategies and assess their impact on the performance of the system. To study the performance of the implemented simulation methods, we simulated two kinds of systems: a synchronous multiprocessor machine with an Omega interconnection network, and an asynchronous toroid network where each node is a simple first-come- first-serve server. The performance of the implemented methods is discussed and conclusions are drawn from the obtained results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer simulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multiprocessors</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report</subfield><subfield code="v">1074</subfield><subfield code="w">(DE-604)BV008930033</subfield><subfield code="9">1074</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133938</subfield></datafield></record></collection> |
id | DE-604.BV009224765 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:33:25Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133938 |
oclc_num | 27130046 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 79 S. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
record_format | marc |
series | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
series2 | Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report |
spelling | Konas, Pavlos Verfasser aut Parallel discrete event simulation on shared memory multiprocessors Pavlos Konas Urbana, Ill. 1991 79 S. txt rdacontent n rdamedia nc rdacarrier Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1074 Abstract: "This thesis presents the implementation and the performance study of various parallel discrete event simulation (PDES) methods on a centralized shared memory machine (an Alliant FX-80). One of the most important features of this implementation is that it provides a single user interface for all the implemented methods. These methods include the Chandy-Misra paradigm with deadlock avoidance (using a shared memory model), the Time Warp approach with direct, aggressive and lazy cancellation, and a hybrid approach, which exploits the parallelism available at each point in simulated time Two issues proved to be significant in the efficient implementation of the above methods: partitioning the tasks among the available processors, and processor self-scheduling. In this thesis, we examine various partitioning and scheduling strategies and assess their impact on the performance of the system. To study the performance of the implemented simulation methods, we simulated two kinds of systems: a synchronous multiprocessor machine with an Omega interconnection network, and an asynchronous toroid network where each node is a simple first-come- first-serve server. The performance of the implemented methods is discussed and conclusions are drawn from the obtained results. Computer simulation Multiprocessors Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report 1074 (DE-604)BV008930033 1074 |
spellingShingle | Konas, Pavlos Parallel discrete event simulation on shared memory multiprocessors Center for Supercomputing Research and Development <Urbana, Ill.>: CSRD report Computer simulation Multiprocessors |
title | Parallel discrete event simulation on shared memory multiprocessors |
title_auth | Parallel discrete event simulation on shared memory multiprocessors |
title_exact_search | Parallel discrete event simulation on shared memory multiprocessors |
title_full | Parallel discrete event simulation on shared memory multiprocessors Pavlos Konas |
title_fullStr | Parallel discrete event simulation on shared memory multiprocessors Pavlos Konas |
title_full_unstemmed | Parallel discrete event simulation on shared memory multiprocessors Pavlos Konas |
title_short | Parallel discrete event simulation on shared memory multiprocessors |
title_sort | parallel discrete event simulation on shared memory multiprocessors |
topic | Computer simulation Multiprocessors |
topic_facet | Computer simulation Multiprocessors |
volume_link | (DE-604)BV008930033 |
work_keys_str_mv | AT konaspavlos paralleldiscreteeventsimulationonsharedmemorymultiprocessors |