|
The group runs a weekly seminar series, covering papers,
projects, and events related with our research. These seminars
are open to anyone on Chalmers or GU who wishes to attend.
Seminars 2003
Current seminar series coordinator: Daniel Cederman.
| Date | Time | Location | Speaker | Refreshment Organizer | Title + Abstract |
| må, dec 1 | 13.30 | S4 | Ha Hoai Phuong | Yi | Efficient and Practical Constructions of LL/SC Variables
I will present the paper "Efficient and Practical Constructions of LL/SC Variables" by P. Jayanti et al. We will look at implemenations of a 64-bit LL/SC object, which have constant time complexity and use a constant amount of space per process, from 64-bit CAS/read or RLL/RSC objects. |
| må, nov 24 | 13.00 | S4 | Håkan Sundell | Håkan | Lock-Free Reference Counting
I will present the paper "Lock-Free Reference Counting" by Moir et al. I will explain how to preserve the concepts they present (as the concepts are interesting), avoiding the expensive and very rare DCAS operation by instead looking on results from Valois and the correction by Michael et al. |
| ti, okt 14 | 13.30 | Buss | Niklas Elmqvist | Philippas | Rehearsal for InfoViz 2003 talk
We present Growing Polygons, a novel visualization technique for the graphical representation of causal relations and information flow in a system of interacting processes. Using this method, individual processes are displayed as partitioned polygons with color-coded segments showing dependencies to other processes. The results from a comparative user study of the method show that the Growing Polygons technique is significantly more efficient than the traditional Hasse diagram visualization. In addition, the subjective ratings of the users rank the method as superior in all regards, including usability, efficiency, and enjoyability. |
| ti, sep 30 | 13.30 | S4 | Boris Koldehofe | - | Buffer Management in Probabilistic Peer-to-Peer Communication Protocols
I'll plan to reherse a talk on
"Buffer Management in Probabilistic Peer-to-Peer Communication Protocols"
to be presented at SRDS. In multipeer communication decentralised probabilistic protocols have received a lot of attention because of their robustness against faults in the communication traffic and their potential to provide scalability for large groups. These protocols provide a probabilistic guarantee for a propagated event to reach every group member. Recent work aims to improve the scalability of such protocols by reducing memory requirements. In saving memory resources, the history buffer, which is used to ``remember'' received events and to prevent multiple deliveries of events to the application, plays a very significant role. We examine how the buffer size should be chosen to challenge the multiple delivery problem. Further, we propose and evaluate several methods of organising the dissemination of events in order to provide high reliability and reduce the number of multiple deliveries at the same time.
|
| må, sep 22 | 13.30 | S2 | Yi Zhang | Niklas Elmqvist | Phylogenetic tree reconstruction
Phylogenetic tree reconstruction uses the information contained in the DNA sequences for organisms to infer the evolutionary relationships among them. The phylogenetic tree reconstruction problem is computationally difficult because the number of candidate tree increases rapidly with the number of sequence to be included in the tree. An overview of algorithms for this problem will be given and there will be some discussion on what we can do with this problem |
| må, sep 15 | 13.30 | S2 | Ha Hoai Phuong | Marina | Rehearsal
Rehearsal. |
| må, sep 8 | 13.30 | S4 | Marina Papatriantafilou | Anders | Group meeting
Group Meeting. |
| må, aug 25 | 13.30 | S4 | Ha Hoai Phuong | Yi | Self Adjusting Tree
Self Adjusting Tree. |
| må, aug 18 | 13.30 | S4 | Ted Herman | Phuong | Self-stabilizing data structures
Ted Herman is planning to talk on self-stabilizing data structures. |
| må, jun 23 | 13.30 | S4 | Philippas Tsigas | Anders | Web page discussion
We will have a discussion about our group's web pages. |
| må, jun 2 | 13.30 | S4 | Niklas Elmqvist | Philippas | Growing Squares: Animated Visualization of Causal Relations
This talk is a rehearsal of the talk I will be giving at the ACM SoftVis 2003 conference about a novel technique for visualizing causal relations, such as the message passing between concurrently executing processes in a distributed system. The new visualization technique, called "Growing Squares", uses animation and color in conjunction with a metaphor of growing color pools to portray the information flow and dependencies in the system. Comparative user studies performed on the new method and traditional Hasse (or time-space) diagrams show a significant improvement in efficiency for sparse data sets, whereas there is no significant difference in efficiency for dense sets. However, the subjective ratings of our method indicate that users vastly prefer the Growing Squares technique in all regards. |
| må, maj 26 | 13.30 | S4 | Anders Gidenstam & Philippas Tsigas | Marina | 31st spring school in theorical computer science - 2
Report on the 31st spring school in theorical computer science: Distributed Algorithms (continue).
Travel report on IPDPS 2003.
|
| må, maj 19 | 13.30 | S4 | Anders Gidenstam | Boris | 31st spring school in theorical computer science
Report on the 31st spring school in theorical computer science: Distributed Algorithms. |
| må, maj 5 | 13.30 | S4 | Ha Hoai Phuong | Niklas | Fast, Reactive and Lock-free Multi-word Compare-and-swap Algorithms
Shared memory multiprocessors typically provide a set of single-word compare-and-swap-like hardware primitives to support synchronization. Although these are conceptually powerful enough to support higher-level synchronization, from the programmer's point of view they are not as useful as their generalizations to the multi-word objects. This paper presents two fast and reactive lock-free multi-word compare-and-swap algorithms. The algorithms dynamically measure the level of contention and automatically react to guarantee good performance. Experiments on a SGI-Origin2000 multiprocessor show that our algorithms react fast according to the contention variations and perform two to nine times faster than the best-known alternatives. |
| må, apr 28 | 13.15 | S4 | Boris Koldehofe | Anders | Licentiate seminar rehearsal
Boris will do the rehearsal for his Licentiate seminar. |
| må, mar 24 | 13.30 | S4 | Álvaro Bilbao | Phuong | Interactive Systems in Distributed Enironments
The contents of the presentation will be on a project that Alvaro has been working on recently, in the area of consistency in continuous collaborative environments. |
| må, mar 17 | 13.30 | S4 | - | Marina | A lock-free algorithm for heaps - Discussion
Discussion on the heap paper presented by Anders last week and some other things. |
| må, mar 10 | 13.30 | S4 | Anders Gidenstam | Boris | A lock-free algorithm for heaps
I will present the algorithm ideas for a lock-free heap implementation found in the technical report "Wait-Free Algorithms for Heaps" (Greg Barnes, University of Washington, CSE-94-12-07) by Greg Barnes. |
| må, mar 3 | 13.30 | S4 | Ha Hoai Phuong | Philippas | Efficient Synchronization for Nonuniform Communication Architectures[Paper]
I will present the paper "Efficient Synchronization for Nonuniform Communication Architectures" by Zoran Radovic and Erik Hagersten. This paper introduces new lock-based synchronization primitives that favor neighboring processors when the lock is released. The experiment in the paper shows that these new synchronization primitives outperform all previous locked-based synchronization primitives including MCS queue-lock. |
| må, feb 24 | 13.30 | S4 |
Marina Papatriantafilou
and
Boris Koldehofe
| Anders | OPODIS'02 travel report[OPODIS '02]
Travel report on OPODIS'02. |
| må, feb 17 | 13.30 | S4 | Yi Zhang | Niklas | Euromicro PDP 2003 travel report[Euromicro PDP 2003]
Travel report on Euromicro PDP 2003. |
| må, feb 10 | 13.30 | S4 | Philippas Tsgias | Yi | History
History. |
| må, feb 3 | 13.30 | S4 | Niklas Elmqvist | Håkan | Occlusion Reduction in 3D Environments
I will hold a presentation with the following title: "Occlusion Reduction in 3D Environments". The abstract of the talk is as follows: "Nearby 3D objects partially or completely occluding distant ones is one of the major problems of 3D visualization, and is in many cases the main reason why information visualization techniques are impractical when taken to the third dimension. There are three basic approaches to reducing occlusion in a 3D environment: (i) making use of an overview or map of the environment; (ii) manipulating the view (or camera) transformation; and (iii) changing the transparency of nearby objects to make them see-through. In this talk, we will explore some of the existing work in this field and then look at some possible ways to approach the problem." |
| må, jan 27 | 13.30 | S4 | Yi Zhang | Ha Hoai Phuong | Quantifying and Resolving Remote Memory Access Contention on Hardware DSM Multiprocessors[Paper]
I will present the following paper: "Quantifying and Resolving Remote Memory Access Contention on Hardware DSM Multiprocessors" by Dimitrios S. Nikolopoulos. |
 Top of Page
Archived Seminars
Use the following links to get access to the seminar schedules
of previous years:
2008,
2007,
2006,
2005,
2004,
2003,
2002,
2001,
2000.
Top of Page
|
