Klaus, Thank you for the quick reply, I wasn't aware of this change in openSUSE 11. With this new type of resolver, we can now document to our clients that package resolving shouldn't take any time at all and if it does, we can guarantee that the machine is frozen and must be rebooted? I know this new resolver is deadlock free, but the machine might hang for any other reason, even malfunctioning hardware. Unless we can tell our clients for sure that it will NEVER take long (by long I'm thinking more then 10 seconds), I think we would still have a possible usability problem. And as a side note, I haven't been keeping up with the latest computer science theories, but as I remember, SAT is a classic NP-Complete problem which would be the opposite to the definition of fast =) Nice to know that someone came up with a good algorithm (approximation?) for it. Thank you, On Tue, 2008-09-23 at 13:06 +0200, Klaus Kaempf wrote:
Arthur,
thanks for your suggestion.
* Arthur Rodrigo Sawazachi Valadares
[Sep 22. 2008 21:55]: I think it would be interesting for ZYpp to report it's progress while resolving packages.
This indeed makes a lot of sense for traditional dependency resolvers.
However, since openSUSE 11.0 we have switched to a new type of resolver, based on boolean satisfiability. See e.g. http://www.satisfiability.org for more about this.
As a result, package dependency solving is now blazingly fast and deadlock-free.
Klaus --- SUSE LINUX Products GmbH, GF: Markus Rex, HRB 16746 (AG Nürnberg)
-- To unsubscribe, e-mail: zypp-devel+unsubscribe@opensuse.org For additional commands, e-mail: zypp-devel+help@opensuse.org