Evènement pour le groupe Algorithmique Distribuée
|Date|| 2007-06-26 14:00-15:00|
|Titre||Data management in networks |
|Résumé||The area of data management (DM) concentrates on storing shared objects in the network, so that arbitrary sequences of accesses coming from network nodes can be served efficiently. In order to achieve this goal, a DM algorithm has to migrate/replicate/delete copies, so that the nodes can find them "nearby" in the network.
It is a widely explored problem, with many variants. In my talk I will present two simple extensions to DM framework:
* k-resource, which tries to model popularity of shared items, and
* a dynamic model which tries to capture network mobility / network dynamics.
No prior knowledge of data management is assumed, general knowledge of online algorithms is useful.
Relevant papers can be found on the page http://www.ii.uni.wroc.pl/~mbi/publications.html |
|Lieu||Salle 075 |
|Orateur|| Marcin Bienkowski |
|Url||Institute of Computer Science, Wroclaw University, Poland |
Aucun document lié à cet événement.RetourRetour à l'index