search for: amortize

Folks, I call the function calcAmorts like so: calcAmorts(prevAm, amort, myDates) Note that I use the package lubridate. The last line where do.call is called to first divide all the rows by the first row and then rbind gives the following error: Error in do.call("rbind", apply(amortsByYears, 1, "/", amortsByYears[, : second argument must be a list By contrast if

"to memory" means: mounting a ~2 GByte filesystem [ tmpfs?, or ramfs? ], and put the "/tmp" on it. [ e.g.: 4 GByte ram in the pc ]. what to write in the "/etc/fstab"? I would like to collect the [ answers too:P ]: Advantages: - Memory is way faster then HDD/SSD, so it could speed things up - "SSD amortization" is less Disadvantages: - Security?

Hi, this is my first post here, my name is Lucas and I''m just starting with rails. For one of the first models I made (an accounts plan), I had some example data in a CSV file, so I created this migration, the idea is to detect the parent/child relationships according to the account number, the code works right (if I insert some puts here and there, I can see it), but when the migration

...dified to take advantage of the new freedom to due more independence of the memory access operations. AA will capture the noalias annotation of inserted by this pass and present it to the passes. Memchecks present an overhead at run time so one question is how we ensure that any optimization will amortize the cost of these checks. Depending on the optimization, answering this could be pretty involved (i.e. almost like running the pass itself). Consider the loop vectorizer. In order to answer whether versioning the loop would make it vectorizable, you’d have to run most of the legality and profita...

.../D51664 Essentially, every instruction will carry an integer order number, and inserting new instructions invalidates the ordering. I know there are better algorithms for maintaining the ordering in the face of random insertions, but I wanted to focus on the simple case of making dominance queries amortized O(1) when no insertion is occuring. My personal belief is that most transforms are 80% analysis, 20% transformation, so most of the benefits can be delivered with simple heuristics. MLIR already uses this technique: https://github.com/llvm/llvm-project/blob/master/mlir/include/mlir/IR/Operation.h...

...ecks in reading character fields is the mkChar() function which on each call incurs a lot of garbage-collection-related overhead. I wonder if there is a "vectorized" version of mkChar, say mkChar2(char **, int length) that converts an array of C strings to a string vector, which somehow amortizes the gc overhead over the entire array? If no such function exists, I'd appreciate any hint as to how to write it. Thanks, Vadim [[alternative HTML version deleted]]

On Sun, Apr 2, 2017 at 10:47 PM, Michael S. Tsirkin <mst at redhat.com> wrote: > On Sun, Apr 02, 2017 at 04:10:12PM -0400, Willem de Bruijn wrote: >> From: Willem de Bruijn <willemb at google.com> >> >> Amortize the cost of virtual interrupts by doing both rx and tx work >> on reception of a receive interrupt if tx napi is enabled. With >> VIRTIO_F_EVENT_IDX, this suppresses most explicit tx completion >> interrupts for bidirectional workloads. >> >> Signed-off-by: Willem de B...

On Sun, Apr 2, 2017 at 10:47 PM, Michael S. Tsirkin <mst at redhat.com> wrote: > On Sun, Apr 02, 2017 at 04:10:12PM -0400, Willem de Bruijn wrote: >> From: Willem de Bruijn <willemb at google.com> >> >> Amortize the cost of virtual interrupts by doing both rx and tx work >> on reception of a receive interrupt if tx napi is enabled. With >> VIRTIO_F_EVENT_IDX, this suppresses most explicit tx completion >> interrupts for bidirectional workloads. >> >> Signed-off-by: Willem de B...

...> > return ERR_PTR(-EFAULT); > > > + get_page(alloc_frag->page); > > > + alloc_frag->offset += buflen; > > > + > > This adds an atomic op on XDP_DROP which is a data path > > operation for some workloads. > > Yes, I have patch on top to amortize this, the idea is to have a very big > refcount once after the frag was allocated and maintain a bias and decrease > them all when allocating new frags.' Why bother with refcounting for a drop though? It should be simple. -- MST

...implementation of c() where everything passed to c() is copied. I tried extending the vector by assigning to length(li) instead of using c(), but that also runs in O(n) (so the loop runs in O(n^2)) and appears to copy the elements. What I am looking for is an array that can dynamically resized in amortized constant or log time (like python's list or C++'s std::vector). I could build up a data structure inside R (the same way std::vector is built on top of C arrays), but I was hoping someone might have some advice on a better way to do this. Does R have a resizeable array type that I'm...

...m de Bruijn wrote: >> On Sun, Apr 2, 2017 at 10:47 PM, Michael S. Tsirkin <mst at redhat.com> wrote: >> > On Sun, Apr 02, 2017 at 04:10:12PM -0400, Willem de Bruijn wrote: >> >> From: Willem de Bruijn <willemb at google.com> >> >> >> >> Amortize the cost of virtual interrupts by doing both rx and tx work >> >> on reception of a receive interrupt if tx napi is enabled. With >> >> VIRTIO_F_EVENT_IDX, this suppresses most explicit tx completion >> >> interrupts for bidirectional workloads. >> >>...

...m de Bruijn wrote: >> On Sun, Apr 2, 2017 at 10:47 PM, Michael S. Tsirkin <mst at redhat.com> wrote: >> > On Sun, Apr 02, 2017 at 04:10:12PM -0400, Willem de Bruijn wrote: >> >> From: Willem de Bruijn <willemb at google.com> >> >> >> >> Amortize the cost of virtual interrupts by doing both rx and tx work >> >> on reception of a receive interrupt if tx napi is enabled. With >> >> VIRTIO_F_EVENT_IDX, this suppresses most explicit tx completion >> >> interrupts for bidirectional workloads. >> >>...

...re > independence of the memory access operations. AA will capture the > noalias annotation of inserted by this pass and present it to the > passes. > > > > > > Memchecks present an overhead at run time so one question is how we > ensure that any optimization will amortize the cost of these checks. > > > > > > Depending on the optimization, answering this could be pretty > involved (i.e. almost like running the pass itself). Consider the > loop vectorizer. In order to answer whether versioning the loop > would make it vectorizable, you...

I'm running dovecot on an OpenBSD 3.7 server and after upgrading to RC25, the daemon started exiting with: Fatal: Time just moved backwards (1173221579 -> 1173221578)! This might cause a lot of problems, so I'll just kill myself now. After upgrading to RC26, I've gotten the error: Error: Time just moved backwards by 1 seconds. I'll sleep now until we're back in

From: Willem de Bruijn <willemb at google.com> Amortize the cost of virtual interrupts by doing both rx and tx work on reception of a receive interrupt if tx napi is enabled. With VIRTIO_F_EVENT_IDX, this suppresses most explicit tx completion interrupts for bidirectional workloads. Signed-off-by: Willem de Bruijn <willemb at google.com> --- dri...

...racking.cpp) is relatively weak and expensive. It could be improved in a number of ways: 1) Review cases where potentially captured is currently returned for possible false positives. There are a couple of known ones which would make good introductory patches. 2) The results could be cached to amortize the cost. This will require careful design to ensure the result is invalidated when appropriate. 3) A more precise analysis could be used to identify object sub-graphs which do not escape (despite links between them). This would be a good project for a student interested in compiler analysis wi...

