Re: GLPSOL in webassemby faster than native ?
Michael Hennebry <[email protected]> Thu, 1 Oct 2020 12:29:28 -0500 (CDT)
| Newsgroups | gmane.comp.gnu.glpk |
|---|---|
| Message-ID | <[email protected]> |
On Thu, 1 Oct 2020, Heinrich Schuchardt wrote: > On 9/30/20 10:02 PM, Michael Hennebry wrote: >> On Tue, 29 Sep 2020, Domingo Alvarez Duarte wrote: >> >>> I found why GLPK in wasm was faster with "--cuts" option than native, >>> it was due wasm using qsort from muslc that is a "stable sort", I've >>> added it to my GLPK repository and running all models in the >>> "examples" folder only "color.mod" produces a different solution (that >>> seems to be valid anyway). > > My expectation is that all sort algorithms produce the same result if > you supply a sort key that is different for all elements. In the case of ties, tie-breaking matters. For a stable sort, the tie-breaker is the original position. -- Michael [email protected] "Sorry but your password must contain an uppercase letter, a number, a haiku, a gang sign, a heiroglyph, and the blood of a virgin." -- someeecards