diff for duplicates of <1483465649.3064.88.camel@linux.intel.com> diff --git a/a/1.txt b/N1/1.txt index 9c09184..ba9d153 100644 --- a/a/1.txt +++ b/N1/1.txt @@ -9,7 +9,7 @@ On Tue, 2017-01-03 at 13:34 +0900, Minchan Kim wrote: > > > > > > > > > > > Patch 3 splits the swap cache radix tree into 64MB chunks, reducing -> > > > A A A A A A A A the rate that we have to contende for the radix tree. +> > > > the rate that we have to contende for the radix tree. > > > To me, it's rather hacky. I think it might be common problem for page cache > > > so can we think another generalized way like range_lock? Ccing Jan. > > I agree on the hackyness of the patch and that page cache would suffer with @@ -28,13 +28,13 @@ On Tue, 2017-01-03 at 13:34 +0900, Minchan Kim wrote: > https://patchwork.kernel.org/patch/9322793/ The batching of pages is done in this patch series with a page allocation cache -and page release cache. A It is done a bit differently than my original patch proposal. +and page release cache. It is done a bit differently than my original patch proposal. This reduces the contention on the swap_info lock. We uses the splitting of the radix tree to reduce the radix tree lock contention. In our tests, these two approaches combined are quite effective in reducing the -latency on actual fast solid state drives. A So we hope that the patch series +latency on actual fast solid state drives. So we hope that the patch series can be merged to facilitate the use case of using these drives as secondary memory. @@ -48,9 +48,3 @@ Tim > Ccing Nick who might have an interest on lockless page cache. > > Thanks. - --- -To unsubscribe, send a message with 'unsubscribe linux-mm' in -the body to majordomo@kvack.org. For more info on Linux MM, -see: http://www.linux-mm.org/ . -Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a> diff --git a/a/content_digest b/N1/content_digest index 033ffbc..e37e89a 100644 --- a/a/content_digest +++ b/N1/content_digest @@ -40,7 +40,7 @@ "> > > \n" "> > > > \n" "> > > > Patch 3 splits the swap cache radix tree into 64MB chunks, reducing\n" - "> > > > A A A A A A A A the rate that we have to contende for the radix tree.\n" + "> > > > \302\240\302\240\302\240\302\240\302\240\302\240\302\240\302\240the rate that we have to contende for the radix tree.\n" "> > > To me, it's rather hacky. I think it might be common problem for page cache\n" "> > > so can we think another generalized way like range_lock? Ccing Jan.\n" "> > I agree on the hackyness of the patch and that page cache would suffer with\n" @@ -59,13 +59,13 @@ "> https://patchwork.kernel.org/patch/9322793/\n" "\n" "The batching of pages is done in this patch series with a page allocation cache\n" - "and page release cache. A It is done a bit differently than my original patch proposal.\n" + "and page release cache. \302\240It is done a bit differently than my original patch proposal.\n" "\n" "This reduces the contention on the swap_info lock. We uses\n" "the splitting of the radix tree to reduce the radix tree lock contention.\n" "\n" "In our tests, these two approaches combined are quite effective in reducing the\n" - "latency on actual fast solid state drives. A So we hope that the patch series\n" + "latency on actual fast solid state drives. \302\240So we hope that the patch series\n" "can be merged to facilitate the use case of using these drives as secondary\n" "memory.\n" "\n" @@ -78,12 +78,6 @@ "> \n" "> Ccing Nick who might have an interest on lockless page cache.\n" "> \n" - "> Thanks.\n" - "\n" - "--\n" - "To unsubscribe, send a message with 'unsubscribe linux-mm' in\n" - "the body to majordomo@kvack.org. For more info on Linux MM,\n" - "see: http://www.linux-mm.org/ .\n" - "Don't email: <a href=mailto:\"dont@kvack.org\"> email@kvack.org </a>" + > Thanks. -c0be469a729b932f4eec9b61f371084ac332460c292a057ce703848e4299b04c +1675f7ade561d36659ba3f16da15be9f724da56e70ee719ef1ce54b6c19a773a
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.