ChangeDetection - Change Log: The Aggregate Magic Algorithms

The Aggregate Magic Algorithms

Current status: normal - monitoring
Number of users monitoring this page: 1
Most recent sizable change (text, html) : 2011-08-19 08:35
Most recent change (text, html) : 2011-08-19 08:35
Last checked for changes: 2012-02-13 11:09
ChangeDetection started monitoring: 2008-08-08 08:35

monitor this page

summary of most recent changes

Showing 1 - 5 of 6

1 2 [next]

show added and deleted only added only deleted | show context hide context | show sizable show all

View changes: 2011-08-19 08:35 67 new words, 0 deleted words, 1% change

... Professor Hank Dietz . This document should be cited using something like the following bibtex entry, but with the date fetched from this site inserted: @techreport{magicalgorithms, author={Henry Gordon ... ={{The Aggregate Magic Algorithms}}, institution={University of Kentucky}, howpublished={Aggregate.Org online technical report}, URL={http://aggregate.org/MAGIC/} } Index of Algorithms Absolute ... Professor Hank Dietz . This document should be cited using something like the following bibtex entry, but with the date fetched from this site inserted: @techreport{magicalgorithms, author={Henry Gordon ... ={{The Aggregate Magic Algorithms}}, institution={University of Kentucky}, howpublished={Aggregate.Org online technical report}, URL={http://aggregate.org/MAGIC/} } Index of Algorithms Absolute Professor Hank Dietz . ... Index of Algorithms Absolute more...

View changes: 2011-06-13 08:35 25 new words, 0 deleted words, <1% change

... discussed on this page Bit Permutations by Jasper Neumann, with very nice diagrams explaining them Bit Twiddling Hacks by Sean Eron Anderson, a very carefully done collection The only thing set discussed on this page Bit Permutations by Jasper Neumann, with very nice diagrams explaining them Bit Twiddling Hacks by Sean Eron Anderson, a very carefully done collection The only thing set discussed on this page ... The only thing set

View changes: 2010-09-15 08:35 233 new words, 41 deleted words, 4% change

... 1 bit mask. For many systems, ... are some alternatives. If the messy non-negative ... 's-complement integers, Jean-Charles Meyrignac suggested including I've been sent a couple number of tricks for sign ... any bit precisions. Before his suggestion, ... in most cases. The most obvious method ... by b-a bits. A more interesting I believe this has ... Meyrignac suggested a shiftless variation that ... 1 bit mask. For many systems, ... are some alternatives. If the messy non-negative ... 's-complement integers, I've been sent a number of tricks for sign ... by b-a bits. I believe this has ... Meyrignac suggested a shiftless variation that ... /2)) . This version has been ... do it. ;-) Swap Values Without a 1 bit mask. ... 's-complement integers, Jean-Charles Meyrignac suggested including a couple of tricks for sign ... any bit precisions. Before his suggestion, ... in most cases. The most obvious method ... by b-a bits. A more interesting variation that doesn't use shifts ( ... a limited resource) basically does a 1- ... Swap Values Without a more...

View changes: 2010-08-19 08:35 541 new words, 26 deleted words, 9% change

... Pointer Field GPU Any GPU SyncBlocks Gray Code Conversion Integer ... sequences. GPU Any One of the most fundamental aggregate functions (or you might call it a collective communication) is a parallel "any" test. FundamentallyA basic SIMD operation, "any" ... on this trick.... GPU SyncBlocks The most fundamental aggregate functions (or you might call it a collective communication) is ... claimed to have invented what is an inferior variant of this algorithm and did not cite us.... ... Pointer Field GPU Any GPU SyncBlocks Gray Code Conversion Integer ... sequences. GPU Any A basic SIMD operation, "any" ... on this trick.... GPU SyncBlocks The most fundamental aggregate functions (or you might call it a collective communication) is ... claimed to have invented what is an inferior variant of this algorithm and did not cite us.... Gray Code Conversion A Pointer Field GPU Any ... sequences. GPU Any One of the most fundamental aggregate functions (or you might call it a collective communication) is a parallel "any" test. Fundamentally, "any" ... Gray Code Conversion A more...

View changes: 2009-04-28 08:35 0 new words, 7 deleted words, <1% change
... PowerPC Compiler Writer's Guide (alternatively, try this link ) Technical Site Index for PowerPC Compiler Writer's Guide ... Technical Site Index for PowerPC Compiler Writer's Guide (alternatively, try this link ) Technical Site Index for

link to this change log

Changes to the page aggregate.org/MAGIC/ are logged on this page as they are detected. You can link to this log by pasting the HTML below into your page. It produces a link which looks like this: change log

The Aggregate Magic Algorithms

monitor this page

summary of most recent changes

link to this change log

log in

search