**From:** Marko Mäkelä (*marko.makela_at_hut.fi*)

**Date:** 2002-06-25 11:43:17

**Next message:**john/lori: "Quine-McKluskey (hey ruud)"**Previous message:**MagerValp: "Re: Reverse engineering logic equations from truth tables"**In reply to:**MagerValp: "Re: Reverse engineering logic equations from truth tables"**Next in thread:**Nicolas Welte: "Re: 82s100"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

MagerValp wrote: > Hmm, I have 15 UltraSPARC CPUs and my cow orker has 10 more. Sounds > like a fun project :) Can you efficiently parallelise the algorithm for simplifying a single formula? Well, obviously you could come up with some educated guesses for smart partitionings, such as splitting the cases C64MODE=0 and C64MODE=1, but I was thinking of simplifying one output equation on a single processor at a time. I'd expect the CAS outputs to be the trickiest; others could be mostly guessed and verified with the FOR loop method I proposed. (That was the process for deriving the equations for the C64 PLA equations that I followed in 1994 or 1995.) Marko Message was sent through the cbm-hackers mailing list

**Next message:**john/lori: "Quine-McKluskey (hey ruud)"**Previous message:**MagerValp: "Re: Reverse engineering logic equations from truth tables"**In reply to:**MagerValp: "Re: Reverse engineering logic equations from truth tables"**Next in thread:**Nicolas Welte: "Re: 82s100"**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ] [ attachment ]

Archive generated by hypermail 2.1.4.