Josef Svenningsson wrote:
What I want to know boils down to
this: what order are processes run which have been woken up from a
call to retry?
IIUC, the order of wake up is irrelevant, since *all* the threads will
re-run the transaction in parallel. So, even if thread 1 is the first to
wake up
Hi,
I'd like to know a bit about the STM implementation in GHC,
specifically about how it tries to achieve fairness. I've been reading
"Composable Memory Transactions" but it does not contain that much
details on this specific matter. What I want to know boils down to
this: what order are processe
On Fri, Feb 29, 2008 at 4:27 PM, Roberto Zunino <[EMAIL PROTECTED]> wrote:
> Josef Svenningsson wrote:
> > What I want to know boils down to
> > this: what order are processes run which have been woken up from a
> > call to retry?
>
> IIUC, the order of wake up is irrelevant, since *all* the th
jay:
> Don Stewart [EMAIL PROTECTED]:
> >jay:
> >> Don Stewart [EMAIL PROTECTED]:
> >> >jay:
> >> >> I also have constants that are too large to compile. I am resigned to
> >> >> loading them from data files--other solutions seem even worse.
> >> ...
> >> >> Data.Binary eases the irritation somewha
Don Stewart [EMAIL PROTECTED]:
>jay:
>> Don Stewart [EMAIL PROTECTED]:
>> >jay:
>> >> I also have constants that are too large to compile. I am resigned to
>> >> loading them from data files--other solutions seem even worse.
>> ...
>> >> Data.Binary eases the irritation somewhat.
>> >
>> >Did you t
Don Stewart [EMAIL PROTECTED]:
>jay:
>> Don Stewart [EMAIL PROTECTED]:
>> >jay:
>> >> I also have constants that are too large to compile. I am resigned to
>> >> loading them from data files--other solutions seem even worse.
>> ...
>> >> Data.Binary eases the irritation somewhat.
>> >
>> >Did you
Don Stewart [EMAIL PROTECTED]:
>jay:
>> Don Stewart [EMAIL PROTECTED]:
>> >jay:
>> >> Don Stewart [EMAIL PROTECTED]:
>> >> >jay:
>> >> >> I also have constants that are too large to compile. I am resigned to
>> >> >> loading them from data files--other solutions seem even worse.
>> >> ...
>> >> >>
jay:
> Don Stewart [EMAIL PROTECTED]:
>
> >jay:
> >> Don Stewart [EMAIL PROTECTED]:
> >> >jay:
> >> >> Don Stewart [EMAIL PROTECTED]:
> >> >> >jay:
> >> >> >> I also have constants that are too large to compile. I am resigned to
> >> >> >> loading them from data files--other solutions seem even wo
| I'd like to know a bit about the STM implementation in GHC,
| specifically about how it tries to achieve fairness. I've been reading
| "Composable Memory Transactions" but it does not contain that much
| details on this specific matter. What I want to know boils down to
| this: what order are pro
Bryan O'Sullivan <[EMAIL PROTECTED]> wrote:
> The trick I usually use in cases like this is to compile the
> data as C code and link against it, then access it from
> Haskell via a Ptr.
For my particular application, I really need to ship a single
static binary that has it all -- data as well
10 matches
Mail list logo
