similar to: [LLVMdev] llvm

Hello, I am an absolutely beginner with regards to R, so forgive me for my potentially very stupid questions. I have been attempting to create recurrence plots using R. The data I am using is based on a mutually exclusive and exhaustive coding scheme with over 40 individual codes which can be assigned to 6 higher order categories. When I carry out the usual rqa command, my plot is pretty much

I am a Biologist and a beginner, please help me to solve this: please anyone..its my homework and I dont have a clue abt R yet.. Write a function which does the following tasks: (a) Calculates minimum and maximum value of a given argument x. (b) If x is positive, some new vector gets the value of TRUE, and FALSE otherwise. (c) Creates a vector where the i:th and (i-1):th values of x are always

Hi, I am involved in the task of achieving speculative paralellisation in llvm. I have started my work by trying to see if a simple for loop can be paralellised in llvm.. The problem is i want to know how to check if a program is automatically parallelised when compiled with llvm or if explicitly need to do it how can i go about paralellising a for loop using llvm compiler infrsatructure.how

Dear all, I am Raghesh, a student pursuing M.Tech at Indian Institute of Technology, Madras, India. I would like to make contribution to the Polly project (http://wiki.llvm.org/Polyhedral_optimization_framework) as part of GSOC 2011. I have gained some experience working in OpenMP Code generation for Polly. This is almost stable now and planning to test with the polybench benchmarks. Some of

Dear R users, I'm still a beginner and I'm wondering whether S3 or S4 methods really differ for my use. I understand more or less the distinction between the 2 classes from the documentation I've read but the big question is: _*does it make a difference in practice**?*_ Up to now, I've worked without noticing anything, but it might be important to differentiate and to know

Hi Bekket, Thank you for your reply. Earlier I came across a paper called "Dynamic Look Ahead Compilation: Hide JIT compilation latencies", it devised some methods for JIT compilation of functions before the actual call takes place by using call graph analysis, branch probabilities to generate a list of functions with high likelihood of execution in near future. In my opinion it

Hi, David: Good point, it will be interesting to see speculative compilation in this context applying on devirtualization, with high level (type) information if applicable. > On Mar 28, 2019, at 2:35 PM, preejackie <praveenvelliengiri at gmail.com> wrote: > > Hi David & Bekket, > > Thanks your replies :) > > David, Indent here is: ORC v2 JIT APIs has

On Mar 31, 2008, at 7:01 AM, Török Edwin wrote: > Evan Cheng wrote: >> On Mar 29, 2008, at 6:02 AM, Török Edwin wrote: >> >> >>> Hi, >>> >>> I would like to transform unpredictable conditional branches with a >>> small body into cmov instructions to reduce branch miss penalty. >>> LLVM generates cmov/setcc instructions when

Hi Bekket, Sorry for the delayed reply. By appropriate, I mean performance of compiled native code. I was referring other JIT implementations like LuaJIT & webkit FTL JIT to see how they implement their JIT. I have gone through the design of Spider Monkey & Android runtime (ART) JIT. As, you said both region based and method based compilation unit have their own advantage &

On Mar 29, 2008, at 6:02 AM, Török Edwin wrote: > Hi, > > I would like to transform unpredictable conditional branches with a > small body into cmov instructions to reduce branch miss penalty. > LLVM generates cmov/setcc instructions when SelectInst is used. The > idea > is to transform regular branches into selects, when that is possible > and > profitable. LLVM

Hi all, I would like to propose "Speculative compilation support in ORC v2 JIT API" for this year GSoC summer project. Project Description: Speculative compilation support. One of the selling points of the concurrent ORC APIs is that you can start compiling a function before you need it, in the hope that by the time that you do need it it is already compiled. However, if we just

Evan Cheng wrote: > On Mar 29, 2008, at 6:02 AM, Török Edwin wrote: > > >> Hi, >> >> I would like to transform unpredictable conditional branches with a >> small body into cmov instructions to reduce branch miss penalty. >> LLVM generates cmov/setcc instructions when SelectInst is used. The >> idea >> is to transform regular branches into

Hi, I'm running the actual R version in JGR (version 1.5-8 ). Sys.getlocale(category = "LC_ALL") yields [1] "LC_COLLATE=German_Germany.1252;LC_CTYPE=German_Germany.1252;LC_MONETARY=German_Germany.1252;LC_NUMERIC=C;LC_TIME=German_Germany.1252" I want to write some HTML-Code enhanced by statistical results and labels encoded in Latin-1, which I pass to a function. Some

Hi all, I'm interested in creating a speex app for Pocket PC devices but first, I'm not (yet) a programmer nor a techie person so even though I read through the whole manual twice, I'm still not sure exactly what I should do. Please help! For starters, I just want to convert a wave file into a speex file using the speexenc/speexdec utilities or whatever else is available. I

There is now a document called "Some hints for the R beginner" whose purpose is to get people up and running with R as quickly as possible. Direct access to it is: http://www.burns-stat.com/pages/Tutor/hints_R_begin.html JRR Tolkien wrote a story (sans hobbits) called 'Leaf by Niggle' that has always resonated with me. I offer you an imperfect, incomplete tree (but my roof is

Hi, R Devils, I'm running the actual R version in JGR (version 1.5-8 ). Sys.getlocale(category = "LC_ALL") yields [1] "LC_COLLATE=German_Germany.1252;LC_CTYPE=German_Germany.1252;LC_MONETARY=German_Germany.1252;LC_NUMERIC=C;LC_TIME=German_Germany.1252" I want to write some HTML-Code enhanced by statistical results and labels encoded in Latin-1, which I pass to a function.

Hi I try parallelising some code using the snow package and the following lines: cl <- makeSOCKcluster(8) pfunc <- function (x) (if(x <= (-th)) 1 else 0) ###correlation coefficient clusterExport(cl,c("pfunc","th")) cor.c.f <- parApply(cl,tms,c(1,2),FUN=pfunc) The parApply results in the error message: > cor.c.f <- parApply(cl,tms,c(1,2),FUN=pfunc) Error

This mail message follows from several discussions with Luke Leighton. It's mostly technical in nature but I'm submitting to all mailing lists anyway (Luke's suggestion). We have our Samba server running with the Berkeley AMD automounter (nothing peculiar here). In order for our Samba users to walk the automount tree, we created a program to create symbolic links from the local

hello, The concept of a PDC is every machine logs into the domain controller to get access to n/w resources(file and print sharing). and in windows if i have a NT or 2000 machine as a domain controller,every other workstation or a client logs in to DC for n/w resources. And samba is a server software on linux server,which i assume(iam new to linux n/w'ing,so still fighting hard

Hello, I have some code to run on an XGrid cluster. Currently the code is written as a single, large job... this is no good for trying to run in parallel. To break it up I have basically taken out the highest level for-loop and am planning on batch-running many jobs, each one representing an instance of the removed loop. However, when it comes to output I am stuck. Previously the output was