...re > independence of the memory access operations. AA will capture the > noalias annotation of inserted by this pass and present it to the > passes. > > > > > > Memchecks present an overhead at run time so one question is how we > ensure that any optimization will amortize the cost of these checks. > > > > > > Depending on the optimization, answering this could be pretty > involved (i.e. almost like running the pass itself). Consider the > loop vectorizer. In order to answer whether versioning the loop > would make it vectorizable, you...

This adds a C-only semi-private function for freeing various types of persistent data passed to libnbd. There are some similarities with nbd_add_close_callback which we removed in commit 7f191b150b52ed50098976309a6af883d245fc56. --- generator/generator | 46 +++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) diff --git a/generator/generator b/generator/generator

I received at least one email suggesting a Windows-based rendering farm - likely to consist of a few rack systems all running 64-bit Windows. I read an article on Tomshardware which gave some decent insight. What can list participants offer on this concept? I don't care _how_ the resource is implemented - virtual machine, cluster, etc. I just want to get the most resources for the money,

On Thu, Sep 06, 2018 at 12:05:19PM +0800, Jason Wang wrote: > There's no need to duplicate page get logic in each action. So this > patch tries to get page and calculate the offset before processing XDP > actions, and undo them when meet errors (we don't care the performance > on errors). This will be used for factoring out XDP logic. > > Signed-off-by: Jason Wang