search for: pessimistic

Hi guys, I must be missing something obvious with pessimistic locking. Here is what I do (Rails 2.3, mySQL): In my Foo model: def test Foo.transaction do lock = UpdateLockForFoo.find_by_foo_id(self.id, :lock => true) sleep 30 end end For each Foo model, I have an UpdateLockForFoo. This "lock" needs to be acquired before doing any c...

After installing the PessimisticLocking plugin I noticed that ActiveRecord''s count method no longer works (see below). If I remove the plugin it resolves the problem. I need both. Any ideas? I have also read that Pessimistic Locking is now baked into ActiveRecord in Edge Rails. I have tried Rails 1.1.2 and 1.1.4...

Hi, How can I upgrade my rails 1.1.6 & activerecord 1.14.4 with the pessimistic locking feature, described in http://wiki.rubyonrails.com/rails/pages/Pessimistic+Locking+Plugin/versions/3? Regards ID --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Ruby on Rails: Talk" group. To post...

Hi! Say we have a rails active-record-based model called "instance" which can have different states - STOPPED, RUNNING, STARTING_UP, SHUTTING_DOWN, etc... There is a method #start which changes the instance state to STARTING_UP only if it is STOPPED. def start if self.state == STOPPED self.state = STARTING_UP self.save ... end end As you understand if we have multiple

...ctivity, lastly I pulled a third one which as expected made the pool unusable and later exported the pool. But when I reconnected one of the previous two drives and tried a import I got this message, the pool was fine once I reconnected the last disk to "fail", so the messages seems a bit pessimistic. The second one i got when importing a old rpool with altroot but forgot to specify a new name for the pool, the solution to just add a new name to the pool was much better than recreating the pool and restoring from backup. I think this could scare or even make new users do terrible things, even...

On Thu, Jun 19, 2014 at 03:30:22PM +0400, lvqcl wrote: > BTW, what can you say about the following place in stream_decoder.c > in read_subframe_lpc_() function: > > /*@@@@@@ technically not pessimistic enough, should be more like > if( (FLAC__uint64)order * ((((FLAC__uint64)1)<<bps)-1) * ((1<<subframe->qlp_coeff_precision)-1) < (((FLAC__uint64)-1) << 32) ) > */ > if(bps + subframe->qlp_coeff_precision + FLAC__bitmath_ilog2(order) <= 32) >...

In the precompute_partition_info_sums_ function, instead of selecting 64-bit accumulator when the signal bps is larger than 16, revert to the original approach based on partition size, but make room for few extra bits to not overflow with unusual signals where the average residual magnitude may be larger than bps. It slightly improves the performance with standard encoding levels and 16-bit files

Hello... I am trying to switch to mongrel from webrick to get rid of the . puppetmaster is FreeBSD 6.2 with ruby, puppet, and mongrel all from ports (latest as of this morning). I get "Server is not a class". --verbose, --debug do not spit out any useful info. puppet-0.22.4 ruby-1.8.6.111_1,1 ruby18-bdb46-0.6.2 ruby18-gems-0.9.4 rubygem-daemons-1.0.8 rubygem-fastthread-1.0

...branch. > I would warmly welcome your help to complete the documentation, both > with part of your patches that make sense, I think the user documentation would benefit from an explanation that there are two possible approaches to NUT configuration: Simple/optimistic, without timers, and pessimistic with timers. And then a complete, fully worked example of the NUT setup for the simplest usage based on OB and LB (no timers). The example on my website covers the pessimistic (with timers) approach only. > along with the above solution if it's good too. I would not recommend putting...

...nd started aching again. > > IBM:Redhat :: Oracle:Sun At least IBM is a far more attractive buyer than the evil Oracle, well known for killing OSS companies as a strategy. Also Microsoft has ben mentioned as possible buyer of Red Hat, that would be much worse too. So, let's not be too pessimistic and give IBM a fair chance. IBM certainly does not have a bad track record on open source and as a technology-driven company, at least a much better track record than most if not all other potential buyers. -- -- Jos Vos <jos at xos.nl> -- X/OS Experts in Open Systems BV | Office...

