SSE Bit Shift?
Forum Reply
17ย years, 8ย months ago
Highlights
Community contributions featuredUgh. 4 separate shifts is slow. In this algorithm I was trying to make an SSE version of, the functions I wrote which act like an SSE version of ROL take 68% of the running timeโฆ
17ย years, 8ย months ago
As far as I can tell, there are no instructions in the various SSE versions to do a bit shift by a non-uniform amount. E.g.: o0 = i0 << n0 o1 = i1 << n1 o2 = i2 <โฆ
17ย years, 8ย months ago
Simple N00b C# Question
Forum Reply
18ย years, 11ย months ago
I'm in need of a data structure that stores a set of objects of a given type without allowing duplicates, and supports fast insert, delete, and test for a specific item in the cโฆ
18ย years, 11ย months ago
What is the scope of Unix IPC objects (semaphores, message queues, shared memory, etc.)? Are they global (anyone may access them by the same name), local to the session (programโฆ
19ย years, 4ย months ago
Latest Activity
See all in DiscussionsUgh. 4 separate shifts is slow. In this algorithm I was trying to make an SSE version of, the functions โฆ
17ย years, 8ย months ago
As far as I can tell, there are no instructions in the various SSE versions to do a bit shift โฆ
17ย years, 8ย months ago
Quote:Original post by Zahlman(The default "hash code" is, basically, the "location in memory" of the object - although that concept โฆ
18ย years, 11ย months ago
Badges
Contributor
Conversation Opener
Regular
Rare
Decade Member
5-Year Veteran
Visionary
Rare
1-Year Veteran
Solid Start
Rare
View all badges โ