|
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 2001
Current seminar series coordinator: Daniel Cederman.
| Date | Time | Location | Speaker | Refreshment Organizer | Title + Abstract |
| må, dec 17 | 13.30 | S4 | Boris Koldehofe | Yi | Analysis of rumor spreading[Paper]
We'll look into the analysis of rumor spreading by R. Karp, C. Schindelbauer, S. Shenker, B. Shenker and B.Vöcking. Besides a short introduction into the rumor spreading model, the push&pull scheme for spreading a single information and the median-counter algorithm to estimate the expansion of the information spreading process will be discussed.
After Boris' presentation during the DCS meeting on Monday, Niklas Elmqvist is going to present the 3Dwm video I will submit to SIGGRAPH.
|
| må, dec 10 | 15.15 | Buss | Philippas Tsigas | Niklas Elmqvist | A Pragmatic Implementation of Non-blocking Linked-Lists[Paper]
I will try to describe in some depth the following papers:
"A Pragmatic Implementation of Non-blocking Linked-Lists" by Timothy L. Harris.
|
| må, dec 3 | 13.30 | S4 | Philippas Tsigas | Boris Koldehofe | DISC '01 travel report[DISC '01,WSS '01,Paper]
I am going to give a trip report for the: i) 15th International Symposium on Distributed Computing DISC '01 and ii) the 5th Workshop on Self-Stabilizing Systems 2001 WSS 01. "Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments" by Shlomi Dolev and Ted Herman. |
| må, nov 26 | 13.30 | S4 | Niklas Elmqvist | Marina Papatriantafilou | Introduction to 3Dwm[3Dwm,Paper]
In this talk, we will discuss the shortcomings of modern GUIs and explore an improved user interface approach based on 3D computer graphics, introducing the 3Dwm system as a platform for the research and development of such interfaces. We will also touch upon some of the open problems in this area, particularly those related to distributing 3Dwm for computer-supported cooperative work (CSCW). Here is a draft article that I plan to submit to SIGGRAPH 2002:
"3Dwm: A Platform for the Research and Development of Three-Dimensional User Interfaces"
|
| må, nov 19 | 13.30 | S4 | Ha Hoai Phuong | Anders | Empirical Studies of Competitive Spinning for A Shared-Memory Multiprocessor[Paper]
I will present the paper "Empirical Studies of Competitive Spinning for A Shared-Memory Multiprocessor" by A. Karlin, K. Li, M. Manasse and S. Owicki. This paper studies seven strategies for determining whether and how long to spin before blocking, five of which are competitive.
|
| må, nov 12 | 13.30 | S4 | Yi Zhang | Håkan | SPAA '01 travel report[Paper,SPAA '01]
I will give a travel report about SPAA '01. I will also present the paper "Room Synchronizations".
|
| må, okt 1 | 13.30 | Buss | Marina Papatriantafilou | Phuong | Lightweight Probabilistic Broadcast[Paper]
Marina will present a paper about Lightweight Probabilistic Broadcast |
| må, sep 24 | 13.30 | S4 | Marina Papatriantafilou | Yi | DSN'01 report[DSN '01,Paper 1,Slides 1,Paper 2,Slides 2]
A brief report on DSN'01 (International Conference on Dependable Systems and Networks Göteborg, Sweden, June 30th - July 4th, 2001) and focus in the presentation of a couple of papers from session 9A, "Group-oriented systems" |
| må, sep 17 | 13.30 | buss | Philippas Tsigas, Håkan Sundell, Yi Zhang | Boris Koldehofe | ARTES summer school report
We will talk about some interesting talks we attended in the ARTES summer school.
|
| ti, sep 11 | 13.30 | S2 | Philippas Tsigas, Håkan Sundell, Yi Zhang | Boris Koldehofe | ARTES summer school report
We will talk about some interesting talks we attended in the ARTES summer school. |
| må, sep 10 | 13.30 | S2 | Yi Zhang | Philippas Tsigas | TCP Congestion Control[Sigmetrics '01,Presentation]
Yi will present a TCP Congestion Control paper from Sigmetrics 2001/Performance 2001.
|
| ti, maj 22 | 13.30 | S4 | Boris Koldehofe | Angela | Computation-Centric Memory Models
Computation-Centric Memory Models by Mateo Frigo and Victor Luchangco.
|
| må, maj 21 | 13.30 | S4 | Anders Gidenstam | Marina | Efficient per flow shaping and packet scheduling in packet switched networks[Paper]
Anders will present "Efficient per flow shaping and packet scheduling in packet switched networks".
|
| må, apr 23 | 13.30 | S2 | Yi | Håkan | Non-blocking Shared Data Structures[Thesis]
"Non-blocking Shared Data Structures for Shared Memory Multiprocessor Systems".
Yi will rehearse for his licentiate seminar.
|
| må, apr 9 | 14.20 | S4 | Håkan | Boris | Lock-Free Memory Management[Thesis]
Lock-Free Memory Management Techniques by J. Valois. |
| må, apr 2 | 13.30 | S2 | Wojciech Mostowski | Marina | Fail-Stop Components by Pattern Matching[Paper]
"Fail-Stop Components by Pattern Matching" by Tomasz Janowski and Wojciech Mostowski.
We describe an approach to formally specify object-based software components, in order to be able to automatically check their behaviour at run-time. The specification is a regular expression built from the propositions about the states (or pairs of states) of a component. Checking is done by a specification-generated wrapper, which produces a fail-stop component from a component which fails in an arbitrary way. The wrapper-generator is implemented for a subset of Java classes. We argue that specification-based error-detection is particularly suitable for the components of open, object-based distributed systems.
|
| må, mar 19 | 13.30 | S2 | Philippas | Angela | Simple Atomic Snapshots[Paper 1,Paper 2]
Philippas will present the paper titled: "Simple Atomic Snapshots: A Linear Complexity Solution With Unbounded Time-Stamps". He will also describe the algorithm presented in the paper: "How to Construct an Atomic Variable (Extended Abstract)" by John Tromp. And, if he has time, he will say a few things from the fundamental paper: "On Interprocess Communication--Part I: Basic Formalism". Find the papers and have a look at them before the presentation.
|
| må, mar 5 | 13.30 | S1 | Angela | Philippas | Value freshness
Value freshness |
| må, feb 26 | 13.30 | S4 | Björn Andersson | Yi | Multiprocessor Scheduling[Paper]
In this talk, I will give an introduction to multiprocessor scheduling intended for people who are not active in the field of real-time systems. I will also present parts of my own work as described below. Consider the problem of scheduling independent periodic tasks on a homogeneous multiprocessor using fixed-priority preemptive scheduling. This problem can be solved using two different methods based on how to assign the tasks to the processors. The traditionally-used method (partitioned method) first partitions the task set and then applies uniprocessor scheduling on each processor. The alternative method (non-partitioned method) allows a task to execute on any processor, even when resuming after having been preempted. While there exists a good understanding of the theoretical properties of the partitioned method, the non-partitioned counterpart has not been fully explored and has therefore received much less attention. I will present three findings on the non-partitioned method. First, I identify a set of anomalies for fixed-priority preemptive multiprocessor scheduling and explain the reasons for their existence. Second, I identify some difficulties in determining critical instants and generating optimal priority assignments for the non-partitioned method. Third, I identify underlying causes for the so-called Dhall's effect, a scheduling dilemma hitherto believed to be an inherent property of the non-partitioned method. For the first and last findings, I propose strategies for circumventing the problems. |
| må, feb 12 | 13.30 | S4 | Håkan | Boris | RTCSA 2000 report[Website]
Chopping and Versioning Real-Time Transactions to Avoid Remote Blocking by L Shu and M Young. |
| må, feb 5 | 13.30 | S4 | Yi | Håkan | Efficient Pure-buffer Algorithms for Real-time Systems[Paper]
Yi will present the paper "Efficient Pure-buffer Algorithms for Real-time Systems".
|
| må, jan 29 | 13.30 | E EL41 | Dr Sanjoy Baruah | - | Scheduling periodic tasks on multiple processors
While real-time scheduing theorists have been remarkably successful in developing a rich theory of uniprocessor scheduling, multiprocessor real-time scheduling remains largely unexplored. In this presentation, I will discuss some recent research that attempts to extend ideas and results from uniprocessor scheduling theory to the multiprocessor domain. In particular, I will present an optimal algorithm for scheduling periodic real-time tasks on multiprocessor platforms. |
 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
|
