petek, 4. oktober 2013 Seminar MARA

V ponedeljek, 7. oktobra 2013, bo ob 16.00  uri v prostorih Fakultete za matematiko, naravoslovje in informacijske tehnologije Univerze na Primorskem, Glagoljaška 8, Koper predavanje v okviru skupnega SEMINARJA ZA MATEMATIČNE IN RAČUNALNIŠKE ZNANOSTI Oddelka za matematiko in Oddelka za Informacijske znanosti in tehnologije UP FAMNIT, Oddelka za matematiko in Oddelka za Informacijske znanosti in tehnologije UP IAM, Oddelka za matematiko in računalništvo UP PEF ter Oddelkov za matematiko in teoretično računalništvo IMFM.

RAČUNALNIŠKI SEMINAR

Prostor: FAMNIT-1-RU1 ob 16:00

Predavatelj: Tine Šukljan

Naslov: Comparison between a cache-oblivious range query data structure and a quadtree

Povzetek:
After the introduction of the cache-oblivious model by Frigo et al. in 1999, a lot of research has been done about data structures that work well in multi-level memory hierarchies. Range reporting, as one of the fundamental problem in computational geometry, received a lot of attention. As there was a lot of research done in this area, there are very little implementation and comparisons between cache-oblivious and ”non”-cache-oblivious data structures.
In this article we implemented one of the cache-oblivious data structure for range queries and compared it with the quadtree. The results show, that the cache-oblivious data structure answers the queries much faster, but at the expense of bigger space consumption.

Vabljeni!