Parallel simulation of performance Petri nets: extending the domain of parallel simulation
Abstract: "We present a parallel simulation protocol for Performance Petri nets, Petri nets in which transition firings take randomly selected amounts of time. This protocol is interesting for two reasons. First, application of standard conservative or optimistic parallel simulation to Petri ne...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Seattle, Wash.
1991
|
Schriftenreihe: | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report
91,4,2 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We present a parallel simulation protocol for Performance Petri nets, Petri nets in which transition firings take randomly selected amounts of time. This protocol is interesting for two reasons. First, application of standard conservative or optimistic parallel simulation to Petri nets results in either unnecessarily low (possibly no) parallelism or simply fails to produce correct results. Thus, this new protocol may be thought of as addressing a class of models not amenable to standard parallel simulation, with Petri net models being a particular example. Second, Performance Petri nets are currently analyzed using numerical techniques that have time and space requirements exponential in the size of the Petri net Simulation, and particularly parallel simulation, is thus a practical alternate analysis method for these models. Our new protocol is derived from the rules of conservative parallel simulation. While this approach normally relies on use of the actual or 'future' timestamps on the message paths into a component of the model to determine the latest simulation time to which that component can safely progress, we have introduced a new technique that loosens this restriction. Our technique, called Selective Receive, allows model components to sometimes ignore certain of their input channels and thus to determine their local clock times based on only a subset of their potential inputs. This technique is helpful in simulating Petri net models We believe that it may be of use in speeding up the parallel simulation of other systems as well. Finally, the development of a parallel simulation protocol for Petri nets suggested a small modification to their definition that, while not affecting the expressive power of the nets, allows for much more efficient simulations. We show that parallel simulations using this modification can achieve unboundedly high speedups relative to a sequential simulation that does not employ this approach. |
Beschreibung: | 19 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008992816 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940206s1991 |||| 00||| eng d | ||
035 | |a (OCoLC)28390682 | ||
035 | |a (DE-599)BVBBV008992816 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Thomas, Gregory S. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Parallel simulation of performance Petri nets |b extending the domain of parallel simulation |c Gregory S. Thomas and John Zahorjan |
264 | 1 | |a Seattle, Wash. |c 1991 | |
300 | |a 19 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |v 91,4,2 | |
520 | 3 | |a Abstract: "We present a parallel simulation protocol for Performance Petri nets, Petri nets in which transition firings take randomly selected amounts of time. This protocol is interesting for two reasons. First, application of standard conservative or optimistic parallel simulation to Petri nets results in either unnecessarily low (possibly no) parallelism or simply fails to produce correct results. Thus, this new protocol may be thought of as addressing a class of models not amenable to standard parallel simulation, with Petri net models being a particular example. Second, Performance Petri nets are currently analyzed using numerical techniques that have time and space requirements exponential in the size of the Petri net | |
520 | 3 | |a Simulation, and particularly parallel simulation, is thus a practical alternate analysis method for these models. Our new protocol is derived from the rules of conservative parallel simulation. While this approach normally relies on use of the actual or 'future' timestamps on the message paths into a component of the model to determine the latest simulation time to which that component can safely progress, we have introduced a new technique that loosens this restriction. Our technique, called Selective Receive, allows model components to sometimes ignore certain of their input channels and thus to determine their local clock times based on only a subset of their potential inputs. This technique is helpful in simulating Petri net models | |
520 | 3 | |a We believe that it may be of use in speeding up the parallel simulation of other systems as well. Finally, the development of a parallel simulation protocol for Petri nets suggested a small modification to their definition that, while not affecting the expressive power of the nets, allows for much more efficient simulations. We show that parallel simulations using this modification can achieve unboundedly high speedups relative to a sequential simulation that does not employ this approach. | |
650 | 4 | |a Petri nets | |
700 | 1 | |a Zahorjan, John |e Verfasser |4 aut | |
810 | 2 | |a Department of Computer Science: Technical report |t University of Washington <Seattle, Wash.> |v 91,4,2 |w (DE-604)BV008930431 |9 91,4,2 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005941734 |
Datensatz im Suchindex
_version_ | 1804123335340064768 |
---|---|
any_adam_object | |
author | Thomas, Gregory S. Zahorjan, John |
author_facet | Thomas, Gregory S. Zahorjan, John |
author_role | aut aut |
author_sort | Thomas, Gregory S. |
author_variant | g s t gs gst j z jz |
building | Verbundindex |
bvnumber | BV008992816 |
ctrlnum | (OCoLC)28390682 (DE-599)BVBBV008992816 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03072nam a2200325 cb4500</leader><controlfield tag="001">BV008992816</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28390682</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992816</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">Thomas, Gregory S.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel simulation of performance Petri nets</subfield><subfield code="b">extending the domain of parallel simulation</subfield><subfield code="c">Gregory S. Thomas and John Zahorjan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Seattle, Wash.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">19 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">University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report</subfield><subfield code="v">91,4,2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present a parallel simulation protocol for Performance Petri nets, Petri nets in which transition firings take randomly selected amounts of time. This protocol is interesting for two reasons. First, application of standard conservative or optimistic parallel simulation to Petri nets results in either unnecessarily low (possibly no) parallelism or simply fails to produce correct results. Thus, this new protocol may be thought of as addressing a class of models not amenable to standard parallel simulation, with Petri net models being a particular example. Second, Performance Petri nets are currently analyzed using numerical techniques that have time and space requirements exponential in the size of the Petri net</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Simulation, and particularly parallel simulation, is thus a practical alternate analysis method for these models. Our new protocol is derived from the rules of conservative parallel simulation. While this approach normally relies on use of the actual or 'future' timestamps on the message paths into a component of the model to determine the latest simulation time to which that component can safely progress, we have introduced a new technique that loosens this restriction. Our technique, called Selective Receive, allows model components to sometimes ignore certain of their input channels and thus to determine their local clock times based on only a subset of their potential inputs. This technique is helpful in simulating Petri net models</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We believe that it may be of use in speeding up the parallel simulation of other systems as well. Finally, the development of a parallel simulation protocol for Petri nets suggested a small modification to their definition that, while not affecting the expressive power of the nets, allows for much more efficient simulations. We show that parallel simulations using this modification can achieve unboundedly high speedups relative to a sequential simulation that does not employ this approach.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Petri nets</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zahorjan, John</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">University of Washington <Seattle, Wash.></subfield><subfield code="v">91,4,2</subfield><subfield code="w">(DE-604)BV008930431</subfield><subfield code="9">91,4,2</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941734</subfield></datafield></record></collection> |
id | DE-604.BV008992816 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:28:08Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941734 |
oclc_num | 28390682 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 19 S. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
record_format | marc |
series2 | University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report |
spelling | Thomas, Gregory S. Verfasser aut Parallel simulation of performance Petri nets extending the domain of parallel simulation Gregory S. Thomas and John Zahorjan Seattle, Wash. 1991 19 S. txt rdacontent n rdamedia nc rdacarrier University of Washington <Seattle, Wash.> / Department of Computer Science: Technical report 91,4,2 Abstract: "We present a parallel simulation protocol for Performance Petri nets, Petri nets in which transition firings take randomly selected amounts of time. This protocol is interesting for two reasons. First, application of standard conservative or optimistic parallel simulation to Petri nets results in either unnecessarily low (possibly no) parallelism or simply fails to produce correct results. Thus, this new protocol may be thought of as addressing a class of models not amenable to standard parallel simulation, with Petri net models being a particular example. Second, Performance Petri nets are currently analyzed using numerical techniques that have time and space requirements exponential in the size of the Petri net Simulation, and particularly parallel simulation, is thus a practical alternate analysis method for these models. Our new protocol is derived from the rules of conservative parallel simulation. While this approach normally relies on use of the actual or 'future' timestamps on the message paths into a component of the model to determine the latest simulation time to which that component can safely progress, we have introduced a new technique that loosens this restriction. Our technique, called Selective Receive, allows model components to sometimes ignore certain of their input channels and thus to determine their local clock times based on only a subset of their potential inputs. This technique is helpful in simulating Petri net models We believe that it may be of use in speeding up the parallel simulation of other systems as well. Finally, the development of a parallel simulation protocol for Petri nets suggested a small modification to their definition that, while not affecting the expressive power of the nets, allows for much more efficient simulations. We show that parallel simulations using this modification can achieve unboundedly high speedups relative to a sequential simulation that does not employ this approach. Petri nets Zahorjan, John Verfasser aut Department of Computer Science: Technical report University of Washington <Seattle, Wash.> 91,4,2 (DE-604)BV008930431 91,4,2 |
spellingShingle | Thomas, Gregory S. Zahorjan, John Parallel simulation of performance Petri nets extending the domain of parallel simulation Petri nets |
title | Parallel simulation of performance Petri nets extending the domain of parallel simulation |
title_auth | Parallel simulation of performance Petri nets extending the domain of parallel simulation |
title_exact_search | Parallel simulation of performance Petri nets extending the domain of parallel simulation |
title_full | Parallel simulation of performance Petri nets extending the domain of parallel simulation Gregory S. Thomas and John Zahorjan |
title_fullStr | Parallel simulation of performance Petri nets extending the domain of parallel simulation Gregory S. Thomas and John Zahorjan |
title_full_unstemmed | Parallel simulation of performance Petri nets extending the domain of parallel simulation Gregory S. Thomas and John Zahorjan |
title_short | Parallel simulation of performance Petri nets |
title_sort | parallel simulation of performance petri nets extending the domain of parallel simulation |
title_sub | extending the domain of parallel simulation |
topic | Petri nets |
topic_facet | Petri nets |
volume_link | (DE-604)BV008930431 |
work_keys_str_mv | AT thomasgregorys parallelsimulationofperformancepetrinetsextendingthedomainofparallelsimulation AT zahorjanjohn parallelsimulationofperformancepetrinetsextendingthedomainofparallelsimulation |