search for: gainestown

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

2009 Oct 16
0
Nehalem & Digium Wildcard issues?
Just putting this out there to see if anyone else has seen any issues. May cross-post to asterisk-dev if it's indeed a bug (and not my own stupidity). I've got a Digium TE220 (2xT1 interface w/Echo canceller) that in two separate Nehalem-based (Xeon E5520 "Gainestown") boxes (HP ProLiant ML350 G6; HP Z800 Workstation) has caused numerous kernel panics. This is only when the dahdi service is running with a very simple config (I've defined the first span, the bchans and the dchan, and that's about it). If dahdi is stopped, or the card is remo...
2012 Feb 29
1
[LLVMdev] Proposed implementation of N3333 hashing interfaces for LLVM (and possible libc++)
...hin the > // implementation of a 'hash_value' routine or similar context. > // > // Note that 'hash_combine_range' contains very special logic for hashing > // a contiguous array of integers or pointers. This logic is *extremely* fast, > // on a modern Intel "Gainestown" Xeon (Nehalem uarch) @2.2 GHz, these were > // benchmarked at over 8.5 GiB/s for large keys, and <20 cycles/ 20 cycles per what? Don't keep us in suspense! > // > //===----------------------------------------------------------------------===// > > #ifndef LLVM_ADT_HAS...
2012 Feb 29
0
[LLVMdev] Proposed implementation of N3333 hashing interfaces for LLVM (and possible libc++)
Thanks for the feedback thus far! I've updated the header file, and enclosed a complete patch against LLVM. This passes all the regtests, and I'll be doing more thorough testing of LLVM itself with the patch. I've included some basic unit tests, but could probably do more here... Not sure it's worth delaying the initial submission though, as the best testing is to use a hash
2012 Feb 28
9
[LLVMdev] Proposed implementation of N3333 hashing interfaces for LLVM (and possible libc++)
Hello folks, TL;DR: This is my proposed hashing interface based on a proposed standard hashing interface. It also is implemented with a much faster and higher quality algorithm than the current one. This is an *early draft* of the code, looking for initial feedback. There has been recent interest in improving the quality and consistency of LLVM's approach to hashing. In particular, getting