)]}'
{
  "commit": "408ed066b11cf9ee4536573b4269ee3613bd735e",
  "tree": "3b1367dafc96835c2fcbf289a7af808eb2efa605",
  "parents": [
    "bb3469ac9b50f14ad6eba129ca0ad4fd033097a0"
  ],
  "author": {
    "name": "Peter Zijlstra",
    "email": "a.p.zijlstra@chello.nl",
    "time": "Fri Jun 27 13:41:28 2008 +0200"
  },
  "committer": {
    "name": "Ingo Molnar",
    "email": "mingo@elte.hu",
    "time": "Fri Jun 27 14:31:40 2008 +0200"
  },
  "message": "sched: hierarchical load vs find_busiest_group\n\nfind_busiest_group() has some assumptions about task weight being in the\nNICE_0_LOAD range. Hierarchical task groups break this assumption - fix this\nby replacing it with the average task weight, which will adapt the situation.\n\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nCc: Srivatsa Vaddagiri \u003cvatsa@linux.vnet.ibm.com\u003e\nCc: Mike Galbraith \u003cefault@gmx.de\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "6a6b0139eb3264fc6bc3441c645ca6c72b13f2b0",
      "old_mode": 33188,
      "old_path": "kernel/sched.c",
      "new_id": "5e2aa394a81259bcb678f2cf4a7c3ca276aa86ca",
      "new_mode": 33188,
      "new_path": "kernel/sched.c"
    }
  ]
}