Parallel programming design,implementation and analysis - a case study on finding invariants for Petri Nets.
碩士 === 淡江大學 === 資訊工程學系 === 85 === Parallel / Distributed system is now the trend of the computational region． The application progress、computer architecture changes、and network arise ，all of these show that parallelism grows not only su...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/98399806858999510828 |
| Summary: | 碩士 === 淡江大學 === 資訊工程學系 === 85 === Parallel / Distributed system is now the trend of the
computational region． The application progress、computer
architecture changes、and network arise ，all of these show that
parallelism grows not only super-computers but also workstations
and personal computers．As we shell see, parallel programs will
be required with multiple processors，even with network-
connected computers．But the original algorithms are specialized
for a single processors．In this way，Concurrency becomes a
necessary requirement for programming． In this
thesis，We will design and write a program in a concurrent point
of view，at the same time，evaluate the efficiency．We will
retrieval the minimal support invariants of Petri Nets as our
example．By adopt Ian Foster 's designing and building parallel
programs method，So we can compare the difference between
parallel algorithm and sequence one．
Finally，We choose Parallel Virtual Machine as our
implementation environment．PVM is designed to link computing
resource and provide users with a parallel platform for running
their computer applications，without knowing how many kind of
computers or where the computers is located．According to this
environment we will get more information and acknowledge of
designing / analyzing parallel programming．
|
|---|