GreyGeek

Montreal, Canada

Jul
14
comment Are there any efficient (sub)tree locking mechanisms?
@shapiro.yaacov ok got it, so in that case you need booth the transitive closure and and the inverse transitive closure as i said in the previous comment
Jul
14
comment Are there any efficient (sub)tree locking mechanisms?
You can compute the transitive closure, and check if any node in the transitive closure of your given node is already locked. This give you a check in constant time. But from the what I understand from your description, I dont understand why you would need to check for locked subtrees before locking a node.can you clarify?
Jul
14
answered Are there any efficient (sub)tree locking mechanisms?
Jul
5
revised Data structure to store intervals and allow fast deleting?
corrected spelling
Jul
4
revised Data structure to store intervals and allow fast deleting?
edited body
Jul
4
answered Data structure to store intervals and allow fast deleting?
Jun
12
revised Good practice to explicitly declare variables without 'much' use in favor of readability?
added 10 characters in body
Jun
12
answered Good practice to explicitly declare variables without 'much' use in favor of readability?
Apr
4
comment Is there a way to use the regular (live Cd) installer when using netboot/pxe images?
@Aravinda I ma not sure the page you linked answers my question. From what i read , he is talking about using an usb drive still...
Apr
4
awarded Yearling
Apr
4
asked Is there a way to use the regular (live Cd) installer when using netboot/pxe images?
Aug
1
comment is there a register corresponding to CLOCK_PROCESS_CPUTIME_ID?
@PaulA.Clayton Looking at the power ISA 2.07 it looks like the timer base is more related to something like CLOCK_REALTIME or CLOCK_MONOTONIC than CLOCK_PROCESS_CPUTIME_ID
Aug
1
awarded Scholar
Aug
1
accepted where can i find linux-tools-3.15.0-031500-generic for 14.04?
Aug
1
asked is there a register corresponding to CLOCK_PROCESS_CPUTIME_ID?
Jul
2
awarded Curious
Jun
18
awarded Supporter
Jun
14
asked where can i find linux-tools-3.15.0-031500-generic for 14.04?
Feb
20
awarded Caucus
Jul
1
comment How to efficiently compare vectors with C++?
@DyP Very true. I did some experiment and the performance of the longer the vector to be compared the worst this method performed. Adjusting the number of bucket (which i take reduce the number of hash collision ) might indeed solve the problem. Splitting the loop might also improved performance, by better cache coherency but also because it will reduce data depency and therefore increase ILP.(the two loop might even be in different threads if the vector are long enough). Finally , i think i might possible to use something like set or map and still get better performance than sorting
1 2 3 4 5