similar to: [LLVMdev] [cfe-dev] costing optimisations

Displaying 20 results from an estimated 10000 matches similar to: "[LLVMdev] [cfe-dev] costing optimisations"

2012 Nov 23
0
[LLVMdev] [cfe-dev] costing optimisations
On 23/11/2012, at 5:46 PM, Sean Silva wrote: > Adding LLVMdev, since this is intimately related to the optimization passes. > >> I think this is roughly because some function level optimisations are >> worse than O(N) in the number of instructions. > > Please profile this and mail llvmdev regarding passes with > significantly superlinear behavior (e.g. O(n^2)). My
2012 Nov 23
2
[LLVMdev] [cfe-dev] costing optimisations
On 23.11.2012, at 15:12, john skaller <skaller at users.sourceforge.net> wrote: > > On 23/11/2012, at 5:46 PM, Sean Silva wrote: > >> Adding LLVMdev, since this is intimately related to the optimization passes. >> >>> I think this is roughly because some function level optimisations are >>> worse than O(N) in the number of instructions. >>
2012 Nov 23
0
[LLVMdev] [cfe-dev] costing optimisations
Hi, Here's a personal perspective on the issue: Firstly I don't think TeX does pre-estimation of work, it's just the standard stepwise "refinement stuff". However, the idea itself isn't necessarily a bad one. In the academic community there's a set of people (John Cavazos, Lous-Noel Pouchet, others I've forgotten) doing work on estimating which sets of
2012 Nov 24
6
[LLVMdev] Uninitialized variable - question
Hello, I was wondering about the case below. I tried to find any information in C standard, but I found nothing. In this case, variable "i" is uninitialized, but it is the _same_ value passed as an argument, so only of "a" or "b" should be printed. What I found is that with -O2: LLVM (trunk) prints both "a" and "b" GCC (4.2) prints both
2012 Nov 23
2
[LLVMdev] [cfe-dev] costing optimisations
On 23/11/2012, at 8:28 PM, David Tweed wrote: > Firstly I don't think TeX does pre-estimation of work, it's just the > standard stepwise "refinement stuff". I didn't mean that example to be taken so literally. When TeX formats a paragraph, it has to decide where to put line breaks. Breaking a line on a space has less badness that hyphenating a word. If I recall
2012 Nov 24
0
[LLVMdev] Uninitialized variable - question
On 11/24/2012 02:08 AM, Jakub Staszak wrote: > Hello, > > I was wondering about the case below. I tried to find any information in C standard, but I found nothing. > In this case, variable "i" is uninitialized, but it is the _same_ value passed as an argument, so only of "a" or "b" should be printed. > > What I found is that with -O2: > LLVM
2012 Nov 24
2
[LLVMdev] Uninitialized variable - question
On 24/11/2012, at 10:21 PM, Nick Lewycky wrote: > > Passing an uninitialized value as a function argument is undefined behaviour on the spot, regardless of what the callee does (even if it never references that argument). Cite reference? No? Then you're guessing ;) > > That aside, there is no way that 'i' has the same value, since it has no value. This is definitely
2012 Feb 14
1
Filling out a data frame row by row.... slow!
I'm reading a file and using the file to populate a data frame. The way the file is laid out, I need to fill in the data frame one row at a time. When I start reading my file, I don't know how many rows I will need. It's on the order of a million. Being mindful of the time expense of reallocation, I decided on a strategy of doubling the data frame size every time I needed to expand
2012 Nov 25
0
[LLVMdev] Uninitialized variable - question
On 11/24/2012 04:14 AM, john skaller wrote: > > On 24/11/2012, at 10:21 PM, Nick Lewycky wrote: > >> >> Passing an uninitialized value as a function argument is undefined behaviour on the spot, regardless of what the callee does (even if it never references that argument). > > Cite reference? No? Then you're guessing ;) This is a rule in C++ that I'm not sure
2017 Jan 11
2
accelerating matrix multiply
> Do you have R code (including set.seed(.) if relevant) to show on how to generate > the large square matrices you've mentioned in the beginning? So we get to some > reproducible benchmarks? Hi Martin, Here is the program I used. I only generate 2 random numbers and reuse them to make the benchmark run faster. Let me know if there is something I can do to help--alternate
2008 Mar 06
2
R code for selecting places spatially and by time
Hi all The code of trying to write relates to selecting properties (given by x and y co-ordinates) spatially (distance "X" from "infected" properties identified by date) over a certain time period. i.e. what properties are within 3 km from properties infected on "2008-01-01" over the last 14 days. Is any one able to give me some clues on how to write code to solve
2011 Aug 04
2
about dom0 disconnection when domU reboot
Hello, I have installed rpm version of xen 3.4.3+ libvirt 0.7.0-6 on my server with Centos 5.4 (kernel 2.6.18-238.12.1.el5xen) When I run reboot a domU (para virtualized Linux) by command "virsh reboot [vm]", sometimes domU cannot be rebooted but sometimes can, pattern is random. Also sometimes when domU reboots by "virsh reboot [vm]" , my ssh connection to dom0
2008 Feb 22
2
Corrected : Efficient writing of calculation involving each element of 2 data frames
Hi I have 2 data.frames each of the same number of rows (approximately 30000 or more entries). They also have the same number of columns, lets say 2. One column has the date, the other column has a double precision number. Let the column names be V1, V2. Now I want to calculate the correlation of the 2 sets of data, for the last 100 days for every day available in the data.frames. My code looks
2016 Jan 12
5
[PATCH 3/4] x86,asm: Re-work smp_store_mb()
On Tue, Jan 12, 2016 at 12:54 PM, Linus Torvalds <torvalds at linux-foundation.org> wrote: > On Tue, Jan 12, 2016 at 12:30 PM, Andy Lutomirski <luto at kernel.org> wrote: >> >> I recall reading somewhere that lock addl $0, 32(%rsp) or so (maybe even 64) >> was better because it avoided stomping on very-likely-to-be-hot write >> buffers. > > I suspect it
2016 Jan 12
5
[PATCH 3/4] x86,asm: Re-work smp_store_mb()
On Tue, Jan 12, 2016 at 12:54 PM, Linus Torvalds <torvalds at linux-foundation.org> wrote: > On Tue, Jan 12, 2016 at 12:30 PM, Andy Lutomirski <luto at kernel.org> wrote: >> >> I recall reading somewhere that lock addl $0, 32(%rsp) or so (maybe even 64) >> was better because it avoided stomping on very-likely-to-be-hot write >> buffers. > > I suspect it
2004 Aug 06
3
Mixing audio
Is There any intension to deal with mixing two or more streams encoded with "speex". Most voice wise applications (such as conference) need this feature. Oded Rephael <p><p>--- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage: http://www.xiph.org/ogg/ To unsubscribe from this list, send a message to 'speex-dev-request@xiph.org'
2005 Jul 20
2
unable to call R t-test from Java
Hello, My colleague and I would like to write Java code that invokes R to do a simple TTest. I've included my sample java code below. I tried various alternatives and am unable to pass a vector to the TTest method. In my investigation, I tried to call other R methods that take vectors and also ran into various degrees of failure. Any insight you can provide or other Web references you
2017 Jan 16
1
accelerating matrix multiply
Hi Tomas, Can you share the full code for your benchmark, compiler options, and performance results so that I can try to reproduce them? There are a lot of variables that can affect the results. Private email is fine if it is too much for the mailing list. I am measuring on Knight's Landing (KNL) that was released in November. KNL is not a co-processor so no offload is necessary. R executes
2004 Aug 06
3
q about jspeex
Hi Marc, thanks for the quick reply. Marc Gimpel wrote: > It would appear the the 'pcm2speex.read(frame, 0, frame.length)' is > blocking which means that it is waiting for data from the underlying > inputstream (i.e.AudioInputStream(t.input)). If it could read > sufficient data it would transcode it. If it recieved an EOF, it > should do some zero padding and then
2016 Jan 14
3
High memory use and LVI/Correlated Value Propagation
On Wed, Jan 13, 2016 at 03:38:24PM -0800, Philip Reames wrote: > I don't think that arbitrary limiting the complexity of the search is the > right approach. There are numerous ways the LVI infrastructure could be > made more memory efficient. Fixing the existing code to be memory efficient > is the right approach. Only once there's no more low hanging fruit should > we