| Message ID | 20110826072927.5b4781f9@kryten |
|---|---|
| State | New, archived |
| Headers | show |
Le vendredi 26 août 2011 à 07:29 +1000, Anton Blanchard a écrit : > +/* > + * We set the batch at 2 * num_online_cpus(), with a minimum of 32 and > + * a maximum of 1024. > + */ > static void compute_batch_value(void) > { > int nr = num_online_cpus(); > > - percpu_counter_batch = max(32, nr*2); > + percpu_counter_batch = min(1024, max(32, nr*2)); > } > > static int __cpuinit percpu_counter_hotcpu_callback(struct notifier_block *nb, Or use the following : percpu_counter_batch = clamp(nr*2, 32, 1024); -- To unsubscribe from this list: send the line "unsubscribe linux-ext4" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
On Fri, Aug 26, 2011 at 07:29:27AM +1000, Anton Blanchard wrote: > > When testing on a 1024 thread ppc64 box I noticed a large amount of > CPU time in ext4 code. > > ext4_has_free_blocks has a fast path to avoid summing every free and > dirty block per cpu counter, but only if the global count shows more > free blocks than the maximum amount that could be stored in all the > per cpu counters. > > Since percpu_counter_batch scales with num_online_cpus() and the maximum > amount in all per cpu counters is percpu_counter_batch * num_online_cpus(), > this breakpoint grows at O(n^2). > > This issue will also hit with users of percpu_counter_compare which > does a similar thing for one percpu counter. > > I chose to cap percpu_counter_batch at 1024 as a conservative first > step, but we may want to reduce it further based on further benchmarking. > > Signed-off-by: Anton Blanchard <anton@samba.org> Yeah, capping the upper bound seems reasonable but can you please add some comment explaining why the upper bound is necessary there? Thank you.
On Aug 25, 2011, at 5:29 PM, Anton Blanchard wrote: > > When testing on a 1024 thread ppc64 box I noticed a large amount of > CPU time in ext4 code. > > ext4_has_free_blocks has a fast path to avoid summing every free and > dirty block per cpu counter, but only if the global count shows more > free blocks than the maximum amount that could be stored in all the > per cpu counters. > > Since percpu_counter_batch scales with num_online_cpus() and the maximum > amount in all per cpu counters is percpu_counter_batch * num_online_cpus(), > this breakpoint grows at O(n^2). I understand why we would want to reduce this number. Unfortunately, the question is what do we do if all 1024 threads try to do buffered writes into the file system at the same instant, when we have less than 4 megabytes of space left? The problem is that we can then do more writes than we have space, and we will only find out about it at write back time, when the process may have exited already -- at which point data loss is almost inevitable. (We could keep the data in cache and frantically page the system administrator to delete some files to make room for dirty data, but that's probably not going to end well….) What we can do if we must clamp this threshold is to also increase the threshold at which we shift away from delayed allocation. We'll then allocate each block at write time, which does mean more CPU and less efficient allocation of blocks, but if we're down to our last 4 megabytes, there's probably not much we can do that will be efficient as far as block layout anyway…. -- Ted -- To unsubscribe from this list: send the line "unsubscribe linux-ext4" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
Hi Ted, > I understand why we would want to reduce this number. > Unfortunately, the question is what do we do if all 1024 threads try > to do buffered writes into the file system at the same instant, when > we have less than 4 megabytes of space left? > > The problem is that we can then do more writes than we have space, and > we will only find out about it at write back time, when the process > may have exited already -- at which point data loss is almost > inevitable. (We could keep the data in cache and frantically page > the system administrator to delete some files to make room for dirty > data, but that's probably not going to end well….) > > What we can do if we must clamp this threshold is to also increase the > threshold at which we shift away from delayed allocation. We'll then > allocate each block at write time, which does mean more CPU and > less efficient allocation of blocks, but if we're down to our last 4 > megabytes, there's probably not much we can do that will be efficient > as far as block layout anyway…. Thanks for the explanation, I'll go back and take another look. Anton -- To unsubscribe from this list: send the line "unsubscribe linux-ext4" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
On Fri, Aug 26, 2011 at 07:48:52AM -0400, Theodore Tso wrote: > > I understand why we would want to reduce this number. Unfortunately, the > question is what do we do if all 1024 threads try to do buffered writes into > the file system at the same instant, when we have less than 4 megabytes > of space left? Oops, sorry, that should be 4 GB of space left (i.e., what do we do if all 1024 cpu's all try write 1024 4k blocks all at the same time). Imagine an simulation application where all threads finish at more or less the same time and then try to write out their data files at the same time.... - Ted -- To unsubscribe from this list: send the line "unsubscribe linux-ext4" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
Index: linux-2.6-work/lib/percpu_counter.c =================================================================== --- linux-2.6-work.orig/lib/percpu_counter.c 2011-07-31 20:37:12.580765739 +1000 +++ linux-2.6-work/lib/percpu_counter.c 2011-08-25 11:43:57.828695957 +1000 @@ -149,11 +149,15 @@ EXPORT_SYMBOL(percpu_counter_destroy); int percpu_counter_batch __read_mostly = 32; EXPORT_SYMBOL(percpu_counter_batch); +/* + * We set the batch at 2 * num_online_cpus(), with a minimum of 32 and + * a maximum of 1024. + */ static void compute_batch_value(void) { int nr = num_online_cpus(); - percpu_counter_batch = max(32, nr*2); + percpu_counter_batch = min(1024, max(32, nr*2)); } static int __cpuinit percpu_counter_hotcpu_callback(struct notifier_block *nb,
When testing on a 1024 thread ppc64 box I noticed a large amount of CPU time in ext4 code. ext4_has_free_blocks has a fast path to avoid summing every free and dirty block per cpu counter, but only if the global count shows more free blocks than the maximum amount that could be stored in all the per cpu counters. Since percpu_counter_batch scales with num_online_cpus() and the maximum amount in all per cpu counters is percpu_counter_batch * num_online_cpus(), this breakpoint grows at O(n^2). This issue will also hit with users of percpu_counter_compare which does a similar thing for one percpu counter. I chose to cap percpu_counter_batch at 1024 as a conservative first step, but we may want to reduce it further based on further benchmarking. Signed-off-by: Anton Blanchard <anton@samba.org> --- -- To unsubscribe from this list: send the line "unsubscribe linux-ext4" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html