search for: systimes

...patres pattern=SS{1,2},sequences=seqres 3 AAdistribution_fct.r Aares sequences=patres ####################################################################### # source functions and get system times ####################################################################### systimes<-data.frame() nrows<-nrow(funcs) i<-0 for(i in 1:nrows) { func<-funcs[i,1] systime<-system.time(source(func)) systimes[i,1]<-func systimes[i,2]<-"source" systimes[i,3]<-systime[1] systimes[i,4]<-systime[2] systimes[i,5]<-systime[3] } ###########...

The following C test program was compiled using LLVM with -O3 option and MSVC with /O2. The MSVC one is about 600 times faster than the one compiled with the LLVM. We can see that the for loop in MSVC assembler is solved in the optimization pass more efficiently than that in LLVM. Is there an way to get a optimization result in LLVM like that of the MSVC? Manoel Teixeira #include

Hello all. I am trying to use WINE to make a windoze-only development environment (very rudimentar, command line cross-compiler and stuff) under Linux, because GNU make is far superior from the M$'s 'nmake'. Anyway, I have some trouble with expirating licenses and stuff, and the solution is to revert the system date back to some valid thing and then compile. Since I am now running

Hey folks, I have a problem with the definition of a variable of type slist in CFEngine on # uname -a ; cat /etc/redhat-release Linux policyhub.example.com 3.10.0-693.el7.x86_64 #1 SMP Tue Aug 22 21:09:27 UTC 2017 x86_64 x86_64 x86_64 GNU/Linux CentOS Linux release 7.4.1708 (Core) I'm not sure if its valid to ask CFEngine questions on this mailing list, but as far as I'm running on

Hi list, one and hopefully last strange thing I figured out ist the systime of my guests. Dom0 uses ntp for time syncronisation. I set the time on my guests manually but after reboot any machine (Windows server, XP, Freebsd, even PV Machines like ubuntu) all run local time - 2 hours. /proc/sys/xen/independent_wallclock is set to 0 so actually the time should be set by dom0...(?) Any

Hi, everyone I'm writing a virtual machine monitor based on libvirt. As I read the api reference, I found I'm confused by some terms. 1, What is cumulative I/O wait CPU time? API reference says that VIR_NODE_CPU_STATS_IOWAIT indicate cumulative I/O wait CPU time. I'm confused by this time. As far as I know, when cpu meets IO wait situation, it will schedule another task, so,

1. Re: LLVM optmization (Bill Wendling) Hi, The IR is not wrong. I said that the assembler generated by MSVC is quicker. We can see that the for loop, in the TESTE function, is done without jump's in the MSVC and with jumps in LLVM. I think thats the point. If we don't use threads, the result is the same. My test were done with one billion interactions in the for loop. The MSVC

On Thu, 26 Jul 2018, Meikel wrote: > Hey folks, > > I have a problem with the definition of a variable of type slist in CFEngine > on > > # uname -a ; cat /etc/redhat-release > Linux policyhub.example.com 3.10.0-693.el7.x86_64 #1 SMP Tue Aug 22 21:09:27 > UTC 2017 x86_64 x86_64 x86_64 GNU/Linux > CentOS Linux release 7.4.1708 (Core) > > I'm not sure if its

Shows that as the MCU increases, the OpenMP extra overhead is amortized and OpenMP becomes as fast as the pthreads implementation. The last chart http://lampiao.lsc.ic.unicamp.br/~piga/gsoc_2008/systime.png Shows that both pthreads and OpenMP overhead decreases as what seems to be a logarithmic function of the MCU size. This was a great experiment, and from what I can conclude, the OpenMP

Hi, This email is to inform what I have been doing since the mid-term. After the mid-term I worked on a pipeline implementation with OpenMP. As I said before I did a pipelined implementation of these functions: (c_dec_dc_unpredict_mcu_plane + oc_dec_frags_recon_mcu_plane) and (oc_state_loop_filter_frag_rows + oc_state_borders_fill_rows) as explained in my previous email. But the results were

I want to start R processes on multiple processors from single shell script and I want all of them to have different random seeds. One way of doing this is sleep 2 # (with 'sleep 1' I am often getting the same number) ... set.seed(unclass(Sys.time())) Is there a simpler way without a need to sleep between invoking different R processes ? Ryszard

Is there a package to do this? Normally the hardware clock is set during shutdown if one is running ntpd. But if a long-running server shuts down unexpectedly, this isn't done, and the hardware clock might be off by a lot when it comes back up. So setting it periodically from a cron job could be useful. What do others do? Adding a one liner to /etc/cron.daily that invokes

The hv_utils module will be composed of more than one file; rename hv_utils.c to accommodate this without changing the module name. Signed-off-by: K. Y. Srinivasan <ksrinivasan at novell.com> -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: hv_util_cleanup.patch Url:

The hv_utils module will be composed of more than one file; rename hv_utils.c to accommodate this without changing the module name. Signed-off-by: K. Y. Srinivasan <ksrinivasan at novell.com> -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: hv_util_cleanup.patch Url:

Hello I am using openssh as vpn on a router with freewrt.org and rsync to sync my local data to a remote server. Everything works fine for me so far. The only problem is that the channel-1 (tun0) goes down on the router after 50-200MB transfered via tun0 or after 5-20 hours only with a ping to the server . Channel-0 is still working. Tcpdump shows that a ping from the router to the server via

v14->v15: - Incorporate PeterZ's v15 qspinlock patch and improve upon the PV qspinlock code by dynamically allocating the hash table as well as some other performance optimization. - Simplified the Xen PV qspinlock code as suggested by David Vrabel <david.vrabel at citrix.com>. - Add benchmarking data for 3.19 kernel to compare the performance of a spinlock heavy test

v14->v15: - Incorporate PeterZ's v15 qspinlock patch and improve upon the PV qspinlock code by dynamically allocating the hash table as well as some other performance optimization. - Simplified the Xen PV qspinlock code as suggested by David Vrabel <david.vrabel at citrix.com>. - Add benchmarking data for 3.19 kernel to compare the performance of a spinlock heavy test

v15->v16: - Remove the lfsr patch and use linear probing as lfsr is not really necessary in most cases. - Move the paravirt PV_CALLEE_SAVE_REGS_THUNK code to an asm header. - Add a patch to collect PV qspinlock statistics which also supersedes the PV lock hash debug patch. - Add PV qspinlock performance numbers. v14->v15: - Incorporate PeterZ's v15 qspinlock patch and improve

v15->v16: - Remove the lfsr patch and use linear probing as lfsr is not really necessary in most cases. - Move the paravirt PV_CALLEE_SAVE_REGS_THUNK code to an asm header. - Add a patch to collect PV qspinlock statistics which also supersedes the PV lock hash debug patch. - Add PV qspinlock performance numbers. v14->v15: - Incorporate PeterZ's v15 qspinlock patch and improve

Hi there We have a pair of servers running FreeBSD 9.1-RC3 that act as transparent layer 7 loadbalancer (relayd) and pop/imap proxy (dovecot). Only one of them is active at a given time, it's a failover setup. From time to time the active one gets in a state in which the 'thread taskq' thread uses up 100% of one cpu on its own, like here: ---- PID USERNAME PRI NICE SIZE