[P4-dev] graph search in P4

Mihai Budiu mbudiu at vmware.com
Tue Oct 17 12:41:43 EDT 2017


Yes can use recirculate to create a loop, but every iteration will be very expensive.

Mihai

-----Original Message-----
From: Roshan [mailto:sedar at oasis.uclouvain.be] 
Sent: Tuesday, October 17, 2017 9:32 AM
To: Mihai Budiu <mbudiu at vmware.com>; p4-dev <p4-dev at lists.p4.org>
Subject: Re: [P4-dev] graph search in P4

I see that. Could recirculate primitive behave/use for looping mechanism?


Thanks!


Cheers,

R-


On 2017-10-17 18:02, Mihai Budiu wrote:
> P4 does not really support data structures or loops, so you cannot really do anything useful with graphs in P4.
>
> Mihai
>
> -----Original Message-----
> From: P4-dev [mailto:p4-dev-bounces at lists.p4.org] On Behalf Of Roshan
> Sent: Tuesday, October 17, 2017 8:54 AM
> To: p4-dev <p4-dev at lists.p4.org>
> Subject: [P4-dev] graph search in P4
>
> Hi,
>
>
> Is there any reference or example material for an implementation of graph search/traversal in P4 to have a look at?
>
> Is this type of implementation is doable in P4?
>
>
> Any advices would be great!
>
>
> Thanks!
>
>
> Cheers,
>
> R-
>
>
> _______________________________________________
> P4-dev mailing list
> P4-dev at lists.p4.org
> https://urldefense.proofpoint.com/v2/url?u=http-3A__lists.p4.org_mailman_listinfo_p4-2Ddev-5Flists.p4.org&d=DwICAg&c=uilaK90D4TOVoH58JNXRgQ&r=tGW6TKXajnoXSyy1S1P4DHGPe8sj54GGvw-b21n7aWg&m=OnrkGWQxzKA_7Gi4GzAXqDNHlJ0XuhifOTDhGrQPND4&s=7Zd7D805wh5blEOPAX5mLwquUzcvy1WVwrPccrpqBGM&e=
>
> _______________________________________________
> P4-dev mailing list
> P4-dev at lists.p4.org
> https://urldefense.proofpoint.com/v2/url?u=http-3A__lists.p4.org_mailman_listinfo_p4-2Ddev-5Flists.p4.org&d=DwICaQ&c=uilaK90D4TOVoH58JNXRgQ&r=tGW6TKXajnoXSyy1S1P4DHGPe8sj54GGvw-b21n7aWg&m=2FHzx-q10Mq-utErUIq4z9qLNvMLglNQD6taUDjtAKM&s=6rbMVcGsxrDqyRhEwhkyuWxer1-hweQu6D1czcIsl7o&e=



More information about the P4-dev mailing list