Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-05-28 Thread Srivatsa S. Bhat
On 05/29/2013 01:38 AM, Phillip Susi wrote: > > On 4/19/2013 3:12 AM, Srivatsa S. Bhat wrote: >> But going further, as I had mentioned in my TODO list, we can be >> smarter than this while doing compaction to evacuate memory regions >> - we can choose to migrate only the active pages, and leave

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-05-28 Thread Phillip Susi
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On 4/19/2013 3:12 AM, Srivatsa S. Bhat wrote: > But going further, as I had mentioned in my TODO list, we can be > smarter than this while doing compaction to evacuate memory regions > - we can choose to migrate only the active pages, and leave the >

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-05-28 Thread Srivatsa S. Bhat
On 05/29/2013 01:38 AM, Phillip Susi wrote: On 4/19/2013 3:12 AM, Srivatsa S. Bhat wrote: But going further, as I had mentioned in my TODO list, we can be smarter than this while doing compaction to evacuate memory regions - we can choose to migrate only the active pages, and leave the

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-05-28 Thread Phillip Susi
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On 4/19/2013 3:12 AM, Srivatsa S. Bhat wrote: But going further, as I had mentioned in my TODO list, we can be smarter than this while doing compaction to evacuate memory regions - we can choose to migrate only the active pages, and leave the

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-25 Thread Srivatsa S. Bhat
On 04/18/2013 10:40 PM, Dave Hansen wrote: > On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: >> 2. Performance overhead is expected to be low: Since we retain the simplicity >>of the algorithm in the page allocation path, page allocation can >>potentially remain as fast as it would be

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-25 Thread Srivatsa S. Bhat
On 04/18/2013 10:40 PM, Dave Hansen wrote: On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: 2. Performance overhead is expected to be low: Since we retain the simplicity of the algorithm in the page allocation path, page allocation can potentially remain as fast as it would be without

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-19 Thread Srinivas Pandruvada
On 04/19/2013 12:12 AM, Srivatsa S. Bhat wrote: On 04/19/2013 11:04 AM, Simon Jeons wrote: Hi Srivatsa, On 04/10/2013 05:45 AM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-19 Thread Srivatsa S. Bhat
On 04/18/2013 08:43 PM, Srinivas Pandruvada wrote: > On 04/18/2013 02:54 AM, Srivatsa S. Bhat wrote: >> On 04/17/2013 10:23 PM, Srinivas Pandruvada wrote: >>> On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-19 Thread Srivatsa S. Bhat
On 04/19/2013 11:04 AM, Simon Jeons wrote: > Hi Srivatsa, > On 04/10/2013 05:45 AM, Srivatsa S. Bhat wrote: >> [I know, this cover letter is a little too long, but I wanted to clearly >> explain the overall goals and the high-level design of this patchset in >> detail. I hope this helps more than

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-19 Thread Srivatsa S. Bhat
On 04/18/2013 10:40 PM, Dave Hansen wrote: > On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: >> 2. Performance overhead is expected to be low: Since we retain the simplicity >>of the algorithm in the page allocation path, page allocation can >>potentially remain as fast as it would be

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-19 Thread Srivatsa S. Bhat
On 04/18/2013 10:40 PM, Dave Hansen wrote: On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: 2. Performance overhead is expected to be low: Since we retain the simplicity of the algorithm in the page allocation path, page allocation can potentially remain as fast as it would be without

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-19 Thread Srivatsa S. Bhat
On 04/19/2013 11:04 AM, Simon Jeons wrote: Hi Srivatsa, On 04/10/2013 05:45 AM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in detail. I hope this helps more than it

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-19 Thread Srivatsa S. Bhat
On 04/18/2013 08:43 PM, Srinivas Pandruvada wrote: On 04/18/2013 02:54 AM, Srivatsa S. Bhat wrote: On 04/17/2013 10:23 PM, Srinivas Pandruvada wrote: On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-19 Thread Srinivas Pandruvada
On 04/19/2013 12:12 AM, Srivatsa S. Bhat wrote: On 04/19/2013 11:04 AM, Simon Jeons wrote: Hi Srivatsa, On 04/10/2013 05:45 AM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-18 Thread Simon Jeons
Hi Srivatsa, On 04/10/2013 05:45 AM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in detail. I hope this helps more than it annoys, and makes it easier for reviewers to relate

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-18 Thread Dave Hansen
On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: > 2. Performance overhead is expected to be low: Since we retain the simplicity >of the algorithm in the page allocation path, page allocation can >potentially remain as fast as it would be without memory regions. The >overhead is pushed

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-18 Thread Srinivas Pandruvada
On 04/18/2013 02:54 AM, Srivatsa S. Bhat wrote: On 04/17/2013 10:23 PM, Srinivas Pandruvada wrote: On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-18 Thread Srivatsa S. Bhat
On 04/17/2013 10:23 PM, Srinivas Pandruvada wrote: > On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: >> [I know, this cover letter is a little too long, but I wanted to clearly >> explain the overall goals and the high-level design of this patchset in >> detail. I hope this helps more than it

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-18 Thread Srivatsa S. Bhat
On 04/17/2013 10:23 PM, Srinivas Pandruvada wrote: On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in detail. I hope this helps more than it annoys, and

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-18 Thread Srinivas Pandruvada
On 04/18/2013 02:54 AM, Srivatsa S. Bhat wrote: On 04/17/2013 10:23 PM, Srinivas Pandruvada wrote: On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-18 Thread Dave Hansen
On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: 2. Performance overhead is expected to be low: Since we retain the simplicity of the algorithm in the page allocation path, page allocation can potentially remain as fast as it would be without memory regions. The overhead is pushed to

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-18 Thread Simon Jeons
Hi Srivatsa, On 04/10/2013 05:45 AM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in detail. I hope this helps more than it annoys, and makes it easier for reviewers to relate

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-17 Thread Srinivas Pandruvada
On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in detail. I hope this helps more than it annoys, and makes it easier for reviewers to relate to the

Re: [RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-17 Thread Srinivas Pandruvada
On 04/09/2013 02:45 PM, Srivatsa S. Bhat wrote: [I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in detail. I hope this helps more than it annoys, and makes it easier for reviewers to relate to the

[RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-09 Thread Srivatsa S. Bhat
[I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in detail. I hope this helps more than it annoys, and makes it easier for reviewers to relate to the background and the goals of this patchset.] Overview

[RFC PATCH v2 00/15][Sorted-buddy] mm: Memory Power Management

2013-04-09 Thread Srivatsa S. Bhat
[I know, this cover letter is a little too long, but I wanted to clearly explain the overall goals and the high-level design of this patchset in detail. I hope this helps more than it annoys, and makes it easier for reviewers to relate to the background and the goals of this patchset.] Overview