A Study of Data Structures with a Deep Heap Shape

דובר:
חגי ערן, הרצאה סמינריונית למגיסטר
תאריך:
יום רביעי, 14.3.2012, 15:00
מקום:
טאוב 701
מנחה:
Assoc. Prof. E. Petrank

Computing environments become increasingly parallel, and it seems likely that we will see more cores on tomorrow's desktops and server platforms. In a highly parallel system, tracing garbage collectors may not scale well due to deep heap structures that hinder parallel tracing. In this work we start by analyzing which data structures make current Java benchmarks create deep heap shapes. It turns out that the problem is manifested mostly with benchmarks that employ queues and linked-lists. We then propose a new construction of the queue data structure with extra references that enables better garbage collector parallelism at a low overhead.

בחזרה לאינדקס האירועים