Algebra of Parameterised Graphs
description
Transcript of Algebra of Parameterised Graphs
![Page 1: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/1.jpg)
Andrey Mokhov, Victor KhomenkoArseniy Alekseyev, Alex Yakovlev
Algebra of Parameterised Graphs
![Page 2: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/2.jpg)
MotivationDesign cost is the greatest threat to the semiconductors
roadmap:manufacturing takes weeks, with low uncertaintydesign takes months or years, with high uncertainty
Designer has to explore a large design space, and thus comprehend a huge number ofsystem configurationsoperational modesbehavioural scenariosimplementation choices
Infeasible to consider each individual mode, need toexploit similarities between the individual modeswork with groups of modes rather than individual onesmanage the modes and groups of modes compositionallytransform/optimise specs in a formal and natural way
![Page 3: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/3.jpg)
Design productivity gap
10000py
Annual productivity gain ~20%
Annual man
ufacturin
g gain
>40%
850py“Productivity gap”
![Page 4: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/4.jpg)
?
13 lines270 stations
Individual descriptions
![Page 5: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/5.jpg)
• Easier for comprehension and reasoning• Gives bigger picture of the system• Easier to modify than individual lines
OrangePark
Overlaid descriptions
?
![Page 6: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/6.jpg)
Characteristics of components
a) 2-input adderb) 3-input adderc) 2-input multiplierd) fast 2-input multipliere) dedicated DP3 unit
Design space exploration
DP3(x,y)=x1y1 + x2y2 + x3y3
![Page 7: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/7.jpg)
Fastest
Design space exploration2 multipliers
Least peak power Dedicatedcomponent
Balanced
![Page 8: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/8.jpg)
Operations on graphs: overlay G1+G2
+
=
=
+
![Page 9: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/9.jpg)
Operations on graphs: sequence G1G2
=
=
![Page 10: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/10.jpg)
Operations on graphs: condition [x]G[0]G= (empty graph)[1]G=G
From arithmetic to algebra: use parameters [x]G
![Page 11: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/11.jpg)
Operations on graphs: condition [x]G[0]G= (empty graph)[1]G=G
From arithmetic to algebra: use parameters [x]G
![Page 12: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/12.jpg)
Operations on graphs: condition [x]G[0]G= (empty graph)[1]G=G
From arithmetic to algebra: use parameters [x]G
[1]
[0]
? [x]
![Page 13: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/13.jpg)
Canonical form of PGsProposition: Any PG can be rewritten in the following canonical form:
whereV is a subset of singleton graphs that appear in the original PGbv are canonical forms of Boolean expressionsbuv are canonical forms of Boolean expressions, s.t. buv b⇒ ubv
![Page 14: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/14.jpg)
Algebra of PGsWe define the equivalence relation on PGs abstractly,
using the following axioms:+ is commutative and associative is associative is a left and right identity of left- and right-distributes over +Decomposition: p q r = p q + p r + q rCondition: [0]p = and [1]p = p
Theorem: The set of axioms of PG-algebra is soundminimalcomplete w.r.t. PGs
![Page 15: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/15.jpg)
Useful equalities (proved from axioms) is an identity of ++ is idempotent Left/right absorption:
p + p q = p qq + p q = p q
Conditional : [x] = Conditional + and :
[x](p + q) = [x]p + [x]q[x](p q) = [x]p [x]q
AND-condition: [x y]p = [x][y]p OR-condition: [x y]p = [x]p + [y]p
![Page 16: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/16.jpg)
Case study: phase encoderPhase encoding: data is encoded by the order of arrival
of signals on n wires:
Goal: synthesise matrix phase encoderInputs: dual-rail ports xij that specify the order of
signalsOutputs: phase encoded data vi
abdc
n! scenarios
![Page 17: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/17.jpg)
Case study: phase encoderOverall specification: where Hij models behaviour of
ith and jth output wiresIf xij=1 and xji=0 then there is a causal dependency vi vjIf xij=0 and xji=1 then there is a causal dependency vj viIf xij=xji=0 then neither vi nor vj can be produced yet; this is
expressed by a circular wait condition between vi and vj
|H| and the resulting circuit are linear in the size of input!
![Page 18: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/18.jpg)
Transitive Parameterised Graphs is often interpreted as causal dependency, so the
graphs are transitiveHence two graphs are considered equal iff their transitive
closures are equalCan express this by an additional axiom Closure:
if q then p q + q r = p q + p r + q rOften allows to simplify expressions by transitive
reduction
![Page 19: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/19.jpg)
Transitive parameterised graphs
PG expression [x]((a + b)c + cd) + [x]((a + b)(d + e))with the specialisations
TPG expression (a + b)([x]cd + [x]e)with the specialisations
![Page 20: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/20.jpg)
Canonical form of TPGsProposition: Any TPG can be rewritten in the following canonical form:
whereV is a subset of singleton graphs that appear in the original TPGbv are canonical forms of Boolean expressionsbuv are canonical forms of Boolean expressions, s.t. buv b⇒ ubv
transitivity: for all u,v,w V, b∈ uv bvw b⇒ uw
![Page 21: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/21.jpg)
TPG axioms – minimal, sound, completeTheorem: The set of axioms of TPG-algebra is
soundminimalcomplete w.r.t. TPGs.
![Page 22: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/22.jpg)
Case study: Processor microcontroller
?
![Page 23: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/23.jpg)
Case study: Processor microcontroller
Instructions classes:ALU Rn to Rn e.g. ADD A,B; MOV A,BALU #123 to Rn e.g. SUB A,#1; MOV
B,#3ALU Rn to PC e.g. JMP AALU #123 to PC e.g. JMP #2012Memory access e.g. MOV A,[B]; MOV
[B],ACond. ALU Rn to Rn e.g. if A<B then ADD A,BCond. ALU #123 to Rn e.g. if A<B then SUB A,#1Cond. ALU #123 to PC e.g. if A<B then JMP #2012
![Page 24: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/24.jpg)
Case study: Processor microcontrollerALU #123 to Rn e.g. SUB A,#1; MOV B,#3TPG algebra specification:
PCIU IFU (ALU + PCIU’) IFU’The graph is considered up to transitivity
![Page 25: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/25.jpg)
Case study: Processor microcontrollerCond. ALU #123 to Rn e.g. if A<B then SUB A,#1If A < B holds:
(ALU + PCIU) IFU (ALU’ + PCIU’) IFU’If A < B does not hold:
(ALU + PCIU) PCIU’ IFU’Composing the two scenarios, lt := (A<B):
[lt]((ALU + PCIU) IFU (ALU’ + PCIU’) IFU’)+[lt]((ALU + PCIU) PCIU’ IFU’)
=(ALU + PCIU) [lt]IFU (PCIU’ + [lt]ALU’) IFU’
![Page 26: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/26.jpg)
Case study: Processor microcontrollerCond. ALU #123 to Rn e.g. if A<B then SUB A,#1
(ALU + PCIU) [lt]IFU (PCIU’ + [lt]ALU’) IFU’
![Page 27: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/27.jpg)
Case study: Processor microcontroller
![Page 28: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/28.jpg)
Case study: Processor microcontroller
![Page 29: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/29.jpg)
Conclusions and future workNew formalisms: PG and TPG algebrae with sound,
minimal and complete sets of axiomsCanonical formsCan work with groups of scenarios and exploit the
similarities between themCan formally compose, manipulate and simplify the
specifications using the rules of these algebraeApplications in microelectronics, formal methods,
computer architecture, modelling university courses
Future work:Tool implementationSimplification by modular decomposition of graphs
![Page 30: Algebra of Parameterised Graphs](https://reader035.fdocuments.us/reader035/viewer/2022081515/56816937550346895de09b02/html5/thumbnails/30.jpg)
Thank you!