University of Birmingham > Talks@bham > Postgraduate Seminars in the School of Computer Science > A Parallel Matching Algorithm for Continuous Interest Management

A Parallel Matching Algorithm for Continuous Interest Management

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mohamed Menaa.

In recent years, the scale of distributed virtual environments (DVEs) as grown rapidly in terms of number of participants and virtual entities. Many DVEs employ interest management schemes to reduce bandwidth consumption and thus enhance the scalability of the system. Most of the existing interest management approaches, however, have a fundamental disadvantage – they perform interest matching at discrete time intervals. As a result, they would fail to report events between consecutive time-steps of simulation which leads to incorrect simulations. This talk presents an interest matching algorithm which aims to capture missing events between discrete time-steps. This algorithm facilitates parallelism by distributing the workload of matching across multiple processors. Since it is increasingly common to deploy commercial DVE applications on shared-memory multiprocessor machines, using the parallel algorithm for these applications would be more suitable than the existing serial algorithms.

This talk is part of the Postgraduate Seminars in the School of Computer Science series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.