1. 18 12月, 2010 1 次提交
    • Y
      6807801: CMS: could save/restore fewer header words during scavenge · 8ea00085
      ysr 提交于
      Summary: Age bits need not enter the mark-word preservation calculus; also affected, in addition to CMS, per CR synopsis above, were ParNew (but not DefNew), ParallelScavenge and G1, albeit to a lesser degree than CMS.
      Reviewed-by: tonyp, johnc
      8ea00085
  2. 24 11月, 2010 1 次提交
  3. 24 10月, 2010 1 次提交
  4. 29 9月, 2010 1 次提交
  5. 21 9月, 2010 1 次提交
  6. 12 8月, 2010 1 次提交
  7. 10 8月, 2010 1 次提交
  8. 17 7月, 2010 1 次提交
  9. 28 5月, 2010 1 次提交
  10. 14 4月, 2010 1 次提交
  11. 24 12月, 2009 1 次提交
    • Y
      6631166: CMS: better heuristics when combatting fragmentation · c290220e
      ysr 提交于
      Summary: Autonomic per-worker free block cache sizing, tunable coalition policies, fixes to per-size block statistics, retuned gain and bandwidth of some feedback loop filters to allow quicker reactivity to abrupt changes in ambient demand, and other heuristics to reduce fragmentation of the CMS old gen. Also tightened some assertions, including those related to locking.
      Reviewed-by: jmasa
      c290220e
  12. 16 9月, 2009 1 次提交
  13. 29 3月, 2009 1 次提交
  14. 10 3月, 2009 1 次提交
    • X
      6814575: Update copyright year · 58e87f34
      xdono 提交于
      Summary: Update copyright for files that have been modified in 2009, up to 03/09
      Reviewed-by: katleman, tbell, ohair
      58e87f34
  15. 03 4月, 2009 1 次提交
  16. 27 1月, 2009 1 次提交
    • Y
      6786503: Overflow list performance can be improved · 7a40ef32
      ysr 提交于
      Summary: Avoid overflow list walk in CMS & ParNew when it is unnecessary. Fix a couple of correctness issues, including a C-heap leak, in ParNew at the intersection of promotion failure, work queue overflow and object array chunking. Add stress testing option and related assertion checking.
      Reviewed-by: jmasa
      7a40ef32
  17. 12 12月, 2008 1 次提交
  18. 02 12月, 2008 1 次提交
  19. 25 11月, 2008 1 次提交
  20. 21 11月, 2008 1 次提交
    • Y
      6684579: SoftReference processing can be made more efficient · bf0e7f79
      ysr 提交于
      Summary: For current soft-ref clearing policies, we can decide at marking time if a soft-reference will definitely not be cleared, postponing the decision of whether it will definitely be cleared to the final reference processing phase. This can be especially beneficial in the case of concurrent collectors where the marking is usually concurrent but reference processing is usually not.
      Reviewed-by: jmasa
      bf0e7f79
  21. 10 7月, 2008 1 次提交
  22. 03 7月, 2008 1 次提交
    • X
      6719955: Update copyright year · b85ed448
      xdono 提交于
      Summary: Update copyright year for files that have been modified in 2008
      Reviewed-by: ohair, tbell
      b85ed448
  23. 29 5月, 2008 1 次提交
  24. 14 4月, 2008 1 次提交
  25. 15 2月, 2008 1 次提交
  26. 01 12月, 2007 1 次提交