17-04-2012, 12:54 PM
Modeling and Simulation of Pipeline by Colored Petri Nets
Modeling and Simulation of Pipeline by Colored Petri Nets.pdf (Size: 504.57 KB / Downloads: 41)
INTRODUCTION
of the systems, as a result here the system problems and
Colored Petri Net (CPN) is a tool by which validation CPN tools can do nothing to improve and solve problems
of discrete-event systems are studied and modeled. CPNs and also it would not be possible to predict the next
are used to analyze and obtain significant and useful optimized situation.
information from the structure and dynamic performance Parallel processing means using variety techniques
of the modeled system. Colored Petri Nets mainly focus in contemporary processing of data for increase meant of
on synchronization, concurrency and asynchronous speed of calcuting computer systems. Pipeline is a
events [1]. The graphic features of CPNs specify the technique that separates a seri process to simple
applicability and visualization of the modeled system. operation and each simple action performs at the same
Furthermore, synchronous and asynchronous events time of other sections in a specific section.
present their prioritized relations and structural adaptive Pipeline can be supposed as a complex of processor
effects. The main difference between CPNs and Petri Nets part that two by two (2-2) information circulates in it. One
(PN) is that in CPNs the elements are separable but in PNs of specifications of pipeline is that, several calculations
they are not.
Pipeline For Adding Up/Distraction Of Floating Point:
Here, we describe, using of pipeline for adding of two
floating point numbers entrances of pipeline are add
maker of floating point of two number of 2-2 (two-by-two)
The Algorithm Simulation:
In this section we propose an
algorithm Simulation for add up/subtraction of two
floating point numbers with using of Colored Petri Net
and CPN Tools. Two normalized number of below floating
point are supposed:
of normalized floating point.
CONCLUSION
Pipeline is a method that can be found in very rapid 4. Peterson, J., 1981. Petri Net Theory and the
computers and applies for laying down of floating point Modelling of Systems, Prentice Hall.
activities. Through this way, activities of can be separated 5. Harper, R., 2000. Programming in M.L. Standard,
into details simply and in this way, accelerate the ordinal Carnegie Mellon University.
factor of a program. In fact, pipeline is division of one 6. Turon, A., 2006. SML/NJ Language Processing
ordinal action to several operational unit.