Publication:J-domaschka2008multithreading-strategies-231

From Navigators

You do not have permission to edit this page, for the following reasons:

• The action you have requested is limited to users in the group: Users.
• You do not have permission to edit pages in the Publication namespace.

You can view and copy the source of this page:

{{Publication |type=inproceedings |title=Multithreading Strategies for Replicated Objects |author=J. Domaschka, F. J. Hauck, T. Bestfleisch, Hans P. Reiser, R. Kapitza |ResearchLine=Timeliness and Adaptation in Dependable Systems (TADS) |month=dec |year=2008 |abstract=Replication of objects usually makes deterministic behaviour mandatory for maintaining a consistent state. Multithreaded execution is a critical source of non-determinism that is completely avoided in most fault-tolerant middleware systems. Recent publications have defined deterministic scheduling algorithms that operate at the middleware level and allow multithreaded replicated objects. This avoids deadlocks, improves performance and makes the development more comparable to non-replicated objects. This paper surveys those algorithms and analyses their differences. Next, this paper defines extensions to two efficient multithreading algorithms in order to support nested invocations and condition variables with time-bounded wait operations similar to the Java synchronisation model. In addition, we provide an experimental evaluation and performance comparison of the algorithms, indicating the areas in which each algorithm performs best. We conclude that replication middleware should implement reconfigurable multithreading strategies, as there is no optimal one-size-fits-all solution. |address=Leuven, Belgium |booktitle=Proc. of the ACM/IFIP/USENIX 9th International Middleware Conference |url=http://www.navigators.di.fc.ul.pt/archive/papers/mt-mw08.pdf }}

Return to Publication:J-domaschka2008multithreading-strategies-231.