...TID.isBranch() || TID.hasUnmodeledSideEffects()) return false; Setting hasSideEffects = 1 seems to work, but I'm not sure if that's the intended use of this flag. I notice that divide / remainder instructions for other architectures are not marked in this way. Also it is also pessimistic: if the divisor is know to be non zero then the instruction couldn't trap and would be safe to motion. Richard Osborne | XMOS http://www.xmos.com

...intain various (separate and diffently organized) "data-flow-like analyses" to do so. What else? I propose a single optimistic data-flow (fixpoint) loop to perform the deduction (similar to [2,3] but for all propagation forms and not only call sites -> callee). Given that a pessimistic initialization allows to terminate early, we can then also vary the compile time investment. Where is the catch? It will require a substantial rewrite with (some) parts that cannot be split in small independent patches. While I believe these to be easy to review*****, I want to know if...

...Also allow the queue depth to be something which can be set at module > load time or via a kernel boot-time parameter, for > testing/benchmarking purposes. Note that with indirect descriptors (which is supported by Almost Everyone), we can actually use the full index, so this value is a bit pessimistic. But it's OK as a starting point. Cheers, Rusty.

...Also allow the queue depth to be something which can be set at module > load time or via a kernel boot-time parameter, for > testing/benchmarking purposes. Note that with indirect descriptors (which is supported by Almost Everyone), we can actually use the full index, so this value is a bit pessimistic. But it's OK as a starting point. Cheers, Rusty.

...neral scheduling barriers anyway. They'll be tagged as writing to memory, yes, but like with @llvm.assume, they'll get special treatment in BasicAA and a few other places so they don't hurt code motion too badly. > > > > Aliasing x2 to A is not only unnecessary, but also pessimistic It is pessimistic, but only in the sense that the restrict qualifier does not say anything about it. > because in general you do not have access to the dynamic scope of > the restricted pointer. > > > > > T A, B; > T * x1 = .... // either &A or &B > T * y2 =...

...t purposes it seems I don't need to worry about subregisters at all. For reaching definitions I think simply tracking definitions via super registers should be sufficient. Even if a definition defines a subregister I can consider it to define the "most super" register. This will be pessimistic for cases like x86 AH/AL, but I hardly care about those at the moment. :) If MachineOperand already tracks the "most super" register then things look pretty simple as far as explicitly defined registers go. Anyone see any problem with this? Thanks! -David

Hello, I am trying to extract a callgraph using DSA, but the analysis looks quite pessimistic. I use TDD analysis and here is my test code: #include <stdlib.h> typedef void (*tX)(int a, int b); typedef void (*tY)(int a); typedef struct { tX p ; int n; } msg; static void A1(int a) { } static void B2(int a, int b) { } static void C2(int a, int b) { } tY q; static void decode(tX...

Hi Dag 2010/2/28 Dag Atle Nettum <dagatle at innit.no> > Hello > > > > I understand you are the project leader of Nut. > > > > In my company we have a Eaton 9135 6000 UPS, we are running NUT 2.4.1 > (Debian squeeze) > > > > The ups is connected with a USB cable but it reports a temperature of 300 > degredes. > > > > Can I send you

Hello... I need some help with tags. as an example: # pseudo code class ssh { file { "/etc/ssh/ssh_config": # normal stuff tag("dangerous") } file { "/etc/ssh/sshd_config": # normal stuff tag("dangerous") } file { "/etc/ssh/ssh_known_hosts": # normal stuff tag("safe") } } on client: puppetd --tags

Hi all, I have been writing a pass to heapify some alloca's (it is pessimistization, not optimization). For example, in the following control flow graph, there is a call to malloc inserted in block BB12. In order to avoid memory leak, free's are needed. The free cannot be inserted in BB23 because BB23 is not dominated by BB12. There are two ways to go I can think of here. One way is to