|
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 2002
Current seminar series coordinator: Daniel Cederman.
| Date | Time | Location | Speaker | Refreshment Organizer | Title + Abstract |
| må, dec 2 | 14.15 | S4 | Boris Koldehofe | Anders | Simple Gossipping with Balls and Bins
I will present my paper to be published in the proceedings of OPODIS'02.
"Simple Gossipping with Balls and Bins". This work provides a new method for analysing
decentralised probabilistic protocols for multipeer communication based on gossipping
or rumour spreading. The propagation of information is represented as a balls and bins game.
The method gives a simple relation between the number of hops a gossip message is propagated
and the reliability provided. This way it can facilitate the analysis of the multiple-delivery
problem i.e. to prevent multiple deliveries of the same message to the application layer.
By introducing a new protocol it is shown how existing approaches can be adapted to the balls
and bins approach. Furthermore, the proposed method is applied to analyse the performance of this protocol.
|
| må, nov 25 | 13.30 | S4 | Håkan Sundell | Philippas | Programming model of TinyOS[TinyOS]
Håkan will talk out programming moing model of TinyOS. |
| må, nov 18 | 13.30 | S4 | Yi Zhang | Niklas | TinyOS[TinyOS]
I will give an overview of TinyOS. |
| må, nov 11 | 13.30 | S4 | Philippas Tsigas | Yi | Luminy seminar on self-stabilizing systems report
What happened during the Luminy seminar on self-stabilizing systems. |
| må, nov 4 | 13.30 | S4 | Niklas Elmqvist | Marina | Color in Information Visualization
Color is one of the most important primitives used in information visualization, and can be utilized to encode information, perform layout, and add an aesthetic touch to applications. Data encoding is, however, the most important of these, and we need to create suitable color scales to maximize the benefit of color. This talk will explore existing color scales, such as gray and rainbow scales, point out their deficiencies, and go on to define the Linearized Optimal Color Scale (LCOS) that addresses these flaws. |
| må, okt 28 | 13.30 | S4 | Yi Zhang | Håkan | WOSP 2002 travel report
Travel report on WOSP 2002. |
| må, okt 21 | 13.30 | S4 | Håkan Sundell | Boris Koldehofe | Priority quity queue
Håkan will talk about a paper about priority quity queue which is being written. |
| må, okt 14 | 13.30 | S4 | Boris Koldehofe | Ha Hoai Phuong | Consistency and freshness in distributed collaborating environment
Boris will continue the topic of last week and lead the discussion about the consistency and freshness in distributed collaborating environment. |
| må, okt 7 | 13.30 | S4 | Ha Hoai Phuong | Yi | Synchronizing a database to improve freshness[Paper]
We will discuss the paper: "Synchronizing a database to improve freshness" by Junghoo Cho, Hector Garcia-Molina |
| må, sep 30 | 13.30 | S4 | Boris Koldehofe | Anders | Sequential consistency versus linearizability
The talk compares sequential consistency and linerizability based on the paper "Sequential consistency versus linearizability" by Hagit Attiya and Jennifer L. Welch. |
| må, sep 23 | 13.30 | S4 | Yi Zhang | Philippas | Presentation
I am going to talk about a paper which is being written by Philippas and me. |
| må, sep 16 | 13.30 | S4 | Håkan Sundell | Niklas Elmqvist | Paper by Maged[List]
I am going to present the most recent (first on the list) paper by Maged, and also the second paper (SMR) on the list briefly as it is connected to the first. |
| må, sep 9 | 13.30 | S4 | | Boris | Stuff
We will discuss some stuff related to our research group. |
| må, sep 2 | 13.30 | S4 | Marina Papatriantafilou | Håkan | Causal memory[Paper 1,Paper 2]
The theme will be causal memory and we will discsuss a selection of results from the papers:
"Causal memory: definitions, implementation, and programming" by Mustaque Ahamad, Gil Neiger, James E. Burns, Prince Kohli and Phillip W. Hutto and
and "On the interconnection of causal memory systems" by Antonio Fernández, Ernesto Jiménez and Vicent Cholvi.
|
| må, aug 26 | 13.30 | S4 | Philippas Tsigas | Yi | Transaction Chopping: Algorithms and Performance Studies[Paper]
Philippas will present the following paper:
"Transaction Chopping: Algorithms and Performance Studies"
by Dennis Shasha, Francois LLirbat, Eric Simon and Patrick Valduriez.
|
| må, aug 19 | 13.30 | S4 | Niklas Elmqvist | Marina | SIGGRAPH 2002 travel report
SIGGRAPH 2002 was held in San Antonio, Texas, at the end of July, and featured a wealth of useful information in all aspects of the field of computer graphics. In this talk, I will focus on giving the outlines for a course on distributed virtual environments called "Super Size It! Scaling Up to Massive Virtual Worlds" and a paper on a parallel rendering framework called "Chromium: A Stream-Processing Framework for Interactive Rendering on Clusters". |
| må, jul 15 | 13.30 | S4 | Yi Zhang | Phuong | Rehearsal for WOSP 2002
I will do the rehearsal for WOSP 2002. |
| må, jul 8 | 13.30 | S4 | Anders Gidenstam | Yi | Wait-free algorithms for Heap
I will present the paper: "Wait-free algorithms for Heap". |
| ti, jul 2 | 13.30 | S4 | Håkan Sundell | Anders Gidenstam | Skiplist-Based Concurrent Priority Queues
I will present the paper: "Skiplist-Based Concurrent Priority Queues" by Lotan and Shavit. The paper addresses the problem of constructing an efficient concurrent version of a priority queue. A priority queue has two operations Insert (which enqueues an item labeled with a certain priority) and DeleteMin (which dequeues the item with the current minimum priority). |
| to, jun 20 | 13.30 | Buss | Phuong | Boris | Writing a Scientific Paper -- Tips from Vernon Booth
"Writing a Scientific Paper -- Tips from Vernon Booth", Part IV. |
| må, jun 10 | 13.30 | S4 | Peter Damaschke | Philippas | Distributed soft path coloring
You are sitting on a very long banquet table, a fork both on your left and on your right. The hors d'ouvre has been served, you grasp a fork and ... you cannot start eating because your neighbor is about to choose the same fork. Such conflict situations appear if vertices in a network have to share local resources without an a-priori global agreement on one of the solutions. Deep results for distributed labeling problems, such as graph coloring, are known in the literature, with the goal to minimize the time to reach a proper solution. More recently, applications have been discussed where a few conflicts are acceptable, but their number should decrease quickly. (The network is already doing something.) This is a different performance measure, albeit closely related to the traditional question. I want to discuss some conflict density results in a rather informal way. Perhaps we get new ideas to attack some open problems. |
| må, jun 10 | 13.30 | S4 | Peter Damaschke | Philippas | Distributed soft path coloring
You are sitting on a very long banquet table, a fork both on your left and on your right. The hors d'ouvre has been served, you grasp a fork and ... you cannot start eating because your neighbor is about to choose the same fork. Such conflict situations appear if vertices in a network have to share local resources without an a-priori global agreement on one of the solutions. Deep results for distributed labeling problems, such as graph coloring, are known in the literature, with the goal to minimize the time to reach a proper solution. More recently, applications have been discussed where a few conflicts are acceptable, but their number should decrease quickly. (The network is already doing something.) This is a different performance measure, albeit closely related to the traditional question. I want to discuss some conflict density results in a rather informal way. Perhaps we get new ideas to attack some open problems. |
| må, jun 3 | 13.30 | Buss | Yi Zhang | Niklas Elmqvist | Wait-free Parallel Algorithms for the Union-Find Problem
I am going to present the paper "Wait-free Parallel Algorithms for the Union-Find Problem" by Richard J. Anderson. |
| må, jun 3 | 13.30 | Buss | Yi Zhang | Niklas Elmqvist | Wait-free Parallel Algorithms for the Union-Find Problem[Paper]
I am going to present the paper "Wait-free Parallel Algorithms for the Union-Find Problem" by Richard J. Anderson. |
| må, maj 13 | 13.30 | S4 | Per Håkan Sundell | Phuong | Writing a Scientific Paper -- Tips from Vernon Booth - 3
"Writing a Scientific Paper -- Tips from Vernon Booth", Part III. |
| må, maj 6 | 13.30 | S4 | Patrick Th. Eugster | Yi | Type-Based Publish/Subscribe
The remote procedure call (RPC) abstraction for distributed programming has celebrated a tremendous success for its hiding of distribution to a large extent, yet has turned out to be inadequate for modern large scale applications: initially conceived for pairwise interaction between client/server application components, the RPC becomes increasingly inefficient in one-to-n interactions underlying most large scale applications as the very n grows. The publish/subscribe paradigm has been proposed as a candidate distributed programming abstraction to meet the scalability requirements of todays applications (e.g., based on a peer-2-peer model). In this talk I present experiences conducted with type-based publish/subscribe (TPS), a variant of the well-known publish/subscribe paradigm. TPS is to publish/subscribe what the RPC is to synchronous message passing: a higher-level paradigm variant which hides "ugly" aspects of distribution and fits well into an object-oriented programming model. Experiences include how to integrate TPS with a mainstream language such as Java, and what features could help future languages support TPS (and other abstractions for distributed programming) in a satisfactory way without any extensions to such languages. |
| må, apr 29 | 13.30 | S4 | Ha Hoai Phuong | Håkan | Wait-free concurrent memory management
I am presenting the paper "Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)" by Wim H. Hesselink and Jan Friso Groote from Distributed Computing volume 14, number 1, 2001. Some problems of garbage collection will be discussed. |
| må, apr 22 | 13.30 | S4 | Anders Gidenstam | Patrick | Plausible clocks
I am going to present the paper Plausible clocks: constant size logical clocks for distributed systems by Francisco J. Torres-Rojas and Mustaque Ahamad from Distributed Computing (12/1999), Springer Verlag. |
| må, apr 15 | 13.30 | S4 | Boris Koldehofe | Marina | Writing a Scientific Paper -- Tips from Vernon Booth - 2
"Writing a Scientific Paper -- Tips from Vernon Booth", Part II. |
| må, apr 8 | 13.30 | S4 | Patrick Th. Eugster | Philippas | Probabilistic Multicast
Gossip-based broadcast algorithms have been considered as a viable alternative to traditional deterministic reliable broadcast algorithms in large scale environments. However, these algorithms focus on broadcasting events inside a large group of processes, while the multicasting of events to a subset of processes in a group only, potentially varying for every event, has not been considered. We propose a scalable gossip-based multicast algorithm which ensures, with a high probability, that (1) a process interested in a multicast event delivers that event (just like in typical gossip-based broadcast algorithms), and that (2) a process not interested in that event does not receive it (unlike in broadcast algorithms). Our multicast algorithm adds a notion of membership scalability to the event dissemination scalability inherent to gossip-based algorithms, and exploits the topology of the network and common interests of processes. |
| må, mar 25 | 13.30 | S4 | Yi Zhang | Anders Gidenstam | Wait-Free queue Classes in the Real-Time Specification for Java and their implementations
The Real-Time Specification for Java provides protected, non-blocking, shared access to objects accessed by both regular Java threads (java.lang.Threads) and the time-critical NoHeapRealtimeThreads. Such access is offered via a set of wait-free queue classes. These classes are provided explicitly to enable communication between the real-time NoHeapRealtimeThreads and the regular Java threads; they have a unidirectional nature with one side of the queue (read or write) for the real-time threads and the other one (write or read, respectively) for the non-real-time ones. Efficient implementations of these queue classes are presented in this paper. The implementations are designed to have the unidirectional nature of these queues in mind and they are more efficient, with respect to space complexity, compared to previous general bi-directional wait-free implementations, without losing in time complexity. |
| må, mar 18 | 14.00 | S4 | Per Håkan Sundell | Yi Zhang | NOBLE
Rehearsal for the paper about NOBLE. |
| må, mar 11 | 13.30 | S4 | Niklas | Phuong | Wearable computers
Wearable computer demonstration. |
| må, mar 4 | 13.30 | S4 | Per Håkan Sundell | Marina | Applications of Non-Blocking Data Structures to Real-Time System
Rehearsal for my seminar for the degree of Licentiate of Philosophy with the thesis titel "Applications of Non-Blocking Data Structures to Real-Time System". |
| må, feb 25 | 15.00 | S4 | Niklas Elmqvist | Niklas Elmqvist | Information visualization
Information visualization is a fairly new field of research that has many exciting implications for the visualization of abstract information lacking a natural visual mapping. Unlike scientific visualization, which concerns itself with graphical representation of spatial data such as temperatures, physical forces, and airflow, information visualization can handle intangible and potentially huge data sets, including web search results, tree hierarchies, and free text. In this talk, I will explain the fundamentals of the area and describe some relevant examples. |
| må, feb 18 | 13.30 | S4 | Philippas Tsigas | Niklas Elmqvist | Writing a Scientific Paper -- Tips from Vernon Booth
Philippas will give a talk: "Writing a Scientific Paper -- Tips from Vernon Booth". |
| må, feb 11 | 13.30 | S4 | - | Boris | Interesting stuff
We will have an informal meeting about whatever you bring up. Then there will be a panel discussion about some interesting stuff. |
| må, feb 4 | 13.30 | S4 | Ha Hoai Phuong | Per Håkan Sundell | Disjoint-access-parallel implementations of strong shared memory
We will consider a non-blocking implementation of multiword compare-and-swap operation in which the key to achieving the non-blocking behavior is the cooperative method, a recursive structure of "helping". Disjoint-access-parallel implementations of strong shared memory, A. Israeli and L. Rappoport. Proc. 14th ACM Symp. on Principles of Distributed Computing, pages 151--160, 1994. |
| må, jan 28 | 13.30 | S4 | Per Håkan Sundell | Anders | Bounded concurrent timestamping
I am going to present the paper "Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!" by Cynthia Dwork and Orli Waarts from the ACM STOC in 1992. |
| må, jan 21 | 13.30 | S4 | Anders Gidenstam | Philippas | Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
I'll try to present this paper "Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks" by Pawan Goyal and Harrick M. Vin and Haichen Cheng. |
| må, jan 14 | 13.30 | S4 | Boris Koldehofe, Håkan Sundell | Phuong | Winter meeting rehearsal
Boris and Håkan will rehearse the presentation for the winter meeting. |
 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
|
