search for: g_count

Displaying 4 results from an estimated 4 matches for "g_count".

2018 Sep 12
3
Generalizing load/store promotion in LICM
...handling into a super aggressive form of PRE, and use predicated stores to avoid solving legality question? Background We've been seeing an interesting class of problems recently that looks roughly like this: for (int = 0; i < N; i++)   if (a[i] == 0) // some data dependent check     g_count++; // conditional load and store to shared location The critical detail in this example is that g_count is a global location which may be accessed concurrently* by multiple threads. The challenge here is that we don't know whether the store ever executes, and we're not allowed to insert...
2018 Sep 13
3
Generalizing load/store promotion in LICM
...tores to avoid solving legality question? > > > Background > > We've been seeing an interesting class of problems recently that > looks roughly like this: > > for (int = 0; i < N; i++) >   if (a[i] == 0) // some data dependent check >     g_count++; // conditional load and store to shared location > > The critical detail in this example is that g_count is a global > location which may be accessed concurrently* by multiple threads.  > The challenge here is that we don't know whether the store ever > execute...
2018 Sep 14
2
Generalizing load/store promotion in LICM
...ad handling into a super aggressive form of PRE, and use predicated stores to avoid solving legality question? Background We've been seeing an interesting class of problems recently that looks roughly like this: for (int = 0; i < N; i++) if (a[i] == 0) // some data dependent check g_count++; // conditional load and store to shared location The critical detail in this example is that g_count is a global location which may be accessed concurrently* by multiple threads. The challenge here is that we don't know whether the store ever executes, and we're not allowed to insert a...
2018 Sep 18
1
Generalizing load/store promotion in LICM
...gt;>> >>> Background >>> >>> We've been seeing an interesting class of problems recently that looks >>> roughly like this: >>> >>> for (int = 0; i < N; i++) >>> if (a[i] == 0) // some data dependent check >>> g_count++; // conditional load and store to shared location >>> >>> The critical detail in this example is that g_count is a global location >>> which may be accessed concurrently* by multiple threads. The challenge >>> here is that we don't know whether the store e...