Softwares
KPASSA
Welcome to KPASSA V2
This is KPASSA V2 a tool for analysis and optimization of some Models of Computation and Communication (MoCC).
Supported MoCCs:
- Marked Graphs (with/without capacities).
- Synchronous DataFlow (with/without capacities).
- Latency-Insensitive Design.
- K-Periodic Routed Graphs.
Analysis:
- Dead-lock freeness: Marked Graphs, Latency-Insensitive Design.
- Safety (bounded buffers): Synchronous DataFlow, K-Periodic Routed Graphs.
- Performance Analysis and K-Periodic Scheduling: all models.
Optimizations:
- Basic Throughput Equalization: Marked Graphs, Latency-Insensitive Design.
- Area Minimal Throughput Equalization: Marked Graphs, Latency-Insensitive Design.
- Optimal sizing of capacities for places and relay-stations: Marked Graphs with capacities, Latency-Insensitive Design.
- Static Schedulers Compression.
- Clustering of Static Schedulers.
Import:
- IPXACT Spirit XML
- UML Activity Diagram
- kpassaSimu
- SDF3
Export:
- IPXACT Spirit XML
- UML Activity Diagram
- kpassaSimu
- SDF3
Screenshots
Downloads
Windows 32bits
Linux 32bits/64bitsPublications
Conferences:
- Another Glance at Relay Stations in Latency Insensitive, FMGALS 2005.
- Latency-Insensitive Design and Central Repetitive Scheduling, MEMOCODE 2006.
- Compositionality of Statically Scheduled IP, FMGALS 2007.
- Latency-Insensitive Design: Retry Relay-Station and Fusion Shell, FMGALS 2009.
Journals:
- Formal Methods for Scheduling of Latency-Insensitive Design, EURASIP 2007.
INRIA Research Reports
- Another glance at Relay Stations in Latency-Insensitive Designs, 2005.
- Latency-Insensitive Design and Central Repetitive Scheduling, 2006.
- Formal Methods for Schedulings of Latency-Insensitive Designs, 2007.
- Statically scheduled Process Networks, 2007.
- Kahn-extended Event Graphs, 2008
- Throughput and FIFO Sizing: an Application to Latency-Insensitive Design, 2009.
Contact
Julien Boucaron: julien DOT boucaron AT inria DOT fr
