similar to: [LLVMdev] GSoC 2009: An LLVM Backend for TPA

On Apr 1, 2009, at 9:53 PM, lu lu wrote: > Hi all, > I'd like to write an LLVM backend for TPA processor architecture as > part of 2009's Google Summer of Code program. Who is using the TPA processor? Is this generally useful, or specific to your research program? -Chris > > > TPA processor is a new architecture that offers the possibility of > high

I couldn't find any reference to this in the FAQ, but is it possible to sort a dataframe by multiple columns? I've created some code, similar to the following: nspr.code <- sp.results$sp.code[order( sp.results$sp.code )] nspr.tpa <- sp.results$tpa[order( sp.results$sp.code )] nspr.code <- as.character( levels( nspr.code ) )[nspr.code] nspr.tpa <- as.numeric( levels( nspr.tpa

Hello R experts: When I tried to read my data into R, it does not take # sign A subset of Exp.txt is: Experiment name assay id Varname (A1)DBA TPA 6h/DBA Acetone rep1(A1) #3 4090 A90C1 (A2)DBA TPA 6h/DBA Acetone rep2(A2) #3 4091 A91C1 The command is: Exp <- read.delim2("Exp.txt",check.names=F,as.is=T) It is excuted but gave me all the NAs. Can you all drop me a hint? Thanks

I've compile a Samba 4.0.9 for x86_64 with the following options: CPPFLAGS="-D_LARGEFILE64_SOURCE -D_FILE_OFFSET_BITS=64 -D_GNU_SOURCE -march=atom -O2 -pipe -fomit-frame-pointer" \ samba_cv_HAVE_GETTIMEOFDAY_TZ=yes \ samba_cv_HAVE_IFACE_IFCONF=yes \ samba_cv_HAVE_IFACE_IFREQ=yes \ ac_cv_have_setresuid=yes \ ac_cv_have_setresgid=yes \ ac_cv_file__proc_sys_kernel_core_pattern=yes \

Hello, One of our admins called me some time ago and told me, that my samba server (server-A) is connecting his server (server-B), although it shouldn't. Authentication of my samba shares is working via winbind, configured to use "server-DC1" : winbind separator = / winbind uid = 10000-20000 winbind gid = 10000-20000 winbind enum users = yes

Software list: FreeBSD 5.3 Samba 3.0.14a nss_ldap-1.204_5 openldap-client-2.2.19 openldap-server-2.2.23 p5-perl-ldap-0.32.02 pam_ldap-1.7.6 smbldap-tools-0.8.8 samba was configured with the following options. LDAP, Cups, Winbind, utmp, popt, acl, quotas, msdfs, syslog, without_ADS I have also tried winbind_nss which I believe is a FreeBSD wrapper around the linux implentation of winbindd, but

Follow up to original post. If I created local groups and users in /etc/passwd & /etc/groups I get farther along. For instance, if I have a Samba PDC with LDAP basically like I listed in my post. If I browse from a w2k pro box to the samba server without the workstation having joined the domain, I can authenticate to the samba server with a user who is not in /etc/passwd but is in LDAP. So

I have some matrices stored as elements in a list that I am working with. On example is provided below as TP[[18]] > TP[[18]] level2 level1 1 2 3 4 1 79 0 0 0 2 0 0 0 0 3 0 0 0 0 4 0 0 0 0 Now, using prop.table on this gives > prop.table(TP[[18]],1) level2 level1 1 2 3 4 1 1 0 0 0 2 3

Andreas Bolka wrote: > Hi all, > > I'd like to have a first stab at a loop-based auto-vectorization pass as > part of 2009's Google Summer of Code program. As far as I can tell from > searching the mailing list archives, no work on such an auto-vectorizer > seems to be currently in progress. Hi Andreas, Actually, you'd be the third person to try writing one, with

Hi all, I'd like to have a first stab at a loop-based auto-vectorization pass as part of 2009's Google Summer of Code program. As far as I can tell from searching the mailing list archives, no work on such an auto-vectorizer seems to be currently in progress. Whereas auto-vectorization is a well-researched topic, complexity seems to quickly explode once more advanced loop constructs are

Hello, Kshitiz > I was interested in taking up the project ideas on adding profile driven > optimization passes and improving alias analysis as this would give me a > chance to carry forward and improve my current work and also contribute > significantly in terms of tangibles. This sounds like a great idea. LLVM definitely lacks some profile-driven optimizations. -- With best

In the ESL(2) (by F-H-T), they have labels on their Lasso graphs (specifically for the South African Heart Disease data). So my question is, how do I label each variable in a similar way on my graph. The following code should produce a plot with 9 enumerated variables: library(glmnet) x=matrix(rnorm(100*9),100,9) y=rnorm(100) g2=sample(1:2,100,replace=TRUE)

I everybody... i need help to enable boot.log at CentOS 5... i have a old server running for a few months, and sometimes when system boots up, a can see FAIL status, but the screen scrools fast and i cant determine which service can not boot up properly... Best Regards Cleiton Cipriani

On Apr 3, 2009, at 12:52 AM, Kshitiz Garg wrote: > Here is my formal proposal i have submitted in gsoc. Comments invited. > This sounds like a very interesting proposal. Many compilers clone loops and use dynamic checks to enforce invariants in one copy of the loop. Is this intended to be similar to that style of approach? -Chris > > About me: > > I am a final

Here is my formal proposal i have submitted in gsoc. Comments invited. About me: I am a final semester Dual Degree( B.Tech. M.Tech.) student from Indian Institute of Technology, Kanpur. I was looking forward to participate in this year's GSoC 2009.Starting Fall 2009 i shall be pursuing a Phd in compilers. I am having a good background in compilers. My current masters thesis is aimed at

Hello, I am a final semester Dual Degree( B.Tech. M.Tech.) student from Indian Institute of Technology, Kanpur. I was looking forward to participate in this year's GSoC 2009.Starting Fall 2009 i shall be pursuing a Phd in compilers. I am having a good background in compilers. My current masters thesis is aimed at automatic parallel code from c programs target for the Cell Processor using

Hello all, I would like to participate in this year's Google Summer of Code and I am sending you a short description of my proposal. I have written the formal proposal already and if someone is interested I can send him the pdf. One of the open projects in the LLVM list is to enhance LLVM with static profiling capabilities. LLVM already provides a unified structure for writing pro

Nick Lewycky wrote: > Andreas Bolka wrote: >> Hi all, >> >> I'd like to have a first stab at a loop-based auto-vectorization pass as >> part of 2009's Google Summer of Code program. As far as I can tell from >> searching the mailing list archives, no work on such an auto-vectorizer >> seems to be currently in progress. > > Hi Andreas, >

On Mar 31, 2009, at 5:27 PM, Andreas Bolka wrote: > Hi all, > I'd like to have a first stab at a loop-based auto-vectorization > pass as > part of 2009's Google Summer of Code program. As far as I can tell > from > searching the mailing list archives, no work on such an auto- > vectorizer > seems to be currently in progress. Hi Andreas, This would be a very

This proposal adds support for path profiling [Ball96] to LLVM. Path profiling compactly represents acyclic paths in a directed acyclic graph representation of the control flow graph of a routine. Instrumentation can be added to uniquely identify paths executed at runtime. Path profiles enable precise enumeration of the sequence of basic blocks executed in order for a particular path. Using path