Mdd/Glu vs. Cudd/Bdd

From: Borzoo Bonakdarpour (borzoo_at_cse.msu.edu)
Date: Fri May 04 2007 - 12:50:34 MDT

• Next message: gepolv: "how to get the top variable in DdManager?"
• Previous message: Zhao, Yang: "Backward Reachability Analysis"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
• Mail actions: [ respond to this message ] [ mail a new topic ]

Hi everyone,

I have implemented a symbolic algorithm using both Cudd/Bdd and Glu/Mdd
packages. Surprisingly, in the same setting (same algorithm, platform,
input, and variable ordering) the implementation using CUDD seems to be
almost twice faster than Glu/Mdd. I was wondering whether I am making a
mistake somewhere or that's how they are.

Thanks,
Borzoo

• Next message: gepolv: "how to get the top variable in DdManager?"
• Previous message: Zhao, Yang: "Backward Reachability Analysis"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
• Mail actions: [ respond to this message ] [ mail a new topic ]

This archive was generated by hypermail 2.1.7 : Fri May 04 2007 - 12:57:42 MDT