Forking or not for parallel computing

In linux, forking is available when parallel computing is done but not in Windows. But what is the difference ?

Let do an exemple (code is below):



When the durations of the tasks are unordered, both algorithms are performing identically. However when task durations are ordered, forking is doing much better.


library(parallel)
l <- (1:32)/10/16.5
sum(l)

 t0 <- system.time(lapply(l, FUN=function(x) {Sys.sleep(x)}))["elapsed"]

 cl <- makeCluster(detectCores())
out1 <- NULL; for (i in 1:200) out1 <- c(out1, system.time(parLapplyLB(cl = cl, X = l, fun = function(x) {Sys.sleep(x)}))["elapsed"])
stopCluster(cl)

 out2 <- NULL; for (i in 1:200) out2 <- c(out2, system.time(mclapply(l, mc.cores =detectCores(), FUN=function(x) {Sys.sleep(x)}))["elapsed"])
cl <- makeCluster(detectCores())
out3 <- NULL; for (i in 1:200) out3 <- c(out3, system.time(parLapplyLB(cl = cl, X = l[sample(32)], fun = function(x) {Sys.sleep(x)}))["elapsed"])
stopCluster(cl)

 out4 <- NULL; for (i in 1:200) out4 <- c(out4, system.time(mclapply(l[sample(32)], mc.cores =detectCores(), FUN=function(x) {Sys.sleep(x)}))["elapsed"])

 layout(mat = matrix(1:4, nrow = 2))

 hist(out1, col="blue", breaks = seq(from=0.8, to=1.3, by=0.01), xlim=c(0.8, 1.3), ylim=c(0, 60), 
     main="Without forking, ordered")
text(x = 1.15, y=50, labels = format(mean(out1), digits = 5), pos=4)
hist(out2, col="blue", breaks = seq(from=0.8, to=1.3, by=0.01), xlim=c(0.8, 1.3), ylim=c(0, 60), 
     main="With forking, ordered")
text(x = 1.15, y=50, labels = format(mean(out2), digits = 5), pos=4)
hist(out3, col="blue", breaks = seq(from=0.8, to=1.3, by=0.01), xlim=c(0.8, 1.3), ylim=c(0, 60), 
     main="Without forking, unordered")
text(x = 1.15, y=50, labels = format(mean(out3), digits = 5), pos=4)
hist(out4, col="blue", breaks = seq(from=0.8, to=1.3, by=0.01), xlim=c(0.8, 1.3), ylim=c(0, 60), 
     main="With forking, unordered")
text(x = 1.15, y=50, labels = format(mean(out4), digits = 5), pos=4)






Commentaires

Enregistrer un commentaire

Posts les plus consultés de ce blog

Standard error from Hessian Matrix... what can be done when problem occurs

An Hessian matrix is a square matrix of partial second order derivative. From the square-root of the inverse of the diagonal, it is possible to estimate the standard error of parameters. Let take an example: val=rnorm(100, mean=20, sd=5) # Return -ln L of values in val in Gaussian distribution with mean and sd in par fitnorm<-function(par, val) {   -sum(dnorm(val, par["mean"], par["sd"], log = TRUE)) } # Initial values for search p<-c(mean=20, sd=5) # fit the model result <- optim(par=p, fn=fitnorm, val=val, method="BFGS", hessian=TRUE) # Inverse the hessian matrix to get SE for each parameters mathessian <- result$hessian inversemathessian <- solve(mathessian) res <- sqrt(diag(inversemathessian)) # results data.frame(Mean=result$par, SE=res)   library(MASS) (r<-fitdistr(val, "normal")) It works well. However, the inverse of the matrix cannot be calculated if the second order derivative for some paramete
Lire la suite

stepAIC from package MASS with AICc

Due to a bug in dropterm() and addterm() in package MASS, it is impossible to use AICc with stepAIC() . Here is a solution. Enter these commands and now you can use: stepAIC(g0, criteria="AICc") or stepAIC(g0, criteria="BIC") For example: datax <- data.frame(y=rnorm(100), x1=rnorm(100),                     x2=rnorm(100), x3=rnorm(100), x4=rnorm(100)) g0 <- glm(y ~ x1+x2+x3+x4, data=datax) gx_AICc <- stepAIC(g0, criteria="AICc") gx_AIC <- stepAIC(g0, criteria="AIC") gx_AIC <- stepAIC(g0, criteria="BIC")
Lire la suite

Install treemix in ubuntu 20.04

Informations are available here  https://bitbucket.org/nygcresearch/treemix/downloads/ In terminal, enter for  Ubuntu 20.04: wget https://bitbucket.org/nygcresearch/treemix/downloads/treemix-1.13.tar.gz tar -xvf treemix-1.13.tar.gz sudo apt-get install libgsl-dev sudo apt install libboost-dev sudo apt install libboost-all-dev cd treemix-1.13/ ./configure make sudo make install And it works: $ treemix TreeMix v. 1.13 $Revision: 231 $ Options: -h display this help -i [file name] input file -o [stem] output stem (will be [stem].treeout.gz, [stem].cov.gz, [stem].modelcov.gz) -k [int] number of SNPs per block for estimation of covariance matrix (1) -global Do a round of global rearrangements after adding all populations -tf [file name] Read the tree topology from a file, rather than estimating it -m [int] number of migration edges to add (0) -root [string] comma-delimited list of populations to set on one side of the root (for migration) -g [vertices file name] [edges file name] read the g
Lire la suite