Use this URL to cite or link to this record in EThOS: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.695686 |
![]() |
|||||||
Title: | A study of thread-local garbage collection for multi-core systems | ||||||
Author: | Mole, Matthew Robert |
ISNI:
0000 0004 5990 6894
|
|||||
Awarding Body: | University of Kent | ||||||
Current Institution: | University of Kent | ||||||
Date of Award: | 2015 | ||||||
Availability of Full Text: |
|
||||||
Abstract: | |||||||
With multi-processor systems in widespread use, and programmers increasingly writing programs that exploit multiple processors, scalability of application performance is more of an issue. Increasing the number of processors available to an application by a factor does not necessarily boost that application's performance by that factor. More processors can actually harm performance. One cause of poor scalability is memory bandwidth becoming saturated as processors contend with each other for memory bus use. More multi-core systems have a non-uniform memory architecture and placement of threads and the data they use is important in tackling this problem. Garbage collection is a memory load and store intensive activity, and whilst well known techniques such as concurrent and parallel garbage collection aim to increase performance with multi-core systems, they do not address the memory bottleneck problem. One garbage collection technique that can address this problem is thread-local heap garbage collection. Smaller, more frequent, garbage collection cycles are performed so that intensive memory activity is distributed. This thesis evaluates a novel thread-local heap garbage collector for Java, that is designed to improve the effectiveness of this thread-independent garbage collection.
|
|||||||
Supervisor: | Jones, Richard | Sponsor: | Not available | ||||
Qualification Name: | Thesis (Ph.D.) | Qualification Level: | Doctoral | ||||
EThOS ID: | uk.bl.ethos.695686 | DOI: | Not available | ||||
Keywords: | QA Mathematics (inc Computing science) | ||||||
Share: |